Image Stereo Matching Based on Multi-Scale Plane Set

Xin Hui Jiang; Shao Jun Yu; Xing Jiang

doi:10.4028/www.scientific.net/AMR.709.527

Paper Titles

Depth from Defocus Using Geometric Optics Regularization
p.511

Image Classification Base on Sparse Representation with Basis Design
p.515

Computer Simulation of Complex Consecutive Reaction Kinetics
p.519

Uniform Blow-Up Rate for Diffusion Equation with a Weighted Localized Source
p.523

Image Stereo Matching Based on Multi-Scale Plane Set
p.527

A Novel Image Contrast Restoration Algorithm for Fog
p.534

Bayesian Estimation of Gold Index's Change Point of Time Series Model
p.538

A Novel Cache Sharing Scheme and Implementation in Multi-Core Real-Time Linux System
p.542

The Application of Wavelet Transform and the Adaptive Threshold Segmentation in Image Change Detection
p.547

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 709Image Stereo Matching Based on Multi-Scale Plane...

Image Stereo Matching Based on Multi-Scale Plane Set

Abstract:

The disparity map of dynamic programming method is poor. To overcome it, a stereo matching method based on multi-scale plane set is proposed in this paper. This method converts the structural model into the plane set. Define the key plane. Then the key planes are in a high-scale. The other planes are in the low scale. Stereo matching the multi-scale plane set using dynamic programming method. The experimental results show that: this method can solve the dynamic programming algorithm`s problem that disparity map has low matching accuracy and a lot of stripes error.

You might also be interested in these eBooks

Advances in Applied Science, Engineering and Technology

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 709)

Pages:

527-533

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.709.527

Citation:

Cite this paper

Online since:

June 2013

Authors:

Xin Hui Jiang, Shao Jun Yu, Xing Jiang

Keywords:

Dynamic Programming, Flat-Set, Multi-Scale, Stereo Matching

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Scharstein D, Szeliski R．A Taxonomy and Evaluation of Dense Two-frame Stereo Correspondence Algorithms [J]．International Journal of Computer Vision, 2002, 47(1):7-42．

DOI: 10.1109/smbv.2001.988771

Google Scholar

[2] SZELISKI R,ZABIH R,SCHARSTEIN D,et al. A comparative study of energy minimization methods for Markov random fields with smoothness-based priors [J] .IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008, 30 (6) :1068-1080 .

DOI: 10.1109/tpami.2007.70844

Google Scholar

[3] Qingxiong Yang. A non-local cost aggregation method for stereo matching [J]. Computer Vision and Pattern Recognition (CVPR), pages: 1402 – 1409, 2012.

DOI: 10.1109/cvpr.2012.6247827

Google Scholar

[4] Ansari, M.E. A real-time spatio-temporal stereo matching for road applications [J]. Intelligent Transportation Systems (ITSC), pages: 1483 – 1488, 2011.

DOI: 10.1109/itsc.2011.6082875

Google Scholar

[5] Gu Z, Su X Y,Liu Y K, et al. Local stereo matching with adaptive support-weight,rank transform and disparity calibration [J]. Pattern Recognition Letters, 2008, 29 (9):1230-1235.

DOI: 10.1016/j.patrec.2008.01.032

Google Scholar

[6] Zhang G F, Jia J Y, Wong T T, et al. Consistent depth maps recovery from a video sequence [J] . IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009, 31 (6):974-988.

DOI: 10.1109/tpami.2009.52

Google Scholar

[7] Tomohiro, N. Stereo matching based on disparity propagation using cellular evolutionary neural networks [J]. Computers & Informatics (ISCI), Pages: 34 – 39, 2012.

DOI: 10.1109/isci.2012.6222663

Google Scholar

[8] Nalpantidis L, Gasteratos A. Biologically and psychophysically inspired adaptive support weights algorithm for stereo correspondence[J] .Robotics and Autonomous Systems, 2010, 58 (5) : 457-464 .

DOI: 10.1016/j.robot.2010.02.002

Google Scholar