• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.12
• /
• pp.2527-2533
• /
• 2011

In this paper we propose a new pre-processing algorithm applied to multi-view video coding using color compensation algorithm based on image features. Multi-view images have a difference between neighboring frames according to illumination and different camera characteristics. To compensate this color difference, first we model the characteristics of cameras based on frame's feature from each camera and then correct the color difference. To extract corresponding features from each frame, we use Harris corner detection algorithm and characteristic coefficients used in the model is estimated by using Gauss-Newton algorithm. In this algorithm, we compensate RGB components of target images, separately from the reference image. The experimental results with many test images show that the proposed algorithm peformed better than the histogram based algorithm as much as 14 % of bit reduction and 0.5 dB ~ 0.8dB of PSNR enhancement.

• The Journal of the Korea Contents Association
• /
• v.14 no.2
• /
• pp.39-47
• /
• 2014

Fast advancement and dynamic diffusion of Smart device make big change to personal user. They have been extended from consumer only watching video to prosumer recording and sharing User Created Video(UCV). With this reason, as a platform for various kind of content service. Especially, UCVs for the purpose of sharing experience are recorded from same event on limited time and space by some people. These are also produced by various cameras that has each angle similar like broadcasting videos. In this paper, we present multi-view characteristic of UCV and propose Multi-view UCV service that is watching UCVs from same event through adjusting camera angle. Through user satisfaction survey, we knew that adjusting camera angle is preferred for watching UCV including overlapping part more than linear watching.

• The Journal of the Korea Contents Association
• /
• v.16 no.6
• /
• pp.9-18
• /
• 2016

This paper proposes a multi-view Wyner-Ziv Video coding scheme based on spatio-temporal adaptive estimation. The proposed algorithm is designed to search for a better estimated block with joint bi-directional motion estimation by introducing weights between temporal and spatial directions, and by classifying effectively the region of interest blocks, which is based on the edge detection and the synthesis, and by selecting the reference estimation block from the effective motion vector analysis. The proposed algorithm exploits the information of a single frame viewpoint and adjacent frame viewpoints, simultaneously and then generates adaptively side information in a variety of closure, and reflection regions to have a better performance. Through several simulations with multi-view video sequences, it is shown that the proposed algorithm performs visual quality improvement as well as bit-rate reduction, compared to the conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1224-1231
• /
• 2006

This paper proposes a fast encoding algorithm of H.264/AVC multi-view video coding. The amount of data to be encoded for a multi-view video is much more than normal video's data, and the amount of information to be predicted is enormous because of the multi-view video coding uses inter-disparity prediction in addition to inter-motion prediction in conventional video coding. We noticed through an experiment that the efficiency of prediction is getting better in order of intra, inter-disparity, inter-motion, and inter-skip, and proposes a early termination algorithm by means of estimate the adaptive threshold within a GOP unit. In the experiments, the proposed algorithm shows improved processing speed about 32% compared to existing method, and increased amount of bits and distortions are relatively disregardable.

• Journal of Korea Multimedia Society
• /
• v.15 no.7
• /
• pp.859-869
• /
• 2012

The Multi-view Video Coding (MVC) which is exploiting disparities between views has been developed to improve the coding efficiency of multi-view video. But MVC has a problem of having high computing complexities because of disparity estimation. This paper propose a fast mode decision for non-anchor picture to reduce the computational time of MVC. The proposed method uses two phases. Anchor pictures in hierarchical B picture structure have a higher correlation with prediction mode selection of non-anchor pictures, so in the first phase, prediction mode of non-anchor pictures is selected by exploiting the macro-block regions in anchor picture. In the second phase, we select a reference direction of inter prediction mode exploiting a higher correlation among reference directions of inter prediction modes of 7 block sizes. Experimental results show that the proposed method could save average about 44% in the encoding time with negligible coding efficiency losses.

• Journal of Korea Multimedia Society
• /
• v.16 no.5
• /
• pp.539-548
• /
• 2013

