Sciweavers

58 search results - page 4 / 12
» Fast Density Codes for Image Data
Sort
View
3DPVT
2006
IEEE
183views Visualization» more  3DPVT 2006»
13 years 10 months ago
A CSC Based Classification Method for CT Bone Images
The CSC (color structure code) is a robust and fast two dimensional segmentation method which has been already generalized to three dimensional images. As the CSC does not need an...
Patrick Sturm, Lutz Priese, Haojun Wang
AAAI
2012
11 years 9 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
GRAPHITE
2006
ACM
14 years 1 months ago
Two-stage compression for fast volume rendering of time-varying scalar data
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
Daisuke Nagayasu, Fumihiko Ino, Kenichi Hagihara
CORR
2008
Springer
167views Education» more  CORR 2008»
13 years 7 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
ACCV
2009
Springer
14 years 1 months ago
Evolving Mean Shift with Adaptive Bandwidth: A Fast and Noise Robust Approach
Abstract. This paper presents a novel nonparametric clustering algorithm called evolving mean shift (EMS) algorithm. The algorithm iteratively shrinks a dataset and generates well ...
Qi Zhao, Zhi Yang, Hai Tao, Wentai Liu