Prediction trees and lossless image compression

Data Compression Conference Proceedings

Volumn 1991-April, Issue , 1991, Pages 83-92

  Memon, Nasir D ^a   Magliveras, Spyros S ^a   Sayood, Khalid ^b  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORECASTING;

IMAGE DATA; LOSSLESS IMAGE COMPRESSION; NON LINEAR; PREDICTION TECHNIQUES; PREDICTION TREE; SPANNING TREE; SPEECH DATA;

IMAGE COMPRESSION;

EID: 85007094218     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.1991.213375     Document Type: Conference Paper

References (9)

1. Bondy J. A. and Murty U. S. R. Graph theory with applications. North-Holland, 1976.
2. Lempel A. and Ziv J. Compression of two-dimensional data. IEEE Transcations on Information Theory, IT-32 (l): l-8, January 1986.
3. Prim R. C. Shortest connection network and some generalisations. Bell System Tech. J., 36: 1389-1401, 1957.
4. Cheriton D. and Tarjan R. E. Finding minimum spanning trees. SIAM Journal of Computing, 5(4):724-741, December 1976.
5. Narsingh Deo. Graph theory with applications to engineering and computer science. Prentice-Hall, 1974.
6. Todd S. Langdon G. G. and Rissanen J. Parameter reduction and context selection for compression of gray scale images. IBM J. Ret. Develop., 29(2):188-193, March 1985.
7. Kruskal J. B. Jr. On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc., 7: 48-50, 1956.
8. Netravili A. N. and Haskell B. G. Digital Pictures - Representation and Comprettion. Applications of Communications Theory Series. Plenum Press, 1988.
9. Harrison C. W. Experiments with linear prediction in television. Bell System Tech. J., 31: 764-783, July 1952.