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

Pattern Recognition Letters

Volumn 23, Issue 1-3, 2002, Pages 203-213

  Sánchez, Gemma ^a,b   Lladós, Josep ^a   Tombre, Karl ^b  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^b LORIA   (France)

Author keywords

2D shapes; Mean shape; Mean string; Median string; String edit distance

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); GRAPHIC METHODS; MAPPING;

MEAN SHAPES;

PATTERN RECOGNITION;

ALGORITHM; PATTERN RECOGNITION;

EID: 0036132205     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(01)00122-2     Document Type: Article

References (20)

1. Applications of approximate string matching to 2d shape recognition
2. Mean and maximum common subgraph of two graphs
3. Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem
4. Active shape models - Their training and application
5. Topology of strings: Median string is NP-complete
6. Design of an integrated environment for the automated analysis of architectural drawings
7. A complete system for analysis of architectural drawings
8. Synthesis of representative graphical symbols by computing generalized median graph
9. Median strings
10. An overview of sequence comparison: Time warps, string edits, and macromolecules
11. A string-based method to recognize symbols and structural textures in architectural plans
12. Using consensus sequence voting to correct ocr errors
13. On a cyclic string-to-string correction problem
14. Use of median string for classification
15. Speeding up the computation of the edit distance for cyclic strings
16. Attributed string matching with merging for shape recognition
17. Model-guided attributed string matching by split-and-merge for shape recognition
18. Learning visual models from shape contours using multiscale convex/concave structure matching
19. The string-to-string correction problem