Journal Article10.1109/TCOM.1986.1096509
Recursive Block Coding--A New Approach to Transform Coding
P. Farrelle,A. Jain +1 more
63
TL;DR: Improved performance of recursive block coding algorithms results in suppression of the block-boundary effect commonly observed in traditional transform coding techniques, illustrated by comparing RBC with cosine transform coding using both one- and twodimensional algorithms.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Introduction to data compression
Khalid Sayood
- 01 Jan 1996
TL;DR: The author explains the development of the Huffman Coding Algorithm and some of the techniques used in its implementation, as well as some of its applications, including Image Compression, which is based on the JBIG standard.
2.6K
Coding of arbitrarily shaped image segments based on a generalized orthogonal transform
TL;DR: An application of the derived algorithms to image sequence coding at low data rates is shown, which is based on a segmentation of the motion compensated prediction error image.
258
A fast Karhunen-Loeve transform for a class of random processes
A. Jain
- 01 Sep 1976
TL;DR: The Karhunter-Loeve transform for a class of signals is proven to be a set of periodic sine functions and this Karhunen- Loeve series expansion can be obtained via an FFT algorithm, which could be useful in data compression and other mean-square signal processing applications.
222
Tree-structured scene adaptive coder
TL;DR: A new type of scene adaptive coder that involves a quadtree mean decomposition of the motion-compensated frame-to-frame difference signal followed by a scalar quantization of the local means to achieve a subjective image quality that is as good or better than that of the traditional transform-based counterpart.
216
Adaptive postfiltering of transform coefficients for the reduction of blocking artifacts
Tao Chen,Hong Ren Wu,Bin Qiu +2 more
TL;DR: This paper proposes a novel postprocessing technique for reducing blocking artifacts in low-bit-rate transform-coded images to alleviate the accuracy loss of transform coefficients, which is introduced by the quantization process.
215
References
Discrete Cosine Transform
TL;DR: In this article, a discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed, which can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
5.1K
Linear prediction: A tutorial review
John Makhoul
- 01 Apr 1975
TL;DR: This paper gives an exposition of linear prediction in the analysis of discrete signals as a linear combination of its past values and present and past values of a hypothetical input to a system whose output is the given signal.
4.4K
Discrete Optimization Via Marginal Analysis
TL;DR: Discrete optimization subject to one constraint is attacked by Lagrangian analysis and the complete family of undominated allocations is generated.
403
A Fast Karhunen-Loeve Transform for a Class of Random Processes
TL;DR: In this paper, the Karhunen-Loeve transform for a class of signals is proven to be a set of periodic sine functions and this k-means expansion can be obtained via an FFT algorithm.
232