2 February 2009 Iterative demosaicking accelerated: theory and fast noniterative implementations
Author Affiliations +
Abstract
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternating projections (AP). Since its publication, the AP algorithm has been wildly cited and served as a benchmark in a flurry of papers in the demosaicking literature. Despite its impressive performances, a relative weakness of the AP algorithm is its high computational complexity. In our work, we provide a rigorous analysis of the convergence of the AP algorithm based on the concept of contraction mapping. Furthermore, we propose an efficient noniterative implementation of the AP algorithm in the polyphase domain. Numerical experiments show that the proposed noniterative implementation achieves the same results obtained by the original AP algorithm at convergence, but is about an order of magnitude faster than the latter.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yue M. Lu, Yue M. Lu, Mina Karzand, Mina Karzand, Martin Vetterli, Martin Vetterli, } "Iterative demosaicking accelerated: theory and fast noniterative implementations", Proc. SPIE 7246, Computational Imaging VII, 72460L (2 February 2009); doi: 10.1117/12.805402; https://doi.org/10.1117/12.805402
PROCEEDINGS
12 PAGES


SHARE
Back to Top