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

Andrew G. Tescher

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

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

Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 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 › transform coding
adaptive transform coding
0.011986
Adaptive Transform Coding Based on Chain Coding Concepts · IEEE Trans. Commun. 1986
Image and video coding › shape coding
chain code
0.011986
Adaptive Transform Coding Based on Chain Coding Concepts · IEEE Trans. Commun. 1986
Image and video coding
transform coding
0.011986
Adaptive Transform Coding Based on Chain Coding Concepts · IEEE Trans. Commun. 1986
Image and video coding
image compression
0.011986
Adaptive Transform Coding Based on Chain Coding Concepts · IEEE Trans. Commun. 1986

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

run-length coding · 0.0chain coding · 0.0
YearPublicationVenuePosition
1993 Sonar Feature-Based Bandwidth Compression
John A. Saghri, Andrew G. Tescher
J. Vis. Commun. Image Represent.2
1986 Adaptive Transform Coding Based on Chain Coding Concepts
abstract
Chain coding technique, originally developed for digital representation and processing of line drawing data, has been implemented in a transform image coding algorithm with significant performance improvement. The algorithm is based on the observation that the boundary of the regions of zero coefficients within a transform block can be efficiently represented by sequences of fixed line segments (chains). Preliminary results indicate significant improvements over the basic coder algorithm in which the consecutive zeros in the transform block were runlength coded. The additional implementation complexity is modest.
John A. Saghri, Andrew G. Tescher
IEEE Trans. Commun.2