Although Motion estimation (ME) plays an important role in digital video compression, it requires a complicated search procedure to find an optimal motion vector. Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. The computational complexity of motion estimation for Multi-view video coding increases in proportion to the number of cameras. To reduce computational complexity and maintain the image quality, a low complexity motion estimation search method is proposed in this paper. The proposed search method consists of four-grid diamond search patten, two-gird diamond search pattern and TZ 2 Point search pattern. These search patterns exploit the characteristics of the distribution of motion vectors to place the search points. Experiment results show that the speedup improvement of the proposed method over TZ search method (JMVC) can be up to 1.8~4.5 times faster by reducing the computational complexity and the image quality degradation is about to 0.01~0.24 (dB).

• Journal of Broadcast Engineering
• /
• v.13 no.4
• /
• pp.516-527
• /
• 2008

This paper introduces a derivation method of both P-SKIP and B-SKIP modes for illumination compensation in the multi-view video coding scheme. In this proposed method, mismatches between IC flag and IC offset in P-SKIP mode are removed, and also computational complexity is far reduced in B-SKIP mode in comparison to a multi-view video coding scheme. In simulation results, proposed method has the almost same coding efficiency in comparison with the referenced coding scheme. However computational complexity in 11m-time decoding process is tremendously reduced, such that the average number of blocks that should be processed in P-SKIP mode is saved in about 7.47%, and the average number of operations per block in B-SKIP mode is saved in about 50.36% and corresponding average decoding time per block is also saved in 46%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1093-1103
• /
• 2009

In this paper, we propose a new depth map based distributed multi-view video coding algorithm through an efficient side information generation. A distributed video coding scheme corrects errors between an original image and side information generated at a decoder by using channel coding techniques. Therefore, the more accurate side information is generated, the better performance of distributed video coding scheme is achieved. In the proposed algorithm, a distributed video coding scheme is applied to multi-view video coding based on depth map. Side information is also generated from images of adjacent views through 3D warping by using a depth map and is also combined with MCTI(motion compensated temporal interpolation) which uses images on a temporal axis, and 3D warping. Experimental results show that side information generated by using the proposed algorithm has 0.97dB better average PSNR compared with using MCTI and 3D warping separated. In addition, 8.01% of average bit-rate has been decreased while the same PSNR in R-D curves is kept.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.5
• /
• pp.1762-1773
• /
• 2014

In this paper, a distributed image coding scheme for multi-view video through an efficient generation of side information is proposed. A distributed video coding technique corrects the errors in the side information, which is generated with the original image, by using the channel coding technique at the decoder. Therefore, the more correct the generated side information is, the better the performance of distributed video coding. The proposed technique is to apply the distributed video coding schemes to the image coding for multi-view video. It generates side information by selectively and efficiently using both 3-dimensional warping based on the depth map with spatially adjacent frames and motion-compensated temporal interpolation with temporally adjacent frames. In this scheme the difference between the adjacent frames, the sizes of the motion vectors for the adjacent blocks, and the edge information are used as the selection criteria. From the experiments, it was observed that the quality of the side information generated by the proposed technique was improved by the average peak signal-to-noise ratio of 0.97dB than the one by motion-compensated temporal interpolation or 3-dimensional warping. The result from analyzing the rate-distortion curves revealed that the proposed scheme could reduce the bit-rate by 8.01% on average at the same peak signal-to-noise ratio value, compared to previous work.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5129-5152
• /
• 2016

Multi-view super-resolution (MVSR) aims to estimate a high-resolution (HR) image from a set of low-resolution (LR) images that are captured from different viewpoints (typically by different cameras). MVSR is usually applied in camera array imaging. Given that MVSR is an ill-posed problem and is typically computationally costly, we super-resolve multi-view LR images of the original scene via image fusion (IF) and blind deblurring (BD). First, we reformulate the MVSR problem into two easier problems: an IF problem and a BD problem. We further solve the IF problem on the premise of calculating the depth map of the desired image ahead, and then solve the BD problem, in which the optimization problems with respect to the desired image and with respect to the unknown blur are efficiently addressed by the alternating direction method of multipliers (ADMM). Our approach bridges the gap between MVSR and BD, taking advantages of existing BD methods to address MVSR. Thus, this approach is appropriate for camera array imaging because the blur kernel is typically unknown in practice. Corresponding experimental results using real and synthetic images demonstrate the effectiveness of the proposed method.