• DocumentCode
    1870432
  • Title

    Sparse stereo matching using belief propagation

  • Author

    Sarkis, Michel ; Diepold, Klaus

  • Author_Institution
    Inst. for Data Process., Tech. Univ. Munchen, Munich
  • fYear
    2008
  • fDate
    12-15 Oct. 2008
  • Firstpage
    1780
  • Lastpage
    1783
  • Abstract
    Depth from stereo is an important research field in computer vision due to the wide range of its applications. In this work, we present a stereo matching algorithm based on belief propagation (BP). The algorithm is designed to work on sparse images originating from image content adaptive mesh representation techniques. There, an image is approximated with a mesh. The nodes of the mesh are the non-uniform samples which are the ones that form the sparse image. The key issue in the proposed method is to formulate BP such that it matches a sparse left stereo image with a dense right image to obtain a sparse depth map. Moreover, we propose a simple method that recovers the dense disparity map of the scene from the sparse one using the approximating mesh of the image. The results obtained show that the proposed method leads to an average of 40% improvement in the quality of depth maps when compared to existing sparse stereo matching techniques.
  • Keywords
    image matching; image representation; image sampling; stereo image processing; adaptive mesh representation technique; belief propagation; computer vision; dense disparity map; nonuniform mesh node sample; sparse stereo image matching algorithm; Algorithm design and analysis; Application software; Belief propagation; Computer vision; Cost function; Data processing; Image reconstruction; Layout; Rendering (computer graphics); Stereo vision; Stereo vision; image reconstruction; image representations; image sampling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing, 2008. ICIP 2008. 15th IEEE International Conference on
  • Conference_Location
    San Diego, CA
  • ISSN
    1522-4880
  • Print_ISBN
    978-1-4244-1765-0
  • Electronic_ISBN
    1522-4880
  • Type

    conf

  • DOI
    10.1109/ICIP.2008.4712121
  • Filename
    4712121