• The Journal of the Acoustical Society of Korea
• /
• v.20 no.7
• /
• pp.47-54
• /
• 2001

In this paper, we present a variable dimension vector quantization for spectral magnitudes. Espectially, spectral magnitudes of the Harmonic coder, need variable dimension quantizer because those are not fixed dimension. So, this paper present efficient quantization methods. These methods use variable Discrete Cosine Transform(DCT) for spectral magnitude parameters and NSTVQ which is combined odd/even, split and multi-stage structure, proposed quantization methods use Spectral Distortion(SD) for performance measure. Consequently, Multi-Stage Nonsquare Transform Vector Quantization(MSNSTVQ) is the best in performance measure.

• English Language & Literature Teaching
• /
• v.12 no.2
• /
• pp.215-235
• /
• 2006

This paper explores the effects of two different methods of instruction for 106 low-level Korean learners of English at a college in learning request expressions. Both of the methods contained the focus-on-form and function characteristics, while the degree of explicitness for input enhancement was differentiated. Abundant email samples written by English native speakers for the input were provided and email writing practice for the output was proceeded for both groups of the students in the treatment sessions. The numbers of target forms used in pretest and posttest results were compared quantitatively: The tests included email writing and open-ended Discourse Completion Test (DCT). The results indicated that the target pragmatic features were slightly better learned under the condition of relatively high degree of explicit instruction with metapragmatic information, even though the difference was statistically insignificant. In addition, the students' use of request strategies both in email and DCT was affected positively by the treatment with email input and output. That is, the students applied the request strategies they learned through email into their oral production (open-ended DCT) as well as their email writing. Further study on the output effect of target features in advancing pragmatic competence is suggested.

• The Journal of Korean Association of Computer Education
• /
• v.9 no.2
• /
• pp.101-109
• /
• 2006

We propose an adaptive digital watermarking algorithm using HVS(human visual system) and SOM(Self-Organizing Map) among neural networks. This method adjusts adaptively the strength of the watermark which is embedded in different blocks according to block classification in DCT(Discrete Cosine Transform) domain. All blocks in 3 classes out of 4 are selected to embed a watermark. Watermark sequences are embedded in 6 lowest frequency coefficients of each block except the DC component. The experimental results are excellent.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.639-642
• /
• 2005

In this paper, we assessed the subjective and objective quality of the images on low bit-rate which used the H.264 intra coding and JPEG2000. The result of our experiments shown the subjective and objective quality assessment of the intra coded image of H.264 high profile is better than JPEG2000. But, the blocking artifact is obvious because of the big difference of DCT and wavelet transform and quantization. it will be necessary to propose a new transform algorithm for the optimal quality.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.653-656
• /
• 2019

현대 사회에서의 생체인식 기술의 발전을 통해 홍채, 지분 등의 정보를 사용하여 사용자의 신원확인 등이 가능하게 되었으며, 생체정보의 유출/위조 방지에 대한 중요성이 높아지면서 관련 연구가 활발히 이루어 지고 있다. 본 논문에서는 홍체 전체의 이미지에 삽입하거나 동공의 중심에 가까운 DCT(Discrete Cosine Transform)영역에 삽입방법, 동공 중심과 눈매의 영역을 검출하여 거리 및 DC 계수를 통하여 삽입 위치를 선택하는 방법 등 홍채영상 속 워터마크를 삽입하여 유출/위조된 홍채 영상을 검출하는 방법에서의 워터마크 삽입위치에 관한 방법을 연구하고, CASIA Irisimage Database ver 4.0의 워터마크를 삽입하여 NC(Normalized Correlation)의 값을 비교하여 워터마크 삽입 실험을 검증하였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.258-268
• /
• 2001

The compression method is necessarily used to send the high quality moving picture that contains a number of data in image processing. In the field of moving picture compression method, the motion estimation algorithm is used to reduce the temporal redundancy. Block matching algorithm to be usually used is distinguished partial search algorithm with full search algorithm. Full search algorithm be used in this paper is the method to compare the reference block with entire block in the search window. It is very efficient and has simple data flow and control circuit. But the bigger the search window, the larger hardware size, because large computational operation is needed. In this paper, we design the full search block matching motion estimator. Using the DCT DC values, we decide luminance. And we apply 3 bit compare-selector using bit plane to I(Intra coded) picture, not using 8 bit luminance signals. Also it is suggested that use the same selective bit for the P(Predicted coded) and B(Bidirectional coded) picture. We compare based full search method with PSNR(Peak Signal to Noise Ratio) for C language modeling. Its condition is the reference block 8$\times$8, the search window 24$\times$24 and 352$\times$288 gray scale standard video images. The result has small difference that we cannot see. And we design the suggested motion estimator that hardware size is proved to reduce 38.3％ for structure I and 30.7％ for structure II. The memory is proved to reduce 31.3％ for structure I and II.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.145-147
• /
• 2006

Image resizing is to change an image size by upsampling or downsampling of a digital image. Most still images and video frames are given in a compressed domain on digital media. Image resizing of a compressed image can be performed in a spatial domain via decompression or recompression. In general, resizing of a compressed image in a compressed domain is much faster than that in a spatial domain. In this paper, we propose an approach to resize images in the integer discrete cosine transform (DCT) domain, which exploits the multiplication-convolution property of DCT.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.726-742
• /
• 2000

A novel rte control algorithm consisting of two major components, i.e. a variable encoding frame rate method and a hybrid DCT/wavelet I-frame coding scheme, is proposed in this work for low bit rate video coding. Most existing rate control algorithms for low bit rate video focus on bit allocation at the macroblock level under a constant frame rate assumption. The proposed rate control algorithm is able to adjust the encoding frame rate at the expense of tolerable time-delay. Furthermore, an R-D optimized hybrid DCT/wavelet scheme is used for effective I-frame coding. The new rate-control algorithm attempts to achieve a good balance between spatial quality and temporal quality to enhance the overall human perceptual quality at low bit rates. It is demonstrated that the rate control algorithm achieves higher coding efficiency at low bit rates with a low additional computational cost. The variable frame rate method and hybrid I-frame coding scheme are compatible with the bi stream structure of H.263+.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.3
• /
• pp.130-134
• /
• 1985

In two-dimensional discrete cosine transform(DCT) coding, the measurements of the distributions of the transform coefficients are important because a better approximation yields a smaller mean square distorition. This paper presents the results of distribution tests which indicate that the statistics of the AC coefficients are well approximated to a generalized Gaussian distribution whose shape parameter is 0.6. Furthermore, from a simulation of the DCT coding, it was shown that the above approximation yields a higher experimental SNR and a better agreement between theory and simulation than the Gaussian or Laplacian assumptions.

• ETRI Journal
• /
• v.23 no.4
• /
• pp.190-198
• /
• 2001

The performance of Motion Compensated Discrete Cosine Transform (MC-DCT) video coding is improved by using the region adaptive subband image coding [18]. On the assumption that the video is acquired from the camera on a moving platform and the distance between the camera and the scene is large enough, both the motion of camera and the motion of moving objects in a frame are compensated. For the compensation of camera motion, a feature matching algorithm is employed. Several feature points extracted using a Sobel operator are used to compensate the camera motion of translation, rotation, and zoom. The illumination change between frames is also compensated. Motion compensated frame differences are divided into three regions called stationary background, moving objects, and newly emerging areas each of which is arbitrarily shaped. Different quantizers are used for different regions. Compared to the conventional MC-DCT video coding using block matching algorithm, our video coding scheme shows about 1.0-dB improvements on average for the experimental video samples.