Share Email Print

Proceedings Paper

Image inpainting: theoretical analysis and comparison of algorithms
Author(s): Emily J. King; Gitta Kutyniok; Wang-Q Lim
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

An 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 this problem and that of data separation: namely, minimizing the norm of the analysis (rather than synthesis) coefficients with respect to particular frame(s).There have been a number of successful applications of this method recently. Analyzing this method using the concept of clustered sparsity leads to theoretical bounds and results, which will be presented. Furthermore, necessary conditions for the frames to lead to sufficiently good solutions will be shown, and this theoretical framework will be use to show that shearlets are able to inpaint larger gaps than wavelets. Finally, the results of numerical experiments comparing this approach to inpainting to numerous others will be presented.

Paper Details

Date Published: 26 September 2013
PDF: 11 pages
Proc. SPIE 8858, Wavelets and Sparsity XV, 885802 (26 September 2013); doi: 10.1117/12.2025401
Show Author Affiliations
Emily J. King, Technische Univ. Berlin (Germany)
Gitta Kutyniok, Technische Univ. Berlin (Germany)
Wang-Q Lim, Technische Univ. Berlin (Germany)

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

© SPIE. Terms of Use
Back to Top