Journal
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
Volume 29, Issue 12, Pages 2241-2246Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TPAMI.2007.70712
Keywords
3D/stereo scene analysis; shape; graph algorithms; global optimization
Ask authors/readers for more resources
This paper presents a volumetric formulation for the multiview stereo problem which is amenable to a computationally tractable global optimization using Graph- cuts. Our approach is to seek the optimal partitioning of 3D space into two regions labeled as object and empty under a cost functional consisting of the following two terms: 1) A term that forces the boundary between the two regions to pass through photo- consistent locations and 2) a ballooning term that inflates the object region. To take account of the effect of occlusion on the first term, we use an occlusion robust photo- consistency metric based on Normalized Cross Correlation, which does not assume any geometric knowledge about the reconstructed object. The globally optimal 3D partitioning can be obtained as the minimum cut solution of a weighted graph.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available