The Open Signal Processing Journal
2019, 6 : 1-14Published online 2019 January 29. DOI: 10.2174/1876825301906010001
Publisher ID: TOSIGPJ-6-1
RESEARCH ARTICLE
A Fast Algorithm for the Demosaicing Problem Concerning the Bayer Pattern
1
Dipartimento di Matematica e Informatica, Laboratorio di Matematica Computazionale “Sauro Tulipani”, Università degli Studi di Perugia 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
*Address correspondence to this author at the Dipartimento di Matematica e Informatica, Laboratorio di Matematica Computazionale “Sauro Tulipani”, Università degli Studi di Perugia Vanvitelli, 1 I-06123 Perugia, Italy; Tel: +39 075 5855001; E-mail: ivan.gerace@unipg.it
2 Dipartimento di Matematica e Informatica "Ulisse Dini", Università degli Studi di Firenze, Viale G. B. Morgagni, 67/a, I-50134 Firenze, Italy
*Address correspondence to this author at the Dipartimento di Matematica e Informatica, Laboratorio di Matematica Computazionale “Sauro Tulipani”, Università degli Studi di Perugia 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.