• DocumentCode
    2394337
  • Title

    A new stereo matching algorithm based on adaptive window

  • Author

    Yang, Yingyun ; Wang, Huabing ; Liu, Bo

  • Author_Institution
    Coll. of Inf. Eng., Commun. Univ. of China, Beijing, China
  • fYear
    2012
  • fDate
    19-20 May 2012
  • Firstpage
    1815
  • Lastpage
    1819
  • Abstract
    As to the problem of great complexity of traditional adaptive window matching algorithm, a simple adaptive window matching algorithm is proposed in this paper, which use various square or rectangular windows of different size based on the different gradient of points to be matched. Moreover, for better matching effect, a regional seed propagation method is proposed based on the disparity smoothness constraints and the assumption that adjacent pixels of similar color should have the same disparity. Experiments show that compared with traditional adaptive window matching algorithms, the computation complexity has been decreased significantly and the matching accuracy rate has been improved effectively.
  • Keywords
    computational complexity; image colour analysis; image matching; stereo image processing; adaptive window matching algorithm; adjacent pixel; computation complexity; disparity smoothness constraint; image color; matching accuracy rate; rectangular window; regional seed propagation method; square window; stereo matching algorithm; Accuracy; Adaptive systems; Algorithm design and analysis; Color; Complexity theory; Image color analysis; Stereo vision; adaptive window; disparity map; stereo matching;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems and Informatics (ICSAI), 2012 International Conference on
  • Conference_Location
    Yantai
  • Print_ISBN
    978-1-4673-0198-5
  • Type

    conf

  • DOI
    10.1109/ICSAI.2012.6223397
  • Filename
    6223397