A New Minimum Trees-Based Approach for Shape Matching with Improved Time Computing: Application to Graphical Symbols Recognition

Recently we have developed a model for shape description and matching. Based on minimum spanning trees construction and specifics stages like the mixture, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to be powerful, the construction of graph induces an expensive algorithmic cost. In this article we discuss on the ways to reduce time computing. An alternative solution based on image compression concepts is provided and evaluated. The model no longer operates in the image space but in a compact space, namely the Discrete Cosine space. The use of block discrete cosine transform is discussed and justified. The experimental results led on the GREC2003 database show that the proposed method is characterized by a good discrimination power, a real robustness to noise with an acceptable time computing.

[1]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[2]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[3]  J. Skilling,et al.  Algorithms and Applications , 1985 .

[4]  Gregory K. Wallace,et al.  The JPEG still picture compression standard , 1991, CACM.

[5]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[6]  G.S. Moschytz,et al.  Practical fast 1-D DCT algorithms with 11 multiplications , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[7]  P. Yip,et al.  Discrete Cosine Transform: Algorithms, Advantages, Applications , 1990 .

[8]  Joan L. Mitchell,et al.  JPEG: Still Image Data Compression Standard , 1992 .

[9]  J. Yukich,et al.  Limit Theorems and Rates of Convergence for Euclidean Functionals , 1994 .

[10]  A. Rényi.  On Measures of Entropy and Information , 1961 .

[11]  Rémy Mullot,et al.  A Topological Measure for Image Object Recognition , 2003, GREC.

[12]  Michael Egmont-Petersen,et al.  Image processing with neural networks - a review , 2002, Pattern Recognit..

[13]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[14]  Jelena Kovacevic,et al.  Wavelets and Subband Coding , 2013, Prentice Hall Signal Processing Series.

[15]  Ying Xu,et al.  2D image segmentation using minimum spanning trees , 1997, Image Vis. Comput..

[16]  David Malah,et al.  Morphological reduction of skeleton redundancy , 1994, Signal Process..

[17]  Laurent Wendling,et al.  Recognition of symbols in grey level line-drawings from an adaptation of the Radon transform , 2004, ICPR 2004.

[18]  Stanislaw Osowski,et al.  Fourier and wavelet descriptors for shape recognition using neural networks - a comparative study , 2002, Pattern Recognit..

[19]  Bart Lamiroy,et al.  Graphics recognition - from re-engineering to retrieval , 2003, Seventh International Conference on Document Analysis and Recognition, 2003. Proceedings..

[20]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[21]  Alfred O. Hero,et al.  Robust estimation of point process intensity features using k-minimal spanning trees , 1997, Proceedings of IEEE International Symposium on Information Theory.

[22]  Philip N. Klein,et al.  A randomized linear-time algorithm to find minimum spanning trees , 1995, JACM.

[23]  Yazid M. Sharaiha,et al.  A minimum spanning tree approach to line image analysis , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[24]  Stéphane Mallat,et al.  A Theory for Multiresolution Signal Decomposition: The Wavelet Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[25]  Alfred O. Hero,et al.  Asymptotic theory of greedy approximations to minimal k-point random graphs , 1999, IEEE Trans. Inf. Theory.

[26]  Soo-Chang Pei,et al.  Normalization of rotationally symmetric shapes for pattern recognition , 1992, Pattern Recognit..

[27]  Young Kee Ryu,et al.  Study on the center of rotation method based on minimum spanning tree matching algorithm for fingerprint recognition , 2004 .

[28]  Y Xu,et al.  Minimum spanning trees for gene expression data clustering. , 2001, Genome informatics. International Conference on Genome Informatics.

[29]  Alfred O. Hero,et al.  Robust entropy estimation strategies based on edge weighted random graphs , 1998, Optics & Photonics.

[30]  Alireza Khotanzad,et al.  Rotation invariant image recognition using features selected via a systematic method , 1990, Pattern Recognit..

[31]  Ernest Valveny,et al.  Symbol Recognition: Current Advances and Perspectives , 2001, GREC.

[32]  William K. Pratt,et al.  Scene Adaptive Coder , 1984, IEEE Trans. Commun..

[33]  Karl Tombre.  Graphics Recognition: The Last Ten Years and the Next Ten Years , 2005, GREC.

[34]  Karell Bertet,et al.  Towards an Iterative Classification Based on Concept Lattice , 2006, CLA.

[35]  Petros Maragos,et al.  Morphological skeleton representation and coding of binary images , 1984, IEEE Trans. Acoust. Speech Signal Process..