Measuring time-Frequency information content using the Rényi entropies

By Richard Baraniuk, Patrick Flandrin, Augustus J. E. M. Janssen, Olivier J. J. Michel. IEEE Transactions on Information Theory, 2001

483 citations recorded by the source corpus.

The generalized entropies of Renyi inspire new measures for estimating signal information and complexity in the time-frequency plane. When applied to a time-frequency representation (TFR) from Cohen's class or the affine class, the Renyi entropies conform closely to the notion of complexity that we use when visually inspecting time-frequency images. These measures possess several additional interesting and useful properties, such as accounting and cross-component and transformation invariances, that make them natural for time-frequency analysis. This paper comprises a detailed study of the properties and several potential applications of the Renyi entropies, with emphasis on the mathematical foundations for quadratic TFRs. In particular, for the Wigner distribution, we establish that there exist signals for which the measures are not well defined.

Subfields: Applied Mathematics, Computer Vision and Pattern Recognition, Signal Processing

View Paper: https://www.semanticscholar.org/paper/2141d4ce1bd5ed6837c1822edbdc343c1f29bd5c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

  1. Jin Jiang
  2. Igor Djurovic
  3. Ervin Sejdic
  4. Steeve Zozor
  5. Christophe Vignat

In Computer Vision and Pattern Recognition

  1. Jin Jiang
  2. Igor Djurovic
  3. Ervin Sejdic
  4. Steeve Zozor
  5. Christophe Vignat

In Signal Processing

  1. Jin Jiang
  2. Igor Djurovic
  3. Ervin Sejdic
  4. Steeve Zozor
  5. Christophe Vignat

Citations in the corpus