A global solution to sparse correspondence problems

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 25, Issue 2, 2003, Pages 187-199

  Maciel, João ^a   Costeira, João P ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Correspondence problem; Linear and concave programming; Sparse stereo

Indexed keywords

ALGORITHMS; CAMERAS; COMPUTATIONAL METHODS; LINEAR PROGRAMMING; OBJECT RECOGNITION; OPTIMIZATION;

FEATURE SELECTION;

COMPUTER VISION;

EID: 0037330974     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2003.1177151     Document Type: Article

References (30)

1. R. Berthilsson, K. Astrom, and A. Heyden, "Projective Reconstruction of 3D-Curves from Its 2D-Images Using Error Models and Bundle Adjustments," Proc. Scandinavian Conf. Image Analysis, 1997.
2. R. Bhatia, "Matrix Analysis," Graduate Texts in Mathematics, S. Alex, ed., Springer, 1997.
3. R. Burkard, E. Çela, and B. Klinz, "On the Biquadratic Assignment Problem," Proc. DIMACS Workshop Quadratic Assignment and Related Problems, pp. 117-146, May 1993.
4. A. Cabot and R. Francis, "Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points," Operations Research, vol. 18, no. 1, pp. 82-86, Feb. 1970.
5. Y. Cheng, V. Wu, R. Collins, A. Hanson, and E. Riseman, "Maximum-Weight Bipartite Matching Technique and Its Application in Image Feature Matching," Proc. SPIE Conf. Visual Comm. and Image Processing, 1996.
6. G. Fielding and M. Kam, "Weighted Matchings for Dense Stereo Correspondence," Pattern Recognition, vol. 33, pp. 1511-1524, 2000.
7. S. Gold, A. Rangarajan, C. Lu, S. Pappu, and E. Mjolsness, "New Algorithms for 2D and 3D Point Matching," Pattern Recognition, vol. 31, no. 8, pp. 1019-1031, 1998.
8. A.V. Goldberg, S.A. Plotkin, and P.M. Vaidya, "Sublinear-Time Parallel Algorithms for Matching and Related Problems," Proc. IEEE Symp. Foundations of Computer Science, pp. 174-185, 1988.
9. R. Horn and C. Johnson, Matrix Analysis. Cambridge Univ. Press, 1985.
10. Handbook of Global Optimization, R. Horst and P. Pardalos, eds., Kluwer, 1995.
11. J. Júdice and A. Faustino, "Solution of the Concave Linear Complementary Problem," Recent Advances in Global Optimization, pp. 76-101, 1992.
12. M. Karwan, V. Lotfi, J. Telgen, and S. Zionts, Redundancy in Mathematical Programming. Springer-Verlag, 1983.
13. B. Lucas and T. Kanade, "An Iterative Image Registration Technique with an Application to Stereo Vision," Proc. Seventh Int'l Joint Conf. Artifical Inteligence, 1981.
14. J. Maciel, "Global Matching: Optimal Solutions for Correspondence Problems," PhD thesis, Instituto Superior Téecnico 2001. http://www.isr.ist.utl.pt/vislab/thesis/macielPhD.pdf.
15. J. Maciel and J. Costeira, "Stereo Matching as a Concave Minimization Problem," Technical Report VISLAB-TR 11/99, Instituto de Sistemas e Robótica, IST, 1999.
16. J. Maciel and J. Costeira, "Robust Point Correspondence by Concave Minimization," Proc. 11th British Machine Vision Conf., pp. 626-635, 2000.
17. C. Meyer, "A Simple Finite Cone Covering Algorithm for Concave Minimization," Technical Report 193, Karl-Franzens-Universitat Graz, Apr. 2000.
18. G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization. Wiley, 1988.
19. Y. Ohta and T. Kanade, "Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, no. 2, pp. 139-154, Mar. 1985.
20. P. Pardalos, "Enumerative Techniques for Solving some Nonconvex Global Optimization Problems," Technical Report CS-86-33, Dept. of Computer Science, The Pennsylvania State Univ., Nov. 1986.
21. P. Pardalos and J. Rosen, "Methods for Global Concave Minimization: A Bibliographic Survey," SIAM Rev., vol. 28, no. 3, pp. 367-379, Sept. 1986.
22. S. Roy and I. Cox, "A Maximum-Flow Formulation of the n-Camera Stereo Correspondence Problem," Proc. Int'l Conf. Computer Vision, 1997.
23. G. Scott and H. Longuet-Higgins, "An Algorithm for Associating the Features of Two Patterns," Proc. Royal Soc. London, B, vol. 244, pp. 21-26, 1991.
24. L. Shapiro and J. Brady, "Feature-Based Correspondence: An Eigenvector Approach," Image and Vision Computing, vol. 10, no. 5, pp. 283-288, June 1992.
25. C. Silva, "3D Motion and Dense Structure Estimation: Representations for Visual Perception and the Interpretation of Occlusions," PhD thesis, Instituto Superior Técnico, 2001. http://www.isr.ist.utl.pt/vislab/thesis/CesarPhD.pdf.
26. J. Starink and E. Backer, "Finding Point Correspondences Using Simulated Annealing," Pattern Recognition, vol. 28, no. 2, pp. 231-240, 1995.
27. C. Tomasi and T. Kanade, "Shape from Motion from Image Streams under Orthography: A Factorization Method," Int'l J. Computer Vision, vol. 9, no. 2, pp. 137-154, Nov. 1992.
28. P. Torr, "Motion Segmentation and Outlier Detection," PhD thesis, Dept. of Eng. Science, Univ. Oxford, 1995.
29. M. Wu and J. Leou, "A Bipartite Matching Approach to Feature Correspondence in Stereo Vision," Pattern Recognition Letters, vol. 16, pp. 23-31, Jan. 1995.
30. Z. Zhang, "Iterative Point Matching for Registration of Free-Form Curves," Technical Report RR-1658, INRIA, 1992.