# Reversible discrete cosine transform

@article{Komatsu1998ReversibleDC, title={Reversible discrete cosine transform}, author={Kunitoshi Komatsu and Kaoru Sezaki}, journal={Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181)}, year={1998}, volume={3}, pages={1769-1772 vol.3} }

In this paper a reversible discrete cosine transform (RDCT) is presented. The N-point reversible transform is firstly presented, then the 8-point RDCT is obtained by substituting the 2 and 4-point reversible transforms for the 2 and 4-point transforms which compose the 8-point discrete cosine transform (DCT), respectively. The integer input signal can be losslessly recovered, although the transform coefficients are integer numbers. If the floor functions are ignored in RDCT, the transform is…

## 50 Citations

Parameterized reversible integer discrete cosine transforms

- MathematicsIS&T/SPIE Electronic Imaging
- 2004

A general parameterized integer-to-integer discrete cosine transform (DCT) is introduced and the optimality is with respect to the minimal mean-square-error of the integer DCT compared with the original DCT with the float-point multiplication.

New Method of Calculation of Reversible Integer 1-D DCTs

- Computer Science
- 2005

A new concept of the kernel integer discrete cosine transform is introduced, that allows the calculation of the eight-point IDCT of type II to the kernel IDCT with a fewer operations of multiplication and floor function.

New method of calculation of reversible integer 1D DCTs

- Computer ScienceIS&T/SPIE Electronic Imaging
- 2005

A new concept of the kernel integer discrete cosine transform is introduced, that allows the calculation of the eight-point IDCT of type II to the kernel IDCT with a fewer operations of multiplication and floor function.

Reversible integer 2D Fourier transform

- EngineeringElectronic Imaging
- 2009

The 2-D reversible integer discrete Fourier transform (RiDFT), which is based on the concept of the paired representation of the pair of 1-D signals which carry the spectral information of the signal at disjoint sets of frequency-points, is described.

A lossless H.263 video codec using the reversible DCT

- EngineeringInternational Conference on Electrical, Electronic and Computer Engineering, 2004. ICEEC '04.
- 2004

In this paper, an N-point reversible discrete cosine transform (RDCT) based H.263 video codec is presented, then 8-point RDCT is obtained by substituting the 2 and 4- point reversible transforms for 2 and4-point transforms which compose 8- point discrete cosines transform (DCT), respectively.

A method for realizing reversible integer type-IV discrete cosine transform (IntDCT-IV)

- Computer ScienceProceedings 7th International Conference on Signal Processing, 2004. Proceedings. ICSP '04. 2004.
- 2004

The proposed method exhibits low rounding number (1.5 N), low complexity O(Nlog/sub 2/N) and is the most accurate to its counterpart floating point DCT-IV transformation when the processing block length is higher than 16.

Novel Reversible Integer Fourier Transform With Control Bits

- MathematicsIEEE Transactions on Signal Processing
- 2007

This paper presents a novel concept of the reversible integer discrete Fourier transform (RiDFT) of order 2r, r > 2, when the transform is split by the paired representation into a minimum set of…

Reversible Interger 2-D Discrete Fourier Transform by Control Bits

- Engineering2010 20th International Conference on Pattern Recognition
- 2010

The 2-D reversible integer discrete Fourier transform (RiDFT), which is based on the concept of the paired representation of the 2- D image, which is referred to as the unique2-D frequency and 1-D time representation, is described.

2D lossless discrete cosine transform

- EngineeringProceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)
- 2001

The design of a two dimensional lossless DCT based on a 4-point twodimensional lossless WHT is presented and it is indicated that its number of rounding off becomes smaller than that of the one dimensional lossed DCT and, as a result, the difference between its transform coefficients and those of the DCT becomes small.

## References

SHOWING 1-8 OF 8 REFERENCES

Reversible transform coding of images

- Computer ScienceOther Conferences
- 1996

This paper proposes some reversible transform coding methods that correspond to the discrete Walsh-Hadamard, Haar, and cosine transform, and proposes a method of which the number of levels of the transform coefficient is the same as that of the input signal.

Reversible image compression via multiresolution representation and predictive coding

- Computer ScienceOther Conferences
- 1993

A new image transformation suited for reversible (lossless) image compression is presented, which uses a simple pyramid multiresolution scheme which is enhanced via predictive coding, and which is comparable to other efficient lossy compression methods.

Reversible subband coding of images

- EngineeringOther Conferences
- 1995

In this paper, reversible subband coding of images are proposed. The high-band signals of conventional one-dimensional reversible filter banks were extrapolative prediction error signals or…

CREW: Compression with Reversible Embedded Wavelets

- Computer ScienceProceedings DCC '95 Data Compression Conference
- 1995

CREW provides state of the art lossless compression of medical images (greater than 8 bits deep), and lossy and lossed compression of 8 bit deep images with a single system.

Lossless DCT Picture Coding.

- Computer Science
- 1996

Lossless DCT coding is proposed in which the transform matrix is modified with short length words, then reversible quantizer is introduced for transform vectors, and makes lossless com pression coding possible.

A study on perfect reconstructive subband coding

- EngineeringIEEE Trans. Circuits Syst. Video Technol.
- 1991

New architectures for short-kernel filters are developed which can reduce the entropy of subband signals better than conventional two-tap filters.

New Networks for Perfect Inversion and Perfect Reconstruction

- MathematicsIEEE J. Sel. Areas Commun.
- 1992

A new network structure is presented that realizes perfect inversion networks (PINs) and perfect reconstruction networks (PRNs) and has a ladderlike shape and a predescribed symmetry between the forward and inverse network or between the split and merge bank.

RSSKF

- RSSKF