Date: 14 Mar 2009
A Predual Proximal Point Algorithm Solving a Non Negative Basis Pursuit Denoising Model
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
This paper develops an implementation of a Predual Proximal Point Algorithm (PPPA) solving a Non Negative Basis Pursuit Denoising model. The model imposes a constraint on the l 2 norm of the residual, instead of penalizing it. The PPPA solves the predual of the problem with a Proximal Point Algorithm (PPA). Moreover, the minimization that needs to be performed at each iteration of PPA is solved with a dual method. We can prove that these dual variables converge to a solution of the initial problem.
Our analysis proves that we turn a constrained non differentiable convex problem into a short sequence of nice concave maximization problems. By nice, we mean that the functions which are maximized are differentiable and their gradient is Lipschitz.
The algorithm is easy to implement, easier to tune and more general than the algorithms found in the literature. In particular, it can be applied to the Basis Pursuit Denoising (BPDN) and the Non Negative Basis Pursuit Denoising (NNBPDN) and it does not make any assumption on the dictionary. We prove its convergence to the set of solutions of the model and provide some convergence rates.
Experiments on image approximation show that the performances of the PPPA are at the current state of the art for the BPDN.
Bect, J., Blanc-Féraud, L., Aubert, G., & Chambolle, A. (2004). A l1-unified variational framework for image restoration. In Lecture notes in computer science. Proc. ECCV 2004. Berlin: Springer.
Berg, E. V., Friedlander, M. P., Hennenfent, G., Herrmann, F., Saab, R., & Yılmaz, Ö. (2007). Sparco: A testing framework for sparse reconstruction (Tech. Rep. TR-2007-20). Dept. Computer Science, University of British Columbia, Vancouver.
Bertsekas, D. P. (2003). Nonlinear programming (2nd ed.). Belmont: Athena Scientific.
Bioucas-Dias, J. (2006). Bayesian wavelet-based image deconvolution: A gem algorithm exploiting a class of heavy-tailed priors. IEEE Transactions on Image Processing, 15(4), 937–951. CrossRef
Brown, M., & Costen, N. (2005). Exploratory basis pursuit classification. Pattern Recognition Letters, 26, 1907–1915. CrossRef
Ciarlet, P. (1989). Introduction to numerical linear algebra and optimisation. Cambridge: Cambridge University Press.
Donoho, D. (2005). Neighborly polytopes and sparse solution of underdetermined linear equations (Tech. Rep. 2005-04). Dept. of Statistics, Stanford University.
Donoho, D., & Tsaig, Y. (2006). Fast solution of l1-norm minimization problems when the solution may be sparse (Tech. Rep. 2006-18). Stanford, Dept. of Statistics.
Figueiredo, M., & Nowak, R. (2005). A bound optimization approach to wavelet-based image deconvolution. In ICIP 2005 (Vol. 2, pp. 782–785).
Figueiredo, M., Nowak, R., & Wright, S. (2007). Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE Journal of Selected Topics in Signal Processing, 1(4), 586–598. CrossRef
Figueiredo, M., Nowak, R., & Wright, S. (2007). Gpsr 5.0. Matlab toolbox. Available at http://www.lx.it.pt/~mtf/GPSR/.
Hale, E., Yin, W., & Zhang, Y. (2007). A fixed-point continuation method for l1-regularized minimization with applications to compressed sensing (CAAM TR07-07). Rice University.
Kim, S. J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007). A method for large-scale l1-regularized least squares. IEEE Journal on Selected Topics in Signal Processing, 1(4), 606–617. CrossRef
Malgouyres, F. (2006). Projecting onto a polytope simplifies data distributions (Tech. Rep. 2006-1). University Paris 13.
Malgouyres, F. (2007). Rank related properties for basis pursuit and total variation regularization. Signal Processing, 87(11), 2695–2707. CrossRef
Malgouyres, F. (2008) Codes and scripts on basis pursuit denoising. http://www.math.univ-paris13.fr/~malgouy/software/index.html.
Maria, S., & Fuchs, J. (2006). Application of the global matched filter to stap data: an efficient algorithmic approach. In Proceedings of ICASSP 2006 (Vol. 4, pp. 1013–1016). Toulouse, France.
Nesterov, Y. (2004). Introductory lectures on convex optimization: A basic course. Norwell: Kluwer Academic. MATH
Rockafellar, R. (1970). Convex analysis. Princeton: Princeton University Press. MATH
Starck, J. L., Elad, M., & Donoho, D. (2005). Image decomposition via the combination of sparse representations and a variational approach. IEEE Transactions on Image Processing, 14(10), 1570–1582. CrossRef
Zeng, T. (2007). Études de modèles variationnels et apprentissage de dictionnaires. Ph.D. thesis, Université Paris 13.
- A Predual Proximal Point Algorithm Solving a Non Negative Basis Pursuit Denoising Model
International Journal of Computer Vision
Volume 83, Issue 3 , pp 294-311
- Cover Date
- Print ISSN
- Online ISSN
- Springer US
- Additional Links
- Basis Pursuit
- Sparse representation
- Proximal point algorithm
- ell1 minimization
- Industry Sectors