Upper bound on compression ratio for run-length encoding
Proceedings of the IEEEPublished 1 January 1972
K.G. Gray, R. S. Simpson
Citations4
SJR quartileQ1
SJR score6.25
SNIP11.38
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Based upon a first-order Markov model of video data, an upper bound on compression ratio is found for run-length encoding according to the Markov source.
Abstract
Based upon a first-order Markov model of video data, an upper bound on compression ratio is found for run-length encoding. The bound is compared with that of the Markov source.
Keywords
Computer Science
IEEE Transactions on Information TheoryA probabilistic model for run-length coding of pictures
115 Citations1959J. Capon
A first-order Markoff process representation for pictures is proposed in order to study the picture coding system known as run-length coding (differential-coordinate encoding), and is shown to yield an insight into the run- length coding system which might not otherwise be obtained.
Proceedings of the IEEEOptimizing a scheme for run length encoding
40 Citations1969S.D. Bradley
A method is developed of optimizing a code for data compression by run length encoding and the performance of this code (13.20 compression factor) is compared with the theoretically attainable compression based on the information content of the probability distribution of run lengths.