Recognizing Sharp Features of 2-D Shapes

• Autorzy: Gewali L. , Scanlan J. P.
• Języki publikacji: EN

Abstrakty

EN

We present an efficient algorithm for recognizing and extracting sharp-features from complex polygonal shapes. The algorithm executes in O(n²) time, where n is the number of vertices in the polygon. Sharp-feature extraction algorithms can be useful as a pre-processing step for measuring shape-similarity between polygonal shapes.

Słowa kluczowe

EN

shape recognition; shape similarity; boundary approximation; shape decomposition; shape simplification

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2010
• Tom: Vol. 56, No. 2
• Strony: 153--156
• Opis fizyczny: Bibliogr. 11 poz., rys.

Twórcy

autor

Gewali L.

autor

Scanlan J. P.

• School of Computer Science University of Nevada, Las Vegas, USA

Bibliografia

• [1] E. M. Arkin, L. P. Chew, D. P. Huttenlocher, K. Kedem, and J. S. B. Mitchell, “An efficiently computable metric for comparing polygonal shapes,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 1, pp. 209–215, 1991.
• [2] O. Daescu and N. Mi, “Polygonal chain approximation: a query based approach,” Computational Geometry: Theory and Applications, vol. 30, pp. 41–58, 2005.
• [3] E. Gulbert and H. Lin, “B-spline curve smoothing under position constraints for line generalisation,” in Proceedings of ACM International Symposium on Advances in Geographic Information Systems, 2006, pp. 3–10.
• [4] M. Held and J. Eibl, “Biarc approximations of polygons within asymmetric tolerance bands,” Computer-Aided Design, vol. 37, pp. 357–371, 2005.
• [5] H. Imai and M. Iri, “Polygonal approximation of a curve,” in Computational Morphology, G. T. Toussaint, Ed. Elsevier, 1988.
• [6] D. T. Lee, “Similarity measurement using polygon curve representation and fourier descriptors for shape-based vertribral retrieval,” in Proceedings of SPIE, vol. 5032, 2003, pp. 1283–1291.
• [7] J. O’Rourke, http://cs.smith.edu/˜orourke.
• [8] J. O’Rourke, “The signature of a plane curve,” Siam Journal on Computing, vol. 15, no. 1, pp. 34–51, 1986.
• [9] J. O’Rourke, Computational Geometry in C (Second Edition). Cambridge University Press, 1998.
• [10] A. Pikaz and I. Distein, “An algorithm for polygonal approximation based on iterative point elimination,” Pattern Recognition Letters, vol. 16, pp. 557–563, 1995.
• [11] R. M. Rangayyan, D. Guliato, J. Carvalho, and S. Santiago, “Feature extractiom from the turning angle function for the classification of contours of breast tumors,” Journal of Digital Imaging, 2007.