Type
Book ChapterKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionComputer Science Program
Electrical Engineering Program
Visual Computing Center (VCC)
KAUST Grant Number
OCRF-2014-CRG3-62140401Date
2016-09-16Online Publication Date
2016-09-16Print Publication Date
2016Permanent link to this record
http://hdl.handle.net/10754/622255
Metadata
Show full item recordAbstract
We present SurfCut, an algorithm for extracting a smooth simple surface with unknown boundary from a noisy 3D image and a seed point. In contrast to existing approaches that extract smooth simple surfaces with boundary, our method requires less user input, i.e., a seed point, rather than a 3D boundary curve. Our method is built on the novel observation that certain ridge curves of a front propagated using the Fast Marching algorithm are likely to lie on the surface. Using the framework of cubical complexes, we design a novel algorithm to robustly extract such ridge curves and form the surface of interest. Our algorithm automatically cuts these ridge curves to form the surface boundary, and then extracts the surface. Experiments show the robustness of our method to errors in the data, and that we achieve higher accuracy with lower computational cost than comparable methods. © Springer International Publishing AG 2016.Citation
Algarni M, Sundaramoorthi G (2016) SurfCut: Free-Boundary Surface Extraction. Lecture Notes in Computer Science: 171–186. Available: http://dx.doi.org/10.1007/978-3-319-46478-7_11.Sponsors
This work was supported by KAUST OCRF-2014-CRG3-62140401, and the Visual Computing Center at KAUST.Publisher
Springer NatureAdditional Links
http://link.springer.com/chapter/10.1007%2F978-3-319-46478-7_11ae974a485f413a2113503eed53cd6c53
10.1007/978-3-319-46478-7_11