• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.7
• /
• pp.495-502
• /
• 2013

Motion estimation (ME) that limits the performance of image quality and encoding speed has been developed to reduce temporal redundancy in video sequences and plays an important role in digital video compression. But it is computational demanding part of the encoder. Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. ME for Multi-view video requires high computational complexity. To reduce computational complexity and maintain the image quality, a fast motion estimation method is proposed in this paper. The proposed method uses a hierarchical search strategy. This strategy method consists of modified diamond search patten, multi gird diamond search pattern, and raster search pattern. These search patterns place search points symmetrically and evenly that can cover the overall search area not to fall into the local minimum or exploits 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.2 ~3 times faster while maintaining similar video quality and bit rates.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2464-2479
• /
• 2014

Multi-view video coding is an international encoding standard that attains good performance by fully utilizing temporal and inter-view correlations. However, it suffers from high computational complexity. This paper presents a fast encoder design to reduce the level of complexity. First, when the temporal correlation of a group of pictures is sufficiently strong, macroblock-based inter-view prediction is not employed for the non-anchor pictures of B-views. Second, when the disparity between two adjacent views is above some threshold, frame-based inter-view prediction is disabled. Third, inter-view prediction is not performed on boundary macroblocks in the auxiliary views, because the references for these blocks may not exist in neighboring views. Fourth, finer partitions of inter-view prediction are cancelled for macroblocks in static image areas. Finally, when estimating the disparity of a macroblock, the search range is adjusted according to the mode size distribution of the neighboring view. Compared with reference software, these techniques produce an average time reduction of 83.65%, while the bit-rate increase and peak signal-to-noise ratio loss are less than 0.54% and 0.05dB, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.3165-3181
• /
• 2019

Spherical videos, which are also called 360-degree videos, have become increasingly popular due to the rapid development of virtual reality technology. However, the large amount of data in such videos is a huge challenge for existing transmission system. To use the existing encode framework, it should be converted into a 2D image plane by using a specific projection format, e.g. the equi-rectangular projection (ERP) format. The existing high-efficiency video coding standard (HEVC) can effectively compress video content, but its enormous computational complexity makes the time spent on compressing high-frame-rate and high-resolution 360-degree videos disproportionate to the benefits of compression. Focusing on the ERP format characteristics of 360-degree videos, this work develops a fast decision algorithm for predicting the coding unit depth interval and adaptive mode decision for intra prediction mode. The algorithm makes full use of the video characteristics of the ERP format by dealing with pole and equatorial areas separately. It sets different reference blocks and determination conditions according to the degree of stretching, which can reduce the coding time while ensuring the quality. Compared with the original reference software HM-16.16, the proposed algorithm can reduce time consumption by 39.3% in the all-intra configuration, and the BD-rate increases by only 0.84%.

• Journal of Broadcast Engineering
• /
• v.22 no.4
• /
• pp.484-495
• /
• 2017

The development of display devices and the increase of network transmission bandwidth bring demands for over 2K high resolution video such as panorama video, 4K ultra-high definition commercial broadcasting, and ultra-wide viewing video. To compress these image sequences with significant amount of data, High Efficiency Video Coding (HEVC) standard with the highest coding efficiency is a promising solution. HEVC, the latest video coding standard, provides high encoding efficiency using various advanced encoding tools, but it also requires significant amounts of computation complexity compared to previous coding standards. In particular, the complexity of HEVC decoding process is a imposing challenges on real-time playback of ultra-high resolution video. To accelerate the HEVC decoding process for ultra high resolution video, this paper introduces a data-level parallel video decoding method using slice and/or tile supported by HEVC. Moreover, deblocking filter process is further parallelized. The proposed method distributes independent decoding operations of each tile and/or each slice to multiple threads as well as deblocking filter operations. The experimental results show that the proposed method facilitates executions up to 2.0 times faster than the HEVC reference software for 4K videos.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.1
• /
• pp.35-41
• /
• 2009

