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

R. E. Roger

dblp:31/4403 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1996
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › image compression › remote sensing image compression
hyperspectral image compression
0.011996
Lossless compression of AVIRIS images · IEEE Trans. Image Process. 1996
Image and video coding
lossless compression
0.011996
Lossless compression of AVIRIS images · IEEE Trans. Image Process. 1996
Image and video coding
predictive coding
0.011996
Lossless compression of AVIRIS images · IEEE Trans. Image Process. 1996

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

variable-length coding · 0.0rice coding · 0.0linear prediction · 0.0adaptive DPCM · 0.0
YearPublicationVenuePosition
1996 Lossless compression of AVIRIS images
abstract
Adaptive DPCM methods using linear prediction are described for the lossless compression of hyperspectral (224-band) images recorded by the Airborne Visible/Infrared Imaging Spectrometer (AVIRIS). The methods have two stages-predictive decorrelation (which produces residuals) and residual encoding. Good predictors are described, whose performance closely approaches limits imposed by sensor noise. It is imperative that these predictors make use of the high spectral correlations between bands. The residuals are encoded using variable-length coding (VLC) methods, and compression is improved by using eight codebooks whose design depends on the sensor's noise characteristics. Rice (1979) coding has also been evaluated; it loses 0.02-0.05 b/pixel compression compared with better VLC methods but is much simpler and faster. Results for compressing ten AVIRIS images are reported.
R. E. Roger, Michael C. Cavenor
IEEE Trans. Image Process.1
1994 A faster way to compute the noise-adjusted principal components transform matrix
abstract
The matrix for the noise-adjusted principal components (NAPC) transform is the solution of a generalized symmetric eigenvalue problem. Applied to remote sensing imagery, this entails the simultaneous diagonalization of data and noise covariance matrices. One of the two PC transforms of the original NAPC transform is replaced by several short, fast procedures. The total operation count for the computation of the NAPC transform matrix is halved.>
R. E. Roger
IEEE Trans. Geosci. Remote. Sens.1
1994 Reversible image compression bounded by noise
abstract
Reversible image compression rarely achieves compression ratios larger than about 3:1. An explanation of this limit is offered, which hinges upon the additive noise the sensor introduces into the image. Simple models of this noise allow lower bounds on the bit rate to be estimated from sensor noise parameters rather than from ensembles of typical images. The model predicts that an 8-b single-band image subject to noise with unit standard deviation can be compressed reversibly to no less than 2.0 b/pixel, equivalent to a maximum compression ratio of about 4:1. The model has been extended to multispectral imagery. The Airborne Visible and Infra Red Imaging Spectrometer (AVIRIS) is used as an example, as the noise in its 224 bands is well characterized. The model predicts a lower bound on the bit rate for the compressed data of about 5.5 b/pixel when a single codebook is used to encode all the bands. A separate codebook for each band (i.e., 224 codebooks) reduces this bound by 0.5 b/pixel to about 5.0 b/pixel, but 90% of this reduction is provided by only four codebooks. Empirical results corroborate these theoretical predictions.>
R. E. Roger, John F. Arnold
IEEE Trans. Geosci. Remote. Sens.1