Surface reconstruction using power watershed

Authors:
Camille Couprie;Xavier Bresson;Laurent Najman;Hugues Talbot;Leo Grady
Affiliations:
Université Paris-Est, Laboratoire d'Informatique Gaspard-Monge, ESIEE Paris;City University of Hong Kong, Dpt. of Computer Science, Hong Kong;Université Paris-Est, Laboratoire d'Informatique Gaspard-Monge, ESIEE Paris;Université Paris-Est, Laboratoire d'Informatique Gaspard-Monge, ESIEE Paris;Siemens Corporate Research, Dpt. Imaging Analytics & Informatics, Princeton
Venue:
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Year:
2011

Citing 18
Cited 0

Surface reconstruction from unorganized points

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
The Euclidean distance transform in arbitrary dimensions

Pattern Recognition Letters
A unified linear-time algorithm for computing distance maps

Information Processing Letters
Attribute openings, thinnings, and granulometries

Computer Vision and Image Understanding
A minimum spanning tree algorithm with inverse-Ackermann type complexity

Journal of the ACM (JACM)
Implicit and nonparametric shape reconstruction from unorganized data using a variational level set method

Computer Vision and Image Understanding
The power crust

Proceedings of the sixth ACM symposium on Solid modeling and applications
Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Random Walks for Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Communicated by Hans-Peter Seidel: Contour-based surface reconstruction using MPU implicit models

Graphical Models
Reconstruction of solid models from oriented point sets

SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Poisson surface reconstruction

SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Efficient Surface Reconstruction using Generalized Coulomb Potentials

IEEE Transactions on Visualization and Computer Graphics
Split Bregman Algorithm, Douglas-Rachford Splitting and Frame Shrinkage

SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle

IEEE Transactions on Pattern Analysis and Machine Intelligence
The Split Bregman Method for L1-Regularized Problems

SIAM Journal on Imaging Sciences
Power Watershed: A Unifying Graph-Based Optimization Framework

IEEE Transactions on Pattern Analysis and Machine Intelligence
Building the Component Tree in Quasi-Linear Time

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Surface reconstruction from a set of noisy point measurements has been a well studied problem for several decades. Recently, variational and discrete optimization approaches have been applied to solve it, demonstrating good robustness to outliers thanks to a global energy minimization scheme. In this work, we use a recent approach embedding several optimization algorithms into a common framework named power watershed. We derive a specific watershed algorithm for surface reconstruction which is fast, robust to markers placement, and produces smooth surfaces. Experiments also show that our proposed algorithm compares favorably in terms of speed, memory requirement and accuracy with existing algorithms.