Opto-Electronic Engineering, Volume. 35, Issue 10, 92(2008)

Stereo Edge Matching Algorithm Based on Region Adjacency Graph

LI Su-qi*, ZHANG Guang-jun, and WEI Zhen-zhong
Author Affiliations
  • [in Chinese]
  • show less

    To realize the stereo matching of natural scene contour edge,a fast matching algorithm based on region adjacency graph was proposed.Firstly,on the basis of image segmentation by using the watershed transformation method,the contour edges were detected according to the boundaries of the segmented regions.Then the matching process was divided into two steps based on the global-to-local hierarchical matching idea.The first step was region edge matching by grouping the contour edges according to their corresponding regions.After establishing the region constraint based on the region characteristic,the region edge matching was accomplished in the guidance of corners in a similar way of region growing.The region constraint reduced the search area and optimized the matching order effectively.The second step was edge point matching.By using the matched corners as datum marks,the edge constraint established in the first step could limit the search area in several pixels.Experimental results show that the proposed algorithm can acquire high correct matching ratio and fast matching speed.

    Tools

    Get Citation

    Copy Citation Text

    LI Su-qi, ZHANG Guang-jun, WEI Zhen-zhong. Stereo Edge Matching Algorithm Based on Region Adjacency Graph[J]. Opto-Electronic Engineering, 2008, 35(10): 92

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category:

    Received: Jan. 29, 2008

    Accepted: --

    Published Online: Mar. 1, 2010

    The Author Email: Su-qi LI (lisuqi@buaa.edu.cn)

    DOI:

    CSTR:32186.14.

    Topics