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

Leonard E. Russo

dblp:89/3710 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2002
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2

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
1 paper
Image and video coding · 67% Geometric modeling and processing · 33%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › surface parameterization
bijective projection
0.012002
Multichannel image compression by bijection mappings onto zero-trees · IEEE Trans. Image Process. 2002
Image and video coding
transform coding
0.012002
Multichannel image compression by bijection mappings onto zero-trees · IEEE Trans. Image Process. 2002
Image and video coding › scalable coding
zerotree coding
0.012002
Multichannel image compression by bijection mappings onto zero-trees · IEEE Trans. Image Process. 2002

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

second-order statistics optimization · 0.0bijection mapping · 0.0
YearPublicationVenuePosition
2002 Multichannel image compression by bijection mappings onto zero-trees
abstract
A new approach to multichannel image compression is introduced where the intra- and cross-band correlations are jointly exploited in a surprisingly simple yet very effective manner. The key component of the algorithm is a bijection mapping of the original multichannel image into a virtual two-dimensional (2-D) scalar image. By optimally mapping the multichannel image set into a 2-D array and by subsequently applying a scalar image coding algorithm, the spatial correlation and the spectral correlation of the multichannel data set are jointly exploited. Based on the statistical characteristics of the multichannel data, the bijection mapping can be optimized to minimize the distortion introduced by the compression algorithm. The optimization reduces to the maximization of a function of the second-order statistics of the multichannel data. At high compression rates, the new algorithm outperforms traditional compression algorithms whenever the cross-band correlation is high and it yields comparable performance at low compression rates.
José L. Paredes, Gonzalo R. Arce, Leonard E. Russo
IEEE Trans. Image Process.3
2000 Multichannel Image Compression by Bijection Mappings onto Zero-Trees
abstract
A new approach to multispectral image compression is introduced where the intra- and cross-band correlations are jointly exploited in a surprisingly simple yet very effective manner. The proposed compression algorithm maps the multispectral image set into a virtual 2-dimensional array and applies a scalar image coding algorithm to the virtual array. Thus, the spatial correlation and the spectral correlation of the multispectral data set are jointly exploited. Based on the statistical characteristics of the multispectral data, the bijection mapping is optimized to minimize the distortion introduced by the compression algorithm. At high compression rates, the new algorithm outperforms traditional compression algorithms whenever the cross-band correlation is high and it yields comparable performance at low compression rates.
José L. Paredes, Gonzalo R. Arce, Leonard E. Russo
ICIP3