An unsupervised algorithm for hybrid/morphological signal decomposition

Matthieu Kowalski, Thomas Rodet

Abstract

The main contribution presented here is an adaptive/unsupervised iterative thresholding algorithm for sparse representation of signals which can be modeled as the sum of two components. Such Hybrid or Morphological representations are known to be well adapted for applications in image or audio signal processing. The proposed algorithm uses a Bernoulli-Gaussian prior on the synthesis coefficients of the signal, with morphological depending parameters. Using an EM-framework introduced by Figueiredo and Nowak in the case of the convex ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> prior, we derive an unsupervised algorithm in the spirit of ISTA, with iteratively adapted thresholding/shrinkage.
BibTeX
@inproceedings{kowalski2011unsupervised,
  author = {Matthieu Kowalski and Thomas Rodet},
  title = {{An unsupervised algorithm for hybrid/morphological signal decomposition}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2011},
  url = {https://openreview.net/forum?id=xF4sXgv39X},
}

Loading related content...

Figure