3D Surface Reconstruction Using Graph Cuts with Surface Constraints
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.
Cite
Text
Tran and Davis. "3D Surface Reconstruction Using Graph Cuts with Surface Constraints." European Conference on Computer Vision, 2006. doi:10.1007/11744047_17Markdown
[Tran and Davis. "3D Surface Reconstruction Using Graph Cuts with Surface Constraints." European Conference on Computer Vision, 2006.](https://mlanthology.org/eccv/2006/tran2006eccv-d/) doi:10.1007/11744047_17BibTeX
@inproceedings{tran2006eccv-d,
title = {{3D Surface Reconstruction Using Graph Cuts with Surface Constraints}},
author = {Tran, Son Dinh and Davis, Larry S.},
booktitle = {European Conference on Computer Vision},
year = {2006},
pages = {219-231},
doi = {10.1007/11744047_17},
url = {https://mlanthology.org/eccv/2006/tran2006eccv-d/}
}