SurfCut: Surfaces of Minimal Paths From Topological Structures

Marei Saeed Mohammed Algarni, Ganesh Sundaramoorthi

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


We present SurfCut, an algorithm for extracting a smooth, simple surface with an unknown 3D curve boundary from a noisy image and a seed point. Our method is built on the novel observation that certain ridge curves of a function defined on a front propagated using the Fast Marching algorithm lie on the surface. Our method extracts and cuts these ridges to form the surface boundary. Our surface extraction algorithm is built on the novel observation that the surface lies in a valley of the distance from Fast Marching. We show that the resulting surface is a collection of minimal paths. Using the framework of cubical complexes and Morse theory, we design algorithms to extract these critical structures robustly. Experiments on three 3D datasets show the robustness of our method, and that it achieves higher accuracy with lower computational cost than state-of-the-art.
Original languageEnglish (US)
Pages (from-to)726-739
Number of pages14
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Issue number3
StatePublished - Mar 5 2018

Bibliographical note

KAUST Repository Item: Exported on 2020-04-23
Acknowledged KAUST grant number(s): OCRF-2014-CRG3-62140401
Acknowledgements: This work was supported by KAUST OCRF-2014-CRG3-62140401, and the Visual Computing Center at KAUST.


Dive into the research topics of 'SurfCut: Surfaces of Minimal Paths From Topological Structures'. Together they form a unique fingerprint.

Cite this