An Efficiently Computable Metric for Comparing Polygonal Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 13, Issue 3, 1991, Pages 209-216

  Arkin, Esther M ^a   Chew, L Paul ^a   Huttenlocher, Daniel P ^a   Kedem, Klara ^b  

^a Department of Obstetrics Gynecology   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Computational geometry; distance metric; model based matching; shape comparison; similarity transformation; turning angle (theta s) representation

Indexed keywords

COMPUTER VISION; MATHEMATICAL TECHNIQUES - GEOMETRY;

COMPUTATIONAL GEOMETRY; DISTANCE METRIC; MINKOWSKI INEQUALITY; POLYGON REPRESENTATION; POLYGONAL SHAPES COMPARISON; TURNING ANGLE REPRESENTATION;

IMAGE PROCESSING;

EID: 0026121005     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.75509     Document Type: Article

References (14)

1. D. Avis and H. ElGindy, “A combinatorial approach to polygon similarity”, IEEE Trans. Inform. Theory, vol. 29, 1983
2. D. H. Ballard and C. M. Brown, Computer Vision. Englewood Cliffs, NJ: Prentice-Hall, 1982.
3. P. Cox, H. Maitre, M. Minoux, and C. Ribeiro, “Optimal matching of convex polygons”, Pattern Recognition Lett., vol. 9, pp. 327–334, 1989.
4. D.P. Huttenlocher and K. Kedem, “Computing the minimum Hausdorff distance for point sets under translation”, in Proc. ACM Symp. Computational Geometry, 1990, pp. 340–349.
5. J. Hong and X. Tan, “The similarity between shapes under affine transformation,”, in Proc. Second Int. Conf. Computer Vision. Washington, DC: IEEE Comput. Soc. Press, 1988, pp. 489–493.
6. J. Hong and H.J. Wolfson, “An improved model-based matching method using footprints”, in Proc. Ninth Int. Conf. Pattern Recognition, Rome, Italy, Nov. 14–18, 1988.
7. D. Mumford, “The problem of robust shape First Int. Conf. Computer Vision. Washington, DC: IEEE Comput. Soc. Press, 1987, pp. 602–606.
8. J. O'Rourke and R. Washington, “Curve Curve similarity via signatures”, in Computational Geometry, G. Toussaint, Ed. Amsterdam, The Netherlands: North-Holland, 1985, pp. 295–318.
9. H. L. Royden, Real Analysis. New York: Macmillan, 1968.
10. L.G. Shapiro and R. M. Haralick, “Organization of relational models for scene analysis”, IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-4, no. 6, pp. 595–602, 1982.
11. J. T. Schwartz and M. Sharir, “Some remarks on robot vision”, New York Univ., Courant Inst. Math. Sci., Tech. Rep. 119, Robotics Rep. 25, Apr. 1984.
12. J. T. Schwartz and M. Sharir, “Identification of objects in two matching noisy characteristic curves”, Int. J. Robotics Res., vol. 6, no. 2, pp. 29–44, 1987.
13. J.J. Stoker, Differential Geometry. New York: Wiley, 1969.
14. H. Wolfson, “On curve matching”, Proc. IEEE Workshop Computer Vision, Miami Beach, FL, Nov. 30—Dec. 2, 1987.