Changsung Kim
University of Southern California
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Changsung Kim.
Journal of Visual Communication and Image Representation | 2006
Changsung Kim; Hsuan-Huei Shih; C.-C. Jay Kuo
A fast H.264 Intra-prediction mode selection scheme is proposed in this work. The objective is to reduce the encoder complexity without significant rate–distortion performance degradation. The proposed method uses spatial and transform domain features of the target block jointly to filter out the majority of candidate modes. This is justified by examining the posterior error probability and the average rate–distortion loss. For the final mode selection, either the feature-based or the RDO (rate–distortion optimization)-based method is applied to 2–3 candidate modes. It is demonstrated by experimental results that the proposed scheme demands only 7–10% of the complexity of the RDO (rate–distortion optimized) mode decision scheme with little quality degradation.
Multimedia systems and applications. Conference | 2003
Changsung Kim; Qing Li; C.-C. Jay Kuo
We investigate the encoding speed improvement for H.264 with a special focus on fast intra-prediction mode selection in this work. It is possible to adopt the rate-distortion (RD) optimized mode in H.264 to maximize the coding gain at the cost of a very high computational complexity. To reduce the complexity associated with the intra-prediction mode selection, we propose a two-step fast algorithm. In the first step, we make a course-level decision to split all possible candidate modes into two groups: the group to be examined further and the group to be ignored. The sizes of these two groups are adaptively determined based on the block activities. Then, in the second step, we focus on the group of interest, and consider an RD model for final decision-making. It is demonstrated by experiment results that the proposed scheme performs 5 to 7 time faster than the current H.264 encoder (JM5.0c) with little degradation in the coding gain.
visual communications and image processing | 2006
Changsung Kim; Jun Xin; Anthony Vetro; C.-C. Jay Kuo
A new complexity-scalable framework for motion estimation is proposed to efficiently reduce the motioncomplexity of encoding process, with focus on long term memory motion-compensated prediction of the H.264 video coding standard in this work. The objective is to provide a complexity scalable scheme for the given motion estimation algorithm such that it reduces the encoding complexity to the desired level with insignificant penalty in rate-distortion performance. In principle, the proposed algorithm adaptively allocates available motion-complexity budget to macroblock based on estimated impact towards overall rate-distortion (RD) performance subject to the given encoding time limit. To estimate macroblock-wise tradeoff between RD coding gain (J) and motion-complexity (C), the correlation of J-C curve between current macroblock and collocated macroblock in previous frame is exploited to predict initial motion-complexity budget of current macroblock. The initial budget is adaptively assigned to each blocksize and block-partition successively and motion-complexity budget is updated at the end of every encoding unit for remaining ones. Based on experiment, proposed J-C slope based allocation is better than uniform motion-complexity allocation scheme in terms of RDC tradeoff. It is demonstrated by experimental results that the proposed algorithm can reduce the H.264 motion estimation complexity to the desired level with little degradation in the rate distortion performance.
Proceedings of SPIE | 2005
Changsung Kim; C.-C. Jay Kuo
An efficient search range prediction method is proposed to reduce the complexity of motion search in the H.264 video coding standard in this work. The main idea is to predict the temporal search range by modeling the relationship between the rate-distortion (RD) coding gain and the required computational complexity. The proposed algorithm first predicts the temporal search range to maximize the ratio of the expected RD coding gain and the normalized computational cost. Then, fast motion search is performed within the predicted search range with some early termination rule. Experimental results show that the proposed algorithm can save approximately 63-75% of the encoding complexity in motion estimation of H.264 (JM9.3) with negligible degradation in the RD performance.
Optical Science and Technology, the SPIE 49th Annual Meeting | 2004
Changsung Kim; C.-C. Jay Kuo
A fast intra/inter mode decision method using a risk-minimization criterion is proposed to reduce the encoder complexity of the H.264 encoder in this work. The current H.264 reference codes employ exhaustive search to find the best mode that optimizes the rate-distortion performance among all possible intra/inter predictive modes. To develop a fast binary mode decision scheme (i.e. either the inter- or intra-prediction mode to be used), we consider the risk of choosing the wrong predictive mode. If the cost of choosing the wrong mode in terms of the averaged rate-distortion (RD) performance loss is low, then the risk is tolerable. The fast algorithm consists of three steps. First, three features are extracted from the current macroblock to form a 3D feature vector. Second, the feature space is partitioned into three regions, i.e. risk-free, risk-tolerable, and risk-intolerable regions. Finally, depending on the location of the feature vector in the feature space, we can apply mechanisms of different complexities for the final mode decision. The proposed algorithm can select either the correct mode or the wrong mode but with low RD performance degradation. It is demonstrated by experimental results that the proposed algorithm can save approximately 19-25% of the total encoding time of H.264 (JM7.3a) with little degradation in the rate-distortion performance.
conference on image and video communications and processing | 2005
Changsung Kim; C.-C. Jay Kuo
A feature-based coding mode prediction method is proposed to reduce the encoder complexity of the H.264 video coding standard in this work. The current H.264 reference codes employ exhaustive search to find the best mode that optimizes the rate-distortion performance among all possible intra/inter predictive modes. To develop a fast binary intra/inter-mode prediction scheme, we consider the expected risk of choosing the wrong mode in a multi-dimensional feature space. The proposed algorithm consists of three steps. First, three features are extracted from the current macroblock. Second, the expected risk is calculated for the corresponding partition in the trained feature vector space, which is used to decide where the feature vector lies in one of the three regions depending on the expected risk, i.e. risk-free, risk-tolerable, and risk-intolerable regions. Finally, depending on the region to which the feature vector belongs, we can apply mechanisms of different complexities for final mode decision. For the likelihood estimation of the risk, parametric and non-parametric density estimation schemes are compared in terms of the rate-distortion-complexity tradeoff. It is demonstrated by experimental results that the proposed algorithm can save approximately 20-32% of the total encoding time of H.264 (JM7.3a) with little degradation in the rate-distortion performance.
visual communications and image processing | 2004
Changsung Kim; Hsuan-Huei Shih; Chung-Chieh Jay Kuo
A multistage mode decision method to reduce the complexity of Intra prediction in H.264/JVT is proposed in this work. The rate-distortion optimized (RDO) mode decision is adopted by H.264 to achieve the optimal coding gain at the cost of a very high computational complexity. Our research goal is to reduce the complexity of intra prediction without significant RD performance loss. The proposed fast intra prediction algorithm uses two features, i.e. the sum of absolute residual coefficients (SATD) and the sum of absolute gradients (SAG), and a simplified RDO method to determine the best mode for 4x4 blocks. It incorporates an early termination mechanism at various intermediate decision steps to avoide unnecessary computations when a good decision can be made at an earlier stage. It is demonstrated by experimental results that the proposed scheme performs approximately 10 to 30 times faster than the current RDO mode decision (JM7.3a) with little degradation in the coding gain.
Archive | 2004
Changsung Kim; Hsuan-Huei Shih; Chung-Chieh Kuo
Archive | 2005
Changsung Kim; Hsuan-Huei Shih; Chung-Chieh Kuo; Chia-Hung Yeh
Archive | 2005
Jun Xin; Changsung Kim; Anthony Vetro