Sparse signal recovery by difference of convex functions algorithms

Authors:
Hoai An Le Thi;Bich Thuy Nguyen Thi;Hoai Minh Le
Affiliations:
Laboratory of Theoretical and Applied Computer Science - LITA EA 3097, University of Lorraine, Metz, France;Laboratory of Theoretical and Applied Computer Science - LITA EA 3097, University of Lorraine, Metz, France;Laboratory of Theoretical and Applied Computer Science - LITA EA 3097, University of Lorraine, Metz, France
Venue:
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II
Year:
2013

Citing 8
Cited 0

On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems

Theoretical Computer Science
Feature Selection via Concave Minimization and Support Vector Machines

ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Use of the zero norm with linear models and kernel methods

The Journal of Machine Learning Research
Gene Selection for Cancer Classification Using DCA

ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

IEEE Transactions on Information Theory
Compressed sensing

IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

IEEE Transactions on Information Theory
Structured Compressed Sensing: From Theory to Applications

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the problem of signal recovery which is formulated as a l0-minimization problem. Using two appropriate continuous approximations of l0−norm, we reformulate the problem as a DC (Difference of Convex functions) program. DCA (DC Algorithm) is then developed to solve the resulting problems. Computational experiments on several datasets show the efficiency of our methods.