• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.23-32
• /
• 2011

In this paper, we develop a method for generating thumbnail images at hybrid domain combined the spatial domain and transform domain. The proposed method generates a pixel of a thumbnail image by adding a DC value of residual transform coefficients and an average value of an estimate block. For effectively calculating average values of estimate blocks, we propose a method for reconstructing the boundary pixels of a block. In comparison to the conventional method of decoding the bit stream then scaling down the decoded images, the developed method reduces the complexity by more than 60% while producing identical thumbnail images.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.7
• /
• pp.70-82
• /
• 1993

In this paper, employing the 3-dimensional discrete cosine transform (DCT) for the utilization of the temporal correlation, an adaptive motion sequence coding technique is proposed. The energy distribution in a 3-D DCT block, due to the nonstationary nature of the image data, varies along the veritical, horizontal and temporal directions. Thus, aiming an adaptive system to local variations, adaptive procedures, such as the 3-D classification, the classified linear scanning technique and the VLC table selection scheme, have been implemented in our approach. Also, a hybrid structure which adaptively combines inter-frame coding is presented, and it is found that the adaptive hybrid frame coding technique shows a significant performance gain for a moving sequence which contains a relatively small moving area. Through an intensive computer simulation, it is demonstrated that, the performance of the proposed 3-D transform coding technique shows a close relation with the temporal variation of the sequence to be code. And the proposed technique has the advantages of skipping the computationally complex motion compensation procedure and improving the performance over the 2-D motion compensated transform coding technique for rates in the range of 0.5 ~ 1.0 bpp.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1649-1657
• /
• 2005

In this paper, a fast implementation of JPEG is discussed and its application to multimedia service is presented for mobile wireless internet. A fast JPEG player is developed based on several fast algorithms for mobile handset. In the color transformation, RCT is adopted instead of ICT for JPEG source. For the most time-consuming DCT part, the binDCT can reduce the decoding time. In upsampling and RGB conversion, the transformation from YCbCr to RGB 16 bit is made at one time. In some parts, assembly language is applied for high-speed. Also, an implementation of multimedia in mobile handset is described using MJPEG (Motion JPEG) and QCELP(Qualcomm Code Excited Linear Prediction Coding). MJPEG and QCELP are used for video and sound, which are synchronized in handset. For the play of MJPEG, the decoder is implemented as a S/W upon the MSM 5500 baseband chip using the fast JPEG decoder. For the play of QCELP, the embedded QCELP player in handset is used. The implemented multimedia player has a fast speed preserving the image quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7C
• /
• pp.700-705
• /
• 2006

In this paper, an informed watermarking algorithm is proposed that aids in concealing packet loss errors in video communications. This watermark-based error concealment (WEC) method embeds a low resolution version of the video frame inside itself as watermark data. At the receiver, the extracted watermark is used as a reference for error concealment. The proposed DCT-based algorithm employs informed watermarking techniques in order to minimize the distortion of host frames. At the encoder, a predictive feedback loop is employed which helps to adjust the strength of the data embedding. Furthermore, the distortion of the DCT coefficients introduced in the embedding can be removed to a considerable extent, by employing bit-sign adaptivity. Simulation results on standard video sequences show that the proposed informed WEC scheme has an advantage of 3$\sim$4 dB in PSNR over non-informed WEC and that even a non-informed WEC is still superior to conventional error concealment techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.156-166
• /
• 2000

A rate-distortion based segmentation using recursive merging is presented, which considers texture as a homogeneity by adopting the procedure of a generalized texture approximation. The texture in a region is approximated by SA-DCT and a set of two uniform quantizers with fixed step sizes, one for DC and another for AC. Using the approximated texture, we calculated the rate-distortion based cost. The segmentation using recursive merging is performed by using the rate-distortion based cost. Experimental results for 256$\times$256 Lena show that the region-based coding using the proposed segmentation yields the PSNR improvements of 0.8~ 1.0 dB and 1.2~1.5 dB over that using the rate-distortion based segmentation with DC approximation only and JPEG, respectively.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.6
• /
• pp.384-390
• /
• 2015

There are two main artifacts in reconstructed images from in-beam positron emission tomography (PET). Unlike generic PET, in-beam PET uses the annihilation photons that occur during heavy ion therapy. Therefore, the geometry of in-beam PET is not a full ring, but a partial ring that has one or two openings around the rings in order for the hadrons to arrive at the tumor without prevention of detector blocks. This causes truncation in the projection data due to an absence of detector modules in the openings. The other is a ring artifact caused by the gaps between detector modules also found in generic PET. To sum up, in-beam PET has two kinds of gap: openings for hadrons, and gaps between the modules. We acquired three types of simulation results from a PET system: full-ring, C-ring and dual head. In this study, we aim to compensate for the artifacts that come from the two types of gap. In the case of truncation, we propose a method that uses prior knowledge of the location where annihilations occur, and we applied the discrete-cosine transform (DCT) gap-filling method proposed by Tuna et al. for inter-detector gap.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2A
• /
• pp.165-172
• /
• 2002

The concept of MPEG-2 transcoding is related to the scaling the bit rate of the previously encoded MPEG bitstream. We proposed a new rate control algorithm that outperforms existing methods and showed the performance by a computer simulation. A rate-quatization model is developed based on a priori knowledge from the given bitstream at macroblock level. The model is independent of the picture coding type, because it is designed in the DCT domain. To increase the accuracy of the model, the activity measurement is considered. By the simulation, the proposed transcoding showed the better result than that of recoding by TM5. We also concluded that MPEG-2 scalable profile is not suitable for the bit rate conversion application.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.124-131
• /
• 2003

In this paper, we propose a Progressive scalable video coding algorithm using frequency weighting in the DCT domain. Since the human visual system (HVS) can be modeled as a nonlinear point transformation, called the modulation transfer function (MTF), we tan use the frequency weighting matrix to enhance the video image quality. We change this frequency weighting matrix into the frequency shift matrix to apply to the bit-plane coding method for the fine granular scalable (FGS) video coding We also define a new error metric JNDE (just noticeable difference) to measure the perceptual image quality in terms of human vision.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.99-104
• /
• 2000

In this paper, as a digital watermark we propose to use a chaotic sequence instead of the conventional Gaussian sequence. It is relatively easy to generate the chaotic sequence and is very sensitive to the change of initial value. The chaotic sequence adopted in this paper is a modified version of logistic map to give the sequence distribution of Chebyshev map. In the experiments, we applied the Gaussian sequence and chaotic sequence to wavelet coefficients of images to compare the similarity distribution. The results show that, as id the DCT-based watermarking system, the chaotic sequence is robust for various signal processing attacks, Moreover, the similarity variance is smaller than the Gaussian sequence for iterative experiments. It also shows a better performance for compression errors than the Gaussian sequence.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.34-44
• /
• 2008

In this paper, a new rate-distortion estimation method is proposed for fast rate-distortion optimized(RDO) mode decision in H.264 encoder. A bit-rate and distortion should be calculated by encoding and reconstruction of each macroblock mode in order to select the optimal RDO mode. To reduce the computations for getting them, a bit-rate and distortion is efficiently estimated in DCT domain. Simulation results show that the proposed method achieves computational saving about 81% of RDO mode decision and saves about 26% of total encoding time without noticeable degradation in coding performance.