Differential Graph-Based Coding of Spikes in a Biologically-Inspired Universal Audio Coder

Lahdili H, Najaf-Zadeh H, Pichevar R, Thibault L. Differential Graph-Based Coding of Spikes in a Biologically-Inspired Universal Audio Coder. In: AES Convention 124. Audio Engineering Society; 2008. Paper 7334. Available from: https://aes.org/publications/elibrary-page/?id=14464

@inproceedings{Lahdili2008_14464,
  author = {Lahdili, Hassan and Najaf-Zadeh, Hossein and Pichevar, Ramin and Thibault, Louis},
  title = {{Differential Graph-Based Coding of Spikes in a Biologically-Inspired Universal Audio Coder}},
  booktitle = {AES Convention 124},
  note = {Paper 7334},
  year = {2008},
  month = may,
  publisher = {Audio Engineering Society},
  url = {https://aes.org/publications/elibrary-page/?id=14464}
}

TY  - CPAPER
TI  - Differential Graph-Based Coding of Spikes in a Biologically-Inspired Universal Audio Coder
AU  - Lahdili, Hassan
AU  - Najaf-Zadeh, Hossein
AU  - Pichevar, Ramin
AU  - Thibault, Louis
T2  - AES Convention 124
M1  - Paper 7334
PY  - 2008
DA  - 2008/05/06
UR  - https://aes.org/publications/elibrary-page/?id=14464
PB  - Audio Engineering Society
LA  - en
AB  - In a previous work we showed that it is possible to code audio materials using a biologically-inspired universal audio coder based on matching pursuit. The best atoms/kernels chosen by matching pursuit are represented by spikes to reflect the biologically-inspired nature of the algorithm. In that work, each spike or atom was defined by parameters such as timing, channel frequency, amplitude, chirp factor, etc. that were encoded independently. However, encoding each atom/spike as a separate entity is very bit consuming. In the present work, we propose algorithms to encode only the difference between parameters associated with spikes. Hence, we assume that each spike/atom is a node in a graph and choose the sequence of spikes that will minimize the differential encoding costs. Methods based on minimum spanning tree and travelling salesman are proposed and compared for the graph-based optimization of the code.
ER  -