Filtered Variation method for denoising and sparse signal processing
Date
2012
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
0
views
views
12
downloads
downloads
Citation Stats
Series
Abstract
We propose a new framework, called Filtered Variation (FV), for denoising and sparse signal processing applications. These problems are inherently ill-posed. Hence, we provide regularization to overcome this challenge by using discrete time filters that are widely used in signal processing. We mathematically define the FV problem, and solve it using alternating projections in space and transform domains. We provide a globally convergent algorithm based on the projections onto convex sets approach. We apply to our algorithm to real denoising problems and compare it with the total variation recovery. © 2012 IEEE.
Source Title
2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Publisher
IEEE
Course
Other identifiers
Book Title
Keywords
Filtered variation, Alternating projections, De-noising, Denoising problems, Discrete-time filters, Filtered variation, Globally convergent, Ill posed, Projection onto convex sets, Projections onto convex sets, Sparse signals, Total variation, Transform domain, Variation method, Algorithms, Set theory, Signal processing, Problem solving
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English