Sciweavers

1013 search results - page 136 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
DICTA
2003
13 years 10 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
ICIP
2000
IEEE
14 years 10 months ago
Registration of Digital Ophthalmic Images Using Vector Mapping
This paper outlines a technique for the automated alignment of digital images of the retina under the assumption that they differ spatially by a geometric global transform. This a...
Neil Ryan, Conor Heneghan, M. Cahill
SIGMOD
1997
ACM
172views Database» more  SIGMOD 1997»
14 years 1 months ago
An Array-Based Algorithm for Simultaneous Multidimensional Aggregates
Computing multiple related group-bys and aggregates is one of the core operations of On-Line Analytical Processing (OLAP) applications. Recently, Gray et al. [GBLP95] proposed the...
Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton
CVPR
2006
IEEE
14 years 11 months ago
Unsupervised Learning of Categories from Sets of Partially Matching Image Features
We present a method to automatically learn object categories from unlabeled images. Each image is represented by an unordered set of local features, and all sets are embedded into...
Kristen Grauman, Trevor Darrell
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 9 months ago
The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
Albert Fannjiang