• Proceedings of the KOSOMBE Conference
• /
• v.1991 no.11
• /
• pp.44-47
• /
• 1991

There exists a transform trellis code that is optimal for stationary Gaussian sources and the squared-error distortion measure at all rates. In this paper, we train an asymptotically optimal version of such a code to obtain one which is matched better to the statistics of real world data. The training algorithm uses the M-algorithm to search the trellis codebook and the LBG-algorithm to update the trellis codebook. To adapt the codebook for the varying input data. we use two gain-adaptive methods. The gain-adaptive scheme 1, which normalizes input block data by its gain factor, is applied to images at rate 0.5 bits/pixel. When each block is encoded at the same rate, the nonstationarity among the block variances leads to a variation in the resulting distortion from one block to another. To alleviate the non-uniformity among the encoded image, we design four clusters from the block power, in which each cluster has its own trellis codebook and different rates. The rate of each cluster is assigned through requiring a constant distortion per-letter. This gain-adaptive scheme 2 produces good visual and measurable quality at low rates.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4189-4202
• /
• 2014

In this paper, we propose a priority-based unequal error protection scheme of data partitioned H.264/AVC video with hierarchical quadrature amplitude modulation. In order to map data with higher priority onto the most significant bits of QAM constellation points, a priority sorting method categorizes different data partitions according to the unequal importance factor of encoded video data in one group of pictures by evaluated the average distortion. Then we propose a hierarchical quadrature amplitude modulation arrangement with adaptive constellation distances, which takes into account the unequal importance of encoded video data and the channel status. Simulation results show that the proposed scheme improves the received video quality by about 2 dB in PSNR comparing with the state-of-the-art unequal error protection scheme, and outperforms EEP scheme by up to 5 dB when the average channel SNR is low.

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

A new image coding technique has been proposed based on the wavelet transform. To achieve lower ceding rates and good qualities in reconstructed images, some of wavelet coefficients were removed by thresholding and quantized in accordance with the sensitivity of the human visual system(HVS). For each block of subimages in wavelet transform domain, block thresholding scheme has been used to remove the unimportant wavelet coefficients according to the frequency characteristic and statistical property of wavelet coefficients. The location information of quantized blocks and removed blocks were encoded using run-length coder which is effective for the exponential distribution. Quantized coefficients were encoded using variable length coder which matches well to their distribution. Simulation results show that the reconstructed images maintain high quality with the low bit rate, below 1.0 bits per pel.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1947-1954
• /
• 2012

The first frame is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the initial QP for the first frame affects the first frame as well as the following frames. Traditionally, the initial QP is determined among four constant values only depending on the bpp. In the case of low bit rate video coding, the initial QP value is fixed to 40 regardless of the output bandwidth. Although this initialization scheme is simple, yet it is not accurate enough. An accurate initial QP prediction scheme should not only depends on bpp but also on the complexity of the video sequence and the output bandwidth. In the proposed scheme, we determine the initial QP according to the ratio of the first frame to the total bits allocated to a GOP. To estimate the QP of the allocated bits, Rate-QP model is used. It is shown by experimental results that the new algorithm can predict the optimal initial QP more accurately and generate the PSNR performance better than that of the existing JVT algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.195-198
• /
• 1996

In this paper, we introduce the notion of the smoothly perfect 8-connected (SP8C) contour and propose a coding technique for the SP8C contours. Based on the contour simplification using the majority filter proposed by Gu[6], SP8C contours are extracted on the contour lattice from the segmented image. By noting that, unlike the perfect 8-connected contours, the SP8C contours are restricted to travel in only 3 different directions along the contours, we also propose two techniques for encoding the SP8C contours. The one is the modified version of the neighbouring direction segment coding by Kandeko[2], while the other is to employ the notion of the entropy coding. From the comparison in terms of the entropy, it is shown that the proposed SP8C contours require les bits in encoding the diagonal contours than the 4-connected contours employed by Gu. And computer simulations reveal that the contours can be efficiently encoded by the proposed technique.

• ETRI Journal
• /
• v.24 no.5
• /
• pp.405-408
• /
• 2002

