RESEARCH ARTICLE


A Fast Algorithm for the Demosaicing Problem Concerning the Bayer Pattern



Antonio Boccuto1, Ivan Gerace1, *, Valentina Giorgetti1, 2, Matteo Rinaldi1
1 Dipartimento di Matematica e Informatica, Laboratorio di Matematica Computazionale “Sauro Tulipani”, Università degli Studi di Perugia via Vanvitelli, 1 I-06123 Perugia, Italy
2 Dipartimento di Matematica e Informatica "Ulisse Dini", Università degli Studi di Firenze, Viale G. B. Morgagni, 67/a, I-50134 Firenze, Italy


© 2019 Boccuto et al.

open-access license: This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International Public License (CC-BY 4.0), a copy of which is available at: https://creativecommons.org/licenses/by/4.0/legalcode. This license permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

* 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: ivan.gerace@unipg.it


Abstract

Introduction:

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.

Methods:

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.

Results:

We show experimentally how the proposed algorithm gives in mean better reconstructions than more computationally expensive algorithms.

Keywords: Demosaicing, Sparse data problem, Inverse problem, Edge-preserving image reconstruction, Local filtering, Bayer pattern.