A mean string algorithm to compute the average among a set of 2D shapes

Authors:
Gemma Sánchez;Josep Lladós;Karl Tombre
Affiliations:
Computer Vision Center, Dept. Informètica, Edifici O, Universitat Autònoma de Barcelona, 08193 Bellaterra (Barcelona), Spain;Computer Vision Center, Dept. Informètica, Edifici O, Universitat Autònoma de Barcelona, 08193 Bellaterra (Barcelona), Spain;Loria, Campus scientifique, B.P. 239, 54506, Vandæuvre-lès-Nancy Cedex, France
Venue:
Pattern Recognition Letters
Year:
2002

Citing 8
Cited 4

On a cyclic string-to-string correction problem

Information Processing Letters
Active shape models—their training and application

Computer Vision and Image Understanding
The String-to-String Correction Problem

Journal of the ACM (JACM)
Topology of strings: median string is NP-complete

Theoretical Computer Science
Combinatorial search versus genetic algorithms: a case study based on the generalized median graph problem

Pattern Recognition Letters - Special issue on pattern recognition in practice VI
Mean and maximum common subgraph of two graphs

Pattern Recognition Letters
Learning Visual Models from Shape Contours Using Multiscale Convex/Concave Structure Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
A String Based Method to Recognize Symbols and Structural Textures in Architectural Plans

GREC '97 Selected Papers from the Second International Workshop on Graphics Recognition, Algorithms and Systems

An Error-Correction Graph Grammar to Recognize Texture Symbols

GREC '01 Selected Papers from the Fourth International Workshop on Graphics Recognition Algorithms and Applications
Some experiments on clustering a set of strings

GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Characterization of contour regularities based on the Levenshtein edit distance

Pattern Recognition Letters
An improved fast edit approach for two-string approximated mean computation applied to OCR

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

An algorithm to compute the mean shape, when the shape is represented by a string, is presented as a modification of the well-known string edit algorithm. Given N strings of symbols, a string edit sequence defines a mapping between their corresponding symbols. We transform these sets of mapped symbols (edges) into piecewise linear functions and we compute their mean. To transform them into functions, we use the equation of the line defining their edges, and the percentage of their length, in order to have a common parameterization. The algorithm has been experimentally tested in the computation of a representative among a class of shapes in a clustering procedure in the domain of a graphics recognition application.