Share Email Print

Proceedings Paper

Iterative demosaicking accelerated: theory and fast noniterative implementations
Author(s): Yue M. Lu; Mina Karzand; Martin Vetterli
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

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.

Paper Details

Date Published: 3 February 2009
PDF: 12 pages
Proc. SPIE 7246, Computational Imaging VII, 72460L (3 February 2009); doi: 10.1117/12.805402
Show Author Affiliations
Yue M. Lu, Swiss Federal Institute of Technology Lausanne (Switzerland)
Mina Karzand, Swiss Federal Institute of Technology Lausanne (Switzerland)
Martin Vetterli, Swiss Federal Institute of Technology Lausanne (Switzerland)

Published in SPIE Proceedings Vol. 7246:
Computational Imaging VII
Charles A. Bouman; Eric L. Miller; Ilya Pollak, Editor(s)

© SPIE. Terms of Use
Back to Top