Large-scale parallel data clustering
- 1 January 1996
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4 (10514651) , 488-493 vol.4
- https://doi.org/10.1109/icpr.1996.547613
Abstract
Algorithmic enhancements are described that allow large reduction (for some data sets, over 95 percent) in the number of floating point operations in mean square error data clustering. These improvements are incorporated into a parallel data clustering tool, P-CLUSTER, developed in an earlier study. Experiments on segmenting standard texture images show that the proposed enhancements enable clustering of an entire 512/spl times/512 image at approximately the same computational cost as that of previous methods applied to only 5 percent of the image pixels.Keywords
This publication has 6 references indexed in Scilit:
- Parallel implementation of vision algorithms on workstation clustersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Lossless acceleration for correlation-based nearest-neighbor pattern recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Text segmentation using gabor filters for automatic document processingMachine Vision and Applications, 1992
- Unsupervised texture segmentation using Gabor filtersPattern Recognition, 1991
- A Branch and Bound Algorithm for Computing k-Nearest NeighborsIEEE Transactions on Computers, 1975
- On Some Invariant Criteria for Grouping DataJournal of the American Statistical Association, 1967