Fast marching for robust surface segmentation

Authors:
Falko Schindler;Wolfgang Förstner
Affiliations:
Department of Photogrammetry, University of Bonn, Bonn, Germany;Department of Photogrammetry, University of Bonn, Bonn, Germany
Venue:
PIA'11 Proceedings of the 2011 ISPRS conference on Photogrammetric image analysis
Year:
2011

Citing 9
Cited 0

Hierarchical face clustering on polygonal surfaces

I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Location adjustment for the minimum volume ellipsoid estimator

Statistics and Computing
Partitioning 3D Surface Meshes Using Watershed Segmentation

IEEE Transactions on Visualization and Computer Graphics
Surface Segmentation Using Geodesic Centroidal Tesselation

3DPVT '04 Proceedings of the 3D Data Processing, Visualization, and Transmission, 2nd International Symposium
Hierarchical mesh segmentation based on fitting primitives

The Visual Computer: International Journal of Computer Graphics
Geodesic Remeshing Using Front Propagation

International Journal of Computer Vision
Photo tourism: exploring photo collections in 3D

ACM SIGGRAPH 2006 Papers
Accurate, Dense, and Robust Multiview Stereopsis

IEEE Transactions on Pattern Analysis and Machine Intelligence
The farthest point strategy for progressive image sampling

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a surface segmentation method based on Fast Marching Farthest Point Sampling designed for noisy, visually reconstructed point clouds or laser range data. Adjusting the distance metric between neighboring vertices we obtain robust, edge-preserving segmentations based on local curvature. We formulate a cost function given a segmentation in terms of a description length to be minimized. An incremental-decremental segmentation procedure approximates a global optimum of the cost function and prevents from under- as well as strong over-segmentation.We demonstrate the proposed method on various synthetic and real-world data sets.