Filters








574 Hits in 6.0 sec

Low-complexity pruned 8-point DCT approximations for image encoding

Vitor de A. Coutinho, Renato J. Cintra, Fabio M. Bayer, Sunera Kulasekera, Arjuna Madanayake
2015 2015 International Conference on Electronics, Communications and Computers (CONIELECOMP)  
Two multiplierless pruned 8-point discrete cosine transform (DCT) approximation are presented. Both transforms present lower arithmetic complexity than state-of-the-art methods.  ...  The performance of such new methods was assessed in the image compression context. A JPEG-like simulation was performed, demonstrating the adequateness and competitiveness of the introduced methods.  ...  CONCLUSION In this paper, we introduced two pruning-based DCT approximations with very low arithmetic complexity.  ... 
doi:10.1109/conielecomp.2015.7086923 dblp:conf/conielecomp/CoutinhoCBKM15 fatcat:fke5lzks65asfofr3b2muvu4xu

A multiplierless pruned DCT-like transformation for image and video compression that requires ten additions only

Vítor A. Coutinho, Renato J. Cintra, Fábio M. Bayer, Sunera Kulasekera, Arjuna Madanayake
2015 Journal of Real-Time Image Processing  
A multiplierless pruned approximate 8-point discrete cosine transform (DCT) requiring only 10 additions is introduced.  ...  The 8x8 block rate is 36 MHz.The DCT approximation was embedded into HEVC reference software; resulting video frames, at up to 327 Hz for 8-bit RGB HEVC, presented negligible image degradation.  ...  Proposed pruned approximate DCT Proposed approximation In [4] a very low-complexity 8-point DCT approximation was introduced and it is referred to as the modified rounded DCT (RDCT).  ... 
doi:10.1007/s11554-015-0492-8 fatcat:da3cd6nqs5hargto7uz7tsep7a

Energy-Efficient 8-Point DCT Approximations: Theory and Hardware Architectures

Renato J. Cintra, Fábio M. Bayer, Vítor A. Coutinho, Sunera Kulasekera, Arjuna Madanayake, André Leite
2015 Circuits, systems, and signal processing  
In this paper, new 8-point DCT approximations with very low arithmetic complexity are presented. The new transforms are proposed based on pruning state-of-the-art DCT approximations.  ...  Several low-complexity integer approximations for the DCT have been proposed for both 1-D and 2-D signal analysis.  ...  Images were split into 8×8 subimages. Resulting subimages were submitted to each of the discussed pruned DCT approximation for all values of K.  ... 
doi:10.1007/s00034-015-0233-z fatcat:s2nh6lsut5f4fjvlmlmd6iuskm

A Generalized Approach to Linear Transform Approximations with Applications to the Discrete Cosine Transform

Yinpeng Chen, Hari Sundaram
2008 EURASIP Journal on Advances in Signal Processing  
(b) We propose the idea of the complexity-distortion framework and present an algorithm to efficiently estimate the complexity distortion function and search for optimal transform approximation using several  ...  There are three key ideas: (a) a joint transform pruning and Haar basis projection-based approximation technique.  ...  Figure 5 : 5 Resolution indicator matrices for DCT pruning on an 8 × 8 image block.  ... 
doi:10.1155/2008/736460 fatcat:pendkc6zjrhd5ozdfwdr55smme

A Low-Complexity Multiple Description Video Coder Based On 3D-Transforms

Karen Egiazarian, Atanas Gotchev, Andrey Norkin
2006 Zenodo  
The encoder needs only 8 lowest coefficients of 1D-DCT. For this reason, we use pruned DCT as in [12] .  ...  The 3D-DCT coder, used in comparison was implemented by RCF approach, that gives 15.357 operations/point. The forward pruned 3D-DCT for the shaper requires only 9.25 op/point.  ... 
doi:10.5281/zenodo.52888 fatcat:kxncesljevefrkgl7vzbgiaowq