The H.264/SVC enables network-adaptive video transmission to smart device which uses wireless network. But, quality scalability of H.264/SVC does not consider personal subjective image quality. In addition, its network efficiency also does not optimized because it uses MGS(Medium Grained Scalability) and CGS(Coarse Grained Scalability). Thus, this paper proposed a new scalable ROI algorithm for not only subjective image quality improvement but also network adaptation. To experiment our proposed a scheme, we added designed algorithm to JSVM(Joint Scalable Video Model) open source video codec of H.264/SVC. Experiment was performed according to the pre-defined scenario for simulating various network conditions. Finally, experimental result showed our proposed scalable ROI scheme. It is better than traditional non-selective scheme in subjective video quality.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.351-358
• /
• 2002

Video compression based on DCT (Discrete Cosine Transform) has weakpoints of blocking artifacts and pixel loss when the resolution is changed. DWT (Discrete Wavelet Transform) based method can overcome such problems. In SAMCoW (Scalable Adaptive Motion Compensation Wavelet), one of wavelet based video coding algorithm, both intra frames and motion compensated error frames are encoded using EZW(Embedded Zerotree Wavelet) algorithm. However the property of wavelets transform coefficients of motion compensated error frames are different from that of still images. Signal energy is not highly concentrated in the lower bands which is true for most still image cases. Signal energy is rather evenly distributed over all frequency bands. This paper suggests a new video coding algorithm utilizing these properties. Spatial band coding which is known to be very effective for encoding images with relative1y high frequency components and not utilizing the interband coefficients correlation is applied instead of EZW to encode both intra and inter frames. In spatial band coding, the position and value of significant wavelet coefficients in each band are progressively transmitted. Unlike EZW, inter band coefficients correlations are not utilized in spatial band coding. It has been shown that spatial band coding gives better performance than EZW when applied to wavelet based video compression.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.142-147
• /
• 2009

The recent H.264/AVC video coding standard provides a higher coding efficiency than previous standards. H.264/AVC achieves a bit rate saving of more than 50 % with many new technologies, but it is computationally complex. Most of fast mode decision algorithms have focused on Baseline profile of H.264/AVC. In this paper, a fast block mode decision scheme for P- slices in High profile is proposed to reduce the computational complexity for H.264/AVC because the High profile is useful for broadcasting and storage applications. To reduce the block mode decision complexity in P- pictures of High profile, we use the SAD value after $16{\times}16$ block motion estimation. This SAD value is used for the classification feature to divide all block modes into some proper candidate block modes. The proposed algorithm shows average speed-up factors of 47.42 ${\sim}$ 67.04% for IPPP sequences.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.42-47
• /
• 2007

Video Segmentation is an essential part in region-based video coding and any other fields of the video processing. Among lots of methods proposed so far, the watershed method in which the region growing is performed for the gradient image can produce well-partitioned regions globally without any influence on local noise and extracts accurate boundaries. But, it generates a great number of small regions, which we call over segmentation problem. Therefore we proposes that adaptive trimmed mean filter for resolving the over segmentation of image. Simulation result, we confirm that proposed ATM filter improves the performance to remove noise and reduces damage for the clear degree of image in case of the noise ratio of 20% and over.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.5
• /
• pp.735-740
• /
• 2005

Video segmentation is an essential part in region-based video coding and any other fields of the video processing. Among lots of methods proposed so far, the watershed method in which the region growing is performed for the gradient image can produce well-partitioned regions globally without any influence on local noise and extracts accurate boundaries, But, it generates a great number of small regions, which we call over segmentation problem. Therefore we proposes that adaptive trimmed mean filter for resolving the over segmentation of image.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.35-38
• /
• 2000

The method of Content-based Triangular Mesh Image representation in moving pictures makes better performance in prediction error ratio and visual efficiency than that of classical block matching. Specially if background and objects can be separated from image, the objects are designed by Irregular mesh. In this case this irregular mesh design has an advantage of increasing video coding efficiency. This paper presents the techniques of mesh generation, motion estimation using these mesh, uses image warping transform such as Affine transform for image reconstruction, and evaluates the content based mesh design through computer simulation.