Generalized vs set median strings for histogram-based distances: Algorithms and classification results in the image domain

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4538 LNCS, Issue , 2007, Pages 404-414

  Solnon, Christine ^a   Jolion, Jean Michel ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; HEURISTIC ALGORITHMS; STATISTICAL METHODS;

HISTOGRAM-BASED DISTANCES; IMAGE DOMAIN; SET MEDIAN STRINGS; SUBSTITUTION COSTS;

PATTERN RECOGNITION;

EID: 38149137332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72903-7_37     Document Type: Conference Paper

References (10)

1. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
2. de la Higuera, C., Casacuberta, F.: Topology of strings: Median string is np-complete. Theoretical Computer Science 230(1/2), 39-48 (2000)
3. Jiang, X., Bunke, H., Csirik, J.: Median strings: A review. In: Last, M., Kandel, A., Bunke, H. (eds) World Scientific, (eds), Data Mining in Time Series Databases, pp. 173-192 (2004)
4. Levenstein, A.: Binary codes capable of correcting deletions, insertions and reversals. Sov. Phy. Dohl. 10, 707-710 (1966)
5. Martinez-Hinarejos, C.D., Juan, A., Casacuberta, F.: Use of median string for classification. In: International Conference on Pattern Recognition, vol. 2, pp. 903-906 (2000)
6. Ros, J., Laurent, C., Jolion, J.M., Simand, I.: Comparing string representations and distances in a natural image classification task. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol. 3434, pp. 71-83. Springer, Heidelberg (2005)
7. Simand, I., Jolion, J.M.: Représentation d'images par chaÎnes de symboles: application á la recherche par le contenu. In: Presses universitaires de Louvain, editor, Actes du 20éme colloque GRETSI: Traitement du signal et des images, vol. 2, pp. 925-928 (2005)
8. Sim, J.S., Park, K.: The consensus string problem for a metric is npcomplete. Journal of Discrete Algorithms 2(1), 115-121 (2001)
9. Wagner, R.A., Fisher, M.J.: The string to string correction problem. Journal of the ACM 21(1), 168 173 (1974)
10. Wang, J.Z., Li, J., Wiederhold, G.: Simplicity: Semantics-sensitive integrated matching for picture libraries. IEEE Trans. on Pattern Analysis and Machine Intelligence 23(9), 947-963 (2001)