loading...
Stereo Correspondence Using Stripe Adjacency Graph
Hong Kong August 20-August 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2006.107918th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Chang-Chang Wu, University of Science and Technology of China, Hefei, China
Zeng-Fu Wang, University of Science and Technology of China, Hefei, China
This paper presents a new approach to solve the problem of stereo correspondence. In order to extract visible surfaces with similar texture from two different images, our method encodes input images to a series of so-called Stripe Adjacency Graphs (SAG). A stripe is a connected region with only one segment on each scan-line and a SAG is a group of stripes with neighbourhood relationships. The algorithm retrieves surfaces from binocular images according to the matching degree between two sub-graphs in two images. The extracted surfaces are evaluated by the global matching cost that is defined as the sum of inter-stripe and intra-stripe energy. The experimental results show that our algorithm is a fast as well as an effective algorithm. It can give a dense disparity map.
Citation:
Chang-Chang Wu, Zeng-Fu Wang, "Stereo Correspondence Using Stripe Adjacency Graph," icpr, vol. 1, pp.123-126, 18th International Conference on Pattern Recognition (ICPR'06) Volume 1, 2006
Usage of this product signifies your acceptance of the Terms of Use.