Most digital cameras use a color filter array to capture the colors of the scene. Downsampled versions of the red, green, and blue components are acquired, and an interpolation of the three colors is necessary to reconstruct a full representation of the image. This color interpolation is known as demosaicing. The most effective demosaicing techniques proposed in the literature are based on directional filtering and a posteriori decision. In this paper, we present a novel approach to this reconstruction method. A refining step is included to further improve the resulting reconstructed image. The proposed approach requires a limited computational cost and gives good performance even when compared to more demanding techniques.

No abstract

Demosaicking is the process of reconstructing a full resolution color image from the sampled data acquired by a digital camera that apply a color filter array to a single sensor. In this paper, we propose a regularization approach to demosaicking, making use of some prior knowledge about natural color images, such as smoothness of each single color component and correlation between the different color channels. Initially, a quadratic strategy is considered and a general approach is reported. Then, an adaptive technique is analyzed, in order to improve the reconstruction near the edges and the discontinuities of the image. This is performed using a novel strategy that avoids computational demanding iterations. The proposed approach provides good performances and candidates itself for many applications. Moreover, since the response of the pixel sensors can be taken into account, it can handle nonideal acquisition devices.

In this paper, we consider the problem of lossless compression of video by taking into account temporal information. Video lossless compression is an interesting possibility in the line of production and contribution. We propose a compression technique which is based on motion compensation, optimal three-dimensional (3-D) linear prediction and context based Golomb-Rice entropy coding. The proposed technique is compared with 3-D extensions of the JPEG-LS standard for still image compression. A compression gain of about 0.8 bit/pel with respect to static JPEG-LS, applied on a frame-by-frame basis, is achievable at a reasonable computational complexity.