Results 1  10
of
120
Invertible Integer DCT Algorithms
"... Integer DCTs have important applications in lossless coding. In this paper, an integer DCT of radix2 length n is understood to be a nonlinear, (left)invertible mapping which acts on Z^n and approximates the classical discrete cosine transform (DCT) of length n. In image compression, the DCT of typ ..."
Abstract
 Add to MetaCart
Integer DCTs have important applications in lossless coding. In this paper, an integer DCT of radix2 length n is understood to be a nonlinear, (left)invertible mapping which acts on Z^n and approximates the classical discrete cosine transform (DCT) of length n. In image compression, the DCT
Reversible integer DCT algorithms
"... Integer DCTs have important applications in lossless coding. An integer DCT of radix2 length n is a nonlinear, leftinvertible mapping which acts on Z^n and approximates the classical discrete cosine transform (DCT) of length n. In image compression, the DCT of type II (DCTII) is of special intere ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Integer DCTs have important applications in lossless coding. An integer DCT of radix2 length n is a nonlinear, leftinvertible mapping which acts on Z^n and approximates the classical discrete cosine transform (DCT) of length n. In image compression, the DCT of type II (DCTII) is of special
Integer DCTII by Lifting Steps
 IN: ADVANCES IN MULTIVARIATE APPROXIMATION
, 2002
"... In image compression, the discrete cosine transform of type II (DCTII) is of special interest. In this paper we use a new approach to construct an integer DCTII first considered in [14]. Our method is based on a factorization of the cosine matrix of type II into a product of sparse, orthogonal mat ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In image compression, the discrete cosine transform of type II (DCTII) is of special interest. In this paper we use a new approach to construct an integer DCTII first considered in [14]. Our method is based on a factorization of the cosine matrix of type II into a product of sparse, orthogonal
Optimum wordlength allocation of integer DCT andits
, 2003
"... Recently, the integer DCT (IntDCT), which transforms an integer input to an integer output, is attracting many researchers ’ attention as an effective methodfor DCTbasedlossy/lossless unifiedcoding. So far, there are many reports relevant to the IntDCT, but they have been limitedto a few topics s ..."
Abstract
 Add to MetaCart
Recently, the integer DCT (IntDCT), which transforms an integer input to an integer output, is attracting many researchers ’ attention as an effective methodfor DCTbasedlossy/lossless unifiedcoding. So far, there are many reports relevant to the IntDCT, but they have been limitedto a few topics
A global method for invertible integer DCT and integer wavelet algorithms
"... In this paper we present a new, simple, global method to derive invertible integertointeger mappings from given linear mappings 7! R . If F is given by F (x) = H n x and H n is an invertible matrix, then one can always nd a suitable factor such that the condition [ ) is satis ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
[ ) is satis ed. An invertible mapping F : Z 7! Z can now simply be de ned by F (x) = rd (H n x), and obviously, this nonlinear integer mapping is close to the linear mapping F . We apply this idea in order to derive a new invertible integer DCTII transform of radix2 length and new integer
Integer DCTbased Reversible Watermarking for Images Using Companding Technique
"... We present a high capacity reversible watermarking scheme using companding technique over integer DCT coefficients of image blocks. This scheme takes advantage of integer DCT coefficients ’ Laplacianshapelike distribution, which permits low distortion between the watermarked image and the original ..."
Abstract
 Add to MetaCart
We present a high capacity reversible watermarking scheme using companding technique over integer DCT coefficients of image blocks. This scheme takes advantage of integer DCT coefficients ’ Laplacianshapelike distribution, which permits low distortion between the watermarked image
Efficient prediction algorithm of integer DCT coefficients for H.264/AVC optimization
 IEEE Trans. Circuits Syst. Video Technol
, 2006
"... Abstract—This paper presents a novel efficient prediction algorithm to reduce redundant discrete cosine transform (DCT) and quantization computations for H.264 encoding optimization. A theoretical analysis is performed to study the sufficient condition for DCT coefficients to be quantized to zeros ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
efficients. Both the theoretical analysis and experimental results demonstrate that the proposed algorithm is superior to other algorithms in terms of the computational complexity reduction, encoded video quality, false acceptance rate, and false rejection rate. Index Terms—H.264, integer DCT, quantization. I.
LOSSY TO LOSSLESS IMAGE COMPRESSION BASED ON REVERSIBLE INTEGER DCT
"... A progressive image compression scheme is investigated using reversible integer discrete cosine transform (RDCT) which is derived from the matrix factorization theory. Previous techniques based on DCT suffer from bad performance in lossy image compression compared with wavelet image codec. And lossl ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A progressive image compression scheme is investigated using reversible integer discrete cosine transform (RDCT) which is derived from the matrix factorization theory. Previous techniques based on DCT suffer from bad performance in lossy image compression compared with wavelet image codec
A SIMPLIFIED REALIZATION OF NORMALIZED INTEGERWHT FORMULTIPLIERLESS INTEGER DCT
"... WalshHadamard transform (WHT) based multiplierless integer discrete cosine transform (IntDCT) has structural regularity even in short word length lifting coefficients. It, however, cannot apply to image coding without the quantization part because WHT was implemented by only ±1 adder operations w ..."
Abstract
 Add to MetaCart
WalshHadamard transform (WHT) based multiplierless integer discrete cosine transform (IntDCT) has structural regularity even in short word length lifting coefficients. It, however, cannot apply to image coding without the quantization part because WHT was implemented by only ±1 adder operations
Proceedings of the International Conference on Cognition and Recognition Video Compression using Integer DCT and Block Based Difference Coding
"... Conventional DCT maps integers to floating point numbers, the computation cost and the power consumption can not be neglected, especially the cost of floating point multiplication. Integer DCT is lowcomplexity implementation of DCT. It requires only shifts and adds. It requires small silicon area. ..."
Abstract
 Add to MetaCart
Conventional DCT maps integers to floating point numbers, the computation cost and the power consumption can not be neglected, especially the cost of floating point multiplication. Integer DCT is lowcomplexity implementation of DCT. It requires only shifts and adds. It requires small silicon area
Results 1  10
of
120