• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1080-1087
• /
• 2005

Significant computations for full search (FS) motion estimation have been a big obstacle in real-time video coding and recent MPEG-4 AVC (advanced video coding) standard requires much more computations than conventional MPEG-2 for motion estimation. To reduce an amount of computation of full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without any degradation of predicted images like the conventional FS. The computational reduction without any degradation in predicted image comes from fast elimination of impossible candidate motion vectors. We obtain faster elimination of inappropriate motion vectors using efficient matching units from localization of complex area in image data and dithering order based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination (PDE) algorithm, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Journal of Korea Multimedia Society
• /
• v.15 no.9
• /
• pp.1093-1101
• /
• 2012

Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. Multi-view video coding exploits inter-view correlations among pictures of neighboring views and temporal correlations among pictures of the same view. Multi-view video coding which uses many cameras requires a method to reduce the computational complexity. In this paper, we proposed an efficient prediction structure to improve performance of multi-view video coding. The proposed prediction structure exploits an average distance between the current picture and its reference pictures. The proposed prediction structure divides every GOP into several small groups to decide the maximum index of hierarchical B layer and the number of pictures of each B layer. Experimental results show that the proposed prediction structure shows good performance in image quality and bit-rates. When compared to the performance of hierarchical B pictures of Fraunhofer-HHI, the proposed prediction structure achieved 0.07~0.13 (dB) of PSNR gain and was down by 6.5(Kbps) in bitrate.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.388-400
• /
• 2008

This paper introduces a cost-effective method fur improving anchor picture quality of a multiview video coding scheme that is mainly based on chroma compensation. Proposed method is applied to both INTER $16{\times}16$ and SKIP modes in only anchor P-pictures. By testing using JVT common test conditions, simulation results show that proposed method can obtain the average BD-PSNR gains fur U and V as 0.136 dB and 0.127 dB, respectively, while maintaining almost same performance for Y (luminance). For the range of low bit-rates, it is observed that average BD-PSNR gains of Y, U, and V are 0.141 dB, 0.494 dB and 0.525 dB, respectively. Necessary computational complexity is very marginal because the number of anchor P-pictures is only 4.18% in comparison with whole coded sequences, however it can be found that the proposed method can significantly improve the coding efficiencies of color components.

• The Journal of the Korea Contents Association
• /
• v.15 no.2
• /
• pp.21-30
• /
• 2015

Image coding based on mixed raster content model generates don't care regions (DCR) in foreground and background layers, and its overall coding performance is greatly affected by region filling methods for DCRs. Most conventional methods for DCR filling fail in utilizing the local signal properties in hole regions and thus the high frequency components in non-DCR regions are reflected into DCR after signal filling. In addition, further high frequency components are induced to the filled signal because of signal discontinuities in the boundary of DCR. To solve this problem, a new DCR filling algorithm using the priority-based adaptive region growing is proposed in this paper. The proposed method uses the watershed algorithm and the flooding priority of each pixel for region filling is determined from the degree of smoothness in the neighborhood area. By growing the filled region into DCR based on the computed priority, the expansion of high-textured area can be minimized which can improve the overall coding performance. Experimental results show that the proposed method outperforms conventional algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.1-10
• /
• 2000

This paper proposes a novel video coding system with rate control based on fractal algorithm To overcome the demerits of excessive amounts of coded bit generated by previous fractal coding methodology. the proposed system classifies the Image into three classes such as background, motion compensation, and fractal coding area. The motion vector for motion compensation, and the fractal offset value that is difference value between the predicted offset and the least-square approximated value are coded with variable length code The decision method which determines threshold value of partitioning quadtree is applied to the bit-rate control algorithm considering the quantity of currently generated bits and fixed channel bandwidth Experimental result shows that the proposed system enhances compression ratio 1.8 times higher than previous method for the same image quality, and performs efficient rate control for fixed channel bandwidth.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.50-57
• /
• 2009

This paper presents a new model-based macroblock layer rate control algorithm for low bit rate video coding which generates output bits corresponding to a target bit budget. The H.264 standard uses various coding modes and optimization methods to improve the compression performance, which makes it difficult to control the generated traffic accurately in low bit rate environments. In the proposed scheme, we first estimate MAD values of macroblocks in a frame and define a target remaining bits using the estimated MAD values before encoding each macroblock. If a difference between the target value and the actual value is greater than a threshold value, the quantization parameter is adjusted to decrease the difference. It is shown by experimental results that the new algorithm can obtain more than 66% decrease of the difference between the target bits and the resulting bits for a frame with the PSNR performance better than that of the existing rate control algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.5
• /
• pp.1155-1163
• /
• 2011

In this paper, we propose a new pre-processing algorithm applied to depth map to improve the coding efficiency. Now, 3DV/FTV group in the MPEG is working for standard of 3DVC(3D video coding), but compression method for depth map images are not confirmed yet. In the proposed algorithm, after dividing the histogram distribution of a given depth map by EM clustering method based on GMM, we classify the depth map into several layered images. Then, we apply different mean shift filter to each classified image according to the existence of background or foreground in it. In other words, we try to maximize the coding efficiency while keeping the boundary of each object and taking average operation toward inner field of the boundary. The experiments are performed with many test images and the results show that the proposed algorithm achieves bits reduction of 19% ~ 20% and computation time is also reduced.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.763-767
• /
• 2008

In a speech coding system using excitation source of voiced and unvoiced, it would be involved a distortion of speech qualify in case coexist with a voiced and an unvoiced consonants in a frame. So, We proposed TS(Transition Segment) including unvoiced consonant searching and extraction method in order to uncoexistent with a voiced and unvoiced consonants in a frame. This research present a new method of TS approximate-synthesis by using Least Mean Square and frequency band division. As a result, this method obtain a high quality approximation-synthesis waveforms within TS by using frequency information of 0.547kHz below and 2.813kHz above. The important thing is that the maximum error signal can be made with low distortion approximation-synthesis waveform within TS. This method has the capability of being applied to a new speech coding of Voiced/Silence/TS, speech analysis and speech synthesis.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.1
• /
• pp.41-48
• /
• 2009

This Paper introduces representation and coding schemes of multiview texture and depth data for complex three-dimensional scenes. We represent input color and depth images using compressed texture and depth map pairs. The proposed X-codec encodes them further to increase compression ratio in a near-lossless way. Our system resolves two problems. First, rendering time and output visual quality depend on input image resolutions rather than scene complexity since a depth image-based rendering techniques is used. Second, the random access problem of conventional image-based rendering could be effectively solved using our image block-based compression schemes. From experimental results, the proposed approach is useful to graphics applications because it provides multiview rendering, selective decoding, and scene manipulation functionalities.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.1
• /
• pp.11-17
• /
• 2001

Fractal image coding provides many promising qualities including the high compression ratio. The coding process however suffers from the long search time of domain block pool because the size of the domain block pool is often very large. In this paper, we introduce a hybrid domain block pool search method that combines the block classification and the variance based searching. This hybrid method makes use of the fact that the variance of a block is independent of the block classification. Thus, this hybrid method enhances the search speed by up to an O(number of classes) factor over the purely variance based searching method. An experimental result shows that our method enhances the search speed by up to 17 times over the purely variance based searching method. We also propose an adjustable variance based searching method that further enhances the search speed without noticeable loss of image quality.