Competitive learning vector quantization with evolution strategies for image compression

2005 ◽  
Vol 44 (2) ◽  
pp. 027006 ◽  
Author(s):  
Ezzatollah Salari
2008 ◽  
Vol 178 (20) ◽  
pp. 3895-3907 ◽  
Author(s):  
George E. Tsekouras ◽  
Mamalis Antonios ◽  
Christos Anagnostopoulos ◽  
Damianos Gavalas ◽  
Dafne Economou

2013 ◽  
Vol 43 (6) ◽  
pp. 1288-1303
Author(s):  
Luis A. Salomón ◽  
Jean-Claude Fort ◽  
Li-Vang Lozada-Chang

Author(s):  
Noritaka Shigei ◽  
◽  
Hiromi Miyajima ◽  
Michiharu Maeda ◽  

Adaptive Vector Quantization (AVQ) is to find a small set of weight vectors that well approximates a larger set of input vectors. This paper presents a fast AVQ method Competitive Learning with Approximate Neuron-Insertion (CLANI). Though neuron-insertion techniques can much enhance the accuracy in AVQ, a naive implementation requires a large computational cost proportional to the number of input vectors. Approximate neuron-insertion has an advantage that its computational cost is independent of the number of input vectors. We theoretically estimate the computational costs of CLANI and the other conventional methods. The effectiveness of CLANI is demonstrated in vector quantization simulations and an image compression application.


Sign in / Sign up

Export Citation Format

Share Document