• Journal of information and communication convergence engineering
• /
• v.11 no.4
• /
• pp.293-297
• /
• 2013

Delivery of high quality video over a wide area network with large number of users poses great challenges for the video communication system. To ensure video quality, multiple descriptions have recently attracted various attention as a way of encoding and visual information delivery over wireless network. We propose a new efficient multiple description coding (MDC) technique. Quincunx lattice sub-sampling is used for generating multiple descriptions of an image. In this paper, we propose the application of a directional discrete cosine transform (DCT) to a sub-sampled quincunx lattice to create an MDC representation. On the decoder side, the image is decoded from the received side information. If all the descriptions arrive successfully, the image is reconstructed by combining the descriptions. However, if only one side description is received, decoding is executed using an interpolation process. The experimental results show that such the directional DCT can achieve a better coding gain as well as energy packing efficiency than the conventional DCT with re-alignment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.1
• /
• pp.84-89
• /
• 2019

JPEG is a most widely used standard image compression technology. This research introduces the JPEG image compression algorithm and describes each step in the compression and decompression. Image compression is the application of data compression on digital images. The DCT (discrete cosine transform) is a technique for converting a time domain to a frequency domain. First, the image is divided into 8 by 8 pixel blocks. Second, working from top to bottom left to right, the DCT is applied to each block. Third, each block is compressed through quantization. Fourth, the matrix of compressed blocks that make up the image is stored in a greatly reduced amount of space. Finally if desired, the image is reconstructed through decompression, a process using IDCT (inverse discrete cosine transform). The purpose of this research is to review all the processes of image compression / decompression using the discrete cosine transform method.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• fall
• /
• pp.37-40
• /
• 2021

비디오 압축 시 변환(transform)은 예측을 통해 만들어진 공간 영역에서의 잔차신호를 주파수 영역으로 변환함으로써 낮은 주파수 대역으로 에너지를 이동시켜 비디오 압축에서 중요한 역할을 수행한다. VVC(Versatile Video Coding)에서는 DCT-II(Discrete Cosine Transform-II), DST-VII(Discrete Sine Transform-VII), DCTVIII(Discrete Cosine Transform-VIII)를 이용하여 잔차신호 변환을 수행한다. 본 논문에서는 DCT-II, DST-VII, DCT-VIII 가 모두 선형 변환(linear transform)이라는 점에서 착안하여 변환의 선형성을 이용하여 계산량을 감소시키는 역변환을 제안한다. 실험결과 변환 수행 시 약 12.7%의 시간이 감소되는 것을 확인하였다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.7
• /
• pp.851-858
• /
• 1988

In this paper, we propose two different VLSI architectures for the parallel computation of DCT (discrete cosine transform) algorithm. First, it is shown that the DCT algorithm can be implemented on the existing systolic architecture for the DFT(discrete fourier transform) by introducing some modification. Secondly, a new prime factor DCT algorithm based on the prime factor DFT algorithm is proposed. And it is shown that the proposed algorihtm can be implemented in parallel on the systolic architecture for the prime factor DFT. However, proposed algorithm is only applicable to the data length which can be decomposed into relatively prime and odd numbers. It is also found that the proposed systolic architecture requires less multipliers than the structures implementing FDCT(fast DCT) algorithms directly.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.852-862
• /
• 2017

In this work a Discrete Cosine Transform (DCT)-based feature dimensionality reduced approach for fingerprint matching is proposed. The DCT is applied on a small region around the core point of fingerprint image. The performance of our proposed method is evaluated on a small database of Bologna University and two large databases of FVC2000. A dimensionally reduced feature vector is formed using only approximately 19%, 7%, and 6% DCT coefficients for the three databases from Bologna University and FVC2000, respectively. We compared the results of our proposed method with the discrete wavelet transform (DWT) method, the rotated wavelet filters (RWFs) method, and a combination of DWT+RWF and DWT+(HL+LH) subbands of RWF. The proposed method reduces the false acceptance rate from approximately 18% to 4% on DB1 (Database of Bologna University), approximately 29% to 16% on DB2 (FVC2000), and approximately 26% to 17% on DB3 (FVC2000) over the DWT based feature extraction method.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.3
• /
• pp.45-50
• /
• 2009

Recently, block-based transforms, like discrete cosine transform (DCT), have been widely used in image and video coding standards, but block-based transforms have a weak point with blocking effect. However, the integer lapped orthogonal transform (ILOT) is a tool for block-based coding with bases functions that overlap near blocks, so it has a strong point against blocking effect. Although it has slightly higher arithmetic complexity than the DCT, the coding gain is significantly higher with much less blocking artifacts. This paper introduces the integer lapped orthogonal transforms and discrete cosine transform. And we compare the performance of DCT with ILOT which is proposed a new efficient method for image coding applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1236-1248
• /
• 1991

A new fast algorithm for computing the discrete cosine transform(DCT) Is developed decomposing N-point DCT into an N /2-point DCT and two N /4 point transforms(transpose of an N /4-point DCT. TN/t'and)It has an important characteristic that in this method, the roundoff noise power for a fixed point arithmetic can be reduced significantly with respect to the wellknown fast algorithms of Lee and Chen. since most coefficients for multiplication are distributed at the nodes close to the output and far from the input in the signal flow graph In addition, it also shows three other versions of factorization of DCT matrix with the same number of operations but with the different distributions of multiplication coefficients.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.5
• /
• pp.2074-2079
• /
• 2018

Global state space's optimal policy is used for offline controller in the form of table by using Dynamic Programming. If an optimal policy table has a large amount of control data, it is difficult to use the system in a low capacity system. To resolve these problem, controller using the compressed optimal policy table is proposed in this paper. A DCT is used for compression method and the cosine function is used as a basis. The size of cosine function decreased as the frequency increased. In other words, an essential information which is used for restoration is concentrated in the low frequency band and a value of small size that belong to a high frequency band could be discarded by quantization because high frequency's information doesn't have a big effect on restoration. Therefore, memory could be largely reduced by removing the information. The compressed output is stored in memory of embedded system in offline and optimal control input which correspond to state of plant is computed by interpolation with Inverse DCT in online. To verify the performance of the proposed controller, computer simulation was accomplished with a one link inverted pendulum.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.30-40
• /
• 2014

As the Hadamard transform can be generalized into the Jacket transform, in this paper, we generalize the Haar transform into the Jacket-Haar transform. The entries of the Jacket-Haar transform are 0 and ${\pm}2^k$. Compared with the original Haar transform, the basis of the Jacket-Haar transform is general and more suitable for signal processing. As an application, we present the DCT-II(discrete cosine transform-II) based on $2{\times}2$ Hadamard matrix and HWT(Haar Wavelete transform) based on $2{\times}2$ Haar matrix, analysis the performances of them and estimate them via the Lenna image simulation.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.13-20
• /
• 2013

A combined DWT and DCT based watermarking technique of low frequency watermarking with weighted correction is proposed. The DWT has excellent spatial localization, frequency spread and multi-resolution characteristics, which are similar to the theoretical models of the human visual system (HVS). The DCT based watermarking techniques offer compression while DWT based watermarking techniques offer scalability. These desirable properties are used in this combined watermarking technique. In the proposed method watermark bits are embedded in the low frequency band of each DCT block of selected DWT sub-band. The weighted correction is also used to improve the imperceptibility. The extracting procedure reverses the embedding operations without the reference of the original image. Compared with the similar approach by DCT based approach and DWT based approach, the experimental results show that the proposed algorithm apparently preserves superiori mage quality and robustness under various attacks such as JPEG compression, cropping, sharping, contrast adjustments and so on.