A new minimum trees-based approach for shape matching with improved time computing: application to graphical symbols recognition

Authors:
Patrick Franco;Jean-Marc Ogier;Pierre Loonis;Rémy Mullot
Affiliations:
Laboratoire Informatique, Image, Interaction, Université de La Rochelle, La Rochelle Cedex 1, France;Laboratoire Informatique, Image, Interaction, Université de La Rochelle, La Rochelle Cedex 1, France;Laboratoire Electronique, Informatique et Image, UMR, CNRS, Université de Bourgogne, Nevers Cedex, France;Laboratoire Informatique, Image, Interaction, Université de La Rochelle, La Rochelle Cedex 1, France
Venue:
GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
Year:
2009

Citing 17
Cited 0

A Theory for Multiresolution Signal Decomposition: The Wavelet Representation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Rotation invariant image recognition using features selected via a systematic method

Pattern Recognition
Discrete cosine transform: algorithms, advantages, applications

Discrete cosine transform: algorithms, advantages, applications
The JPEG still picture compression standard

Communications of the ACM - Special issue on digital multimedia systems
Vector quantization and signal compression

Vector quantization and signal compression
Morphological reduction of skeleton redundancy

Signal Processing - Special issue on mathematical morphology and its applications to signal processing
Wavelets and subband coding

Wavelets and subband coding
A randomized linear-time algorithm to find minimum spanning trees

Journal of the ACM (JACM)
JPEG Still Image Data Compression Standard

JPEG Still Image Data Compression Standard
Symbol Recognition: Current Advances and Perspectives

GREC '01 Selected Papers from the Fourth International Workshop on Graphics Recognition Algorithms and Applications
Graphics Recognition - from Re-engineering to Retrieval

ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 1
Recognition of Symbols in Grey Level Line-drawings from an Adaptation of the Radon Transform

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
A Minimum Spanning Tree Approach to Line Image Analysis

ICPR '96 Proceedings of the 13th International Conference on Pattern Recognition - Volume 2
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

IEEE Transactions on Computers
Discrete Cosine Transfom

IEEE Transactions on Computers
Towards an iterative classification based on concept lattice

CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
Graphics recognition: the last ten years and the next ten years

GREC'05 Proceedings of the 6th international conference on Graphics Recognition: ten Years Review and Future Perspectives

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.