Share Email Print

Proceedings Paper

Block coordinate relaxation methods for nonparamatric signal denoising
Author(s): Andrew G. Bruce; Sylvain Sardy; Paul Tseng
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 26 March 1998
PDF: 12 pages
Proc. SPIE 3391, Wavelet Applications V, (26 March 1998); doi: 10.1117/12.304915
Show Author Affiliations
Andrew G. Bruce, MathSoft, Inc. (United States)
Sylvain Sardy, Univ. of Washington (United States)
Paul Tseng, Univ. of Washington (United States)

Published in SPIE Proceedings Vol. 3391:
Wavelet Applications V
Harold H. Szu, Editor(s)

© SPIE. Terms of Use
Back to Top