Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 625-631 |
| Number of pages | 7 |
| Journal | Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an |
| Volume | 21 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 1998 Jan 1 |
Fingerprint
Keywords
- Competitive Learning
- Neural Networks
- Wavelet Transform
ASJC Scopus subject areas
- Engineering(all)
Cite this
A fast and efficient competitive learning design algorithm based on weight vector training in transform domain. / Hwang, Wen-Jyi; Zeng, Yi Chong; Liao, Shi Chiang.
In: Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an, Vol. 21, No. 5, 01.01.1998, p. 625-631.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A fast and efficient competitive learning design algorithm based on weight vector training in transform domain
AU - Hwang, Wen-Jyi
AU - Zeng, Yi Chong
AU - Liao, Shi Chiang
PY - 1998/1/1
Y1 - 1998/1/1
N2 - 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.
AB - 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.
KW - Competitive Learning
KW - Neural Networks
KW - Wavelet Transform
UR - http://www.scopus.com/inward/record.url?scp=0032166635&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032166635&partnerID=8YFLogxK
U2 - 10.1080/02533839.1998.9670424
DO - 10.1080/02533839.1998.9670424
M3 - Article
AN - SCOPUS:0032166635
VL - 21
SP - 625
EP - 631
JO - Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers
JF - Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers
SN - 0253-3839
IS - 5
ER -