A Fast Algorithm for the Demosaicing Problem Concerning the Bayer Pattern
Antonio Boccuto, Ivan Gerace*, Valentina Giorgetti, Matteo Rinaldi
In this paper, we deal with the demosaicing problem when the Bayer pattern is used. We propose a fast heuristic algorithm, consisting of three parts.
In the first one, we initialize the green channel by means of an edge-directed and weighted average technique. In the second part, the red and blue channels are updated, thanks to an equality constraint on the second derivatives. The third part consists of a constant-hue-based interpolation.
We show experimentally how the proposed algorithm gives in mean better reconstructions than more computationally expensive algorithms.
Correspondence: Address correspondence to this author at the Dipartimento di Matematica e Informatica, Laboratorio di Matematica Computazionale “Sauro Tulipani”, Università degli Studi di Perugia via Vanvitelli, 1 I-06123 Perugia, Italy; Tel: +39 075 5855001; E-mail: email@example.com