Quad-Tree based Two Source Image Coding
Paul Michael Farrelle, Anil Kumar Jain · 1986
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.
Cited by 5 works. doi:10.1109/milcom.1986.4805874
Authors
References
- Synthetic Highs — An Experimental TV Bandwidth Reduction System
- Advances in mathematical models for image processing
- Contour Filling
- A Fast Karhunen-Loeve Transform for a Class of Random Processes
- Partial differential equations and finite difference methods in image processing--Part II: Image restoration
- Encoding of Images Based on a Two-Component Source Model
- Recursive Block Coding--A New Approach to Transform Coding
- Partial differential equations and finite-difference methods in image processing, part 1: Image representation