Approximate geometric pattern matching under rigid motions

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 21, Issue 4, 1999, Pages 371-379

  Goodrich, Michael T ^a,b   Mitchell, Joseph S B ^a,b   Orletsky, Markw ^a,b  

^a Johns Hopkins University   (United States)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY;

HAUSDORFF DISTANCE;

PATTERN MATCHING;

EID: 0032634603     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.761267     Document Type: Article

References (38)

1. P.K. Agarwal, B. Aronov, M. Sharir, and S. Suri, "Selecting Distances in thé Plane," Algorithmica, vol. 9, pp. 495-514,1993.
2. N. Ahuja, "Dot Pattern Processing Using Voronoi Neighborhoods," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 4, no. 3, pp. 336-343, May 1982.
3. H. Alt, B. Behrends, and J. Blömer, "Approximate Matching of Polygonal Shapes," Annals of Math, and Artificial Intelligence, vol. 13, pp. 251-266,1995.
4. H. Alt, L. Knipping, and G. Weber, "An Application of Point Pattern Matching in Astronautics," Technical Report B-93-16, Institut für Informatik, Fachbereich Mathematik und Informatic, Freie Universität Berlin, 1993.
5. H. Alt, K. Mehlhorn, H. Wagener, and E. Welzl, "Congruence, Similarity and Symmetries of Geometric Objects," Discrete Computing in Geometry, vol. 3, pp. 237-256,1988.
6. E. M. Arkin, K. Kedem, J.S.B. Mitchell, J. Sprinzak, and M. Werman, "Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms," ORSA }. Computing, vol. 4, no. 4, pp. 375-386,1992.
7. K.S. Arun, T.S. Huang, and S.D. Blostein, "Least Squares Fitting of Two 3-(D) Point Sets," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, pp. 698-700,1987.
8. S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A. Wu, "An Optimal Algorithm for Approximate Nearest Neighbor Searching," Proc. Fifth ACM-SIAM Symp. Discrete Algorithms, 1994.
9. L.P. Chew, M.T. Goodrich, O.P. Huttenlocher, K. Kedem, J.M. Kleinberg, and D. Kravets, "Geometric Pattern Matching Under Euclidean Motion," Computing Geometric Theory Applications, vol. 7, pp. 113-124,1997.
10. L.P. Chew and K. Kedem, "Improvements on Geometric Pattern Matching Problems," Proc. Third Scandinavian Workshop Algorithm Theory, pp. 318-325. Springer-Verlag, 1992.
11. R. Cole, "Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms," J. ACM, vol. 34, pp. 200-208,1987.
12. R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, no. 4, pp. 770-785,1988.
13. R. Cole, J. Salowe, W. Steiger, and E. Szemerédi, "An OptimalTime Algorithm for Slope Selection," SIAM J. Computing, vol. 18, pp. 792-810,1989.
14. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. Cambridge, Mass.: MIT Press, 1990.
15. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Heidelberg, West Germany: Springer-Verlag, 1987.
16. D. Forsyth, J.L. Mundy, A. Zisserman, C. Coelho, A. Heller, and C. Rothwell, "Invariant Descriptors for 3-D Object Recognition and Pose," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 10, pp. 971-991, Oct. 1991.
17. J.W. Foster, G.K. Bennett, and P.M. Griffin, "Automated Visual Inspection: Quality Control Techniques for the Modern Manufacturing Environment," Proc. 1987 HE Integrated Systems Conf., pp. 135-140, Dec. 1987.
18. M.T. Goodrich and R. Tamassia, "Dynamic Trees and Dynamic Point Location," SIAM J. Computing, vol. 28, no. 2, pp. 612-636, 1999.
19. P.M. Griffin, J.W. Foster, and M.H. Han, "Automated Dimension Verification by Point Pattern Matching," Proc. 1988 Int'l Industrial Eng. Conf., pp. 451-455,1988.
20. R.M. Haralick, C.N. Lee, X. Zhuang, V.G. Vaidya, and M.B. Kirn, "Pose Estimation From Corresponding Point Data," IEEE Trans. Systems, Man, and Cybernetics, vol. 19, no. 6, pp. 1,426-1,446, Nov.Dec. 1989.
21. PJ. Heffernan, "Generalized Approximate Algorithms for Point Set Congruence," Proc. Third Workshop Algorithms Data Structure, pp. 373-384,1993.
22. PJ. Heffernan and S. Schirra, "Approximate Decision Algorithms for Point Set Congruence," Computing Geometric Theory Applications, vol. 4, pp. 137-156,1994.
23. B.K.P. Horn, "Closed-Form Solution of Absolute Orientation Using Unit Quaternions," J. Optical Soc. of Am. A, vol. 4, no. 4, pp. 629-642, Apr. 1987.
24. B.K.P. Horn, H.M. Hilden, and S. Negahdaripour," Closed-Form Solution of Absolute Orientation Using Orthonormal Matrices," J. Optical Soc. of Am. A, vol. 5, no. 7, pp. 1,127-1,135, July 1988.
25. O.P. Huttenlocher, K. Kedem, and J.M. Kleinberg., "On Dynamic Voronoi Diagrams and the Minimum Hausdorff Distance for Point Sets Under Euclidean Motion in the Plane," Proc. Eighth Ann. ACM Symp. Computer Geometry, pp. 110-120,1992.
26. D.P. Huttenlocher, K. Kedem, and M. Sharir, "The Upper Envelope of Voronoi Surfaces and Its Applications," Discrete Computing Geometry, vol. 9, pp. 267-291,1993.
27. K. Imai, S. Sumino, and H. Imai, "Minimax Geometric Fitting of Two Corresponding Sets of Points," Proc. Fifth Ann. ACM Symp. Computing Geometry, pp. 266-275,1989.
28. DJ. Kahl, A. Rosenfeld, and A. Danker, "Some Experiments in Point Pattern Matching," IEEE Trans. Systems, Man, and Cybernetics, vol. 10, no. 2, pp. 105-116,1980.
29. L.J. Kitchen, "Relaxation for Point-Pattern Matching: What It Really Computes," Proc. IEEE Conf. Visualization and Pattern Recognition, pp. 405-407,1985.
30. N. Megiddo, "Applying Parallel Computation Algorithms in the Design of Serial Algorithms," J. ACM, vol. 30, pp. 852-865,1983.
31. H. Ogawa, "Labeled Point Pattern Matching by Fuzzy Relaxation," Pattern Recognition, vol. 17, no. 5, pp. 569-573,1984.
32. H. Ogawa, "Labeled Point Pattern Matching by Delaunay Triangulation and Maximal Cliques," Pattern Recognition, vol. 19, no. 1, pp. 35-40,1986.
33. P.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction. New York: Springer-Verlag, 1985.
34. S. Ranade and A. Rosenfeld, "Point Pattern Matching by Relaxation," Pattern Recognition, vol. 12, pp. 269-275,1980.
35. W. Rucklidge, "Lower Bounds for the Complexity of the Hausdorff Distance," Proc. Fifth Canadian Conf. Computer Geometry, pp. 145-150, 1993.
36. G. Stockman, S. Kopstein, and S. Benett, "Matching Images to Models for Registration and Object Detection via Clustering," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 4, no. 3, pp. 229-241, May 1982.
37. S. Umeyama, "Least-Squares Estimation of Transformation Parameters Between Two Point Patterns," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 4, pp. 376-380, Apr. 1991.
38. C. Wang, H. Sun, S. Yada, and A. Rosenfeld, "Some Experiments in Relaxation Image Matching Using Corner Features," Pattern Recognition, vol. 16, no. 2, pp. 167-182,1983.