• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.111-120
• /
• 2005

A cost effective three-dimensional color gamut mapping architecture is described. The conventional three-dimensional reduced resolution look-up table is considered and the concept of three-dimensional reduced resolution difference look-up table is introduced for cost effective and real-time color gamut mapping. The overall architecture uses one-dimensional memory decomposition of three-dimensional gamut mapping look-up table, three-dimensional interpolation and simple addition operation for generating the final gamut mapped colors. The required computational cost is greatly reduced by look-up table resolution adjustment and further reduced by the gamut mapping rule modification. The proposed architecture greatly reduces the required memory size and hardware complexity compared to the conventional method and it is suitable for real-time applications. The proposed hardware is suitable for FPGA and ASIC implementation and could be applied to the real-time display quality enhancement purposes.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.135-142
• /
• 2009

Since hold-type display systems have been developed, frame-rate up conversion (FRUC) is an essential technique to improve the temporal resolution in the display. FRUC improves the temporal resolution by interpolating one or multiple intermediate frames between two adjacent frames. In this paper, a new frame-rate up-conversion algorithm based on bilateral motion refinement with rotation is proposed. First, we perform bi-directional motion estimation between adjacent two frames to obtain a motion vector for each block. Then, we apply a modified median filtering to motion vectors for outlier-rejection and motion field smoothing. The filtered motion vectors are updated by the bilateral motion refinement with rotation. After the refined motion vector is obtained, the intermediate frame is generated by applying the overlapped block motion compensation (OBMC). Experimental results show that the proposed algorithm provides a better performance than the previous methods subjectively and objectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.397-405
• /
• 2003

In this paper, we propose an efficient motion estimation algorithm which can reduce computational complexity by using characteristics of wavelet coefficient in each subband while keeping about the same image quality as in using MRME(multiresolution motion estimation). In general, because of the high similarity between consecutive frames, we first decide whether the motion exists or not by just comparing MAD(mean absolute difference) between blocks with threshold in the lowest subbands of consecutive two frames. If it turns out that there is no motion in the lowest subband, we can also decide no motion exists in the higher subband. This is due to the characteristics of wavelet transform. Conversely, if we find any motion in the lowest subband, we can reduce computational complexity by estimating high subband motion vectors selectively according to the amount of computational complexity by estimating high subband motion vectors selectively according to the amount of energy in that subband. Experimental results are shown that algorithm suggested in this paper maintains about the same PSNR as MRME. However, the processing time was reduced about 30-50% compared with the MRME.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1055-1061
• /
• 2008

H.264 is the prominent video coding standard in various applications such as real-time streaming and digital multimedia broadcasting, since it provides enhanced compression performance, error resilience tools, and network adaptation. Compression efficiency of H.264 has been improved, however, it requires more computing and memory access than traditional methods. In this paper we proposed adaptive intra fast algorithm for real-time video surveillance system reducing the encoding complexity of H264/A VC. For this aim, temporal interrelationship between macroblock in the previous and the current frame is used to decide the encoding mode of macroblock fast. As a result, though video quality was deteriorated a little, less than 0.04dB, and bit rate was somewhat increased in suggested method, however, proposed method improved encoding time significantly and, in particular, encoding time of an image with little changes of neighboring background such as surveillance video was more shortened than traditional methods.

• Journal of Biomedical Engineering Research
• /
• v.18 no.3
• /
• pp.223-231
• /
• 1997

In this paper, an interframe coding method for volumetric medical images is proposed. By treating interslice variations as the motion of bones or tissues, we use the motion compensation (MC) technique to predict the current frame from the previous frame. Instead of a block matching algorithm (BMA), which is the most common motion estimation (ME) algorithm in video coding, image warping with biolinear transformation has been suggested to predict complex interslice object variation in medical images. When an object disappears between slices, however, warping prediction has poor performance. In order to overcome this drawback, an overlapped block motion compensation (OBMC) technique is combined with carping prediction. Motion compensated residual images are then encoded by using an embedded zerotree wavelet (EZW) coder with small modification for consistent quality of reconstructed images. The experimental results show that the interframe coding suing warping prediction provides better performance compared with interframe coding, and the OBMC scheme gives some additional improvement over the warping-only MC method.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.3
• /
• pp.262-266
• /
• 2020

