• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1561-1570
• /
• 1989

In this paper, we propose an image coding scheme which combines the Laplacian pyramid structure and a hierarchical finite state classified vector quantizer in the DCT domain, namely FSDCT-CTQ. First, an optimal bit allocation problem for fixed rates DCT-CVQ on the Laplacian pyramid structure is described. In an asymptotic case, with an optimal bit allocation, a coding gain over scalar quantization of each Laplacian plane is derived. Second, it is experimentallhy shown that the Laplacian pyramid structure provides a considerable codng gain in the sense of total MMSE (minimum mean squared error). Finally, we propose an FS-DCT-CVQ which exploits the hierarchicla correlation between the Laplacian planes. Simulation results on real images show that the proposed coding scheme can reconstruct an image with 30.33 dB at 0.192 bpp, 32.45 dB at 0.385 bpp, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2071-2078
• /
• 2009

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 intial QP (Quantization Parameter) 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 35 regardless of the output bandwidth. Although this initialization scheme is simple, yet it is not accurate enough. An accurate intial 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 use a linear model because there is a linear inverse proportional relationship between the output bandwidth and the optimal intial QP. Model parameters of the model are determined depending on the spatial complexity of the first frame. 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 JM algorithm.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.249-254
• /
• 2002

We consider a buffer-constrained adaptive quantization algorithm for image compression. Buffer control algorithm was considered with source coding scheme by some researchers and recently a formal description of the algorithm in terms of rate-distortion has been developed. We propose a buffer control algorithm that incorporates the buffer occupancy into the Lagrange multiplier form in a rate-distortion cost measure. Although the proposed algorithm provides the suboptimal performance as opposed to the optimal Vieterbi algorithm, it can be implemented with very low computaional complexity. In addition stability of this buffer control algorithm has been mentioned briefly using Liapnov stability theory.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.121-124
• /
• 2002

This paper presents an adaptive digital image watermarking scheme that uses successive subband quantization (SSQ) and perceptual modeling. Our approach performs a multiwavelet transform to determine the local image properties optimal and the watermark embedding location. The multiwavelet used in this paper is the DGHM multiwavelet with approximation order 2 to reduce artifacts in the reconstructed image. A watermark is embedded into the perceptually significant coefficients (PSC) of the image in each subband. The PSCs in high frequency subbands are selected by setting the thresholds to one half of the largest coefficient in each subband. After the PSCs in each subband are selected, a perceptual model is combined with a stochastic approach based on the noise visibility function to produce the final watermark.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.67-75
• /
• 2012

Optimal quantizers in conducting the entropy-constrained quantization for high bit rates have the lattice structure. The quantization process is simple due to the regular structure, and various quantization algorithms are proposed depending on the lattice. Such a lattice vector quantizer (VQ) can be implemented by using the sample-adaptive product quantizer (SAPQ) and its output can also be easily entropy encoded. In this paper, the entropy encoding scheme for the lattice VQ is proposed based on SAPQ, and the performance of the proposed lattice VQ, which is based on SAPQ with the entropy coder, is asymptotically compared as the rate increases. It is shown by experiment that the gain for the memoryless Gaussian source also approaches the theoretic gain for the uniform density case.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.4
• /
• pp.10-15
• /
• 2017

Feedback burden of a full-digital energy beamforming, which is known as the optimal precoding scheme for radio frequency (RF) energy transfer, is huge because it uses a vector quantization for a channel feedback. To reduce the feedback burden, we consider a beam steering based wireless energy transfer, which uses a scalar quantization. Researches related to the beam steering based wireless energy transfer have been studied in special channel model with an assumption of full channel state information at the transmitter. In this paper, we analyze the beam steering scheme compared with the full-digital energy beamforming for practical channel models with channel estimation errors. According to characteristics of the millimeter wave channel, the number of antennas of the base station and the user, the distance between them, and channel estimation errors, we simulate the performance of the beam steering scheme and analyze reasons why.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7C
• /
• pp.654-662
• /
• 2009

Video streams for mobile video streaming can be encoded to fit the available network bandwidth by controlling three factors: temporal resolution, spatial resolution, and picture quality. The controlling of picture quality by modifying the quantization parameter (QP) is most widely used. In this paper, we demonstrate that reducing the spatial resolution adaptively can be more efficient in terms of picture quality and energy consumption in low bit-rate environment, and present a model to find the optimal spatial resolution for the available bandwidth. Adaptive spatial resolution control scheme is especially effective when the bandwidth between the video server and the mobile device varies considerably with time, and when the mobile device is sensitive to energy consumption. Our scheme can improve the picture quality by approximately O.5dB and reduce energy consumption by more than 50% compared to the conventional video coding in low bit-rate environment.

• The KIPS Transactions:PartB
• /
• v.18B no.5
• /
• pp.249-254
• /
• 2011

FGS (fine granularity scalability) supporting scalability in MPEG-4 Part 2 is a scalable video coding scheme that provides bit-rate adaptation to varying network bandwidth thereby achieving of its optimal video quality. In this paper, we proposed FGS coding scheme which performs one more bit-plane coding for residue signal occured in the enhancement-layer of the basic FGS coding scheme. The experiment evaluated in terms of video quality scalability of the proposed FGS coding scheme by comparing with FGS coding scheme of the MPEG-4 verification model (VM-FGS). The comparison was conducted by analysis of PSNR values of three tested video sequences. The results showed that when using rate control algorithm VM5+, the proposed FGS coding scheme obtained Y, U, V PSNR of 0.4 dB, 9.4 dB, 9 dB averagely higher and when using fixed QP value 17, obtained Y, U, V PSNR of 4.61 dB, 20.21 dB, 16.56 dB averagely higher than the existing VM-FGS. From results, we found that the proposed FGS coding scheme has higher video quality scalability to be able to achieve video quality from minimum to maximum than VM-FGS.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.81-90
• /
• 2005

When we transmit signals, which are quantized by the vector quantizer (VQ), through noisy channels, the overall performance of the coding system is very dependent on the employed quantization scheme and the channel error effect. In order to design an optimal coding system, the source and channel coding scheme should be jointly optimized as in the channel-optimized VQ. As a suboptimal approach, we may consider the robust VQ (RVQ). In RVQ, we consider developing an index assignment function for mapping the output of quantizers to channel symbols so that the effect of the channel errors is minimized. Recently, a VQ, which can reduce the encoding complexity and is called the sample-adaptive product quantizer (SAPQ), has been proposed. SAPQ has very similar quantizer structure as to the product quantizer (PQ). However, the quantization performance can be better than PQ. Further, the encoding complexity and the memory requirement for the codebooks are lower than the regular full-search VQ case. In this paper, SAPQ is employed in order to design an RVQ to channel errors by reducing the vector dimension. Discussions on the codebook structure of SAPQ and experiments are introduced in an aspect of robustness to noisy channels.

• Journal of Broadcast Engineering
• /
• v.12 no.2
• /
• pp.93-101
• /
• 2007

In heterogeneous networks SVC (Scalabile Video Coding) will be used for IPTV service. This paper analyses how to determine the optimal inter-layer reference scheme according to final level to be displayed in hybrid scalable coding which consists of spatial, quality and temporal layer. It determines where to stop layering quality layer stacks in lower spatial layer according to the relationship between noise induced by loss of high frequency component eliminated by filter in order to get rid of aliasing when spatial layering is processed and noise induced by quantization when quality layering is processed. This paper shows the choice of the level of layering between spatial and quality to get better coding efficiency and then presents what is needed for determining it.