Sciweavers

1689 search results - page 172 / 338
» Proximate point searching
Sort
View
ECCV
2008
Springer
16 years 8 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
16 years 8 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
ICIP
2006
IEEE
16 years 8 months ago
Optimum Watermark Design by Vector Space Projections
We introduce an optimum watermark embedding technique that satisfies common watermarking requirements such as visual fidelity, sufficient embedding rate, robustness against noise ...
Oktay Altun, Gaurav Sharma, Mark F. Bocko
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
16 years 7 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik
ICPR
2008
IEEE
16 years 7 months ago
Bilateral symmetry of object silhouettes under perspective projection
Symmetry is an important property of objects and is exhibited in different forms e.g., bilateral, rotational, etc. This paper presents an algorithm for computing the bilateral sym...
Cornelia Fermüller, Hyoungjune Yi, Konstantin...