Sciweavers

ACCV
2007
Springer
14 years 2 months ago
Efficient Search in Document Image Collections
This paper presents an efficient indexing and retrieval scheme for searching in document image databases. In many non-European languages, optical character recognizers are not very...
Anand Kumar 0002, C. V. Jawahar, R. Manmatha
DAS
2010
Springer
14 years 2 months ago
Nearest neighbor based collection OCR
Conventional optical character recognition (OCR) systems operate on individual characters and words, and do not normally exploit document or collection context. We describe a Coll...
K. Pramod Sankar, C. V. Jawahar, Raghavan Manmatha
PODS
1997
ACM
182views Database» more  PODS 1997»
14 years 3 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
14 years 3 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
FOCS
1999
IEEE
14 years 3 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
ICDT
2001
ACM
116views Database» more  ICDT 2001»
14 years 3 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
EDBT
2009
ACM
172views Database» more  EDBT 2009»
14 years 3 months ago
Continuous visible nearest neighbor queries
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query li...
Yunjun Gao, Baihua Zheng, Wang-Chien Lee, Gencai C...
MDM
2010
Springer
152views Communications» more  MDM 2010»
14 years 3 months ago
Finding One-Of Probably Nearest Neighbors with Minimum Location Updates
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
Mitzi McCarthy, Xiaoyang Sean Wang, Zhen He
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
14 years 4 months ago
HPAT Indexing for Fast Object/Scene Recognition Based on Local Appearance
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
Hao Shao, Tomás Svoboda, Tinne Tuytelaars, ...
3DIM
2003
IEEE
14 years 4 months ago
Effective Nearest Neighbor Search for Aligning and Merging Range Images
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...
Ryusuke Sagawa, Tomohito Masuda, Katsushi Ikeuchi