By Topic

Recursive overcomplete signal representations

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

2 Author(s)
Varkonyi-Koczy, A.R. ; Dept. of Meas. & Inf. Syst., Tech. Univ. of Budapest, Hungary ; Fek, M.

For representing stationary signals, several well-established methods are available. For nonstationary signals, however, these approaches can be used only with serious limitations. If the signal can be characterized as a sequence of stationary intervals, overcomplete signal representations help to handle such problems. This paper introduces the concept of recursive overcomplete representations using different recursive signal processing algorithms. The novelty of the paper is that an on-going set of signal transformations together with appropriate (e.g., L1 norm) minimization procedures can provide optimal on-going representations, on-going signal segmentations into stationary intervals, and on-going feature extractions for immediate utilization in diagnostics, or other applications

Published in:

Instrumentation and Measurement, IEEE Transactions on  (Volume:50 ,  Issue: 6 )