scispace - formally typeset
Open AccessJournal ArticleDOI

A DCT Approximation for Image Compression

Renato J. Cintra, +1 more
- 01 Aug 2011 - 
- Vol. 18, Iss: 10, pp 579-582
Reads0
Chats0
TLDR
An orthogonal approximation for the 8-point discrete cosine transform (DCT) is introduced, and could outperform state-of-the-art algorithms in low and high image compression scenarios, exhibiting at the same time a comparable computational complexity.
Abstract
An orthogonal approximation for the 8-point discrete cosine transform (DCT) is introduced. The proposed transformation matrix contains only zeros and ones; multiplications and bit-shift operations are absent. Close spectral behavior relative to the DCT was adopted as design criterion. The proposed algorithm is superior to the signed discrete cosine transform. It could also outperform state-of-the-art algorithms in low and high image compression scenarios, exhibiting at the same time a comparable computational complexity.

read more

Citations
More filters
Journal ArticleDOI

Improved 8-Point Approximate DCT for Image and Video Compression Requiring Only 14 Additions

TL;DR: A novel 8-point DCT approximation that requires only 14 addition operations and no multiplications is introduced and is compared to state-of-the-art DCT approximations in terms of both algorithm complexity and peak signal-to-noise ratio.
Journal ArticleDOI

Approximate Communication: Techniques for Reducing Communication Bottlenecks in Large-Scale Parallel Systems

TL;DR: Compression and approximate value prediction show great promise for reducing the communication bottleneck in bandwidth-constrained applications, while relaxed synchronization is found to provide large speedups for select error-tolerant applications, but suffers from limited general applicability and unreliable output degradation guarantees.
Journal ArticleDOI

Improved 8-point Approximate DCT for Image and Video Compression Requiring Only 14 Additions

TL;DR: In this article, the authors proposed an 8-point DCT approximation that requires only 14 addition operations and no multiplications, compared to state-of-the-art DCT approximations in terms of both algorithm complexity and peak signal-to-noise ratio.
Journal ArticleDOI

DCT-like transform for image compression requires 14 additions only

TL;DR: In this article, a low-complexity 8-point orthogonal approximate discrete cosine transform (DCT) is introduced. But the proposed transform requires no multiplications or bit-shift operations.
Journal ArticleDOI

Low-complexity 8-point DCT approximations based on integer functions

TL;DR: This paper proposes a collection of twelve approximations for the 8-point DCT based on integer functions that are suitable for hardware implementation in dedicated architectures and assessed in the context of JPEG-like image compression.
References
More filters
Journal ArticleDOI

Fundamentals of statistical signal processing: estimation theory

TL;DR: The Fundamentals of Statistical Signal Processing: Estimation Theory as mentioned in this paper is a seminal work in the field of statistical signal processing, and it has been used extensively in many applications.
Journal ArticleDOI

A universal image quality index

TL;DR: Although the new index is mathematically defined and no human visual system model is explicitly employed, experiments on various image distortion types indicate that it performs significantly better than the widely used distortion metric mean squared error.
MonographDOI

Functions of Matrices: Theory and Computation

TL;DR: A thorough and elegant treatment of the theory of matrix functions and numerical methods for computing them, including an overview of applications, new and unpublished research results, and improved algorithms.
Proceedings ArticleDOI

Practical fast 1-D DCT algorithms with 11 multiplications

TL;DR: A class of practical fast algorithms is introduced for the discrete cosine transform (DCT) and the structure of many of the published algorithms can be found in members of this class.
Related Papers (5)