A surface reconstruction method using global graph cut optimization
DOI10.1007/s11263-005-3953-xzbMath1477.68406OpenAlexW2088629531WikidataQ124987834 ScholiaQ124987834MaRDI QIDQ2508351
Sylvain Paris, François X. Sillion, Long Quan
Publication date: 12 October 2006
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00510160/file/graph_cut.pdf
global minimumdiscontinuitiesgraph cutocclusionsgraph flow3D reconstruction from calibrated camerasself-occlusions
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)
Related Items (2)
Uses Software
Cites Work
- Constraints on deformable models: Recovering 3D shape and nonrigid motion
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- On implementing the push-relabel method for the maximum flow problem
- Geodesic active contours
- A theory of shape by space carving
- Image Selective Smoothing and Edge Detection by Nonlinear Diffusion
- Variational principles, surface evolution, PDEs, level set methods, and the stereo problem
- Mathematical problems in image processing. Partial differential equations and the calculus of variations. Foreword by Olivier Faugeras
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A surface reconstruction method using global graph cut optimization