SurfCut: Surfaces of Minimal Paths from Topological Structures

9Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present SurfCut, an algorithm for extracting a smooth, simple surface with an unknown 3D curve boundary from a noisy 3D image and a seed point. Our method is built on the novel observation that ridge curves of the Euclidean length of minimal paths ending on a level set of the solution of the eikonal equation lie on the surface. Our method extracts these ridges and cuts them to form the surface boundary. Our surface extraction algorithm is built on the novel observation that the surface lies in a valley of the eikonal equation solution. The resulting surface is a collection of minimal paths. Using the framework of cubical complexes and Morse theory, we design algorithms to extract ridges and valleys 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.

Cite

CITATION STYLE

APA

Algarni, M., & Sundaramoorthi, G. (2019). SurfCut: Surfaces of Minimal Paths from Topological Structures. IEEE Transactions on Pattern Analysis and Machine Intelligence, 41(3), 726–739. https://doi.org/10.1109/TPAMI.2018.2811810

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free