Translator Disclaimer
26 March 1998 Block coordinate relaxation methods for nonparamatric signal denoising
Author Affiliations +
Abstract
An important class of nonparametric signal processing methods is to form a set of predictors from an overcomplete set of basis functions associated with a fast transform. In these methods, the number of basis functions can far exceed the number of samples values in the signal, leading to an ill-posed prediction problem. The 'basis pursuit' denoising method of Chen, Donoho, and Saunders regularizes the prediction problem by adding an L1 penalty term on the coefficients for the basis functions. Use of an L1 penalty instead of L2 has significant benefits, including higher resolution of signals close in time/frequency and a more parsimonious representation. The L1 penalty, however, poses a challenging optimization problem that was solved by Chen, Donoho and Saunders using a novel application of interior point methods. In this paper, we investigate an alternative optimization approach based on 'block coordinate relaxation' (BCR) techniques. We show that BCR is globally convergent, and empirically, BCR is faster than interior point methods for a variety of signal de- noising problems.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Andrew G. Bruce, Sylvain Sardy, and Paul Tseng "Block coordinate relaxation methods for nonparamatric signal denoising", Proc. SPIE 3391, Wavelet Applications V, (26 March 1998); https://doi.org/10.1117/12.304915
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
Back to Top