Sciweavers

45 search results - page 3 / 9
» Dynamic similarity search in multi-metric spaces
Sort
View
SEBD
1997
158views Database» more  SEBD 1997»
13 years 7 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 7 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
ICVGIP
2004
13 years 7 months ago
Searching in Document Images
Searching in scanned documents is an important problem in Digital Libraries. If OCRs are not available, the scanned images are inaccessible. In this paper, we demonstrate a search...
C. V. Jawahar, Million Meshesha, A. Balasubramania...
ICDAR
2011
IEEE
12 years 5 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
CVPR
2011
IEEE
12 years 9 months ago
Space-Time Super-Resolution from a Single Video
Spatial Super Resolution (SR) aims to recover fine image details, smaller than a pixel size. Temporal SR aims to recover rapid dynamic events that occur faster than the video fra...
Oded Shahar, Alon Faktor, Michal Irani