Results 271 to 280 of about 38,586 (315)
Some of the next articles are maybe not open access.
Hallucinating Face in the DCT Domain
IEEE Transactions on Image Processing, 2011In this paper, we propose a novel learning-based face hallucination framework built in the DCT domain, which can produce a high-resolution face image from a single low-resolution one. The problem is formulated as inferring the DCT coefficients in frequency domain instead of estimating pixel intensities in spatial domain.
Wei Zhang 0021, Wai-kuen Cham
openaire +2 more sources
The discrete cosine transform DCT-4 and DCT-8
Proceedings of the 4th international conference conference on Computer systems and technologies e-Learning - CompSysTech '03, 2003In paper two types of the discrete cosine (end sine) transforms (DCT/DST) are analyzed on the base of the linear representations of finite groups and geometrical approach. This transforms are useful for multirate systems, adaptive filtering and compression of speech signals and images.
openaire +1 more source
Invariant spaces and cosine transforms DCT - 2 and DCT - 6
Proceedings of the 5th international conference on Computer systems and technologies - CompSysTech '04, 2004In paper two types of the discrete cosine (and sine) transforms (DCT/DST) are analyzed. These transforms are useful for many applications. It is shown that if an operator, connected with the Discrete Fourier Transform (DFT), is referred to an appropriate basis it takes block-diagonal form.
openaire +1 more source
Image Degradation by Zeroing Block DCT vs. Full DCT Coefficients
Proceedings of the 2020 2nd International Conference on Information Technology and Computer Communications, 2020As Discrete Cosine Transform (DCT) has been applied widely in image processing, it has been extensively studied in recent years. It is an interesting research topic to reveal the processing effect of block DCT and full DCT on the same image. In this paper, it is found that the block size of DCT is directly related to the impact of different DCT ...
Shuyi Ying, Ruihan Yin
openaire +1 more source
Squeezing the DCT to Fight Camouflage
Journal of Mathematical Imaging and Vision, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcos Escudero-Viñolo, Jesús Bescós
openaire +2 more sources
1995
Due to the importance of the two-dimensional (2-D) DCT in digital image processing, particularly in video compression, various algorithms and architectures have been proposed for its implementation. These methods can be divided into two main categories. The first category includes techniques from linear matrix analysis and decomposition. Lee’s fast DCT
Vasudev Bhaskaran +1 more
openaire +1 more source
Due to the importance of the two-dimensional (2-D) DCT in digital image processing, particularly in video compression, various algorithms and architectures have been proposed for its implementation. These methods can be divided into two main categories. The first category includes techniques from linear matrix analysis and decomposition. Lee’s fast DCT
Vasudev Bhaskaran +1 more
openaire +1 more source
Region support DCT (RS-DCT) for coding of arbitrarily shaped texture
IEEE Transactions on Circuits and Systems for Video Technology, 2002Object-based coding is a promising technique for next-generation coding. Arbitrarily shaped texture coding is the key technique for object-based coding. This paper proposes a new technique, called "region support DCT", for arbitrarily shaped texture coding.
Shinichi Sakaida, Yoshiaki Shishikui
openaire +1 more source
DCT-domain blind measurement of blocking artifacts in DCT-coded images
2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221), 2002A method for DCT-domain blind measurement of blocking artifacts is proposed. By constituting a new block across any two adjacent blocks, the blocking artifact is modeled as a 2-D step function. A fast DCT-domain algorithm has been derived to constitute the new block and extract all parameters needed.
Alan C. Bovik, Shizhong Liu
openaire +1 more source
SIGGRAPH Asia 2015 Technical Briefs, 2015
j In this paper, we propose an acceleration method for image denoising with a redundant discrete cosine transform (R-DCT). Image denoising is essential for image processing, and its efficiency is important for graphics applications. R-DCT with a hard-thresholding or shrinkage method can perform denoising while keeping detail textures.
Shu Fujita +3 more
openaire +1 more source
j In this paper, we propose an acceleration method for image denoising with a redundant discrete cosine transform (R-DCT). Image denoising is essential for image processing, and its efficiency is important for graphics applications. R-DCT with a hard-thresholding or shrinkage method can perform denoising while keeping detail textures.
Shu Fujita +3 more
openaire +1 more source
Associative architecture for fast DCT
Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), 2002This paper discusses an associative processor architecture designed to meet the demands of real-time image processing applications. In a single chip, this architecture provides thousands of processors-one for each pixel, in the form of associative memory.
Yossi Shain +2 more
openaire +1 more source

