By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wang Tian Jing ; Key Lab. of Broadband Wireless Commun. & Sensor Network Technol., Nanjing Univ. of Posts & Telecommun., Nanjing, China ; Zheng Bao Yu ; Yang Zhen

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.

Published in:

Communications (APCC), 2012 18th Asia-Pacific Conference on

Date of Conference:

15-17 Oct. 2012