Design of energy-efficient discrete cosine transform using pruned arithmetic circuits

Jeremy Schlachter, Vincent Camus, Christian Enz
2016 2016 IEEE International Symposium on Circuits and Systems (ISCAS)  
Image and video processing is one of the best candidate for applying such techniques.  ...  As one of the key building blocks, Discrete Cosine Transform (DCT) accelerators are investigated using pruned arithmetic circuits.  ...  where T is an 8 x 8 matrix in the case of an 8 point DCT and X and W are row and column vectors.  ... 
doi:10.1109/iscas.2016.7527240 dblp:conf/iscas/SchlachterCE16 fatcat:m46mjn7ndfbstcafey2otq2d5q

Low-Complexity Multiple Description Coding of Video Based on 3D Block Transforms

Andrey Norkin, Atanas Gotchev, Karen Egiazarian, Jaakko Astola
2007 EURASIP Journal on Embedded Systems  
The shaper is obtained by block-wise pruned 3D-DCT. The residual sequence is coded by 3D-DCT or hybrid, LOT+DCT, 3D-transform. The coding scheme is targeted to mobile devices.  ...  It has low computational complexity and improved robustness of transmission over unreliable networks. The coder is able to work at very low redundancies.  ...  The encoder needs only the 8 lowest coefficients of 1D-DCT. For this reason, we use pruned DCT as in [25] .  ... 
doi:10.1186/1687-3963-2007-038631 fatcat:iuthiqrgszc7jcsayilaa6mmsm

Low-Complexity Multiple Description Coding of Video Based on 3D Block Transforms

Andrey Norkin, Atanas Gotchev, Karen Egiazarian, Jaakko Astola
2007 EURASIP Journal on Embedded Systems  
The shaper is obtained by block-wise pruned 3D-DCT. The residual sequence is coded by 3D-DCT or hybrid, LOT+DCT, 3D-transform. The coding scheme is targeted to mobile devices.  ...  It has low computational complexity and improved robustness of transmission over unreliable networks. The coder is able to work at very low redundancies.  ...  The encoder needs only the 8 lowest coefficients of 1D-DCT. For this reason, we use pruned DCT as in [25] .  ... 
doi:10.1155/2007/38631 fatcat:dypkla45kjca7cbpderlow7sje

Variable complexity DCT approximations driven by an HVQ-based analyzer

R.L. de Queiroz
2002 IEEE transactions on circuits and systems for video technology (Print)  
Transform approximations are explored for speeding up the software compression of images and video.  ...  Approximations are used to replace the regular discrete cosine transform (DCT) whenever only a few DCT coefficients are actually encoded.  ...  The method was shown to be efficient to substitute the DCT in JPEG for low bit rates. Fig. 1 . 1 Approximated transform to approach a reduced M-point DCT (M = NK).  ... 
doi:10.1109/tcsvt.2002.805507 fatcat:gnjsvqs6j5dwtcruy5wbjmduym

Design and Applications of Approximate Circuits by Gate-Level Pruning

Jeremy Schlachter, Vincent Camus, Krishna V. Palem, Christian Enz
2017 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
for image and video processing applications.  ...  Even though arithmetic circuits represent less than 4 % of the entire DCT area, it is shown that the Gate-Level Pruning technique can lead to 21 % energy-delay-area savings over the entire system for a  ...  Image encoding algorithms used for instance in JPEG encoding generally compute the DCT per pixel blocks.  ... 
doi:10.1109/tvlsi.2017.2657799 fatcat:5gblp5efzrdcbndlqelcvjhsy4

Using Pruning and Truncation for Power-Efficient 2-D Approximate Tchebichef Transform Hardware Architecture

