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.

A. B. Shahid Hussain

dblp:272/4811 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1975
—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%
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 › document image compression
facsimile coding
0.011975
Facsimile Coding by Skipping White · IEEE Trans. Commun. 1975
Image and video coding › lossless compression
run-length coding
0.011975
Facsimile Coding by Skipping White · IEEE Trans. Commun. 1975
Coding theory › source coding › source modeling
markov sources
0.011975
Facsimile Coding by Skipping White · IEEE Trans. Commun. 1975
Coding theory
source coding
0.011975
Facsimile Coding by Skipping White · IEEE Trans. Commun. 1975

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

white block skipping · 0.0first-order markov model · 0.0
YearPublicationVenuePosition
1975 Facsimile Coding by Skipping White
abstract
The white block skipping (WBS) method of coding binary facsimile images consists of breaking each scan line intoNpicture-element (pel) blocks, then using "0" as the code word for all-white blocks and "1" followed by the binary pattern in the block for non-all-white blocks. In the first part of this paper, we derive (based on a first-order Markov source model) the optimum block sizeNand its corresponding minimum bit rate as functions of the average white and black run lengths of the image. In the second part of this paper, we propose a modified coding scheme where all-white scan lines are essentially skipped. This modified scheme is found to be as efficient as run length coding for transmitting texts.
Thomas S. Huang, A. B. Shahid Hussain
IEEE Trans. Commun.2