Redundancy in Non-Orthogonal Transforms

Compression efficiency is mainly driven by redundancy of the overcomplete set of functions chosen for the signal decomposition. In Matching Pursuit algorithms for example, the redundancy of the dictionary influences the convergence of the residual energy. The set of functions or dictionary plays a crucial role into the non-orthogonal transform properties, and more particularly in the ability of this transform to compact the signal energy. Redundancy provides an important criteria in the design of dictionaries and quantifies the power of the transform to capture signal features. The size of the dictionary provides a first indicator of the dictionary propertie, but it does not take into account the distribution of the atoms. This paper provides a formulation for the structural redundancy of an overcomplete set of functions. We also compute the structural redundancy factor for random dictionaries and show its implication in the practical context of Matching Pursuit.


Publié dans:
Proceedings of the IEEE International Symposium on Information Theory, 196
Année
2001
Publisher:
EUSIPCO
Mots-clefs:
Laboratoires:




 Notice créée le 2006-06-14, modifiée le 2019-08-12

n/a:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)