The deviation of a set of strings

Pattern Analysis and Applications

Volumn 6, Issue 3, 2003, Pages 224-231

  Jolion, Jean Michel ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Deviation string; Levenstein distance; Median string; Reweighted mean; Text processing; Word processing

Indexed keywords

EID: 0347592931     PISSN: 14337541     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10044-003-0190-1     Document Type: Article

References (21)

1. Jolion JM (2001) Graph matching: what are we talking about? In: Jolion JM, Kropatsch W, Vento M (eds) Proceedings of Third IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 170-175
2. Arcelli C, Cordella LP, Sanniti di Baja G (2001) 4th IAPR Int. Workshop on Visual Form. Capri, Italy. Lecture Notes in Computer Science 2059, Springer
3. Bunke H (2000) Recent developments in graph matching. Proceedings ICPR'00, Barcelona, Spain, pp 117-124
4. Massaro A, Pelillo M (2001) A linear complementarity approach to graph matching. In: Cuen I (ed) Proceedings of Third IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 160-169
5. Bunke H (1997) On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters 18:689-694
6. Jiang X, Münger A, Bunke H (2001) On median graphs: properties, algorithms, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(10):1144-1151
7. Bunke H, Jiang X, Abegglen K, Kandel A (2002) On the weighted mean of a pair of strings. Pattern Analysis and Applications 5(1):23-30
8. Bunke H, Günter S (2001) Weighted mean of a pair of graphs. Computing 67:209-224
9. Lopresti D, Zhou J (1997) Using consensus sequence voting to correct OCR errors. Computer Vision and Image Understanding 67(1):39-47
10. Lewis T, Owens R, Baddeley A (1999) Averaging feature maps. Pattern Recognition 32(9):331-339
11. Sánchez G, Lladós J, Tombre K (2002) A mean string algorithm to compute the average among a set of 2D shapes. Pattern Recognition Letters 23:203-213
12. Levenstein A (1966) Binary codes capable of correcting deletions, insertions and reversals. Sov Phy Dohl 10:707-710
13. Wagner RA, Fisher MJ (1974) The string to string correction problem. Journal of the ACM 21(1):168-173
14. Marzal A, Vidal E (1993) Computation of normalized edit distance and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence 15(9):926-932
15. de la Higuera C, Casacuberta F (2000) Topology of strings: Median string is NP-complete. Theoretical Computer Science 230(1/2):39-48
16. Sim JS, Park K (2001) The consensus string problem for a metric is NP-complete. Journal of Discrete Algorithms 2(1):115-121
17. Rousseeuw PJ, Leroy AM (1987) Robust Regression & Outlier Detection, Wiley
18. Wolf C, Jolion JM, Chassaing F (2002) Text localization, enhancement and binarization in multimedia documents. Proceedings ICPR'02, Quebec, 2:1037-1040
19. Jolion JM, Meer P, Bataouche S (1991) Robust clustering with applications in computer vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 13:791-802
20. Meer P, Mintz D, Rosenfeld A, Kim DY (1991) Robust regression methods for computer vision: a review. International Journal of Computer Vision 6(1):59-70
21. Jolion JM (2003) Some experiments on clustering a set of strings. 4th IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, York, UK, Lecture Notes on Computer Sciences, 2726, Springer Verlag, 214-224