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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Paul D. Israelsen

dblp:120/6609 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Computer networks · 1

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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video coding › quantization › vector quantization
codebook design		 0.011994
Efficient codebooks for vector quantization image compression with an adaptive tree search algorithm · IEEE Trans. Commun. 1994
Image and video coding
image compression		 0.011994
Efficient codebooks for vector quantization image compression with an adaptive tree search algorithm · IEEE Trans. Commun. 1994
Image and video coding › quantization
vector quantization		 0.011994
Efficient codebooks for vector quantization image compression with an adaptive tree search algorithm · IEEE Trans. Commun. 1994
Image and video coding
rate-distortion		 0.011994
Efficient codebooks for vector quantization image compression with an adaptive tree search algorithm · IEEE Trans. Commun. 1994

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

vector quantization · 0.0tree search · 0.0
YearPublicationVenuePosition
1994 Efficient codebooks for vector quantization image compression with an adaptive tree search algorithm
abstract
This paper discusses some algorithms to be used for the generation of an efficient and robust codebook for vector quantization (VQ). Some of the algorithms reduce the required codebook size by 4 or even 8 b to achieve the same level of performance as some of the popular techniques. This helps in greatly reducing the complexity of codebook generation and encoding. We also present a new adaptive tree search algorithm which improves the performance of any product VQ structure. Our results show an improvement of nearly 3 dB over the fixed rate search algorithm at a bit rate of 0.75 b/pixel.>
Vijay S. Sitaram, Chien-Min Huang, Paul D. Israelsen
 IEEE Trans. Commun.3