Share Email Print
cover

Proceedings Paper

Analysis of data separation and recovery problems using clustered sparsity
Author(s): Emily J. King; Gitta Kutyniok; Xiaosheng Zhuang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Data often have two or more fundamental components, like cartoon-like and textured elements in images; point, filament, and sheet clusters in astronomical data; and tonal and transient layers in audio signals. For many applications, separating these components is of interest. Another issue in data analysis is that of incomplete data, for example a photograph with scratches or seismic data collected with fewer than necessary sensors. There exists a unified approach to solving these problems which is minimizing the ℓ1 norm of the analysis coefficients with respect to particular frame(s). This approach using the concept of clustered sparsity leads to similar theoretical bounds and results, which are presented here. Furthermore, necessary conditions for the frames to lead to sufficiently good solutions are also shown.

Paper Details

Date Published: 27 September 2011
PDF: 11 pages
Proc. SPIE 8138, Wavelets and Sparsity XIV, 813818 (27 September 2011); doi: 10.1117/12.892723
Show Author Affiliations
Emily J. King, Univ. Osnabrück (Germany)
Gitta Kutyniok, Univ. Osnabrück (Germany)
Xiaosheng Zhuang, Univ. Osnabrück (Germany)


Published in SPIE Proceedings Vol. 8138:
Wavelets and Sparsity XIV
Manos Papadakis; Dimitri Van De Ville; Vivek K. Goyal, Editor(s)

© SPIE. Terms of Use
Back to Top