loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on Computer and Information Technology (CIT'05)
Progressive Matching Based On Segmentation for 3D reconstruction
Shanghai, China
September 21-September 23
ISBN: 0-7695-2432-X
Yong Zhuang, Shenyang Institute of Automation, Chinese Academy of Sciences
Ma Ma, Graduate School of the Chinese Academy of Sciences
Wei Jun, Shenyang Institute of Automation, Chinese Academy of Sciences
Liu Liu, Shenyang Institute of Automation, Chinese Academy of Sciences

Dense matching plays an important role for 3D Scene reconstruction. A simple rectified algorithm is given in this paper. Then the new matching algorithm starts from GCPS as seeds with rectified stereo pairs. First color segment is used to capture disparity discontinuity and the reliable seed point from GCPS which is computed by using fast ZNCC based on asymmetric window can propagate the other correspondence points according to continuity constraint in each region. The algorithm is demonstrated on standard images pairs and shows better applications on 3D reconstruction.

Index Terms:
dense match, GCPS, segmentation, correlation
Citation:
Yong Zhuang, Ma Ma, Wei Jun, Liu Liu, "Progressive Matching Based On Segmentation for 3D reconstruction," cit, pp.575-579, Fifth International Conference on Computer and Information Technology (CIT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.