Please use this identifier to cite or link to this item: http://dspace.unimap.edu.my:80/xmlui/handle/123456789/10211
Title: Principle component analysis (PCA) based coin-counting system
Authors: Mohd. Syafarudy, Abu
Lim, Eng Aik
syafarudy@unimap.edu.my
Keywords: Rapid descriptor (RD)
Neural network
Recognition performance
Network sizes and training time for networks
Regional Conference on Applied and Engineering Mathematics (RCAEM)
Issue Date: 2-Jun-2010
Publisher: Universiti Malaysia Perlis (UniMAP)
Citation: Vol.1(16), p.105-108
Series/Report no.: Proceedings of the 1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010
Abstract: In this paper, a neural network using a feature extraction scheme known as principle component analysis (PCA) is proposed to recognize two-dimensional objects in an image. This approach consists of two stages. First, the procedures of determining the coefficients of rapid descriptor (RD) of 2-D objects from their boundary are described. To speed up the learning process of the neural network, a PCA technique is used to extract the principal components of these RD coefficients. Then, these reduced components are utilized to train a feed-forward neural network for object recognition and classification. We compare recognition performance, network sizes, and training time for networks trained with both reduced and unreduced data. The experimental results show that a significant reduction in training time can be achieved without a sacrifice in classifier accuracy.
Description: 1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 organized by Universiti Malaysia Perlis (UniMAP) and co-organized by Universiti Sains Malaysia (USM) & Universiti Kebangsaan Malaysia (UKM), 2nd - 3rd June 2010 at Eastern & Oriental Hotel, Penang.
URI: http://dspace.unimap.edu.my/123456789/10211
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
Paper ID R055.pdf184.9 kBAdobe PDFView/Open


Items in UniMAP Library Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.