• The KIPS Transactions:PartB
• /
• v.12B no.6 s.102
• /
• pp.637-646
• /
• 2005

Most of the multimedia contents for DBM services art provided as MPEG-2 bit streams. However, they have to be transcoded to H.264 bit streams for practical services because the standard video codec for DMB is H.264. The existing transcoder architecture is Cascaded Pixel-Domain Transcoding Architecture, which consists of the MPEG-2 dacoding phase and the H.264 encoding phase. This architecture can be easily implemented using MPEG-2 decoder and H.264 encoder without source modifying. However. It has disadvantages in transcoding time and DCT-mismatch problem. In this paper, we propose two kinds of transcoder architecture, DCT-OPEN and DCT-CLOSED, to complement the CPDT architecture. Although DCT-OPEN has lower PSNR than CPDT due to drift problem, it is efficient for real-time transcoding. On the contrary, the DCT-CLOSED architecture has the advantage of PSNR over CPDT at the cost of transcoding time.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.3 no.1
• /
• pp.1-11
• /
• 2000

The hybrid coding algorithm for multi-spectral image obtained from satellite is discussed. As the spatial and spectral resolution of satellite image are rapidly increasing, there are enormous amounts of data to be processed for computer processing and data transmission. Therefore an efficient coding algorithm is essential for multi-spectral image processing. In this paper, VQ(vector quantization), quadtree decomposition, and DCT(discrete cosine transform) are combined to compress the multi-spectral image. VQ is employed for predictive coding by using the fact that each band of multi-spectral image has the same spatial feature, and DCT is for the compression of residual image. Moreover, the image is decomposed into quadtree structure in order to allocate the data bit according to the information content within the image block to improve the coding efficiency. Computer simulation on Landsat TM image shows the validity of the proposed coding algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.691-700
• /
• 1995

Most fractal image codings using fractal concept require long encoding time because a large amount of computation is needed to find an optimal affine transformation point. Such a problem can be solved by designing a block classifier fitted to characteristics of image blocks. In general, it is possible to predict more precise and various types of blocks in frequency domain than in spatial domain. In this paper, we propose a block classifier to predict the block type using characteristics of DCT(Discrete Cosine Transform). This classifier has merits to enhance the quality of decoded images as well as to reduce the encoding time meeting fractal features. AC coefficient values in frequency domain make it possible to predict various types of blocks. As the results, the number of comparisons between a range block and the correspoding domain blocks to reach an optimal affine transformation point can be reduced. Specially, signs of DCT coefficients help to find the optimal affine transformation point with only two isometric transformations by eliminating unnecessary isometric transformations among eight isometric transformations used in traditional fractal codings.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.1019-1024
• /
• 2005

MPEG-2 achieves high compression radio, by exploiting the temporal and spatial correlations in real image sequence, using the motion compensated prediction and the transform coding, respectively. However, as the image sequence is more highly compressed, the encoded bitstream becomes more vulnerable to transmission error over the noisy channels. Furthermore, er개rs in the headers are fatal to decoding processes, because the header parameters in the video coding standard include a lot of important information connected to the syntax elements, fables, and decoding process. In this paper, we propose a new error resilience method using LSB coding for header parameters in MPEG-2 coded video transmissions. The experimental results for football and susie video sequence demonstrate that the proposed error resilience method for header parameters in MPEG-2 bitstream has good performance.

• The KIPS Transactions:PartB
• /
• v.12B no.1 s.97
• /
• pp.9-16
• /
• 2005

This paper focuses on the study of the face authentication system and the robustness of fact authentication methods under illumination changes. Four different face authentication methods are tried. These methods are as fellows; PCA(Principal Component Analysis), GMM(Gaussian Mixture Modeis), 1D HMM(1 Dimensional Hidden Markov Models), Pseudo 2D HMM(Pseudo 2 Dimensional Hidden Markov Models). Experiment results involving an artificial illumination change to fate images are compared with each other. Face feature vector extraction based on the 2D DCT(2 Dimensional Discrete Cosine Transform) if used. Experiments to evaluate the above four different fate authentication methods are carried out on the ORL(Olivetti Research Laboratory) face database. Experiment results show the EER(Equal Error Rate) performance degrade in ail occasions for the varying ${\delta}$. For the non illumination changes, Pseudo 2D HMM is $2.54{\%}$,1D HMM is $3.18{\%}$, PCA is $11.7{\%}$, GMM is $13.38{\%}$. The 1D HMM have the bettor performance than PCA where there is no illumination changes. But the 1D HMM have worse performance than PCA where there is large illumination changes(${\delta}{\geq}40$). For the Pseudo 2D HMM, The best EER performance is observed regardless of the illumination changes.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.3 s.345
• /
• pp.48-58
• /
• 2006

