In this paper we consider the recovery of missing regions in images and we compare the performance of two recent prediction algorithms that utilize sparse recovery. The first algorithm is based on recent work that tries to find sparse atomic decompositions (AD) using l1-norm regularization, while the second algorithm employs iterated denoising (ID). Experimental results indicate that ID generally outperforms the l1 based technique and we investigate the reasons for the often substantial performance difference. We discuss many issues that effect the robustness of the l1 based technique and in particular, we point to inherent problems in the missing data prediction setting that challenge the underlying sparse atomic decomposition assumptions at their core. Inspired by what ID does right, we provide techniques that are expected to improve the performance of sparse atomic decomposition motivated algorithms and we establish connections with ID.

Date Published: 17 September 2005
PDF: 12 pages
Proc. SPIE 5914, Wavelets XI, 59141G (17 September 2005); doi: 10.1117/12.618997

Published in SPIE Proceedings Vol. 5914:
Wavelets XI
Manos Papadakis; Andrew F. Laine; Michael A. Unser, Editor(s)