Rejecting Wrong Matches in Stereovision

Block matching methods in stereo vision must de- cide when two pixels match, and usually do it by thresh- olding a similarity measure between two blocks. This paper proposes a more elaborate statistical block matching method ensuring that the detected block matches are not likely to have occurred "just by chance". The method is based on the generation of a simple but faithful statistical background model for image blocks. The ensuing rejection/acceptation process uses an a contrario method that computes a false alarm numbers, and guarantees that on average not more than one wrong block match occurs. To evaluate the perfor- mance of this method, its application range will be first es- tablished. Two subsidiary matching criteria prove necessary: First, the fattening effect inherent to block matching meth- ods is avoided by comparing only blocks that do not meet the image line segments on which the depth is discontinu- ous. Second, the stroboscopic errors due to repetitive shapes are avoided by a SIFT-like threshold. The method is tested on three kinds of data: urban aerial scenes with low baseline, classic benchmark examples, and a close range stereo pair. All confirm that a careful three steps error analysis yields a dense disparity maps with 0.3% wrong matches and less. The presented technique is tested with block matching, but can be applied as an after check to any other stereo matching method.

[1]  Yann Gousseau,et al.  An A Contrario Decision Method for Shape Element Recognition , 2006, International Journal of Computer Vision.

[2]  Richard Szeliski,et al.  Symmetric Sub-Pixel Stereo Matching , 2002, ECCV.

[3]  Cordelia Schmid,et al.  The Geometry and Matching of Lines and Curves Over Multiple Views , 2000, International Journal of Computer Vision.

[4]  Andrew Zisserman,et al.  A PLANE-SWEEP STRATEGY FOR THE 3D RECONSTRUCTION OF BUILDINGS FROM MULTIPLE IMAGES , 2000 .

[5]  Julie Delon,et al.  A Unified Framework for Detecting Groups and Application to Shape Recognition , 2007, Journal of Mathematical Imaging and Vision.

[6]  Alfred Schmitt,et al.  Real-Time Stereo by using Dynamic Programming , 2003, 2004 Conference on Computer Vision and Pattern Recognition Workshop.

[7]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.

[8]  Richard Szeliski,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, International Journal of Computer Vision.

[9]  Takeo Kanade,et al.  A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Darius Burschka,et al.  Advances in Computational Stereo , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Vladimir Kolmogorov,et al.  Graph Cut Algorithms for Binocular Stereo with Occlusions , 2006, Handbook of Mathematical Models in Computer Vision.

[12]  Cordelia Schmid,et al.  Automatic line matching across views , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[13]  Jean-Michel Morel,et al.  From Gestalt Theory to Image Analysis: A Probabilistic Approach , 2007 .

[14]  Charles V. Stewart,et al.  MINPRAN: A New Robust Estimator for Computer Vision , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  David G. Lowe,et al.  Perceptual Organization and Visual Recognition , 2012 .

[16]  Takeo Kanade,et al.  Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Cordelia Schmid,et al.  A performance evaluation of local descriptors , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Julie Delon Midway Image Equalization , 2004, Journal of Mathematical Imaging and Vision.

[19]  Jean-Luc Lotti,et al.  Correlation algorithm with adaptive window for aerial image in stereo vision , 1994, Remote Sensing.

[20]  Julien Rabin,et al.  A contrario matching of local descriptors , 2007 .

[21]  F. Cao Application of the Gestalt principles to the detection of good continuations and corners in image level lines , 2004 .

[22]  Jiri Matas,et al.  Robust wide-baseline stereo from maximally stable extremal regions , 2004, Image Vis. Comput..

[23]  Nikos Paragios,et al.  Motion-based background subtraction using adaptive kernel density estimation , 2004, CVPR 2004.

[24]  Rafael Grompone von Gioi,et al.  On Straight Line Segment Detection , 2008, Journal of Mathematical Imaging and Vision.

[25]  W. Eric L. Grimson,et al.  On the Verification of Hypothesized Matches in Model-Based Recognition , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[26]  Vassilios Morellas,et al.  Robust Foreground Detection In Video Using Pixel Layers , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  Julie Delon,et al.  Small Baseline Stereovision , 2007, Journal of Mathematical Imaging and Vision.

[28]  Jean-Michel Morel,et al.  A Theory of Shape Identification , 2008 .

[29]  Michael Elad,et al.  Sparse Representation for Color Image Restoration , 2008, IEEE Transactions on Image Processing.

[30]  Lionel Moisan,et al.  A Probabilistic Criterion to Detect Rigid Point Matches Between Two Images and Estimate the Fundamental Matrix , 2004, International Journal of Computer Vision.

[31]  Laura Igual,et al.  Automatic low baseline stereo in urban areas , 2007 .

[32]  David G. Lowe,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004, International Journal of Computer Vision.