110 likes | 269 Views
Optimal Stereo Matching. 1. Introduction. The stereo matching problem : W hich parts of left and right image are projections of the same scene element?. 2.Previous Work. 1. Correlation-Based Methods
E N D
1. Introduction The stereo matching problem : Which parts of left and right image are projections of the same scene element?
2.Previous Work 1. Correlation-Based Methods Similarity criterion is a measure of the correlation between windows in the two images.
2.Previous Work 2.Winner-take-all The easiest way of choosing the best disparity is to select at each pixel the minimum aggregated cost across all disparities under consideration
2.Previous Work 3.Error minimization with Ransac
2.Previous Work 4.Divide-and-Conquer
2.Previous Work 5. Adaptive windows Stereo image pair simplified version Using the Adaptive window
3.DSI(Disparity Space Image) Algorithm 1. DSI Creation for Ideal Imagery
3.DSI Algorithm 2. Disparity Space Image
3.DSI Algorithm 3.Occlusion Analysis and DSI Path Constraints Because of the occlusion regions, the matching zero path through the image cannot be continuous 1.occlusion constraint D : Horizontal gaps V : Vertical jumps 2.ordering constraint => In the DSI, moving from left to right, diagonal jumps can only jump forward (down and across) and vertical jumps can only jump backwards (up).
Future Work • Stereo Matching with Transparency and Matting 1998 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. - RICHARD SZELISKI, POLINA GOLLAND