An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Multidimensional divide-and-conquer
Communications of the ACM
Clustering Algorithms
Color image quantization for frame buffer display
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Color quantization by dynamic programming and principal analysis
ACM Transactions on Graphics (TOG)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Experimental results of randomized clustering algorithm
Proceedings of the twelfth annual symposium on Computational geometry
Application of an effective geometric clustering method to the color quantization problem
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Realistic modeling and rendering of plant ecosystems
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Dynamic Color Quantization of Video Sequences
IEEE Transactions on Visualization and Computer Graphics
DWT-based scene-adaptive color quantization
Real-Time Imaging - Special issue on multi-dimensional image processing
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
Color quantization of digital images
PCM'05 Proceedings of the 6th Pacific-Rim conference on Advances in Multimedia Information Processing - Volume Part II
Survey of Clustering: Algorithms and Applications
International Journal of Information Retrieval Research
| Hi-index | 0.00 |
A new divisive algorithm for multidimensional data clustering is suggested. Based on the minimization of the sum-of-squared-errors, the proposed method produces much smaller quantization errors than the median-cut and mean-split algorithms. It is also observed that the solutions obtained from our algorithm are close to the local optimal ones derived by the k-means iterative procedure.