pith. sign in

arxiv: 1610.08813 · v1 · pith:GJXXYT7Cnew · submitted 2016-10-27 · 📊 stat.ML

Sparse Signal Subspace Decomposition Based on Adaptive Over-complete Dictionary

classification 📊 stat.ML
keywords methoddecompositiondictionarysubspaceover-completesignalsparsecriterion
0
0 comments X
read the original abstract

This paper proposes a subspace decomposition method based on an over-complete dictionary in sparse representation, called "Sparse Signal Subspace Decomposition" (or 3SD) method. This method makes use of a novel criterion based on the occurrence frequency of atoms of the dictionary over the data set. This criterion, well adapted to subspace-decomposition over a dependent basis set, adequately re ects the intrinsic characteristic of regularity of the signal. The 3SD method combines variance, sparsity and component frequency criteria into an unified framework. It takes benefits from using an over-complete dictionary which preserves details and from subspace decomposition which rejects strong noise. The 3SD method is very simple with a linear retrieval operation. It does not require any prior knowledge on distributions or parameters. When applied to image denoising, it demonstrates high performances both at preserving fine details and suppressing strong noise.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.