Sciweavers

5 search results - page 1 / 1
» Adaptive approximate nearest neighbor search for fractal ima...
Sort
View
TIP
2002
116views more  TIP 2002»
13 years 4 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong
DCC
1995
IEEE
13 years 8 months ago
Accelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
Dietmar Saupe
ICIP
2007
IEEE
13 years 11 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
14 years 5 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
CORR
2008
Springer
167views Education» more  CORR 2008»
13 years 5 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud