000086800 001__ 86800
000086800 005__ 20190812204939.0
000086800 037__ $$aCONF
000086800 245__ $$aRedundancy in Non-Orthogonal Transforms
000086800 269__ $$a2001
000086800 260__ $$bEUSIPCO$$c2001
000086800 336__ $$aConference Papers
000086800 490__ $$aProceedings of EUSIPCO 2002
000086800 520__ $$aCompression 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.
000086800 6531_ $$aLTS2
000086800 6531_ $$aLTS4
000086800 700__ $$0241061$$g101475$$aFrossard, P.
000086800 700__ $$aVandergheynst, P.$$g120906$$0240428
000086800 773__ $$tProceedings of the IEEE International Symposium on Information Theory$$q196
000086800 8564_ $$zn/a$$uhttps://infoscience.epfl.ch/record/86800/files/Frossard2001_71.pdf$$s73695
000086800 909C0 $$xU10380$$pLTS2$$0252392
000086800 909C0 $$0252393$$xU10851$$pLTS4
000086800 909CO $$qGLOBAL_SET$$pconf$$pSTI$$ooai:infoscience.tind.io:86800
000086800 937__ $$aEPFL-CONF-86800
000086800 970__ $$aFrossard2001_71/LTS
000086800 973__ $$sPUBLISHED$$aEPFL
000086800 980__ $$aCONF