Guilherme Paim, Leandro M. G. Rocha, Gustavo M. Santana, Leonardo B. Soares, Eduardo A. C. Da Costa, Sergio Bampi
2018 Journal of Integrated Circuits and Systems  
We have also selectively pruned the rows of the state-of-the-art approximate DTT matrix.  ...  The DTT (Discrete Tchebichef Transform) represents a discrete class of the Chebyshev orthogonal polynomials, and it is an al-ternative for the DCT (Discrete Cosine Transform), commonly used in picture  ...  ACKNOWLEDGEMENTS The authors would like to thank Fapergs, Capes and CNPq Brazilian agencies for financial support to our research.  ... 
doi:10.29292/jics.v13i1.22 fatcat:sw7spt5x3basfkn5h2f2px5nfi

Low-Complexity Loeffler DCT Approximations for Image and Video Coding

Diego F. G. Coelho, Renato J. Cintra, Fábio M. Bayer, Sunera Kulasekera, Arjuna Madanayake, Paulo Martinez, Thiago L. T. Silveira, Raíza S. Oliveira, Vassil S. Dimitrov
2018 Journal of Low Power Electronics and Applications  
As a result, a new class of 8-point DCT approximations was proposed, capable of unifying the mathematical formalism of several 8-point DCT approximations archived in the literature.  ...  Efficient approximations and their scaled 16- and 32-point versions are embedded into image and video encoders, including a JPEG-like codec and H.264/AVC and H.265/HEVC standards.  ...  Some noteworthy topics are: (i) cosine-sine decomposition to compute the 8-point DCT [9] ; (ii) low-complexity-pruned 8-point DCT approximations for image encoding [10] ; (iii) improved 8-point approximate  ... 
doi:10.3390/jlpea8040046 fatcat:yyencv7tivdtjd7p5ue6ixfrim

Area and power efficient DCT architecture for image compression

Vaithiyanathan Dhandapani, Seshasayanan Ramachandran
2014 EURASIP Journal on Advances in Signal Processing  
The new class of transform requires only 12 additions, which highly reduces the computational complexity and achieves a performance in image compression that is comparable to that of the existing approximated  ...  The discrete cosine transform (DCT) is one of the major components in image and video compression systems.  ...  The authors would also like to thank the associate editor and anonymous reviewers for their valuable comments, which significantly helped to improve this paper.  ... 
doi:10.1186/1687-6180-2014-180 fatcat:3zmp26kwl5aqlgwsqlsed7gbmy

A Class of Low-Complexity DCT-like Transforms for Image and Video Coding

Thiago L. T. Da Silveira, Diego Ramos Canterle, Diego F. G. Coelho, Vitor A. Coutinho, Fabio M. Bayer, Renato J. Cintra
2021 IEEE transactions on circuits and systems for video technology (Print)  
Four novel orthogonal low-complexity 8-point DCT approximations are obtained by solving a multicriteria optimization problem.  ...  The optimal 8-point transforms are scaled to lengths 16 and 32 while keeping the arithmetic complexity low.  ...  Acknowledgments We thank for the financial support from Fundação de Amparo à Pesquisa do Estado do Rio Grande do Sul (FAPERGS), Conselho Nacional de Desenvolvimento Científico and Tecnológico (CNPq), and  ... 
doi:10.1109/tcsvt.2021.3134054 fatcat:bufgrh2wkbdzdbu3irzx24xzka

Adaptive Content Frame Skipping for Wyner–Ziv-Based Light Field Image Compression

Huy PhiCong, Stuart Perry, Xiem HoangVan
2020 Electronics  
Light field (LF) imaging introduces attractive possibilities for digital imaging, such as digital focusing, post-capture changing of the focal plane or view point, and scene depth estimation, by capturing  ...  However, LF image compression is still a great challenge, not only due to light field imagery requiring a large amount of storage space and a large transmission bandwidth, but also due to the complexity  ...  compression performance for LF data with low encoding complexity.  ... 
doi:10.3390/electronics9111798 fatcat:orzfqah2pbbvnksprarlf3vyrm
« Previous Showing results 1 — 15 out of 574 results