ICA 2007

ICA 2007
7th International Conference on
Independent Component Analysis
and Signal Separation

London, UK        9 - 12 September 2007

Banner showing images of London
- Home
- Committee
- Call for Papers
- Submission
- Info for Presenters
- Dates
- Programme
- Tutorials
- Keynotes
- Papers
- Registration
- Accommodation
- Venue
- Maps
- Arrival
- Travel Tips
- Links
- Contact

Paper No: 47

Fast Sparse Representation based on Smoothed L0 Norm

Author(s): G. Hosein Mohimani, Babaie-Zadeh Massoud, Christian Jutten

Abstract

In this paper, a new algorithm for Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented. The algorithm is essentially a method for obtaining sufficiently sparse solutions of underdetermined systems of linear equations. The solution obtained by the proposed algorithm is compared with the minimum \lone-norm solution achieved by Linear Programming (LP). It is experimentally shown that the proposed algorithm is about two to three orders of magnitude faster than the state-of-the-art interior-point LP solvers, while providing the same (or better) accuracy.

Last Updated: 14-Aug-2007   Please read our disclaimer