• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12A
• /
• pp.1146-1152
• /
• 2005

In this paper, we propose a compressed quantized channel state information (CQCSI) feedback scheme for multi-carrier mobile communication systems. The proposed CQCSI figures out the contiguous subsequences of equal QCSI's as separate types of runs across the subcarriers, and then encodes the types of runs using a truncated Huffman coding algorithm. Computer simulation shows that the proposed algorithm can reduce the QCSI feedback up to one tenth of the uncompressed, while providing a comparable performance with the conventional QCSI feedback schemes. To cope with special cases when the frequency selective fading is very high, we also propose a restricted CQCSI feedback scheme. The restricted CQCSI feedback has been proved under vehicular B channel model.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.28-41
• /
• 2017

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1057-1065
• /
• 1998

This paper describes a new fractal image coding algorithm to shorten time to take on fractal image encoding by using limited search area method and scaling method. First, the original image is contracted respectively by half and by quarter with the scaling method. And then, the corresponding domain block of the quarter-sized image which is most similar with one range block of the half-sized image is searched within the limited area in order to reduce the encoding time extremely. This searched block is used in encoding. Also, we propose an algorithm provided much shorter encoding time and better compression ratio with a little degradation of the decoded image quality than Jacquin's method.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.461-469
• /
• 2016

A novel steganography based on ternary BCH code with t = 2 is presented in this paper. Proposed method utilizes powerful BCH code with t = 2 for data hiding to the DCT coefficients from JPEG images. The presented data hiding technique uses a proposed look up table approach for searching multiple solutions for ternary BCH code with t = 2. The proposed look up table approach enables fast and efficient search for locations of DCT coefficients, which are necessary to modify for hiding data. Presented data hiding technique is the first steganography technique based on ternary BCH code. Experimental results clearly indicate advantages of using ternary BCH compared to binary BCH.

• Journal of Broadcast Engineering
• /
• v.21 no.6
• /
• pp.878-888
• /
• 2016

This paper proposes an efficient method to remove the boundary artifacts of rendered views caused by damaged depth maps in the 3D video system. First, characteristics of boundary artifacts with the compression noise in depth maps are carefully studied. Then, the artifacts suppression method is proposed by the iterative projection onto convex sets (POCS) algorithm with setting the convex set in pixel and frequency domain. The proposed method is applied to both texture and depth maps separately during view rendering. The simulation results show the boundary artifacts are greatly reduced with improving the quality of synthesized views.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.281-292
• /
• 2004

Selectivity estimation for spatial query is very important process used in finding the most efficient execution plan. Many works have been performed to estimate accurate selectivity. Although they deal with some problems such as false-count, multi-count, they can not get such effects in little memory space. Therefore, we propose a new technique called MW Histogram which is able to compress summary data and get reasonable results and has a flexible structure to react dynamic update. Our method is based on two techniques : (a) MinSkew partitioning algorithm which deal with skewed spatial datasets efficiently (b) Wavelet transformation which compression effect is proven. The experimental results showed that the MW Histogram which the buckets and wavelet coefficients ratio is 0.3 is lower relative error than MinSkew Histogram about 5%-20% queries, demonstrates that MW histogram gets a good selectivity in little memory.

• Journal of Broadcast Engineering
• /
• v.26 no.6
• /
• pp.680-691
• /
• 2021

Due to the recent developments of attaining 3D contents by using devices such as 3D scanners, the diversity of the contents being used in AR(Augmented Reality)/VR(Virutal Reality) fields is significantly increasing. There are several ways to represent 3D data, and using point clouds is one of them. A point cloud is a cluster of points, having the advantage of being able to attain actual 3D data with high precision. However, in order to express 3D contents, much more data is required compared to that of 2D images. The size of data needed to represent dynamic 3D point cloud objects that consists of multiple frames is especially big, and that is why an efficient compression technology for this kind of data must be developed. In this paper, a motion estimation and compensation method for dynamic point cloud objects using 3D DCT is proposed. This will lead to switching the 3D video frames into I frames and P frames, which ensures higher compression ratio. Then, we confirm the compression efficiency of the proposed technology by comparing it with the anchor technology, an Intra-frame based compression method, and 2D-DCT based V-PCC.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.8
• /
• pp.492-497
• /
• 2005

In this paper, we suggest that the new volume of robust audio watermarking method protects form the MP3 compression attack, mostly used in audio field. Watermarks were inserted at the coefficients repeatedly from low frequencies to high frequencies after DCT transform in commonly used Cox's spread spectrum method. However, our method could be investigated losing frequency when MP3 attacks and make order by small amount of losing frequency and then insert watermarks rightly through statistical analysis. In the result about various sound clips, the suggested method have better performances than Cox's method by preserving watermarks and reducing distortions of the original sounds.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.145-147
• /
• 2006

Image resizing is to change an image size by upsampling or downsampling of a digital image. Most still images and video frames are given in a compressed domain on digital media. Image resizing of a compressed image can be performed in a spatial domain via decompression or recompression. In general, resizing of a compressed image in a compressed domain is much faster than that in a spatial domain. In this paper, we propose an approach to resize images in the integer discrete cosine transform (DCT) domain, which exploits the multiplication-convolution property of DCT.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1157-1163
• /
• 2005

In this paper, an efficient and fast method to segment a video in the MPEG(motion picture expert group) video stream is proposed. For the real time processing of large amount of broadcasting data, we use DC images of I-frames in an MPEG compressed video with minimal decoding. Using the modified histogram comparison which counts on not only luminance but also chrominance information, the scene change detection was performed in the fast and accurate way Also, to discriminate anchorperson frame from non-anchor frame, a neural network method was introduced.