Entropy-Based Algorithms For Best Basis Selection

DMCA

Entropy-Based Algorithms For Best Basis Selection (1992)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Ronald R. Coifman , Mladen Victor Wickerhauser

Venue:	IEEE Transactions on Information Theory
Citations:	675 - 20 self

BibTeX

@ARTICLE{Coifman92entropy-basedalgorithms,
    author = {Ronald R. Coifman and Mladen Victor Wickerhauser},
    title = {Entropy-Based Algorithms For Best Basis Selection},
    journal = {IEEE Transactions on Information Theory},
    year = {1992},
    volume = {38},
    pages = {713--718}
}

OpenURL

Abstract

pretations (position, frequency, and scale), and we have experimented with feature-extraction methods that use best-basis compression for front-end complexity reduction. The method relies heavily on the remarkable orthogonality properties of the new libraries. It is obviously a nonlinear transformation to represent a signal in its own best basis, but since the transformation is orthogonal once the basis is chosen, compression via the best-basis method is not drastically affected by noise: the noise energy in the transform values cannot exceed the noise energy in the original signal. Furthermore, we can use information cost functionals defined for signals with normalized energy, since all expansions in a given library will conserve energy. Since two expansions will have the same energy globally, it is not necessary to normalize expansions to compare their costs. This feature greatly enlarges the class of functionals usable by the method, speeds the best-basis search, and provides a geom

Keyphrases

entropy-based algorithm best basis selection noise energy normalized energy best-basis search new library feature-extraction method best-basis compression remarkable orthogonality property front-end complexity reduction nonlinear transformation original signal information cost functionals best-basis method

DMCA