This paper presents a new competitive learning (CL) algorithm which performs the training in the wavelet domain. In the algorithm, the winning neural units during the training process are identified using the partial distance search (PDS) technique so that little multiplication is required. The PDS can be performed over the lower resolution representation of codewords in the wavelet transform domain to further reduce the computation time required for training. Simulation results show that, at the expense of a possible slight decrease in performance, the algorithm requires less than 5% of the computational time required by the traditional CL algorithm in many cases.
|頁（從 - 到）||625-631|
|期刊||Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an|
|出版狀態||已發佈 - 1998 一月 1|
ASJC Scopus subject areas