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

被引:24
作者
An, Fengwei [1 ]
Mattausch, Hans Juergen [1 ]
机构
[1] Hiroshima Univ, Res Inst Nanodevice & Bio Syst, Higashihiroshima 724, Japan
关键词
Hardware/software co-design; K-means clustering algorithm; Nearest neighbor searching; Handwritten digit recognition; Face recognition; Image segmentation; ASSOCIATIVE-MEMORY; ARCHITECTURE; RECOGNITION; HARDWARE; SEARCH;
D O I
10.1016/j.sysarc.2012.11.004
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we report a hardware/software (MW/SW) co-designed K-means clustering algorithm with high flexibility and high performance for machine learning, pattern recognition and multimedia applications. The contributions of this work can be attributed to two aspects. The first is the hardware architecture for nearest neighbor searching, which is used to overcome the main computational cost of a K-means clustering algorithm. The second aspect is the high flexibility for different applications which comes from not only the software but also the hardware. High flexibility with respect to the number of training data samples, the dimensionality of each sample vector, the number of clusters, and the target application, is one of the major shortcomings of dedicated hardware implementations for the K-means algorithm. In particular, the HW/SW K-means algorithm is extendable to embedded systems and mobile devices. We benchmark our multi-purpose K-means system against the application of handwritten digit recognition, face recognition and image segmentation to demonstrate its excellent performance, high flexibility, fast clustering speed, short recognition time, good recognition rate and versatile functionality. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:155 / 164
页数:10
相关论文
共 35 条
  • [1] Mixed digital-analog associative memory enabling fully-parallel nearest Euclidean distance search
    Abedin, Md. Anwarul
    Tanaka, Yuki
    Ahmadi, Ali
    Koide, Tetsushi
    Mattausch, Hans Juergen
    [J]. JAPANESE JOURNAL OF APPLIED PHYSICS PART 1-REGULAR PAPERS BRIEF COMMUNICATIONS & REVIEW PAPERS, 2007, 46 (4B): : 2231 - 2237
  • [2] A digital architecture for support vector machines: Theory, algorithm, and FPGA implementation
    Anguita, D
    Boni, A
    Ridella, S
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 2003, 14 (05): : 993 - 1009
  • [3] Bai H., 2009, 2009 WRI WORLD C COM, P650
  • [4] Boni A. Zorat, 2006, NEURAL NETWORKS, V14, P993
  • [5] HUMAN AND MACHINE RECOGNITION OF FACES - A SURVEY
    CHELLAPPA, R
    WILSON, CL
    SIROHEY, S
    [J]. PROCEEDINGS OF THE IEEE, 1995, 83 (05) : 705 - 740
  • [6] Flexible Hardware Architecture of Hierarchical K-Means Clustering for Large Cluster Number
    Chen, Tse-Wei
    Chien, Shao-Yi
    [J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2011, 19 (08) : 1336 - 1345
  • [7] NEAREST NEIGHBOR PATTERN CLASSIFICATION
    COVER, TM
    HART, PE
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) : 21 - +
  • [8] Histograms of oriented gradients for human detection
    Dalal, N
    Triggs, B
    [J]. 2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, : 886 - 893
  • [9] Eickeler S., 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348), P672, DOI 10.1109/ICIP.1999.821721
  • [10] High-speed face recognition based on discrete cosine transform and RBF neural networks
    Er, MJ
    Chen, WL
    Wu, SQ
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 2005, 16 (03): : 679 - 691