JOURNAL ARTICLE

An overcomplete dictionary design algorithm for sparse representation of piecewise stationary signals

Abstract

In recent years there has been a growing interest in sparse representation of signals based on overcomplete dictionaries. Selecting few atoms that best match the signal structure, the signal is described by linear combination of these atoms. In this paper, we propose a novel overcomplete dictionary design algorithm for sparse representation of piecewise stationary signals. An effective and easy-to-use overcomplete dictionary is constructed in accordance with the parametric autocorrelation function model of piecewise stationary processes. Furthermore, a sparse decomposition algorithm in terms of nonlinear approximation is designed to obtain sparse representation of piecewise stationary signals, which has lower computational complexity and better practicability than the conventional sparse decomposition algorithms. The experimental results demonstrate that the proposed method avails for higher sparsiry of signal representation and better reconstruction performance than sparse representation of signals based on overcomplete DCT dictionary.

Keywords:
Sparse approximation Piecewise Representation (politics) Algorithm K-SVD Computer science Autocorrelation Pattern recognition (psychology) SIGNAL (programming language) Mathematics Artificial intelligence

Metrics

2
Cited By
0.00
FWCI (Field Weighted Citation Impact)
13
Refs
0.11
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Sparse and Compressive Sensing Techniques
Physical Sciences →  Engineering →  Computational Mechanics
Image and Signal Denoising Methods
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
Blind Source Separation Techniques
Physical Sciences →  Computer Science →  Signal Processing

Related Documents

© 2026 ScienceGate Book Chapters — All rights reserved.