• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.55-62
• /
• 2005

This paper proposes a method to recognize a face using DCT/LDA where LDA is applied to DCT coefficients of an input face image. In the proposed method, SSS problem of LDA due to less number of training data than the size of feature space can be avoided by expressing an input image in low dimensional space using DCT coefficients. In terms of the recognition rate, both the proposed method and the PCA/LDA method have shown almost equal performance while the training time of the proposed method is much shorter than the other. This is because DCT has the fixed number of basis vectors while the property of energy compaction rate is similar to that of PCA. Although depending on the number of coefficients employed for the recognition, the experimental results show that the performance of the proposed method in terms of recognition rate is very comparable to PCA/LDA method and other DCT/LDA methods, and it can be trained 13,000 times faster than PCA/LDA method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.127-140
• /
• 2003

This paper develops a novel algorithm of computing 2 Dimensional Discrete Cosine Transform (2D-DCT) via Polynomial Transform (PT) converting 2D-DCT to the sum of 1D-DCTs. In computing N${\times}$M size 2D-DCT, the conventional row-column algorithm needs 3/2NMlog$_2$(NM)-2NM＋N＋M additions and 1/2NMlog$_2$(NM) additions and 1/2NMlog$_2$(NM) multiplications, while the proposed algorithm needs 3/2NMlog$_2$M＋NMlog$_2$N-M-N/2＋2 additions and 1/2NMlog$_2$M multiplications The previous polynomial transform needs complex operations because it applies the Euler equation to DCT. Since the suggested algorithm exploits the modular regularity embedded in DCT and directly decomposes 2D DCT into the sum of ID DCTs, the suggested algorithm does not require any complex operations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.10
• /
• pp.1433-1443
• /
• 1993

DCT(Discrete Cosine Transform) / IDCT(Inverse DCT) is widely used in various image compression and decompression systems as well as in DSP(Digital Signal Processing) applications. Since DCT/ IDCT is one of the most complicated part of the compression system, the performance of the system can be greatly enchanced by improving the speed of DCT/IDCT operation. In this thesis, we designed a DCT/IDCT core processor using module generator technique. By utilizing the partial sum and DA(Distributed Arithmetic) techniques, the DCT/ IDCT core processor is designed within small area. It is also designed to perform the IDCT(Inverse DCT) operation with little additional circuitry. The pipeline structure of the core processor enables the high performance, and the high accuracy of the DCT/IDCT operation is obtained by having fewer rounding stages. The proposed design is independent of design rules, and the number of the input bits and the accuracy of the internal calculation coa be easily adjusted due to the module generator technique. The accuracy of the processor satisfies the specifications in CCITT recommendation H, 261.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.113-123
• /
• 2007

In Ubiquitous communication environment, various conversions of images are essential, and most digital images are compressed by standard methods such as the Joint Photographic Expert Group (JPEG) and Motion Picture Expert Group (MPEG) which are based on the discrete cosine transform (DCT). In this paper, various image resizing algorithms in the DCT domain are analyzed, and a new image resizing algorithm, which shows superior performance compared with the conventional methods, is proposed. For arbitrary-ratio image resizing in the DCT domain, several blocks of $8{\times}8$ DCT coefficients are converted into one block using the conversion formula in the proposed algorithm, and the size of the inverse discrete cosine transform (IDCT) is decided optimally. The performance is analyzed by comparing the peak signal to noise ratio (PSNR) between original images and converted images. The performance of the proposed algorithm is better than that of the conventional algorithm, since the correlation of pixels in images is utilized more efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2407-2414
• /
• 1999

This paper introduces the concept of warped discrete cosine transform (WDCT) and an image compression algorithm based on the WDCT. The proposed WDCT is a cascade connection of a conventional DCT and all-pass filters whose parameters can be adjusted to provide frequency warping. In the proposed image compression scheme, the frequency response of the all-pass filter is controlled by a set of parameters with each parameter for a specified frequency range. For each image block, the best parameter is chosen from the set and is sent to the decoder as a side information along with the result of corresponding WDCT computation. For actual implementation, the combination of the all-pass IIR filters and the DCT can be viewed as a cascade of a warping matrix and the DCT matrix, or as a filter bank which is obtained by warping the frequency response of the DCT filter bank. Hence, the WDCT can be implemented by a single matrix computation like the DCT. The WDCT based compression, outperforms the DCT based compression, for high bit rate applications and for images with high frequency components.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.8
• /
• pp.1265-1274
• /
• 1990

A new classified VQ scheme for DCT coefficients(DCT-CVQ) is proposed for still image coding. DCT coefficient matrices are classified into six classes by ac coefficients that well represent edge characteristics and the distribution of ac energy in the DCT domain. To reduce the complexity of, VQ, ac transform coefficients are partitioned into several vectors, and an adaptive method is provided by making different codebook sizes for different classes. Simulation results show that this DCT-CVQ results in good subjective quality at low bit rates, and SNR is increased by about 1.5-4.0 dB in the range 0.2-0.5 bpp, when compared with other DCT-VQ coding schemes.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.962-967
• /
• 2003

In this paper, we proposed DC term embedding digital watermarking in the DCT domain. We computed a 8${\times}$8 block DCT The watermark signal is composed of a random number sequence of length 1000, which obeys normal distribution with zero mean and unit variance N(0,1). We embedded watermark signal in DC term for small watermark signal, the other watermark signal embedded in the largest AC coefficients. Experiment show that the invisibility and robust of the proposed method better than those of the conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.12 no.3
• /
• pp.239-253
• /
• 1987

By the extension and the modification of the efficient aigorithms for the DCT-III, the fast algorithms to compute three versions for DCT, four versions of DST, and a DHT are developed. It is shown that the algorithms developed in this paper have simple structures and the numbers of multipication and addition are reduced as comparies with the existing efficient algorithms. The algorithms presentes in this paper indicate the close relationship amng different versions of the DCT and DST as well as a DHT. The formulas to compute the numbers of multiplication and addition of them are derived.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.4
• /
• pp.58-64
• /
• 2003

Noise generation systems are used to generate noise signals with specified characteristics. In recent study, DCT-based noise generation system outperforms the conventional noise generation system when a noise model requires complicated PSD(Power Spectral Density) specifications. In this paper, we propose the area-efficient noise generation system based on DCT method. It is shown that the proposed system results in area reduction by 61~64% except DCT block. Furthermore, it achieves power reduction by 41~56%.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.35-40
• /
• 2004

In this paper, we propose a method for calculation of the length of watermarks to be inserted in the discrete cosine transform (DCT) domain for the specified peak signal to noise ratio (PSNR) of still image. Using the energy relationship of the DCT we derive the equation that directly computes the length of watermarks to be inserted in the DCT domain. Experimental results with several test images show the effectiveness of the proposed method.