K. G. Castor

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

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

Theory of computation · 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%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › shape coding
line drawing encoding
0.011985
A rate and distortion analysis of chain codes for line drawings · IEEE Trans. Inf. Theory 1985
Image and video coding
rate-distortion analysis
0.011985
A rate and distortion analysis of chain codes for line drawings · IEEE Trans. Inf. Theory 1985
Coding theory › source coding › variable-length codes
chain code
0.011985
A rate and distortion analysis of chain codes for line drawings · IEEE Trans. Inf. Theory 1985
Coding theory
source coding
0.011985
A rate and distortion analysis of chain codes for line drawings · IEEE Trans. Inf. Theory 1985

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

rate-distortion theory · 0.0
YearPublicationVenuePosition
1985 A rate and distortion analysis of chain codes for line drawings
abstract
The performance of chain codes for line drawings in the framework of source coding with a fidelity criterion is investigated. A formal characterization is given for a broad class of chain codes that includes the generalized chain codes of Freeman and the convex quantizers of Koplowitz. Measures of distortion (fidelity) and rate (efficiency) are introduced. The distortion and rate are calculated for several types of chain codes applied to straight and slowly curving lines. Several statistical models for straight lines are introduced and the average performance of chain codes for these models is investigated.
David L. Neuhoff, K. G. Castor
IEEE Trans. Inf. Theory2