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

Manfred Tasto

dblp:134/8813 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1986
—ORCID · none

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

Computer networks · 2 · 2 first-authorTheory of computation · 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 networks
1 paper
Internet architecture and protocols · 100%
Computer graphics and multimedia
2 papers
Image and video coding · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
integrated services
0.011986
Terminals for Broad-band Office Communications · IEEE J. Sel. Areas Commun. 1986
Image and video coding
image compression
0.021973
Note on the Error Signal of Block Quantizers · IEEE Trans. Commun. 1973
A bound on the rate-distortion function and application to images · IEEE Trans. Inf. Theory 1972
Image and video coding › video compression
low bit rate coding
0.011973
Note on the Error Signal of Block Quantizers · IEEE Trans. Commun. 1973
Image and video coding
quantization
0.011973
Note on the Error Signal of Block Quantizers · IEEE Trans. Commun. 1973
Coding theory › source coding
rate-distortion theory
0.011972
A bound on the rate-distortion function and application to images · IEEE Trans. Inf. Theory 1972

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

source space partitioning · 0.0covariance-based bounding · 0.0error signal analysis · 0.0
YearPublicationVenuePosition
1986 Terminals for Broad-band Office Communications
abstract
The influence of broad-band communication networks on the evolution of office communication terminals is considered. Three trends are predicted:\bulletthe evolution of presently existing dedicated terminals towards higher speed and more sophisticated functionality;\bulletthe push of multifunctional workstations allowing simultaneous operation in several modes of communication, such as voice, data, text, facsimile, and graphics;\bulletthe occurrence of new communication services relating to video and CAD/CAM applications. A more detailed description of these trends is given, and some first experimental steps already done are described. The emphasis in this paper is on application aspects rather than on interfaces, protocols, coding methods, etc.
Manfred Tasto
IEEE J. Sel. Areas Commun.1
1973 Note on the Error Signal of Block Quantizers
abstract
We show that the error signal incurred by block quantizing stationary data is nonstationary under some conditions. Examples are presented that indicate that the mean square error is largest at the block edges. When block quantizers are used to encode pictures at low bit rates, this effect tends to make the block edges visible in the reconstructed picture.
Manfred Tasto, Paul A. Wintz
IEEE Trans. Commun.1
1972 A bound on the rate-distortion function and application to images
abstract
An upper bound on the rate-distortion function for discrete ergodic sources with memory is developed by partitioning the source sample space into a finite number of disjoint subsets and bounding the rates for each subset. The bound depends only on the mean vectors and covariance matrices for the subsets and is easy to compute. It is tighter than the Gaussian bound for sources that exhibit clustering of either the values or covariances of successive source outputs. The bound is evaluated for a certain class of pictorial data using both one-dimensional and two-dimensional blocks of picture elements. Two-dimensional blocks yield a tighter bound than one-dimensional blocks; both result in a significantly tighter bound than the Gaussian bound.
Manfred Tasto, Paul A. Wintz
IEEE Trans. Inf. Theory1