Dynamic computation of generalised median strings

Pattern Analysis and Applications

Volumn 6, Issue 3, 2003, Pages 185-193

  Jiang, Xiaoyi ^a   Abegglen, Karin ^b   Bunke, Horst ^b   Csirik, Janos ^c  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF BERN   (Switzerland)

^c UNIVERSITY OF SZEGED   (Hungary)

Author keywords

Levenshtein distance; Median shape; Median string; Online algorithm

Indexed keywords

EID: 0346331966     PISSN: 14337541     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10044-002-0184-4     Document Type: Article

References (38)

1. Lewis T, Owens R, Baddeley A. Averaging feature maps. Pattern Recognition 1999; 32(9): 1615-1630
2. Gramkow C. On averaging rotations. International Journal Computer Vision 2001; 42(1/2): 7-16
3. Zhuang H, Roth ZS, Sudhakar R. Practical fusion algorithms for rotation matrices: a comparative study. Journal of Robotic Systems 1992; 9(7): 915-931
4. Pennec X and Ayache N. Uniform distribution, distance and expectation problems for geometric features processing. Journal of Mathematical Imaging and Vision 1998; 9(1): 49-67
5. Guimond A, Meunier J, Thirion JP. Average brain models: a convergence study. Computer Vision and Image Understanding 2000; 77(2): 192-210
6. Subramanyan K and Dean D. A procedure to average 3D anatomical structures. Medical Image Analysis 2000; 4(4): 317-334
7. O'Toole AJ, Price T, Vetter T, Barlett JC, Blanz V. 3D shape and 2D surface textures of human faces: The role of 'averages' in attractiveness and age. Image & Vision Computing 1999; 18(1): 9-19
8. Jiang X, Schiffmann L, Bunke H. Computation of median shapes. Proceedings 4th Asian conference on computer vision, Taipai 2000, pp 300-305
9. Sanchez G, Llados J, Tombre K. A mean string algorithm to compute the average among a set of 2D shapes. Pattern Recognition Letters 2002; 23(1-3): 203-213
10. Casacuberta F, and de Antoni MD. A greedy algorithm for computing approximate median strings. In Proceedings national symposium on pattern recognition and image analysis, Barcelona, Spain 1997, pp 193-198
11. Jiang X, Abegglen K, Bunke H. Genetic computation of generalised median strings, 2001 (submitted)
12. Kohonen T. Median strings. Pattern Recognition Letters 1985; 3: 309-313
13. Kruskal JB. An overview of sequence comparison. In: Sankoff D and Kruskal JB (eds), Time warps, string edits, and macromolecules: the theory and practice of sequence comparison, 2nd ed. CSLI Publications 1999, pp 1-44
14. Kruzslicz F. Improved greedy algorithm for computing approximate median strings. Acta Cybernetica 1999; 14: 331-339
15. Lopresti D and Zhou J. Using consensus sequence voting to correct OCR errors. Computer Vision and Image Understanding 1997; 67(1): 39-47
16. Martinez-Hinarejos CD, Juan A, Casacuberta F. Use of median string for classification. In Proceedings international conference on pattern recognition 2000, pp 907-910
17. de la Higuera C and Casacuberta F. Topology of strings: Median string is NP-complete. Theoretical Computer Science 2000; 230(1/2): 39-48
18. Sim JS Park K. The consensus string problem for a metric is NP-complete. Journal of Discrete Algorithms 2001; 2(1)
19. Borodin EY. Online computation and competitive analysis. Cambridge University Press, 1998
20. Astola J, Haavisto P, Neuvo Y. Vector median filters, Proceedings IEEE 1990; 78(4): 678-689
21. Bartolini F, Cappellini V, Colombo C, Mecocci A. Enhancement of local optical flow techniques. In Proceedings 4th international workshop on time varying image processing and moving object recognition, Florence, Italy, 1993
22. Jiang X, Münger A, Bunke H. On median graphs: Properties, algorithms and applications. IEEE Transactions PAMI 2001; 23(10): 1144-1151
23. Bunke H and Bühler U. Applications of approximate string matching to 2D shape recognition. Pattern Recognition 1993; 26(12): 1797-1812
24. Fu KS and Lu SY. A clustering procedure for syntactic patterns. IEEE Transactions SMC 1977; 7: 734-742
25. Wang YP and Pavlidis T. Optimal correspondences of string subsequences. IEEE Transactions PAMI 1990; 12(11): 1080-1087
26. Rice SV, Kanai J, Narker TA. An algorithm for matching OCR-generated text string. In: Bunke H, Wang P, Baird H (eds), Document image analysis. World Scientific 1994, pp 263-272
27. Gusfield D. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, 1997
28. Sankoff D and Kruskal JB (eds). Time warps, string edits, and macromolecules: the theory and practice of sequence comparison, CSLI Publications 1999
29. Marzal A and Vidai E. Computation of normalized edit distance and applications. IEEE Transactions PAMI 1993; 15(9): 926-932
30. Fred ALN and Leitão JMN. A comparative study of string dissimilarity measures in structural clustering. In Proceedings international conference on advances in pattern recognition (ICAPR'98), Springer 1998, pp 385-393
31. Juan A and Vidai E. Fast median search in metric spaces. In: Amin A and Dori D (eds), Advances in pattern recognition. Springer-Verlag 1998, pp 905-912
32. Mico L and Oncina J. An approximate median search algorithm in non-metric spaces. Pattern Recognition Letters 2001; 22(10): 1145-1151
33. Marti V and Bunke H. Use of positional information in sequence alignment for multiple classifier combination, in: Kittler J and Roli F (eds), Multiple classifier combination. Springer-Verlag 2001, pp 388-398
34. Bunke H and Günter S. Weighted mean of a pair of graphs. Computing 2001; 67: 209-224
35. Bunke H, Jiang X, Abegglen K, Kandel A. On the weighted mean of a pair of strings, Pattern Analysis and Applications 2002; 5(1): 23-30
36. Wagner RA and Fischer MJ. The string-to-string correction problem, Journal of the ACM 1974; 21(1): 168-173
37. Jain AK, Murty MN, Flynn PJ. Data clustering: a review. ACM Computing Surveys 1999; 31(3): 264-323
38. Guyon I, Schomaker L, Plamondon R, Liberman M and Janet S. UNIPEN project on on-line exchange and recognizer benchmarks. Proceedings 12th international conference on pattern recognition 1994, pp 29-33