In this paper, we discuss recovery schemes for errors occurring when image data encoded with variable length coding (VLC) is transmitted through additive white Gaussian noise (AWGN) and multiple-access interference in direct sequence code division multiple access (DS/CDMA) systems. VLC such as JPEG is so sensitive to channel errors that severe degradation in decoded images occurs even if only one or two bits have errors. This is due to the loss of synchronization at the image decoder. We propose a resynchronization scheme using a power allocation method in wireless DS/CDMA transmission. Through simulation, we know that the proposed method has a more robust resynchronization capability and higher objective and subjective quality than the conventional method.

• Journal of Biomedical Engineering Research
• /
• v.17 no.3
• /
• pp.305-312
• /
• 1996

A new three dimensional fractal coding is proposed with a perceptually enhanced matching. Since most of medical images (e.g. computed tomoyaphy or magnetic resonance images) have three dimensional characters, searching regions are extended to adjacent slices. For a perceptually enhanced matching, a high frequency boost filter is used for pre-filtering images to be encoded, and a least mean square error matching is applied to the edge enhanced Images rather than the original images. From simulation with magnetic resonance images($255\times255$, 8bits/pixel), reconstructed images by the proposed compression algorithm show much improved subjective image quality with higher peak signnal-to-noise ratio compared to those by existing fractal coding algorithms at compression ratios of about 10.

• The Journal of the Korea Contents Association
• /
• v.6 no.1
• /
• pp.8-13
• /
• 2006

In this thesis, an automatic door lock system using a dual tone multiple frequency(DTMF) signal generated as pushing the key button of mobile phone is proposed and implemented. This system consists of a transmitter module and a receiver module for processing the DTMF signal of mobile phone. The DTMF signal of mobile phone connected with ear-phone jack enter into the input terminal of DTMF receiver and those are encoded by a code-converter with 4-bits binary format in the DTMF receiver. The encoded output signals are transmitted to the amplitude shift keying(ASK) modulator of transmitter module and the modulated ASK signals which are converted into radio frequency(RF) signals propagate in a free space. The RF signals passed through a free space are demodulated by the ASK demodulator of receiver module and the demodulated ASK signals are sent to a micro-controller unit(MCU). The output signals processed by the MCU are compared with the secreted identification number which is prerecorded in a microprocessor and are transferred to a power relay. If the result is the same, the automatic door lock system opens a door. In the opposite case, it maintains closing the door. The implemented automatic door lock system operates well in mobile environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1092-1097
• /
• 2005

In this paper, we propose a low-power Booth multiplication which reduces the switching activities of partial products during multiplication process. Radix-4 Booth algorithm has a characteristic that produces the Booth encoded products with zero when input data have sequentially equal values (0 or 1). Therefore, partial products have higher chances of being zero when an input with a smaller effective dynamic range of two multiplication inputs is used as a multiplier data instead of a multiplicand. The proposed multiplier divides a multiplication expression into several multiplication expressions with smaller bits than those of an original input data, and each multiplication is computed independently for the Booth encoding. Finally, the results of each multiplication are added. This means that the proposed multiplier has a higher chance to have zero encoded products so that we can implement a low power multiplier with the smaller switching activity. Implementation results show the proposed multiplier can save maximally about $20\%$ power dissipation than a previous Booth multiplier.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1256-1261
• /
• 2005

In this paper, we propose a low-power Booth multiplication which reduces the switching activities of partial products during multiplication process. Radix-4 Booth algorithm has a characteristic that produces the Booth encoded products with zero when input data have sequentially equal values (0 or 1). Therefore, partial products have higher chances of being zero when an input with a smaller effective dynamic range of two multiplication inputs is used as a multiplier data instead of a multiplicand. The proposed multiplier divides a multiplication expression into several multiplication expressions with smaller bits than those of an original input data, and each multiplication is computed independently for the Booth encoding. Finally, the results of each multiplication are added. This means that the proposed multiplier has a higher chance to have zero encoded products so that we can implement a low power multiplier with the smaller switching activity. Implementation results show the proposed multiplier can save maximally about $20\%$ power dissipation than a previous Booth multiplier.