Efficient algorithms for robust feature matching

Pattern Recognition

Volumn 32, Issue 1, 1999, Pages 17-38

  Mount, David M ^a   Netanyahu, Nathan S ^b,c   Moigne, Jacqueline Le ^c  

^a University of Maryland ^*  (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c NASA GODDARD SPACE FLIGHT CENTER   (United States)

Author keywords

Approximation algorithms; Hausdorff distance; Image registration; Point pattern matching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; IMAGE QUALITY; MONTE CARLO METHODS;

HAUSDORFF DISTANCE; IMAGE REGISTRATION;

PATTERN MATCHING;

ALGORITHM; IMAGE PROCESSING; REMOTE SENSING;

EID: 0033007159     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(98)00086-7     Document Type: Article

References (35)

1. [1] D.P. Huttenlocher, W.J. Rucklidge, A multiresolution technique for comparing images using the Hausdorff distance, Technical Report 1321, Dept. of Computer Science, Cornell University, Ithaca, New York, 1992.
2. [2] D.P. Huttenlocher, W.J. Rucklidge, A multi-resolution technique for comparing images using the Hausdorff distance, Proc. IEEE Conf. on Computer Vision and Pattern Recognition, New York, June 1993, pp. 705-706.
3. [3] L.G. Brown, A survey of image registration techniques, ACM Comput. Surveys 24 (1992) 325-376.
4. [4] J. Ton, A.K. Jain, Registering landsat images by point matching, IEEE Trans. Geosci. Remote Sensing 27 (1989) 642-651.
5. [5] H. Alt, L.J. Guibas, Discrete geometric shapes: Matching, interpolation, and approximation, Technical Report 96-11, Institut für Informatik, Freie Unversität Berlin, Berlin, Germany, 1996.
6. [6] J. Le Moigne, W. Xia, J.C. Tilton, B-T. Lerner, E. Kaymaz, J. Pierce, S. Raghavan, S. Chettri, T. El-Ghazawi, M. Manohar, N.S. Netanyahu, W.J. Campbell, R.F. Cromp, Towards an intercomparison of automated registration algorithms for multiple source remote sensing data, Proc. CESDIS Image Registration Workshop, pp. 307-316. NASA Goddard Space Flight Center, November 1997. Also in NASA Publication CP-1998-206853.
7. [7] J. Le Moigne, W. Xia, J.C. Tilton, T. El-Ghazawi, M. Manohar, N.S. Netanyahu, W.J. Campbell, R.F. Cromp, First evaluation of automatic image registration methods, Proc. IEEE Int. Geoscience and Remote Sensing Symp., Seattle, Washington, July 1998.
8. [8] M. McGuire, H. Stone. Techniques for multi-resolution image registration in the presence of occlusions, Proc. CESDIS Image Registration Workshop, pp. 101-122. NASA Goddard Space Flight Center, November. Also in NASA Publication CP-1998-206853, 1997.
9. [9] D.L. Donoho, P.J. Huber, The notion of breakdown point, in: P.J. Bickel, K. Doksun, J.L. Hodges Jr., (Eds.), A Festschrift for Erich L. Lehman, Wadsworth, Belmont, CA, 1983, pp. 157-184.
10. [10] P.J. Rousseeuw, A.M. Leroy, Robust Regression and Outlier Detection, Wiley, New York, 1987.
11. [11] D.P. Huttenlocher, G.A. Klanderman, W.J. Rucklidge, Comparing images using the Hausdorff distance, IEEE Trans. Pattern Anal. Mach. Intell. 15 (1993) 850-863.
12. [12] P.J. de Rezende, D.T. Lee, Point set pattern matching in d dimensions, Algorithmica 13 (1995) 387-404.
13. [13] H. Alt, K. Mehlhorn, H. Wagener, E. Welzl, Congruence, similarity and symmetries of geometric objects, Discrete Comput. Geom. 3 (1988) 237-256.
14. [14] P.J. Heffernan, S. Schirra. Approximate decision algorithms for point set congruence, Comput. Geom. Theory Appl. 4 (1994) 137-156.
15. [15] H. Alt, O. Aichholzer, G. Rote, Matching shapes with a reference point, Proc. 10th Annual ACM Symp. on Computational Geometry, Stony Brook, New York, June 1994, pp. 85-92.
16. [16] L.P. Chew, M.T. Goodrich, D.P. Huttenlocher, K. Kedem, J.M. Kleinberg, D. Kravets, Geometric pattern matching under Euclidean motion, Comput. Geom. Theory Appl. 7 (1997) 113-124.
17. [17] M.T. Goodrich, J.S. Mitchell, M.W. Orletsky, Practical methods for approximate geometric pattern matching under rigid motion, Proc. 10th Annual ACM Symp. on Computational Geometry, Stony Brook, New York, June, 1994, pp. 103-112.
18. [18] D.P. Huttenlocher, K. Kedem, M. Sharir, The upper envelope of Voronoi surfaces and its applications, Discrete Comput. Geom. 9 (1993) 267-291.
19. [19] S. Ranade, A. Rosenfeld, Point pattern matching by relaxation, Pattern Recognition 12 (1980) 269-275.
20. [20] G.C. Stockman, S. Kopstein, S. Benett, Matching images to models for registration and object detection via clustering, IEEE Trans. Pattern Anal. Mach. Intell. 4 (1989) 229-241.
21. [21] A. Goshtasby, G.C. Stockman, Point pattern matching using convex hull edges. IEEE Trans. Systems Man Cybernet. 15 (1985) 631-637.
22. [22] A. Goshtasby, G.C. Stockman, C.V. Page, A region-based approach to digital image registration with subpixel accuracy, IEEE Trans. Geosci. and Remote Sensing 24 (1986) 390-399.
23. [23] C.F. Olson, D.P. Huttenlocher, Automatic target recognition by matching oriented edge pixels, IEEE Trans. Image Process. 6 (1997) 103-113.
24. [24] M. Hagedoorn, R.C. Veltkamp, Reliable and efficient pattern matching using an affine invariant metric, Technical Report RUU-CS-97-33, Dept. of Computing Science, Utrecht University, The Netherlands, 1997.
25. [25] S. Irani, P. Raghavan, Combinatorial and experimental results for randomized point matching algorithms, Proc. 12th Annual ACM Symp. on Computational Geometry, Philadelphia, PA, May 1996, pp. 68-77.
26. [26] Y. Lamdan, H.J. Wolfson, Geometric hashing: A general and efficient model-based recognition scheme, Proc. 2nd Int. Conf. Computer Vision, Tampa, FL, December 1988, pp. 238-249.
27. [27] W.J. Rucklidge, Efficient Visual Recognition using the Hausdorff Distance, Lecture Notes in Computer Science, vol. 1173, Springer, Berlin, 1996.
28. [28] W.J. Rucklidge, Efficiently locating objects using the Hausdorff distance, Int. J. Comput. Vision 24 (1997) 251-270.
29. [29] J.H. Friedman, J.L. Bentley, R.A. Finkel, An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Software 3 (1977) 209-226.
30. [30] S. Arya, D.M. Mount, Algorithms for fast vector quantization, in: Proc. DCC '93: Data Compression Conf., J. A. Storer, M. Cohn, (Ed.), Los Alamitos, California, IEEE Press, New York, 1993, pp. 381-390.
31. [31] S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, A. Wu, An optimal algorithm for approximate nearest neighbor searching, Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, Arlington, Virginia, January, 1994, pp. 573-582.
32. [32] S. Arya, D.M. Mount, Approximate range searching. Proc. 11th Annual ACM Symp. Computational Geometry, Vancouver, Canada, June 1995, pp. 172-181.
33. [33] D.M. Mount, S. Arya, ANN: A library for approximate nearest neighbor searching, CGC 2nd Annual Fall Workshop on Computational Geometry, URL: http: // www.cs.umd.edu/~mount/ANN, 1997.
34. [34] J. Le Moigne, W.J. Campbell, R.F. Cromp, An automated parallel image registration technique of multiple source remote sensing data, IEEE Trans. Geosci. Remote Sensing, to appear.
35. [35] K. Kedem, Y. Yarmovski, Curve based stereo matching using the minimum Hausdorff distance, Proc. 12th Annual ACM Symp. Computational Geometry. Philadelphia, Pennsylvania, May 1996, pp. C15-C18.