This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Stereo Correspondence Through Feature Grouping and Maximal Cliques
November 1989 (vol. 11 no. 11)
pp. 1168-1180

The authors propose a method for solving the stereo correspondence problem. The method consists of extracting local image structures and matching similar such structures between two images. Linear edge segments are extracted from both the left and right images. Each segment is characterized by its position and orientation in the image as well as its relationships with the nearby segments. A relational graph is thus built from each image. For each segment in one image as set of potential assignments is represented as a set of nodes in a correspondence graph. Arcs in the graph represent compatible assignments established on the basis of segment relationships. Stereo matching becomes equivalent to searching for sets of mutually compatible nodes in this graph. Sets are found by looking for maximal cliques. The maximal clique best suited to represent a stereo correspondence is selected using a benefit function. Numerous results obtained with this method are shown.

[1] A. P. Ambler, H. G. Barrow, C. M. Brown, R. M. Burstall, and R. J. Popplestone, "A versatile computer-controlled assembly system," inProc. Third Int. Joint Conf. Artificial Intelligence, Stanford Univ., Stanford, CA, Aug. 1973, pp. 298-307.
[2] R. D. Arnold and T. O. Binford, "Geometric constraints in stereo vision," inSPIE Vol. 238-Image Processing for Missile Guidance, 1980, pp. 281-292.
[3] N. Ayache and B. Faverjon, "Efficient registration of stereo images by matching graph descriptions of edge segments,"Int. J. Comput. Vision, vol. 1, no. 2, pp. 107-131, 1987.
[4] H. H. Baker and T. O. Binford, "Depth from edge and intensity based stereo," inProc. 7th Int. Joint Conf. Artificial Intelligence, Vancouver, Canada, Aug. 1981, pp. 631-636.
[5] D. H. Ballard and C. M. Brown,Computer Vision. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[6] S. T. Barnard and M. A. Fischler, "Computational stereo,"Comput. Surveys, vol. 14, no. 4, pp. 553-572, 1982.
[7] R. C. Bolles and R. A. Cain, "Recognizing and locating partially visible objects, the local-feature-focus method,"Int. J. Robotics Res., vol. 1, no. 3, pp. 57-82, 1982.
[8] R. C. Bolles and P. Horaud, "3DPO: A three dimensional part orientation svstem,"Int. J. Robotics Res., vol. 5, no. 3, Fall 1986, pp. 3-26.
[9] K. L. Boyer and A. C. Kak, "Structural stereopsis for 3-D vision,"IEEE Trans. Pattern Anal. Machine Intell., vol. 10, no. 2, pp. 144- 166, Mar. 1988.
[10] R. Deriche, "Using Canny's criteria to derive a recursively implemented optimal edge detector,"Int. J. Comput. Vision, vol. 1, no. 2, pp. 167-187, 1987.
[11] R. D. Eastman and A. M. Waxman, "Disparity functionals and stereo vision," inProc. DARPA Image Understanding Workshop, Miami Beach, FL, Dec. 1985, pp. 245-254.
[12] O. D. Faugeras and G. Toscani, "The calibration problem for stereo," inProc. Conf. Computer Vision and Pattern Recognition, Miami Beach, FL, June 1986, pp. 15-20.
[13] W. E. L. Grimson, "Computational experiments with a feature based stereo algorithm,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-7 no. 1, pp. 17-34, Jan. 1985.
[14] M. Herman and T. Kanade, "Incremental reconstruction of 3D scenes from multiple, complex images,"Artificial Intell., vol. 30, pp. 289-341, 1986.
[15] H. S. Lim and T. O. Binford, "Stereo correspondence: Features and constraints," inProc. DARPA Image Understanding Workshop, Miami Beach, FL, Dec. 1985, pp. 373-380.
[16] G. Medioni and R. Nevatia, "Segment-based stereo matching,"Comput. Vision, Graphics, Image Processing, vol. 31, pp. 2-18, 1985.
[17] Y. Ohta and T. Kanade, "Stereo by intra- and inter-scanline search using dynamic programming,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-7, no. 2, pp. 139-154, Mar. 1985.
[18] T. Pavlidis and S. L. Horowitz, "Segmentation of plane curves,"IEEE Trans. Comput., vol. C-23, no. 8, pp. 860-870, Aug. 1974.
[19] S. B. Pollard, J. E. W. Mayhew, and J. P. Frisby, "PMF: A stereo correspondence algorithm using a disparity gradient limit,"Perception, vol. 14, pp. 449-470, 1985.
[20] T. Skordas, "Mise en correspondance et reconstruction stereo utilisant une description structurelle des images," Ph.D. dissertation, Institut National Polytechnique de Grenoble, Oct. 1988.
[21] R. Tarjan, "Depth-first search and linear graph algorithms,"SIAM J. Computation, vol. 1, no. 2, pp. 146-160, June 1972.
[22] A. L. Yuille and T. Poggio, "A generalized ordering constraint for stereo correspondence," MIT Artificial Intell. Lab., Tech. Rep. AI Memo 777, May 1984.

Index Terms:
image structure extraction; segmentation; stereo matching; pattern recognition; graph theory; picture processing; feature grouping; maximal cliques; stereo correspondence; relational graph; nodes; graph theory; pattern recognition; picture processing
Citation:
R. Horaud, T. Skordas, "Stereo Correspondence Through Feature Grouping and Maximal Cliques," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 11, pp. 1168-1180, Nov. 1989, doi:10.1109/34.42855
Usage of this product signifies your acceptance of the Terms of Use.