Abstract
In this paper, some new and efficient algorithms are described for feature description, analysis and recognition of contours. One linearization method is introduced . The series of curvature angle, linearity, and bend angle between two neighboring linearized lines are calculated from the starting line to the end line. The series of structural points are described. The useful series of features can be used for shape analysis and recognition of binary contours.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Moktarian, F., Mackworth, A.K.: A Theory of Multiscale Curvature-Based Shape Representation for Planer Curvature Angles. IEEE Trans. Pattern Analysis Mach. Intell. 14(8), 789–805 (1992)
Fu, A.M.N., Yan, H., Huang, K.: A Curvature Angle Bend Function Based Method to Characterize Contour Shapes. Patt. Recog. 30(10), 1661–1671 (1997)
Sonka, M., Hlavac, V., Boyle, R.: Image Processing, Analysis and Machine Vision. Chapman & Hall Computing, Cambridge (1993)
Yu, D., Yan, H.: An efficient algorithm for smoothing binary image contours. In: Pro. of ICPR 1996, vol. 2, pp. 403–404 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, D., Lai, W. (2004). New Algorithms for Feature Description, Analysis and Recognition of Binary Image Contours. In: Zhang, J., He, JH., Fu, Y. (eds) Computational and Information Science. CIS 2004. Lecture Notes in Computer Science, vol 3314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30497-5_179
Download citation
DOI: https://doi.org/10.1007/978-3-540-30497-5_179
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24127-0
Online ISBN: 978-3-540-30497-5
eBook Packages: Computer ScienceComputer Science (R0)