A fast voronoi-diagram algorithm with quaternary tree bucketing
Information Processing Letters
Group Properties of Cellular Automata and VLSI Applications
IEEE Transactions on Computers
An efficient branch-and-bound nearest neighbour classifier
Pattern Recognition Letters
Strategies for efficient incremental nearest neighbor search
Pattern Recognition
A Novel Discrete Relaxation Architecture
IEEE Transactions on Pattern Analysis and Machine Intelligence
Clustering Using a Similarity Measure Based on Shared Near Neighbors
IEEE Transactions on Computers
RBFFCA: A Hybrid Pattern Classifier Using Radial Basis Function and Fuzzy Cellular Automata
Fundamenta Informaticae - Special issue on DLT'04
An improved multiple-attractor cellular automata classifier with a tree frame based on CART
Computers & Mathematics with Applications
Hi-index | 0.00 |
A new, parallel, nearest-neighbor (NN) pattern classifier, based on a 2-D Cellular Automaton (CA) architecture, is presented in this paper. The proposed classifier is both time and space efficient, when compared with already existing NN classifiers, since it does not require complex distance calculations and ordering of distances, and storage requirements are kept minimal since each cell stores information only about its nearest neighborhood. The proposed classifier produces piece-wise linear discriminant curves between clusters of points of complex shape (nonlinearly separable) using the computational geometry concept known as the Voronoi diagram, which is established through CA evolution. These curves are established during an "off-line" operation and, thus, the subsequent classification of unknown patterns is achieved very fast. The VLSI design and implementation of a nearest neighborhood processor of the proposed 2-D CA architecture is also presented in this paper.