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.

Highlights

  • In this paper, we deal with the demosaicing problem when the Bayer pattern is used

  • We present the experimental results obtained from the implementation of the proposed algorithm, which was tested for the Bayer Color Filter Array (CFA) on the set of Kodak sample images [24], of size, shown in Fig. (5)

  • To define a specific Local Edge Preserving (LEP) method, we assume that the radius t of the neighborhood of the median filter in the equation (7) is equal to, and we experimentally choose the detection function φ: R0+ → R+ in (2)

Read more

Summary

Methods

We initialize the green channel by means of an edge-directed and weighted average technique. The third part consists of a constant-hue-based interpolation

Results
INTRODUCTION
THE DEMOSAICING PROBLEM
The Initialization of the Green Channel
The Initialization of the Red Values
The Initialization of the Blue Values
THE ITERATIVE PHASE OF THE PROPOSED ALGORITHM
EXPERIMENTAL RESULTS AND DISCUSSION
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call