Please use this identifier to cite or link to this item:
Title: Pattern classification using a linear associative memory
Authors: Eichmann, George 
Kasparis, Takis 
Keywords: Pattern recognition;Classification;Information retrieval;Image processing
Category: Electrical Engineering - Electronic Engineering - Information Engineering
Field: Engineering and Technology
Issue Date: 5-Jan-1989
Publisher: Pergamon
Source: Pattern Recognition, 1989, vol. 22, no. 6, pp. 733-740
Journal: Pattern recognition 
Abstract: Pattern classification is a very important image processing task. A typical pattern classification algorithm can be broken into two parts; first, the pattern features are extracted and, second, these features are compared with a stored set of reference features until a match is found. In the second part, usually one of the several clustering algorithms or similarity measures is applied. In this paper, a new application of linear associative memory (LAM) to pattern classification problems is introduced. Here, the clustering algorithms or similarity measures are replaced by a LAM matrix multiplication. With a LAM, the reference features need not be separately stored. Since the second part of most classification algorithms is similar, a LAM standardizes the many clustering algorithms and also allows for a standard digital hardware implementation. Computer simulations on regular textures using a feature extraction algorithm achieved a high percentage of successful classification. In addition, this classification is independent of topological transformations.
ISSN: 0031-3203
DOI: 10.1016/0031-3203(89)90009-5
Type: Article
Appears in Collections:Άρθρα/Articles

Files in This Item:
File Description SizeFormat
pattern classification using a linear.pdf633.91 kBAdobe PDFView/Open
Show full item record

Citations 50

checked on Feb 13, 2018

Citations 50

checked on Aug 21, 2019

Page view(s) 50

Last Week
Last month
checked on Aug 22, 2019

Download(s) 50

checked on Aug 22, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.