论文信息 - UAEMex at ImageCLEF 2016: Handwritten Retrieval

UAEMex at ImageCLEF 2016: Handwritten Retrieval

This paper describes the participation of the (UAEMex) at the ImageCLEF 2016 Handwritten Scanned Document Retrieval Task. We propose to use a skip-character text search method based on Longest Common Subsequence. Our system split all characters in query to find all Longest Common Subsequence in one line of text.

Yulia Ledeneva | René Arnulfo García-Hernández | Miguel Ángel García Calderón

[1] Costas S. Iliopoulos,et al. Algorithms for computing variants of the longest common subsequence problem , 2008, Theor. Comput. Sci..

[2] Alejandro Héctor Toselli,et al. Overview of the ImageCLEF 2016 Handwritten Scanned Document Retrieval Task , 2016, CLEF.

[3] Mi Lu,et al. An optimal algorithm for the longest common subsequence problem , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[4] Emmanuel Dellandréa,et al. General Overview of ImageCLEF at the CLEF 2016 Labs , 2016, CLEF.