Stereo Correspondence Through Feature Grouping Maximal Cliques

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 11, Issue 11, 1989, Pages 1168-1180

  Horaud, Radu ^a   Skordas, Thomas ^b  

^a LIFIA CNRS INRIA   (France)

^b CEA LETI   (France)

Author keywords

feature grouping; Feature based matching; geometric constraints; maximal cliques; stereo vision; subgraph isomorphism

Indexed keywords

MATHEMATICAL TECHNIQUES--GRAPH THEORY; VISION--ARTIFICIAL;

FEATURE EXTRACTION; GEOMETRIC CONSTRAINTS; GRAPH SEARCH; MAXIMAL CLIQUES; SEARCH METHODS; STEREO VISION;

IMAGE PROCESSING;

EID: 0024771949     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.42855     Document Type: Article

References (23)

1. A. P. Ambler, H. G. Barrow, C. M. Brown, R. M. Burstall, and R. J. Popplestone, “A versatile computer-controlled assembly system,” in Proc. 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,” in SPIE 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,” in Proc. 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,” ACM Comput. Surveys, vol. 14, pp. 553-572, Dec. 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 R. Horaud, “3DPO: A three-dimensional part orientation system,” Int. J. Robotics Res., vol. 5, no. 3, pp. 3-26, Fall 1986; also in
9. Three-Dimensional Machine Vision, T. Kanade, Ed. New York: Kluwer Academic, 1987, pp. 399-450.
10. 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.
11. 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.
12. R. D. Eastman and A. M. Waxman, “Disparity functionals and stereo vision,” in Proc. DARPA Image Understanding Workshop, Miami Beach, FL, Dec. 1985, pp. 245-254.
13. O. D. Faugeras and G. Toscani, “The calibration problem for stereo,” in Proc. Conf. Computer Vision and Pattern Recognition, Miami Beach, FL, June 1986, pp. 15-20.
14. 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.
15. M. Herman and T. Kanade, “Incremental reconstruction of 3-D scenes from multiple, complex images,” Artificial Intell., vol. 30, pp. 289-341, 1986.
16. H. S. Lim and T. O. Binford, “Stereo correspondence: Features and constraints,” in Proc. DARPA Image Understanding Workshop, Miami Beach, FL, Dec. 1985, pp. 373-380.
17. G. Medioni and R. Nevatia, “Segment-based stereo matching,” Comput. Vision, Graphics, Image Processing, vol. 31, pp. 2-18, 1985.
18. 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.
19. T. Pavlidis and S. l. Horowitz, “Segmentation of plane curves,” IEEE Trans. Comput., vol. C-23, no. 8, pp. 860-870, Aug. 1974.
20. 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.
21. T. Skordas, “Mise en correspondance et reconstruction stéréo utilisant une description structurelle des images,” Ph.D. dissertation. Institut National Polytechnique de Grenoble, Oct. 1988.
22. R. Tarjan, “Depth-first search and linear graph algorithms,” SIAM J. Computation, vol. 1, no. 2, pp. 146-160, June 1972.
23. A. L. Yuille and T. Poggio, “A generalized ordering constraint for stereo correspondence,” MIT Artificial Intell. Lab., Tech. Rep. AI Memo 777, May 1984.