This paper presents 8x8 two dimensional DCT/IDCT processor of adder-based distributed arithmetic architecture without applying ROM units in conventional memories. To reduce hardware cost in the coefficient matrix of DCT and IDCT, an odd part of the coefficient matrix was shared. The proposed architecture uses only 29 adders to compute coefficient operation in the 2-D DCT/IDCT processor, while 1-D DCT processor consists of 18 adders to compute coefficient operation. This architecture reduced 48.6% more than the number of adders in 8x8 1-D DCT NEDA architecture. Also, this paper proposed a form of new transpose network which is different from the conventional transpose memory block. The proposed transpose network block uses 64 registers with reduction of 18% more than the number of transistors in conventional memory architecture. Also, to improve throughput, eight input data receive eight pixels in every clock cycle and accordingly eight pixels are produced at the outputs.

• Journal of Biomedical Engineering Research
• /
• v.16 no.4
• /
• pp.507-516
• /
• 1995

The nonstationary identifier in the DCT domain is suggested in this study for the identification of AR parameters of above-lesion upper-trunk electromyographic (EMG) signals as a means of developing a reliable real time signal to control functional electrical stimulation (FES) in paraplegics to enable primitive walking. As paraplegic shifts his posture from one attitude to another, there is transition period where the signal is clearly nonstationary. Also as muscle fatigues, nonstationarities become more prevalent even during stable postures. So, it requires a develpment of time varying nonstationary EMG signal identifier. In this paper, time varying nonstationary EMG signals are transformed into DCT domain and the transformed EMG signals are modeled and analyzed in the transform domain. In the DCT domain, we verified reduction of condition number and increment of the smallest eigenvalue of input correlation matrix that influences numerical properties and mean square error were compared with SLS algorithm, and the proposed algorithm is implemented using IMS T-805 parallel processing computer for real time application.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9C
• /
• pp.564-572
• /
• 2011

Distributed video coding (DVC) system has been proposed to reduce encoder complexity by using the correlation of frames in decoders. Since the block based motion estimation operation is not performed in the encoder of DVC system, lapped transforms, in which adjacent two blocks are transformed into one block, can be efficiently used in the DVC system. In this paper, an efficient DVC system using lapped transforms is proposed. The overlapped block motion compensated interpolation is used to produce side information, and the corresponding correlation noise between original Wyner-Ziv frame and side information is modeled. Extensive computer simulations show that the proposed DVC system outperforms conventional DVC systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2091-2098
• /
• 2010

This paper proposes a hologram data compression scheme that uses the existing image/video compression techniques, in which the existing techniques are modified appropriately to fit to the characteristics of hologram. In this paper we use CGH as the hologram data. The proposed scheme uses the generation characteristics of a CGH to consist of a pre-processing, spatial segmentation of a CGH, frequency-transformation with 2D-DCT (2-dimensional discrete cosine transform), and motion estimation and residual image generation in the frequency-domain. It uses H.264/AVC, the lossless compressor BinHex, and a linear quantizer that we have made. From the experiments the proposed scheme showed the image quality of about 25.4 dB at the compression ratio of 10:1 and about 16.5dB at 90:1 compression ratio.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.1
• /
• pp.22-27
• /
• 2014

Blocking and ringing artifacts continue to be the most serious defects that occur in images and video streams compressed to low bit rates using block-based discrete cosine transform(DCT) compression standards. These artifacts contain the high frequency components near the block and the edge boundaries. Usually the lowpass filter can remove them. However, simple lowpass filter results into blur by removing important information such as edges at the same time. To overcome these problems, we propose a novel postfiltering algorithm that calculate the weight value based on the intensity similarity in the neighboring pixels and multiply this weight to the Gaussian lowpass filter coefficient. Experimental results show that the proposed technique provides satisfactory performance in both objective and subjective image quality.