Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usuall...
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
To locate a video clip in large collections is very important for retrieval applications, especially for digital rights management. In this paper, we present a novel technique for...
In recent years, there has been a rapid increase in the size and number of medical image collections. Thus, the development of appropriate methods for medical information retrieval...
Xiaoqian Xu, Dah-Jye Lee, Sameer Antani, L. Rodney...
Matching word images has many applications in document recognition and retrieval systems. Dynamic Time Warping (DTW) is popularly used to estimate the similarity between word imag...