Self-organizing maps for the design of multiple description vector quantizers

被引:1
|
作者
Poggi, Giovanni [1 ]
Cozzolino, Davide [1 ]
Verdoliva, Luisa [1 ]
机构
[1] Univ Naples Federico II, Dept Elect Engn & Informat Technol, Naples, Italy
关键词
Self-organizing maps; Vector quantization; Multiple description coding; Reproducible research; INDEX ASSIGNMENTS; QUANTIZATION; CODEBOOKS; NETWORK;
D O I
10.1016/j.neucom.2013.06.021
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multiple description coding is an appealing tool to guarantee graceful signal degradation in the presence of unreliable channels. While the principles of multiple description scalar quantization are well-understood and solid guidelines exist to design effective systems, the same does not hold for vector quantization, especially at low bit-rates, where burdensome and unsatisfactory design techniques discourage its use altogether in applications. In this work we use the self-organizing maps to design multiple description VQ codebooks. The proposed algorithm is flexible, fast and effective: it deals easily with a large variety of situations, including the case of more than two descriptions, with a computational complexity that remains fully affordable even for large codebooks, and a performance comparable to that of reference techniques. A thorough experimental analysis, conducted in a wide range of operating conditions, proves the proposed technique to perform on par with well-known reference methods based on greedy optimization, but with a much lower computational burden. In addition, the resulting codebook can be itself optimized, thus providing even better performance. All experiments are fully reproducible, with all software and data available online for the interested researchers. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:298 / 309
页数:12
相关论文
共 50 条
  • [41] DESIGN OF MULTIPLE DESCRIPTION SCALAR QUANTIZERS
    VAISHAMPAYAN, VA
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (03) : 821 - 834
  • [42] Document classification with self-organizing maps
    Merkl, D
    KOHONEN MAPS, 1999, : 183 - 195
  • [43] Grey self-organizing feature maps
    Hu, YC
    Chen, RS
    Hsu, YT
    Tzeng, GH
    NEUROCOMPUTING, 2002, 48 : 863 - 877
  • [44] Self-Organizing Maps with a Single Neuron
    Georgiou, George M.
    Voigt, Kerstin
    2013 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2013,
  • [45] Initialization Issues in Self-organizing Maps
    Valova, Iren
    Georgiev, George
    Gueorguieva, Natacha
    Olson, Jacob
    COMPLEX ADAPTIVE SYSTEMS: EMERGING TECHNOLOGIES FOR EVOLVING SYSTEMS: SOCIO-TECHNICAL, CYBER AND BIG DATA, 2013, 20 : 52 - 57
  • [46] Transition times in self-organizing maps
    Heskes, TM
    BIOLOGICAL CYBERNETICS, 1996, 75 (01) : 49 - 57
  • [47] Fast Self-Organizing Maps Training
    Giobergia, Flavio
    Baralis, Elena
    2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2019, : 2257 - 2266
  • [48] On the stationarity in some self-organizing maps
    Hoshino, M
    Kimura, Y
    Kaku, I
    ICIM' 2004: PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, 2004, : 754 - 760
  • [49] Lateral interactions in self-organizing maps
    Viviani, R
    ARTIFICIAL NEURAL NETWORKS - ICANN 2002, 2002, 2415 : 920 - 926
  • [50] Fault tolerance of self-organizing maps
    Bernard Girau
    Cesar Torres-Huitzil
    Neural Computing and Applications, 2020, 32 : 17977 - 17993