Flexible Hardware Architecture of Hierarchical K-Means Clustering for Large Cluster Number

Authors:
Tse-Wei Chen; Shao-Yi Chien
Affiliations:
Grad. Inst. of Electron. Eng. & Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan;-
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
2011

Citing 0
Cited 3

K-means clustering algorithm for multimedia applications with flexible HW/SW co-design

Journal of Systems Architecture: the EUROMICRO Journal
An analog on-line-learning K-means processor employing fully parallel self-converging circuitry

Analog Integrated Circuits and Signal Processing
Visual vocabulary processor based on binary tree architecture for real-time object recognition in full-HD resolution

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

K-Means is an important clustering algorithm that is widely applied to different applications, including color clustering and image segmentation. To handle large cluster numbers in embedded systems, a hardware architecture of hierarchical K-Means (HK-Means) is proposed to support a maximum cluster number of 1024. It adopts 10 processing elements for the Euclidean distance computations and the level-order binary-tree traversal. Besides, a hierarchical memory structure is integrated to offer a maximum bandwidth of 1280 bit/cycle to processing elements. The experiments show that applications such as video segmentation and color quantization can be implemented based on the proposed HK-Means hardware. Moreover, the gate count of the hardware is 414 K, and the maximum frequency achieves 333 MHz. It supports the highest cluster number and has the most flexible specifications among our works and related works.