A VLSI Systolic Architecture for Pattern Clustering

Cluster analysis is a valuable tool in exploratory pattern analysis, especially when very little prior information about the data is available. In unsupervised pattern recognition and image segmentation applications, clustering techniques play an important role. The squared-error clustering technique is the most popular one among different clustering techniques. Due to the iterative nature of the squared-error clustering, it demands substantial CPU time, even for modest numbers of patterns. Recent advances in VLSI microelectronic technology triggered the idea of implementing the squared-error clustering directly in hardware. A two-level pipelined systolic pattern clustering array is proposed in this paper. The memory storage and access schemes are designed to enable a rhythmic data flow between processing units. Each processing unit is pipelined to further enhance the system performance. The total processing time for each pass of pattern labeling and cluster center updating is essentially dominated by the time required to fetch the pattern matrix once. Detailed architectural configuration, system performance evaluation, and simulation experiments are presented. The modularity and the regularity of the system architecture make it suited for VLSI implementations.

[1]  Paul Budnik,et al.  The Organization and Use of Parallel Memories , 1971, IEEE Transactions on Computers.

[2]  Kai Hwang,et al.  Partitioned Matrix Algorithms for VLSI Arithmetic Systems , 1982, IEEE Transactions on Computers.

[3]  Kai Hwang,et al.  Vector Computer Architecture and Processing Techniques , 1981, Adv. Comput..

[4]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

[5]  H. T. Kung,et al.  A Two-Level Pipelined Systolic Array for Convolutions , 1981 .

[6]  King-sun Fu,et al.  Stochastic Error-Correcting Syntax Analysis for Recognition of Noisy Patterns , 1977, IEEE Transactions on Computers.

[7]  G.B. Coleman,et al.  Image segmentation by clustering , 1979, Proceedings of the IEEE.

[8]  Kai Hwang,et al.  Integrated Computer Architectures for Image Processing and Database Management , 1983, Computer.

[9]  Bryan D. Ackland,et al.  An integrated multiprocessing array for time warp pattern matching , 1981, ISCA '81.

[10]  George C. Stockman,et al.  Matching Images to Models for Registration and Object Detection via Clustering , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Gautam Biswas,et al.  Evaluation of Projection Algorithms , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  H. T. Kung Why systolic architectures? , 1982, Computer.

[13]  Anil K. Jain,et al.  Clustering Methodologies in Exploratory Data Analysis , 1980, Adv. Comput..

[14]  Bryan D. Ackland,et al.  Dynamic Time Warp Pattern Matching Using an Integrated Multiprocessing Array , 1983, IEEE Transactions on Computers.

[15]  D. Michieand,et al.  TheOrganization andUseofParallel Memories , 1971 .

[16]  Leslie C. Morey,et al.  11 Cluster analysis software , 1982, Classification, Pattern Recognition and Reduction of Dimensionality.

[17]  Jack Bryant,et al.  On the clustering of multidimensional pictorial data , 1979, Pattern Recognit..

[18]  Kai Hwang,et al.  Pipelined Evaluation of First-Order Recurrence Systems , 1983, ICPP.

[19]  Anil K. Jain,et al.  Clustering techniques: The user's dilemma , 1976, Pattern Recognit..

[20]  Kai Hwang,et al.  Vector reduction methods for arithmetic pipelines , 1983, 1983 IEEE 6th Symposium on Computer Arithmetic (ARITH).

[21]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .