Blurred Shape Model for binary and grey-level symbol recognition (original) (raw)
Related papers
Multi-class binary symbol classification with circular blurred shape models
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009
Multi-class binary symbol classification requires the use of rich descriptors and robust classifiers. Shape representation is a difficult task because of several symbol distortions, such as occlusions, elastic deformations, gaps or noise. In this paper, we present the Circular Blurred Shape Model descriptor. This descriptor encodes the arrangement information of object parts in a correlogram structure. A prior blurring degree defines the level of distortion allowed to the symbol. Moreover, we learn the new feature space using a set of Adaboost classifiers, which are combined in the Error-Correcting Output Codes framework to deal with the multi-class categorization problem. The presented work has been validated over different multi-class data sets, and compared to the state-ofthe-art descriptors, showing significant performance improvements.
Handwritten Symbol Recognition by a Boosted Blurred Shape Model with Error Correction
2007
One of the major difficulties of handwriting recognition is the variability among symbols because of the different writer styles. In this paper we introduce the boosting of blurred shape models with error correction, which is a robust approach for describing and recognizing handwritten symbols tolerant to this variability. A symbol is described by a probability density function of blurred shape model that encodes the probability of pixel densities of image regions. Then, to learn the most distinctive features among symbol classes, boosting techniques are used to maximize the separability among the blurred shape models. Finally, the set of binary boosting classifiers is embedded in the framework of Error Correcting Output Codes (ECOC). Our approach has been evaluated in two benchmarking scenarios consisting of handwritten symbols. Compared with state-of-the-art descriptors, our method shows higher tolerance to the irregular deformations induced by handwritten strokes.
Circular Blurred Shape Model for Multiclass Symbol Recognition
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2000
In this paper, we propose a circular blurred shape model descriptor to deal with the problem of symbol detection and classification as a particular case of object recognition. The feature extraction is performed by capturing the spatial arrangement of significant object characteristics in a correlogram structure. The shape information from objects is shared among correlogram regions, where a prior blurring degree defines the level of distortion allowed in the symbol, making the descriptor tolerant to irregular deformations. Moreover, the descriptor is rotation invariant by definition. We validate the effectiveness of the proposed descriptor in both the multiclass symbol recognition and symbol detection domains. In order to perform the symbol detection, the descriptors are learned using a cascade of classifiers. In the case of multiclass categorization, the new feature space is learned using a set of binary classifiers which are embedded in an error-correcting output code design. The results over four symbol data sets show the significant improvements of the proposed descriptor compared to the state-of-the-art descriptors. In particular, the results are even more significant in those cases where the symbols suffer from elastic deformations.
Hand drawn symbol recognition by blurred shape model descriptor and a multiclass classifier
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2008
In the document analysis field, the recognition of handwriting symbols is a difficult task because of the distortions due to hand drawings and the different writer styles. In this paper, we propose the Blurred Shape Model to describe handwritten symbols, and the use of Adaboost in an Error Correcting Codes framework to deal with multi-class categorization handwriting problems. It is a robust approach tolerant to the distortions and variability typically found in handwritten documents. This approach has been evaluated with the public GREC2005 database and an architectural symbol database extracted from a sketching interface, reaching high recognition rates compared with the state-of-the-art approaches.
Aligning Bags of Shape Contexts for Blurred Shape Model Based Symbol Classification
Abstract This paper addresses the problem of shape classification and proposes a method able to exploit peculiarities of both, local and global shape descriptors. In the proposed shape classification framework, the silhouettes of symbols are firstly described through Bags of Shape Contexts. This shape signature is used to solve correspondence problem between points of two shapes.
Multi-class Binary Object Categorization Using Blurred Shape Models
Lecture Notes in Computer Science, 2008
The main difficulty in the binary object classification field lays in dealing with a high variability of symbol appearance. Rotation, partial occlusions, elastic deformations, or intra-class and inter-class variabilities are just a few problems. In this paper, we introduce a novel object description for this type of symbols. The shape of the object is aligned based on principal components to make the recognition invariant to rotation and reflection. We propose the Blurred Shape Model (BSM) to describe the binary objects. This descriptor encodes the probability of appearance of the pixels that outline the object's shape. Besides, we present the use of this descriptor in a system to improve the BSM performance and deal with binary objects multi-classification problems. Adaboost is used to train the binary classifiers, learning the BSM features that better split object classes. Then, the different binary problems learned by the Adaboost are embedded in the Error Correcting Output Codes framework (ECOC) to deal with the muti-class case. The methodology is evaluated in a wide set of object classes from the MPEG07 repository. Different state-of-the-art descriptors are compared, showing the robustness and better performance of the proposed scheme when classifying objects with high variability of appearance.
A comparative study of graphic symbol recognition methods
Multimedia Tools and Applications, 2018
From the very beginning of written scripts, contents of documents generally comprise of text, images, figures, graphs and graphic symbols. A graphic recognition system involves representation of graphic symbols, description of features extracted from the symbol and classification of the unknown symbols. Due to the wide range of symbols, no generalize technique is available that can recognize the symbol for all the application domains. this paper, we present an overview of the many models and methodologies available to symbol recognition for representation, description and classification. We provide a general survey of symbol recognition process, beginning with the basic definition of symbol, which is further classified into their types based on application areas. distinctive part of the survey is categorization of different symbol recognition methods into four categories i.e. statistical, structural, syntactical and hybrid methods, which is aimed to help potential researchers in exploring areas of research in the field of graphic symbol recognition.
Robust Symbol Recognition using a Structural Approach Mathieu Delalandre CVC (Barcelona, Spain)
In this paper we present a robust system of symbol recognition using a structural approach. Our key objective here is to provide a system, equaling the statistical ones in robustness concerning the recognition, to apply next to localization. To do it we have investigated two particular structural methods: the straight line detection using Hough Transform and the vector templates matching. Experiments done on the GREC2003 database show how their combination allows to obtain high recognition results.
Robust Symbol Recognition using a Structural Approach
In this paper we present a robust system of symbol recognition using a structural approach. Our key objective here is to provide a system, equaling the statistical ones in robustness concerning the recognition, to apply next to localization. To do it we have investigated two particular structural methods: the straight line detection using Hough Transform and the vector templates matching. Experiments done on the GREC2003 database show how their combination allows to obtain high recognition results.