By Topic

Restoration of Astrophysical Spectra With Sparsity Constraints: Models and Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bourguignon, S. ; Cassiopee Lab., Univ. of Nice Sophia Antipolis, Nice, France ; Mary, D. ; Slezak, E.

We address the problem of joint signal restoration and parameter estimation in the context of the forthcoming MUSE instrument, which will provide spectroscopic measurements of light emitted by very distant galaxies. Restoration of spectra is formulated as a linear inverse problem, accounting for the instrument response and the noise spectral variability. Estimation is considered in the setting of sparse approximation, where restoration is performed jointly with the detection of relevant patterns in the spectra. To this aim, a dictionary of elementary spectral features is designed according to astrophysical spectroscopy. Sparse estimation is considered through the minimization of a quadratic data misfit criterion with an ℓ1-norm penalization, where nonzero components are associated to the detected features. An efficient optimization strategy is proposed, based on the Iterative Coordinate Descent (ICD) principle, with accelerations that dramatically reduce the computational cost. The algorithm does not rely on fast transforms and can be applied to a wide variety of criteria if the sparsity constraint is separable. Results on simulated MUSE-like data reveal satisfactory performance in terms of denoising and detection of physically relevant spectral features. On such data, the proposed algorithm is shown to outperform both state-of-the-art gradient-based and homotopy continuation methods. Simulations with a compressed sensing-like random matrix also reveal better performance compared with usual algorithms, showing that ICD can be a powerful strategy for sparse optimization.

Published in:

Selected Topics in Signal Processing, IEEE Journal of  (Volume:5 ,  Issue: 5 )