Complexity controllable DCT for real-time H.264 encoder
Journal of Visual Communication and Image Representation
Łukasiewicz transform and its application to compression and reconstruction of digital images
Information Sciences: an International Journal
Multiplierless and fully pipelined JPEG compression soft IP targeting FPGAs
Microprocessors & Microsystems
Block-Based Compressed Sensing of Images and Video
Foundations and Trends in Signal Processing
Multimedia Tools and Applications
A high performance video transform engine by using space-time scheduling strategy
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Image encryption based on the finite field cosine transform
Image Communication
Low-complexity 8-point DCT approximations based on integer functions
Signal Processing
| Hi-index | 35.68 |
Several fast algorithms for computing discrete cosine transforms (DCTs) and their inverses on multidimensional inputs of sizes which are powers of 2 are introduced. Because the 1-D 8-point DCT and the 2-D 8×8-point DCT are so widely used, they are discussed in detail. Algorithms for computing scaled DCTs and their inverses are also presented. These have applications in compression of continuous tone image data, where the DCT is generally followed by scaling and quantization