An Algorithm for Finding a Common Structure Shared by a Family of Strings
IEEE Transactions on Pattern Analysis and Machine Intelligence
The String-to-String Correction Problem
Journal of the ACM (JACM)
Topology of strings: median string is NP-complete
Theoretical Computer Science
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Automatic Construction of 2D Shape Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
A mean string algorithm to compute the average among a set of 2D shapes
Pattern Recognition Letters
Median strings for k-nearest neighbour classification
Pattern Recognition Letters
Learning Shape Models from Examples Using Automatic Shape Clustering and Procrustes Analysis
IPMI '99 Proceedings of the 16th International Conference on Information Processing in Medical Imaging
Comparison of AESA and LAESA search algorithms using string and tree-edit-distances
Pattern Recognition Letters
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Towards a genetic based prototyper for character shapes
ICDAR '95 Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2
A Learning Model for Multiple-Prototype Classification of Strings
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 4 - Volume 04
A Leaf Image Retrieval Scheme Based on Partial Dynamic Time Warping and Two-Level Filtering
CIT '07 Proceedings of the 7th IEEE International Conference on Computer and Information Technology
Detection and recognition of contour parts based on shape similarity
Pattern Recognition
Mean Shape Models for Polyp Detection in CT Colonography
DICTA '08 Proceedings of the 2008 Digital Image Computing: Techniques and Applications
Contour Grouping with Partial Shape Similarity
PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
Automatic contour model creation out of polygonal CAD models for markerless Augmented Reality
ISMAR '07 Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality
Contour Regularity Extraction Based on String Edit Distance
IbPRIA '09 Proceedings of the 4th Iberian Conference on Pattern Recognition and Image Analysis
Planar-shape prototype generation using a tree-based random greedy algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.10 |
This paper describes a new method for quantifying the regularity of contours and comparing them (when encoded by Freeman chain codes) in terms of a similarity criterion which relies on information gathered from Levenshtein edit distance computation. The criterion used allows subsequences to be found from the minimal cost edit sequence that specifies an alignment of contour segments which are similar. Two external parameters adjust the similarity criterion. The information about each similar part is encoded by strings that represent an average contour region. An explanation of how to construct a prototype based on the identified regularities is also reviewed. The reliability of the prototypes is evaluated by replacing contour groups (samples) by new prototypes used as the training set in a classification task. This way, the size of the data set can be reduced without sensibly affecting its representational power for classification purposes. Experimental results show that this scheme achieves a reduction in the size of the training data set of about 80% while the classification error only increases by 0.45% in one of the three data sets studied.