Quad-Tree based Two Source Image Coding
- 1 October 1986
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In this paper we describe an adaptation of our two source RBC algorithm[1] where we introduce a variable block size. The blocks are chosen to meet some uniformity criterion and are generated via a quad-tree segmentation of the image which allows the segmentation overhead to be coded very efficiently. The prediction component is improved over standard RBC prediction with a fixed block size and some images may be coded using the prediction alone. However it is more economical to also code the residual component for more detailed images.Keywords
This publication has 8 references indexed in Scilit:
- Recursive Block Coding--A New Approach to Transform CodingIEEE Transactions on Communications, 1986
- Contour FillingPublished by Springer Nature ,1982
- Advances in mathematical models for image processingProceedings of the IEEE, 1981
- Partial differential equations and finite difference methods in image processing--Part II: Image restorationIEEE Transactions on Automatic Control, 1978
- Encoding of Images Based on a Two-Component Source ModelIEEE Transactions on Communications, 1977
- Partial differential equations and finite-difference methods in image processing, part 1: Image representationJournal of Optimization Theory and Applications, 1977
- A Fast Karhunen-Loeve Transform for a Class of Random ProcessesIEEE Transactions on Communications, 1976
- Synthetic Highs — An Experimental TV Bandwidth Reduction SystemJournal of the SMPTE, 1959