• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 한국방송공학회 2005년도 학술대회
• /
• pp.209-212
• /
• 2005

This paper introduces interactive multi-view contents authoring system based on MPEG-4. The MPEG-4 standard, which aims to provide an object based audiovisual coding tool, has been developed to address the emerging needs from communications, interactive broadcasting as well as from mixed service models resulting from technological convergence. Due to the feature of object based coding, it has been considered that MPEG-4 is the most suitable for interactive broadcasting content production. This feature is suitable for creation of the content which provides multiple views of object or scene in interactive manner. In this paper, we categorize the multi-view visual content into two types: panoramic multi-view content and object multi-view content. And design and implementation of the authoring system for interactive multi-view contents is presented. We believe that the proposed method can be effectively used for further deployment of MPEG-4 content to various interactive applications.

• Journal of Broadcast Engineering
• /
• 제25권6호
• /
• pp.911-921
• /
• 2020

Recently, MPEG-I (Immersive) has been exploring compression performance through standardization projects for immersive video. The MPEG Immersion Video (MIV) standard technology is intended to provide limited 6DoF based on depth map-based image rendering (DIBR). MIV is a model that processes the Basic View and the residual information into an Additional View, which is a collection of patches. Atlases have the unique characteristics depending on the kind of the view they are included, requiring consideration of the compression efficiency. In this paper, the performance comparison analysis of screen content coding tools such as intra block copy (IBC) is conducted, based on the pattern of various views and patches repetition. It is demonstrated that the proposed method improves coding performance around -15.74% BD-rate reduction in the MIV.

• Journal of Multimedia Information System
• /
• 제1권1호
• /
• pp.1-10
• /
• 2014

In this paper, we propose a new view synthesis technique for coding of multi-view color and depth data in arbitrary camera arrangements. We treat each camera position as a 3-D point in world coordinates and build clusters of those vertices. Color and depth data within a cluster are gathered into one camera position using a hierarchical representation based on the concept of layered depth image (LDI). Since one camera can cover only a limited viewing range, we set multiple reference cameras so that multiple LDIs are generated to cover the whole viewing range. Therefore, we can enhance the visual quality of the reconstructed views from multiple LDIs comparing with that from a single LDI. From experimental results, the proposed scheme shows better coding performance under arbitrary camera configurations in terms of PSNR and subjective visual quality.

• IEIE Transactions on Smart Processing and Computing
• /
• 제3권6호
• /
• pp.388-392
• /
• 2014

This paper proposes an early termination method of a block vector search for fast encoding of high efficiency video coding (HEVC) screen content coding (SCC). In the proposed algorithm, two blocks indicated by two block vector predictors (BVPs) were first employed as an intra block copy (IBC) search. If the sum of absolute difference (SAD) value of the block is less than a threshold defined empirically, an IBC BV search is terminated early. The initial threshold for early termination is derived by statistical analysis and it can be modified adaptively based on a quantization parameter (QP). The proposed algorithm is evaluated on SCM-2.0 under all intra (AI) coding configurations. Experimental results show that the proposed algorithm reduces IBC BV search time by 29.23% on average while the average BD-rate loss is 0.41% under the HEVC SCC common test conditions (CTC).

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제34권7C호
• /
• pp.681-686
• /
• 2009

In H.264/Ave, an intra prediction added to the P-frame coding slightly improves both of image quality and bit rate, but greatly increases an amount of computation. In order to reduce the increase in computation, this paper proposes an image contents based intra prediction coding using characteristics that the best intra block mode depends on the image content of a macro block. The proposed algorithm estimates the image content with image complexity and the best inter block mode, and then selects or excludes a intra block mode on the basis of it. The simulation results show that the proposed algorithm reduces average O.OldB in image quality, and increases average 0.38% in the bit rate, but reduces average 37.02% in computation time compared with the conventional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제22권6호
• /
• pp.1178-1184
• /
• 1997

Encoding of segment contours is a critical part of a region-based coding system especially at low bit rates where the contour information occupies a majority of the bit rate. When approximating contours with polygons, a fixed upper bound on the distortion is set for the approximation process. Instead of using this fixed bound, adaptive approximation bound for a lossy coding of contourts is proposed in this paper. A function representing the relative importance of the contour segmentis defined to take into account the spatial content of the image. By using this function, the contour can be approximated adaptively. This allows a more general approach than the methods with the fixed distortion measure. The effectiveness of the adaptive contour coding approach is verified through experiments.

• Journal of information and communication convergence engineering
• /
• 제3권1호
• /
• pp.56-61
• /
• 2005

In this paper, we present a video rate control scheme for storage and delivery in which the time-varying viewing interests are controlled by human gaze. To track the gaze, the pupil's movement is detected using the three-step process : detecting face region, eye region, and pupil point. To control bit rates, the quantization parameter (QP) is changed by considering the static parameters, the video object priority derived from the pupil tracking, the target PSNR, and the weighted distortion value of the coder. As results, we achieved human interfaced visual model and corresponding region-of-interest rate control system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권7호
• /
• pp.2449-2463
• /
• 2014

Hierarchical B-frame coding was introduced into H.264/SVC to provide temporal scalability and improve coding performance. A content analysis-based adaptive group of picture structure (AGS) can further improve the coding efficiency, but damages the inter-frame correlation and temporal scalability of hierarchical B-frame to different degrees. In this paper, we propose a group of pictures (GOP) adaptation coding method based on the positions of video cuts. First, the cut positions are accurately detected by the combination of motion coherence (MC) and mutual information (MI); then the GOP is adaptively and proportionately set by the analysis of MC in one scene. In addition, we propose a binary tree algorithm to achieve the temporal scalability of any size of GOP. The results for test sequences and real videos show that the proposed method reduces the bit rate by up to about 15%, achieves a performance gain of about 0.28-1.67 dB over a fixed GOP, and has the advantages of better transmission resilience and video summaries.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 한국방송공학회 1996년도 Proceedings International Workshop on New Video Media Technology
• /
• pp.61-66
• /
• 1996

In this paper, an efficient contour coding algorithm incorporating polygonal approximation and discrete sine transform is introduced. Contour information is inevitable in content based coding, and polygonal approximation method is widely used to compress the contour information. However polygonal approximation method is not suitable when fine contour is needed. We show that the error signal of polygonal approximation can be efficiently represented using DST, that is, the contour information can be represented accurately with polygons and DST coefficients. With this contour coding scheme, the required bits to represent a contour can be reduced by about 40-50% with virtually no degradation compared to the existing chain coding method.