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

Richard W. Harris

dblp:42/6360 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1995
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › rate control › bit allocation
adaptive bit allocation
0.011995
Comparison between adaptive search and bit allocation algorithms for image compression using vector quantization · IEEE Trans. Image Process. 1995
Image and video coding › rate control
bit allocation
0.011995
Comparison between adaptive search and bit allocation algorithms for image compression using vector quantization · IEEE Trans. Image Process. 1995
Image and video coding › quantization
vector quantization
0.011995
Comparison between adaptive search and bit allocation algorithms for image compression using vector quantization · IEEE Trans. Image Process. 1995

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

distortion threshold function · 0.0adaptive search · 0.0
YearPublicationVenuePosition
1995 Evaluation of a hearing compensation algorithm
abstract
A new hearing compensation algorithm based on a homomorphic multiplicative AGC (automatic gain control) is evaluated and compared against commercially available digitally programmable analog hearing aids. Both quantitative (speech recognition threshold and speech discrimination) and qualitative tests (estimation of perceived quality) were used in the evaluation. The new algorithm is shown to have made significant progress in restoring normal or near normal hearing for hearing impaired individuals.
David V. Anderson, Richard W. Harris, Douglas M. Chabries
ICASSP2
1995 Comparison between adaptive search and bit allocation algorithms for image compression using vector quantization
abstract
This article discusses bit allocation and adaptive search algorithms for mean-residual vector quantization (MRVQ) and multistage vector quantization (MSVQ). The adaptive search algorithm uses a buffer and a distortion threshold function to control the bit rate that is assigned to each input vector. It achieves a constant rate for the entire image but variable bit rate for each vector in the image. For a given codebook and several bit rates, we compare the performance between the optimal bit allocation and adaptive search algorithms. The results show that the performance of the adaptive search algorithm is only 0.20-0.53 dB worse than that of the optimal bit allocation algorithm, but the complexity of the adaptive search algorithm is much less than that of the optimal bit allocation algorithm.
Kyminh Liang, Chien-Min Huang, Richard W. Harris
IEEE Trans. Image Process.3