Sciweavers

2601 search results - page 128 / 521
» A Point in Many Triangles
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
ICIP
2003
IEEE
16 years 8 months ago
Image features that draw fixations
The ability to automatically detect `visually interesting' regions in an image has many practical applications especially in the design of active machine vision systems. This...
Umesh Rajashekar, Lawrence K. Cormack, Alan C. Bov...
ICIP
2000
IEEE
16 years 8 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
16 years 7 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
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