A Fast Algorithm for the Demosaicing Problem Concerning the Bayer Pattern
Antonio Boccuto1, Ivan Gerace1, *, Valentina Giorgetti1, 2, Matteo Rinaldi1
Identifiers and Pagination:Year: 2019
First Page: 1
Last Page: 14
Publisher Id: TOSIGPJ-6-1
Article History:Received Date: 29/6/2018
Revision Received Date: 6/12/2018
Acceptance Date: 18/12/2018
Electronic publication date: 29/1/2019
Collection year: 2019
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.
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.