In this paper, we proposed an effective technique for hiding the watermark in the LSB of a color image by applying spatial encryption techniques. Even if the watermark hidden in the LSB of the image is extracted, the information of the extracted watermark cannot be decrypted because the watermark is encrypted using various spatial encryption techniques. Therefore, if the watermark is concealed in the LSB using the spatial encryption techniques proposed in this paper, the security is greatly improved compared to the existing technique of embedding the watermark in the LSB. When watermarking is performed by applying the proposed technique, the image quality of the watermark-concealed image is very good, so it is impossible to distinguish it from the original image, and the watermark, which is confidential data, can be extracted from the watermarked image without loss. The performance of the proposed technique was mathematically analyzed and the superiority of the proposed technique was confirmed through experiments. When the watermark was concealed by applying the proposed technique to Lenna, airplane, Tiffany, and pepper images having a size of 512×512, the PSNR values of the watermarked images were 53.91dB, 54.10dB, 54.09dB, and 54.13dB, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.383-393
• /
• 2010

DVC (Distributed Video Coding) allows us to explore the video statistics at the decoder side, resulting in a less complex encoder and more complex decoder. In this approach, it is important to generate a good prediction to the current Wyner-Ziv frame, called side information, which plays a crucial role in the overall performance of a DVC system. Conventional MCFI (motion compensated frame interpolation) techniques, which explore temporal correlations between neighbor frames of the current frame, preform the block-based or object-based motion estimation, but, they do not include the basis frame for the Wyner-Ziv frame. This paper proposes an efficient way to get better side information, by finding the average frame between neighbor frames and by comparing adaptively the candidate blocks. Through computer simulations, it is shown that the proposed method can improve the performance up to 0.4dB and provide better subjective and objective visual qualities in Wyner-Ziv CODEC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1480-1489
• /
• 1999

In this paper, we propose a new post-processing method which can solve a problem of MSDS(Mean Squared Difference of Slope) method. Using that method the blocking artifacts can significantly be reduced without any restriction, which is a major drawback of block-based DCT compression method. In this approach, the OSLD(Overlapped Sub-Laplacian Distribution) of dequantized block boundary pixel difference values is defined and used to categorize each block of an image into one of four types. Those types are also classified into one of two classes: an edge and a non-edge classes. A slope across the block boundary is used to quantify discontinuity of the image. If an absolute estimated quantization error value of a DCT coefficient is greater than the corresponding quantization step size, it is saturated to the step size in the edge class. The proposed post-processing method can improve not only the PSNR value up to 0.1~O.3 dB but visual quality without any constraints determined by ad-hoc manner.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.755-760
• /
• 2005

To transmit a video bit stream over low bandwith, such as mobile, channels, encoding algorithms for high bit rate like H.263+ are used. In transmitting video bit-streams, packet losses cause severe degradation in image quality. This paper proposes a new algorithm for the recovery of missing or erroneous motion vectors when H.263+ bit-stream is transmitted. Considering that the missing or erroneous motion vectors are closely related with those of neighboring blocks, this paper proposes a temporal-spatial error concealment algorithm. The proposed approach is that missing or erroneous Motion Vectors(MVs) are recovered by clustering the movements of neighboring blocks by their homogeneity. MVs of neighboring blocks we clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in subjective and objective evaluation than existing methods.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1002-1012
• /
• 2019

360VR content requires short latency, such as immediate response to viewers' viewport changes and high quality video delivery. It is necessary to consider efficient transmission that guarantees the QoE(Quality of Experience) of the 360VR contents with limited bandwidth. Several research has been introduced to reduce overall bandwidth consumption by predicting a user's viewport and allocating different bit rates to the area corresponding to the viewport. In this paper, we propose novel viewport prediction scheme that uses sound source location information of 360VR contents as auditory recognition information along with visual recognition information. Also, we propose efficient transmission algorithm by allocating a bit rate properly based on improved viewport prediction. The proposed scheme improves the accuracy of the viewport prediction and provides high quality videos to tiles corresponding to the user's viewpoint within the limited bandwidth.