Abstract We describe a graph cut algorithm to recover the 3D object surface using both silhouette and foreground color information. The graph cut algorithm is used for optimization on a color consistency field. Constraints are added to improve its performance. These constraints are a set of predetermined locations that the true surface of the object is likely to pass through. They are used to preserve protrusions and to pursue concavities respectively in the first and the second phase of the algorithm. We also introduce a method for dealing with silhouette uncertainties arising from background subtraction on real data. We test the approach on synthetic data with different numbers of views (8, 16, 32, 64) and on a real image set containing 30 views of a toy squirrel.
3D Surface Reconstruction Using Graph Cuts with Surface Constraints
Computer Vision – ECCV 2006 ; 4 ; 219-231
Lecture Notes in Computer Science ; 3952 , 4
2006-01-01
13 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
3D Surface Reconstruction Using Graph Cuts with Surface Constraints
British Library Conference Proceedings | 2006
|GPU-friendly multi-view stereo reconstruction using surfel representation and graph cuts
British Library Online Contents | 2011
|Joint 3D-Reconstruction and Background Separation in Multiple Views Using Graph Cuts
British Library Conference Proceedings | 2003
|Spatially Coherent Clustering Using Graph Cuts
British Library Conference Proceedings | 2004
|