# A Mean String Algorithm to Compute the Average Among a Set of 2D Shapes

1 QGAR - Querying Graphics through Analysis and Recognition
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Mots-clés :
Type de document :
Article dans une revue
Pattern Recognition Letters, Elsevier, 2002, 23 (1-3), pp.203-213
Domaine :

https://hal.inria.fr/inria-00100713
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:49:54
Dernière modification le : jeudi 11 janvier 2018 - 06:19:59

### Identifiants

• HAL Id : inria-00100713, version 1

### Citation

Gemma Sánchez, Josep Lladós, Karl Tombre. A Mean String Algorithm to Compute the Average Among a Set of 2D Shapes. Pattern Recognition Letters, Elsevier, 2002, 23 (1-3), pp.203-213. 〈inria-00100713〉

### Métriques

Consultations de la notice