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

G. Stephen Zabele

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

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

Artificial intelligence and machine learning · 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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video coding › shape coding
contour coding
0.011985
Fourier Encoding of Closed Planar Boundaries · IEEE Trans. Pattern Anal. Mach. Intell. 1985
Image and video coding
shape coding
0.011985
Fourier Encoding of Closed Planar Boundaries · IEEE Trans. Pattern Anal. Mach. Intell. 1985
Image and video coding
transform coding
0.011985
Fourier Encoding of Closed Planar Boundaries · IEEE Trans. Pattern Anal. Mach. Intell. 1985
Image and video coding
rate-distortion optimization
0.011985
Fourier Encoding of Closed Planar Boundaries · IEEE Trans. Pattern Anal. Mach. Intell. 1985

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

rate-distortion theory · 0.0circular gaussian autoregressive model · 0.0
YearPublicationVenuePosition
1985 Fourier Encoding of Closed Planar Boundaries
abstract
A circular Gaussian autoregressive (CGAR) source is used as a model for closed planar curves. A class of suboptimal encoding schemes is considered which separately quantize the Fourier coefficients of the boundary. Application of rate-distortion theoretic techniques leads to parametric equations describing the optimal encoding bound. Interpretation of these equations establishes a sampling criterion and a computationally efficient transform encoding scheme for the suboptimal class. Several variants of this transform encoding scheme are suggested and compared to the encoding bound.
G. Stephen Zabele, Jack Koplowitz
IEEE Trans. Pattern Anal. Mach. Intell.1