Fourier descriptors for broken shapes

Fourier descriptors are powerful features for the recognition of two-dimensional connected shapes. In this article, we propose a method to define Fourier descriptors even for broken shapes, i.e. shapes that can have more than one contour. The method is based on the convex hull of the shape and the distance to the closest actual contour point along the convex hull. We define different invariant Fourier descriptors for this three-dimensional representation of a two-dimensional shape and compare them on different data sets. The recognition rates are comparable to normal Fourier descriptors while the new scheme at the same time offers the option to also deal with broken contours. We also discuss and evaluate different normalisation schemes that make the descriptors invariant under scale and rotation.

[1]  Gösta H. Granlund,et al.  Fourier Preprocessing for Hand Print Character Recognition , 1972, IEEE Transactions on Computers.

[2]  Guojun Lu,et al.  Study and evaluation of different Fourier methods for image retrieval , 2005, Image Vis. Comput..

[3]  Malayappan Shridhar,et al.  High accuracy character recognition algorithm using fourier and topological descriptors , 1984, Pattern Recognit..

[4]  R.M. McElhaney,et al.  Algorithms for graphics and image processing , 1983, Proceedings of the IEEE.

[5]  Wesley E. Snyder,et al.  Application of Affine-Invariant Fourier Descriptors to Recognition of 3-D Objects , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Christoph Dalitz,et al.  Optical recognition of psaltic Byzantine chant notation , 2008, International Journal of Document Analysis and Recognition (IJDAR).

[7]  Faouzi Ghorbel,et al.  Image reconstruction from a complete set of similarity invariants extracted from complex moments , 2006, Pattern Recognit. Lett..

[8]  Josef Kittler,et al.  Robust and Efficient Shape Indexing through Curvature Scale Space , 1996, BMVC.

[9]  Donald G. Bailey,et al.  An Efficient Euclidean Distance Transform , 2004, IWCIA.

[10]  Charles R. Giardina,et al.  Elliptic Fourier features of a closed contour , 1982, Comput. Graph. Image Process..

[11]  Ulrich Eckhardt,et al.  Shape descriptors for non-rigid shapes with a single closed contour , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[12]  Ralph Roskies,et al.  Fourier Descriptors for Plane Closed Curves , 1972, IEEE Transactions on Computers.

[13]  Ichiro Fujinaga,et al.  The Gamera framework for building custom recognition systems , 2003 .

[14]  L. Rodney Long,et al.  Comparative study of shape retrieval using feature fusion approaches , 2010, 2010 IEEE 23rd International Symposium on Computer-Based Medical Systems (CBMS).

[15]  Chun-Shin Lin,et al.  New forms of shape invariants from elliptic fourier descriptors , 1987, Pattern Recognit..

[16]  Christoph Dalitz,et al.  Document Image Analysis with the Gamera Framework , 2009 .

[17]  Anil K. Jain,et al.  Small Sample Size Effects in Statistical Pattern Recognition: Recommendations for Practitioners , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Dimo Dimov,et al.  Invariant Fourier Descriptors Representation of Medieval Byzantine Neume Notation , 2009, COST 2101/2102 Conference.

[19]  Christoph Dalitz.  Kd-Trees for Document Layout Analysis ∗ , 2009 .

[20]  Alireza Khotanzad,et al.  Invariant Image Recognition by Zernike Moments , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Thomas B. Moeslund,et al.  Long-Term Occupancy Analysis Using Graph-Based Optimisation in Thermal Imagery , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[22]  P. Heywood.  Trigonometric Series , 1968, Nature.

[23]  Thomas R. Crimmins.  A Complete Set of Fourier Descriptors for Two-Dimensional Shapes , 1982, IEEE Transactions on Systems, Man, and Cybernetics.

[24]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.