Sparse signal subspace decomposition based on adaptive over-complete dictionary

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...

Full description

Bibliographic Details
Main Authors: Hong Sun, Cheng-wei Sang, Didier Le Ruyet
Format: Article
Language:English
Published: SpringerOpen 2017-07-01
Series:EURASIP Journal on Image and Video Processing
Subjects:
PCA
Online Access:http://link.springer.com/article/10.1186/s13640-017-0200-7
id doaj-e18feb99126647208f4b49dadca65694
record_format Article
spelling doaj-e18feb99126647208f4b49dadca656942020-11-24T21:53:00ZengSpringerOpenEURASIP Journal on Image and Video Processing1687-52812017-07-012017111010.1186/s13640-017-0200-7Sparse signal subspace decomposition based on adaptive over-complete dictionaryHong Sun0Cheng-wei Sang1Didier Le Ruyet2School of Electronic Information, Wuhan University, Luojia HillSchool of Electronic Information, Wuhan University, Luojia HillCEDRIC Laboratory, CNAMAbstract 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 reflects the intrinsic characteristic of regularity of the signal. The 3SD method combines variance, sparsity, and component frequency criteria into a 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.http://link.springer.com/article/10.1186/s13640-017-0200-7Subspace decompositionSparse representationFrequency of componentsPCAK-SVDImage denoising
collection DOAJ
language English
format Article
sources DOAJ
author Hong Sun
Cheng-wei Sang
Didier Le Ruyet
spellingShingle Hong Sun
Cheng-wei Sang
Didier Le Ruyet
Sparse signal subspace decomposition based on adaptive over-complete dictionary
EURASIP Journal on Image and Video Processing
Subspace decomposition
Sparse representation
Frequency of components
PCA
K-SVD
Image denoising
author_facet Hong Sun
Cheng-wei Sang
Didier Le Ruyet
author_sort Hong Sun
title Sparse signal subspace decomposition based on adaptive over-complete dictionary
title_short Sparse signal subspace decomposition based on adaptive over-complete dictionary
title_full Sparse signal subspace decomposition based on adaptive over-complete dictionary
title_fullStr Sparse signal subspace decomposition based on adaptive over-complete dictionary
title_full_unstemmed Sparse signal subspace decomposition based on adaptive over-complete dictionary
title_sort sparse signal subspace decomposition based on adaptive over-complete dictionary
publisher SpringerOpen
series EURASIP Journal on Image and Video Processing
issn 1687-5281
publishDate 2017-07-01
description 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 reflects the intrinsic characteristic of regularity of the signal. The 3SD method combines variance, sparsity, and component frequency criteria into a 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.
topic Subspace decomposition
Sparse representation
Frequency of components
PCA
K-SVD
Image denoising
url http://link.springer.com/article/10.1186/s13640-017-0200-7
work_keys_str_mv AT hongsun sparsesignalsubspacedecompositionbasedonadaptiveovercompletedictionary
AT chengweisang sparsesignalsubspacedecompositionbasedonadaptiveovercompletedictionary
AT didierleruyet sparsesignalsubspacedecompositionbasedonadaptiveovercompletedictionary
_version_ 1725873549497860096