CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2007 vol.29 Issue No.12 - December
Issue No.12 - December (2007 vol.29)
This paper presents a volumetric formulation for the multi-view stereo problem which is amenable to a computationally tractable global optimisation using Graph-cuts. Our approach is to seek the optimal partitioning of 3D space into two regions labelled 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 Normalised 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.
Carlos Hernández Esteban, Philip H. S. Torr, Roberto Cipolla, "Multiview Stereo via Volumetric Graph-Cuts and Occlusion Robust Photo-Consistency", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.29, no. 12, pp. 2241-2246, December 2007, doi:10.1109/TPAMI.2007.70712