A Novel Technique For Reducing Demosaicing Artifacts

Publication in the conference proceedings of EUSIPCO, Florence, Italy, 200

Noise reduction in muon tomography for detecting high density objects

The muon tomography technique, based on multiple Coulomb scattering of cosmic ray muons, has been proposed as a tool to detect the presence of high density objects inside closed volumes. In this paper a new and innovative method is presented to handle the density fluctuations (noise) of reconstructed images, a well known problem of this technique. The effectiveness of our method is evaluated using experimental data obtained with a muon tomography prototype located at the Legnaro National Laboratories (LNL) of the Istituto Nazionale di Fisica Nucleare (INFN). The results reported in this paper, obtained with real cosmic ray data, show that with appropriate image filtering and muon momentum classification, the muon tomography technique can detect high density materials, such as lead, albeit surrounded by light or medium density material, in short times. A comparison with algorithms published in literature is also presented

Hybrid Vector Quantization for Multiresolution Image Coding

In this correspondence, we propose a coding scheme that exploits the redundancy of the multiresolution representation of images, in that blocks in one subimage are predicted from blocks of the adjacent lower resolution subimage with the same orientation. The pool of blocks used for prediction of a given subband plays the role of a codebook that is built from vectors of coefficients inside the subband decomposition itself. Whenever the prediction procedure does not give satisfactory results with respect to a target quality, the block coefficients are quantized using a geometric vector quantizer for a Laplacian source

A Distributed Video Coding Approach for Multiple Description Video Transmission over Lossy Channels

none2nononeS. MILANI; G. CALVAGNOMilani, Simone; Calvagno, Giancarl

Multiresolution Vector Quantization for Video Coding

In this work, we propose a coding technique that is based on the generalized block prediction of the multiresolution subband decomposition of motion compensated difference image frames. A segmentation mask is used to distinguish between the regions where motion compensation was effective and those regions where the motion model did not succeed. The difference image is decomposed into a multiresolution pyramid of subbands where the highest resolution subbands are divided into two regions, based on the information given by the segmentation mask. Only the coefficients of the regions corresponding to the motion model failure are considered in the highest resolution subbands. The remaining coefficients are coded using a multiresolution vector quantization scheme that exploits inter-band non-linear redundancy. In particular, blocks in one subimage are predicted from blocks of the adjacent lower resolution subimage with the same orientation. This set of blocks plays the role of a codebook built from coefficients inside the subband decomposition itself. Whenever the inter-band prediction does not give satisfactory results with respect to a target quality, the block coefficients are quantized using a lattice vector quantizer for a Laplacian source

Segmentation-Based Motion Compensation For Enhanced Video Coding

none2nononeS. MILANI; G. CALVAGNOMilani, Simone; Calvagno, Giancarl

Image Coding by Block Prediction of Multiresolution Subimages

The redundancy of the multiresolution representation has been clearly demonstrated in the case of fractal images, but it has not been fully recognized and exploited for general images. Recently, fractal block coders have exploited the selfsimilarity among blocks in images. In this work, we devise an image coder in which the causal similarity among blocks of different subbands in a multiresolution decomposition of the image is exploited. In a pyramid subband decomposition, the image is decomposed into a set of subbands that are localized in scale, orientation, and space. The proposed coding scheme consists of predicting blocks in one subimage from blocks in lower resolution subbands with the same orientation. Although our prediction maps are of the same kind of those used in fractal block coders, which are based on an iterative mapping scheme, our coding technique does not impose any contractivity constraint on the block maps, This makes the decoding procedure very simple and allows a direct evaluation of the mean squared error (MSE) between the original and the reconstructed image at coding time. More importantly, we show that the subband pyramid acts as an automatic block classifier, thus making the block search simpler and the block matching more effective, These advantages are confirmed by the experimental results, which show that the performance of our scheme is superior for both visual quality and MSE to that obtainable with standard fractal block coders and also to that of other popular image coders such as JPEG