Efficient shape recognition method using novel metric for complex polygonal shapes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient shape recognition method using novel metric for complex polygonal shapes

Full text

Pdf (88 KB)

Source

ACM International Conference Proceeding Series; Vol. 324 archive
Proceedings of the 2nd international conference on Mobile multimedia communications table of contents

Alghero, Italy

SESSION: Automatic annotation and retrieval of multimedia content table of contents

Article No. 23

Year of Publication: 2006

ISBN:1-59593-516-X

Authors

Vesna Zeljkovic	Delaware State University, Dover, DE
Robert B. Vincelette	Delaware State University, Dover, DE
Marko Savic	Belgrade University, Belgrade, Serbia

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 30, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1374296.1374321 What is a DOI?

ABSTRACT

We propose two new optimal and sub-optimal solution shape recognition algorithms using geometric calculations. Our algorithms are efficient and tolerate severe noise. They work for convex and concave polygons equally well. These algorithms are invariant under translation, rotation, change of scale and they are reasonably easy to compute.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	J. T. Schwartz and M. Sharir, "Some Remarks on Robot Vision", New York University, Courant Inst. Math. Sci., Tech. Rep. 119, Robotics Rep. 25, April 1984.
	2	L. G. Shapiro and R. M. Haralick, "Organization of Relational Models for Scene Analysis", IEEE Transactions Pattern Anal. Machine Intelligence, vol. 4, no. 6, pp. 595--602, 1982.
	3	J. O'Rourke and R. Washington, "Curve Similarity Via Signatures", Computational Geometry, G. Toussaint, Amsterdam, The Netherlands, pp. 295--318, 1985.
	4	J. Hong and X. Tan, "The Similarity between Shapes under Affined Transformation", Proceedings of Second International Confrence for Computer Vision. Washington, DC: IEEE Computer Society Press, pp. 489--493, 1988.
	5	P. Cox, H. Maitre, M. Minoux and C. Ribeiro, "Optimal Matching of Convex Polygons", Pattern Recognition Letters, vol. 9, pp. 327--334, 1989.
	6	D. Avis and H. ElGindy, "A Combinatorial Approach to Polygon Similarity", IEEE Transactions on Information Theory, vol. 29, 1983.
	7	Daniel P. Huttenlocher , Klara Kedem, Computing the minimum Hausdorff distance for point sets under translation, Proceedings of the sixth annual symposium on Computational geometry, p.340-349, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98599]
	8	Jacob T. Schwartz , Micha Sharir, Identification of partially obscured objects in two and three dimensions by matching noisy characteristic, International Journal of Robotics Research, v.6 n.2, p.29-44, Summer 1987 [doi>10.1177/027836498700600203]
	9	H. Wolson, "On Curve Matching", Proceedings on IEEE Workshop Computer Vision, Miami Beach, Florida, 1987.
	10	Esther M. Arkin , L. Paul Chew , Daniel P. Huttenlocher , Klara Kedem , Joseph S. B. Mitchell, An Efficiently Computable Metric for Comparing Polygonal Shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.3, p.209-216, March 1991 [doi>10.1109/34.75509]
	11	V. Zeljkovic, A. Dorado and E. Izquierdo, "Combining a Fuzzy Rule-Based Classifier and Illumination Invariance for Improved Building Detection", IEEE Transactions on Circuits and Systems for VideoTechnology, vol. 14, No. 11, November 2004, pp. 1277--1280.