Open Access Open Access  Restricted Access Subscription Access


Oleksandr Koriukalov, Vasyl Tereshchenko


In this article we propose an efficient modification of a previously published shape descriptor, which is fast and simple to compute. Proposed descriptor was developed for object classification and should be used with classifiers: SVM, KNN, etc. Object classification is a common task of computer vision, which has many applications in different areas: computer intelligence, robotic vision, smart cameras, autonomous driving, etc. Because the properties of objects are largely determined by their geometric features, shape analysis and classification are essential to almost every applied scientific and technological area. Main steps of the proposed algorithm are as follows: to find the object bounds; to smooth the bound contour using extremes based approach (if needed); to find side contour feature for each of N object rotation; to gather common feature vector; to classify object contour, using pre-trained classifier (SVM, KNN). In this work, in addition to method modifications (saving object proportions, rotation invariance, applying KNN classifier), we provide a wide comparison of our algorithm with existing approaches. The described method provided state-of-the-art performance on 100 leaves and Mpeg7 datasets, and showed good results on our own Mushroom dataset separately or together with texture or color based features.


object classification; shape descriptor; computer vision; contour smoothing.

Full Text:



J. Iivarinen, 2 Shape Coding Techniques, 1997, [Online]. Available:

H. Park, G.R. Martin, A.C. Yu, Lossless Contour Representation Using Efficient Multiple Grid Chain Coding, 2005, [Online]. Available:

Y. Qian, W. Xichang, Z. Huaying, S. Zhen, L. Jiang, “Recognition method for handwritten digits based on improved chain code histogram feature,” Proceedings of 3rd International Conference on Multimedia Technology (ICMT-13), Published by Atlantis Press, November 2013, 438-445.

X. Bai, W. Liu, Z. Tu, “Integrating contour and skeleton for shape classification,” Proceedings of the 12th International Conference on Computer Vision Workshops, Kyoto, Japan, September 27 – October 4, 2009, pp. 360-367.

L. Latecki, R. Lakamper, “Shape similarity measure based on correspondence of visual parts,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 10, pp. 1185-1190, 2000.

A. Tsai, W.M. Wells, S.K. Warfield, A.S. Willsky, “An EM algorithm for shape classification based on level sets,” Medical Images Analysis, vol. 9, issue 5, pp. 491-502, 2005.

X.W. Bin, F.X. Bai, W.L. Longin, J. Latecki, “Bag of contour fragments for robust shape classification,” Journal Pattern Recognition, vol. 47, issue 6, pp. 2116-2125, 2014.

Canny Edge Detection, 2009, 09gr820

A. Vedaldi, VlFeat Library, 2013, [Online]. Available:

M.E. Rahmani, A. Amine, M.R. Hamou, “Plant leaves classification,” Proceedings of the First International Conference on Big Data, Small Data, Linked Data and Open Data ALLDATA’2015, Barcelona, Spain, April 19-24, 2015, pp. 75-80.

C. Mallah, J. Cope, J. Orwell, “Plant leaf classification using probabilistic integration of shape, texture and margin features,” Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications (SPPRA’2013), February 12-14, 2013 Innsbruck, Austria, pp. 279-286.

A. Goshvarpour, H. Ebrahimnezhad, A. Goshvarpour, “Shape classification based on normalized distance and angle histograms using PNN,” Interntional Journal on Information Technology and Computer Science, no. 9, pp. 65-72, 2013.

O.V. Koriukalov, V.M. Tereshchenko, “Contour feature for simple objects classification real-time algorithm,” Bulletin of Taras Shevchenko National University of Kyiv, Series Physics & Mathematics, vol. 1, pp. 143-146, 2016. (in Ukrainian)

O.V. Koriukalov, V.M. Tereshchenko, “Contour smoothing algorithm based on contour extremes,” Proceedings of the International Conference on Computer Graphics, Visualization, Computer Vision and Image Processing, Funchal, Madeira, Portugal, July 2–4, 2016, pp. 283-286.

H. Freeman, “On the encoding of arbitrary geometric configurations,” IRE Transactions on Electronic Computers, vol. EC-10, issue 2, pp. 260-268, June 1961. [Online]. Available:

S.-D. Kim, J.-H. Lee, J.-K. Kim, “A new chain-coding algorithm for binary images using run-length codes,” Computer Vision, Graphics, and Image Processing, vol. 41, issue 1, pp. 114-128, January 1988. [Online]. Available:

D.G. Bailey, Chain Coding Streamed Images through Crack Run-Length Encoding, [Online]. Available:

L. da Fona Costa, R. Marcond Cesar, Jr., Shape Classification and Analysis: Theory and Practice, Second Edition, April 1, 2009. [Online]. Available:

Star-shaped polygon, [Online]. Available:

K.B. Sun and B.J. Super, Classification of Contour Shapes Using Class Segment Sets, [Online]. Available:

E. Salahat, M. Qasaimeh, Recent Advances in Features Extraction and Description Algorithms: A Comprehensive Survey, 19 Mar 2017 arXiv:1703.06376v1 [Online]. Available:


  • There are currently no refbacks.
hgs yükleme