An Image Stereo Match Algorithm Based on Multi-Area Match

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 220)

Abstract

Micro computer three-dimensional matching stereovision is an important research topic which opened new research contents of three-dimensional object information to measure small. In this paper, an image stereo match algorithm is proposed based on multi-area match. The proposed match algorithm uses the matching strategy point calculation similarity and matches between pixels and characteristics of pixels. Finally, pixel is chosen as the biggest similarity of matching pixels. Detailed numerical results show the effectiveness of the proposed scheme.

Keywords

Color image Image match Multi-area match 

References

  1. 1.
    Nasser MN (1992) A stereovision technique using curve-segments and relaxation matching. IEEE Trans Pattern Anal Matching Intell 14(5):566–572CrossRefGoogle Scholar
  2. 2.
    Fua P (1993) Aparallel algorithm that produces dense depth maps and preserves image feature. Mach Vis Appl 6:35–49CrossRefGoogle Scholar
  3. 3.
    Wang Y (1998) Principles and applications of structural image matching. ISPRS J Photogram Remote Sens 53:154–165CrossRefGoogle Scholar
  4. 4.
    Quam LH (1999) Hierarchical warp stereo. In: Image understanding workshop, vol 12(3). Sciences Applications International Corporation, New Orleans, pp 149–155Google Scholar
  5. 5.
    Cox IJ, Hingorani SL, Rao SB, Maggs BM (1996) A maximum likelihood stereo algorithm. Comput Vis Image Underst 63(3):542–567Google Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  1. 1.Modern Education Technology Center of Xi’an International UniversityXi’anChina

Personalised recommendations