Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Stefano Andriani

dblp:57/6737 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 7 · 6 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Image and video coding · 58% Image and video processing · 22% Audio and music processing · 20%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video coding › video compression
color video coding
0.112008
Lossless Compression of Color Sequences Using Optimal Linear Prediction Theory · IEEE Trans. Image Process. 2008
Image and video coding
image compression
0.112008
Lossless Compression of Color Sequences Using Optimal Linear Prediction Theory · IEEE Trans. Image Process. 2008
Audio and music processing
linear prediction
0.112008
Lossless Compression of Color Sequences Using Optimal Linear Prediction Theory · IEEE Trans. Image Process. 2008
Image and video coding
lossless compression
0.112008
Lossless Compression of Color Sequences Using Optimal Linear Prediction Theory · IEEE Trans. Image Process. 2008
Image and video processing › image restoration
demosaicing
0.112007
Demosaicing With Directional Filtering and a posteriori Decision · IEEE Trans. Image Process. 2007
Image and video processing
image reconstruction
0.012007
Demosaicing With Directional Filtering and a posteriori Decision · IEEE Trans. Image Process. 2007

Methods — techniques the papers use, named apart from their topics

optimal linear prediction · 0.1golomb-rice coding · 0.1context-based coding · 0.1directional filtering · 0.1a posteriori decision · 0.1
YearPublicationVenuePosition
2013 Crosstalk correction technique for single sensor camera provided with Bayer color filter array
abstract
In this paper we present a three-step crosstalk correction algorithm for single sensor still or video cameras provided with a Bayer color filter array. The first step is performed off-line, during the calibration or the development of the camera; it estimates the sensor response to different colors and analyzes the crosstalk. In the second step, the algorithm corrects “on-the-fly” the raw data of the sensor by using the crosstalk model estimated in the first step. The third, optional, step can be included to remove the residual crosstalk from the second step. It consists of a low-pass filter and it can be omitted if other image rescaling steps are included into the image processing chain. The resulting technique has proved to be effective in removing the crosstalk without introducing any other visual artifacts.
Stefano Andriani, Harald Brendel
ICIP1
2013 Beyond the Kodak image set: A new reference set of color image sequences
abstract
In 1991 Kodak released a set of 24 digital color images derived from a variety of film source materials. Since then, most image processing algorithms have been developed, optimized, tested and compared using this set. Until a few years ago it was considered “the” image set; however, today it shows its limitations. Researches have expressed their need for better, more up-to-date material. We present a new set of high quality color image sequences captured with our professional digital cinema camera. This camera stores uncompressed raw sensor data and the set is freely available for FTP at ftp://[email protected]/ password: imageset.
Stefano Andriani, Harald Brendel, Tamara Seybold, Joseph Goldstone
ICIP1
2008 Lossless Compression of Color Sequences Using Optimal Linear Prediction Theory
abstract
In this paper, we present a novel technique that uses the optimal linear prediction theory to exploit all the existing redundancies in a color video sequence for lossless compression purposes. The main idea is to introduce the spatial, the spectral, and the temporal correlations in the autocorrelation matrix estimate. In this way, we calculate the cross correlations between adjacent frames and adjacent color components to improve the prediction, i.e., reduce the prediction error energy. The residual image is then coded using a context-based Golomb-Rice coder, where the error modeling is provided by a quantized version of the local prediction error variance. Experimental results show that the proposed algorithm achieves good compression ratios and it is roboust against the scene change problem.
Stefano Andriani, Giancarlo Calvagno
IEEE Trans. Image Process.1
2007 Lossless Compression of Colour Video Sequence using Optimal Prediction Theory - Octopus
abstract
Summary form only given. In this paper we present a lossless compression algorithm for colour video sequence which exploits the spatial, the spectral and the temporal correlations of a colour video sequence in the RGB colour space using the well-known optimal prediction theory. The main idea is to construct the optimal prediction coefficients estimating an autocorrelation matrix which exploits all these correlations. No colour transformation or motion compensation are applied because reversible colour transformations are not able to fully decorrelate the three bands of each frame, and motion compensation remarkably increases the complexity of the updating step of the autocorrelation matrix estimate. Furthermore, the fact that our algorithm is not based on motion compensation lead it to be robust to scene changes. The prediction errors are then coded using a context-based Golomb-Rice coder, with bias cancellation, but without run-length coding. To construct the contexts, the prediction errors are then modeled using an estimate of their local variance. This estimate considers all the previous prediction errors, using a forgetting factor to improve the adaptability of the proposed algorithm. The quantized estimated variance values are used as contexts for the Golomb-Rice coder, and, among others, we considered the following solutions: - 12 contexts estimated by sampling the standard deviation with a quantization step Delta = 1, and a saturation threshold equal to 12, [delta12]; - 128 contexts estimated by sampling the standard deviation with Delta = 1/3 and a saturation threshold equal to 128/3, [delta128]. The obtained coding results are presented for the proposed algorithm compared to JPEG-LS (without using any colour transformation), and JPEG2000 (in lossless mode, using the reversible colour YDbDrtransform, and the 5/3 DWT). The results show an improvement of about 1.5 bpp and 0.65 bpp if compared with JPEG-LS coder, and JPEG2000, respectively
Stefano Andriani, Giancarlo Calvagno
DCC1
2007 Demosaicing With Directional Filtering and a posteriori Decision
abstract
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.
Daniele Menon, Stefano Andriani, Giancarlo Calvagno
IEEE Trans. Image Process.2
2005 Lossless image compression using vector prediction based on spectral correlation
abstract
In this paper we present a new way to exploit optimal vector prediction theory for lossless compression of color images. To compress color images, the spectral correlation is usually reduced using a color space transformation (e.g., from RGB colour space to YUV Ricoh colour space, or to YCbCr when small losses are allowed). In this work, we exploit the spectral correlation to develop an optimal vector predictor in order to reduce the entropy of the residual image. To this purpose, we consider a pixel as a vector of the three components R, G, and B, and we predict this vector. As a result, we obtain an improvement of the compression ratio at the cost of an increase in the computational complexity. Some techniques to reduce the computational cost are presented. A comparison is carried out with scalar version of GLICBAWLS and JPLG-LS.
Stefano Andriani, Giancarlo Calvagno, Gian Antonio Mian
ICIP (2)1
2004 Comparison of lossy to lossless compression techniques for digital cinema
abstract
This paper presents the investigation carried out for the MetaVision project in the area of lossless compression for digital cinema. The goal of this investigation was to identify, among the many approaches, the one that is most suited to the MetaVision requirements. An extensive simulation campaign has thus identified JPEG-2000 as the best compromise between efficiency, standardization and lossy-to-lossless performance. This result was hardly predictable, especially because of the peculiar kind of material to be coded.
Stefano Andriani, Giancarlo Calvagno, Marco Durigon, Roberto Rinaldo, Mike Knee, Paul Walland, Michael Koppetz, Tomaso Erseghe, Gian Antonio Mian
ICIP1