On the weighted mean of a pair of strings

Pattern Analysis and Applications

Volumn 5, Issue 1, 2002, Pages 23-30

  Bunke, Horst ^a   Jiang, Xiaoyi ^a   Abegglen, Karin ^a   Kandel, Abraham ^b  

^a UNIVERSITY OF BERN   (Switzerland)

^b University of South Florida   (United States)

Author keywords

Generalised median string; Self organising feature map; String edit distance; String matching; Weighted mean string

Indexed keywords

EID: 0036014754     PISSN: 14337541     EISSN: None     Source Type: Journal    
DOI: 10.1007/s100440200003     Document Type: Article

References (17)

1. Wagner R, Fischer M. The string-to-string correction problem. Journal of the ACM 1974; 21(1): 168-173
2. Bunke H, Bühler U. Applications of approximate string matching to 2D shape rcognition. Pattern Recognition 1993; 26(12): 1797-1812
3. Marzal A, Vidal E. Computation of normalised edit distance and applications. IEEE Trans Pattern Analysis and Machine Intelligence 1993; 15: 926-932
4. Chen SW, Tung ST, Fang CY, Cherng S, Jain A. Extended attributed string matching for shape recognition. Computer Visior & Image Understanding 1998; 70(1): 36-50
5. Bunke H, Zumbühl M. Acquisition of 2D shape models from scenes with overlapping objects using string matching. Pattern Analysis and Applications 1999; 2(1): 2-9
6. Llados J, Bunke H, Marti E. Finding rotational symmetries by cyclic string matching. Pattern Recognition Letters 1997; 18(14)
7. Lopresti D, Zhou J. Using consensus sequence voting to correct OCR errors. Computer Vision & Image Understanding 1997; 67(1): 39-47
8. Kohoren I. Median strings. Pattern Recognition Letters 1985; 3: 309-313
9. Casacuberta F, de Antonio MD. A greedy algorithm for computing approximate median strings. Proc of National Symposium on Pattern Recognition and Image Analysis, Barcelona, Spain, 1997; 193-198
10. Kruzslicz F. Improved greedy algorithm for computing approximate median strings. Acta Cybernetica 1999; 14: 331-339
11. Jiang X, Schiftmann L, Bunke H. Computation of median shapes. Proc 4th Asian Conference on Computer Vision, Taipei, Taiwan. 2000; 300-305
12. Martinez-Hinarejos C, Juan A, Casacuberta F. Use of median string for classification. Proc 15th Int Conf on Pattern Recognition, Barcelona, Spain, 2000; 2: 907-910
13. Bunke H, Münger A, Jiang X. Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem. Pattern Recognition Letters 1999; 20: 1271-1277
14. Alpaydin E, Alimoglu F. Pen based recognition of handwritten digits. Department of Computer Engineering, Bogazici University, Istanbul Turkey, ftp://ftp.ics.uci.edu/pub/machine-learning-database/pendigits/
15. Guyon I, Schomaker L, Plamondon R, Liberman M, Janet S. UNIPEN project of on-line data exchange and recognizer benchmarks. Proc 12th Int Conf on Pattern Recognition, Jerusalem, Israel, 1994; 29-33
16. Kohonen T. Self-Organization and Associative Memory (2nd Ed.). Springer-Verlag, 1988
17. Kohonen T, Someruno P. Self-organizing maps of symbol strings. Neurocomputing 1998; 21: 21-30