A similarity measure under Log-Euclidean metric for stereo matching

Stereo matching has been one of the most active areas in computer vision for decades. Many methods, ranging from similarity measures to local or global matching cost optimization algorithms, have been proposed. In this paper, we propose a novel similarity measure under log-euclidean metric for stereo matching. A generalized structure tensor is applied to describe a point and the similarity is measured by the distance between the associated tensors. Since the structure tensor lies in a Riemannian manifold, the log-euclidean metric is adopted to calculate the distance between the generalized structure tensors. The proposed similarity measure can provide an effective and efficient way to fuse different features and is independent of illumination change and window scaling. Experiments on standard data set prove that the proposed similarity measure outperforms traditional measures such as SSD, SAD and normalized-cross-correlation (NCC).

[1]  Andreas Klaus,et al.  Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[2]  Jian Sun,et al.  Symmetric stereo matching for occlusion handling , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[3]  Yogesh Rathi,et al.  A Graph Cut Approach to Image Segmentation in Tensor Space , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[4]  Paul A. Viola,et al.  Rapid object detection using a boosted cascade of simple features , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

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

[6]  Edward H. Adelson,et al.  Probability distributions of optical flow , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Marsha Jo Hannah,et al.  Computer matching of areas in stereo images. , 1974 .

[8]  Li Hong,et al.  Segment-based stereo matching using graph cuts , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

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

[10]  William T. Freeman,et al.  Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[11]  Richard Szeliski,et al.  A Comparative Study of Energy Minimization Methods for Markov Random Fields , 2006, ECCV.

[12]  Kai-Kuang Ma,et al.  Accurate optical flow estimation using adaptive scale-space and 3D structure tensor , 2002, Proceedings. International Conference on Image Processing.

[13]  Fatih Murat Porikli,et al.  Region Covariance: A Fast Descriptor for Detection and Classification , 2006, ECCV.

[14]  Nicholas Ayache,et al.  Fast and Simple Calculus on Tensors in the Log-Euclidean Framework , 2005, MICCAI.