Recursive Block Coding--A New Approach to Transform Coding
Paul Michael Farrelle, A. Jain · IRE Transactions on Communications Systems · 1986
The concept of fast KL transform coding introduced earlier [7], [8] for first-order Markov processes and certain random fields has been extended to higher order autoregressive (AR) sequences and practical images yielding what we call recursive block coding (RBC) algorithms. In general, the rate-distortion performance for these algorithms is significantly superior to that of the conventional block KL transform algorithm. Moreover, these algorithms permit the use of small size transforms, thereby removing the need for fast transforms and making the hardware implementation of such coders more appealing. This improved performance has been verified for practical image data and results in suppression of the block-boundary effect commonly observed in traditional transform coding techniques. This is illustrated by comparing RBC with cosine transform coding using both one- and twodimensional algorithms. Examples of RBC encoded images at various rates are given.
Cited by 51 works. doi:10.1109/tcom.1986.1096509
Authors
References
- Analysis of a complex of statistical variables into principal components.
- Linear prediction: A tutorial review
- Discrete Cosine Transform
- Hadamard transform image coding
- Orthogonal Transforms for Digital Signal Processing
- Image data compression: A review
- Advances in mathematical models for image processing
- Discrete Optimization Via Marginal Analysis
- A Fast Karhunen-Loeve Transform for a Class of Random Processes
- A Sinusoidal Family of Unitary Transforms