Byung-Gyu Kim
Research Subjects
Byung-Gyu Kim has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Chang-Sik Cho
Future Computing Research Division Artificial Intelligence Research Lab ETRI 34129 Daejeon South KOREA
7 shared publications - Jongho Kim
ETRI, Daejeon, Korea
3 shared publications Jong-Ho Kim
2 shared publications- Suk-Kyu Song
Embedded S/W Research Division, Electronics and Telecommunications Research Institute (ETRI), 161 Gajeong-dong, Yuseong-gu, Daejeon 305-350, Korea
2 shared publications Chang-Sik Cho
Embedded S/W Research Division, Electronics and Telecommunications Research Institute (ETRI), 161 Gajeong-dong, Yuseong-gu, Daejeon 305-350, Korea
1 shared publication- Suk-Kyu Song1 shared publication
Latest Publications
- 1 December 2007
- Published by Wiley in ETRI Journal
- Vol. 29 (6) , 736-744
Fast Inter Mode Decision Algorithm Based on Macroblock Tracking in H.264/AVC Video
- 1 December 2007
- Published by Wiley in ETRI Journal
- Vol. 29 (6) , 736-744
Fast Inter Mode Decision Algorithm Based on Macroblock Tracking in H.264/AVC Video
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 11 (19457871) , 1599-1602
Distortion-Based Partial Distortion Search for Fast Motion Estimation
Block motion estimation with full search is computationally complex. To reduce this complexity, different methods have been proposed, including partial distortion, which can reduce the computational complexity with no loss of image quality. We propose a distortion-based partial distortion search (DPDS) based on the magnitude of distortion and adaptive update of the matching order. We calculate absolute differences for all pixels in the predicted block point. Pixels are then sorted by the amount of distortion in a descending order for the matching process, which produces a scanning map. The sum of the absolute differences (SAD) of other candidate positions is then computed from this matching order. We also use an update of the scanning map by checking the increase in the number of absolute differences for the SAD value. The proposed DPDS algorithm improves the computational efficiency, compared with the original PDS scheme, because the accumulated value of the absolute pixel differences can rapidly reach the current minimum SAD value. The proposed algorithm is 4-13 times faster than the full search method with the same visual quality.
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 11 (19457871) , 1599-1602
Distortion-Based Partial Distortion Search for Fast Motion Estimation
Block motion estimation with full search is computationally complex. To reduce this complexity, different methods have been proposed, including partial distortion, which can reduce the computational complexity with no loss of image quality. We propose a distortion-based partial distortion search (DPDS) based on the magnitude of distortion and adaptive update of the matching order. We calculate absolute differences for all pixels in the predicted block point. Pixels are then sorted by the amount of distortion in a descending order for the matching process, which produces a scanning map. The sum of the absolute differences (SAD) of other candidate positions is then computed from this matching order. We also use an update of the scanning map by checking the increase in the number of absolute differences for the SAD value. The proposed DPDS algorithm improves the computational efficiency, compared with the original PDS scheme, because the accumulated value of the absolute pixel differences can rapidly reach the current minimum SAD value. The proposed algorithm is 4-13 times faster than the full search method with the same visual quality.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0747668X,p. 1-5
A Fast Block Mode Decision Algorithm using a Block Correlation in H.264/AVC
The recent video coding standard H.264/AVC show extremely higher coding efficiency compare to any other previous standards. Although H.264/AVC can achieve over 50% of bit rate saving with same quality using the rate-distortion process, but it brings high computational complexity. In this paper, we propose an algorithm that can reduce the complexity of the codec by reducing the block mode decision process adaptively. In this paper an efficient method is proposed to reduce the inter mode decision coding complexity using the direct prediction methods based on inter block correlation and adaptive rate distortion cost threshold for early stopping. The intra mode decision complexity is also reduced using the early intra skip method. The experimental results show that the proposed algorithm can achieve up to 43.85~74.12% speed up ratio with a little PSNR loss. Increment in bit requirement is also not much noticeable.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0747668X,p. 1-5
A Fast Block Mode Decision Algorithm using a Block Correlation in H.264/AVC
The recent video coding standard H.264/AVC show extremely higher coding efficiency compare to any other previous standards. Although H.264/AVC can achieve over 50% of bit rate saving with same quality using the rate-distortion process, but it brings high computational complexity. In this paper, we propose an algorithm that can reduce the complexity of the codec by reducing the block mode decision process adaptively. In this paper an efficient method is proposed to reduce the inter mode decision coding complexity using the direct prediction methods based on inter block correlation and adaptive rate distortion cost threshold for early stopping. The intra mode decision complexity is also reduced using the early intra skip method. The experimental results show that the proposed algorithm can achieve up to 43.85~74.12% speed up ratio with a little PSNR loss. Increment in bit requirement is also not much noticeable.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Fast Inter-Mode Decision Algorithm for P Slices in H.264/AVC Video Standard
We propose a fast macro-block (MB) mode prediction and decision algorithm based on temporal correlation information for P-slices in the H.264/AVC video standard. There are 8 block types for temporal decorrelation including SKIP mode exist based on rate-distortion (RD) optimization. This scheme gives rise to exhaustive computations (search) in the coding procedure. To reduce this computational load, a thresholding method for fast inter mode decision using a MB tracking scheme to find the most correlated block and RD cost of that is suggested for early stop of the inter mode determination. Firstly, an inter mode candidate selection method is suggested through the statistical analysis. Then an adaptive inter mode search algorithm is applied by using RD cost of the most correlated MB. Through comparative analysis, a speed-up factor of up to 70.59% was verified with a negligible bit increment and a minimal loss of image quality.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Fast Inter-Mode Decision Algorithm for P Slices in H.264/AVC Video Standard
We propose a fast macro-block (MB) mode prediction and decision algorithm based on temporal correlation information for P-slices in the H.264/AVC video standard. There are 8 block types for temporal decorrelation including SKIP mode exist based on rate-distortion (RD) optimization. This scheme gives rise to exhaustive computations (search) in the coding procedure. To reduce this computational load, a thresholding method for fast inter mode decision using a MB tracking scheme to find the most correlated block and RD cost of that is suggested for early stop of the inter mode determination. Firstly, an inter mode candidate selection method is suggested through the statistical analysis. Then an adaptive inter mode search algorithm is applied by using RD cost of the most correlated MB. Through comparative analysis, a speed-up factor of up to 70.59% was verified with a negligible bit increment and a minimal loss of image quality.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, V - 301-V - 304
A Fast Inter-Mode Decision Algorithm Based on Macro-Block Tracking for P Slices in the H.264/AVC Video Standard
A fast inter-mode determination algorithm based on the macro-block (MB) tracking scheme and rate-distortion (RD) cost is proposed for the H.264/AVC video standard in which residual prediction is composed of intra-modes and inter-modes. In addition to intra-mode prediction, 8 block types exist for the best coding gain based on rate-distortion (RD) optimization in the inter-mode prediction. This scheme gives rise to exhaustive computations (search) in the coding procedure. To reduce the computational load of the inter-mode search at the inter-frame, we propose a new inter-mode determination algorithm based on the rate-distortion (RD) cost of the neighborhood MB that is tracked for the current MB in the previous frame. Based on the MB tracking scheme, an efficient sequential mode search approach is presented. We verify the performance of the proposed scheme through comparative analysis of experimental results using JM reference software.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, V - 301-V - 304
A Fast Inter-Mode Decision Algorithm Based on Macro-Block Tracking for P Slices in the H.264/AVC Video Standard
A fast inter-mode determination algorithm based on the macro-block (MB) tracking scheme and rate-distortion (RD) cost is proposed for the H.264/AVC video standard in which residual prediction is composed of intra-modes and inter-modes. In addition to intra-mode prediction, 8 block types exist for the best coding gain based on rate-distortion (RD) optimization in the inter-mode prediction. This scheme gives rise to exhaustive computations (search) in the coding procedure. To reduce the computational load of the inter-mode search at the inter-frame, we propose a new inter-mode determination algorithm based on the rate-distortion (RD) cost of the neighborhood MB that is tracked for the current MB in the previous frame. Based on the MB tracking scheme, an efficient sequential mode search approach is presented. We verify the performance of the proposed scheme through comparative analysis of experimental results using JM reference software.
- Open Access
- 7 December 2006
- Published by Wiley in ETRI Journal
- Vol. 28 (6) , 721-731
A Fast Intra Skip Detection Algorithm for H.264/AVC Video Encoding
- 7 December 2006
- Published by Wiley in ETRI Journal
- Vol. 28 (6) , 721-731
Open AccessA Fast Intra Skip Detection Algorithm for H.264/AVC Video Encoding
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15224880,p. 1333-1336
Efficient Inter-Mode Decision Based on Contextual Prediction for the P-Slice in H.264/AVC Video Coding
We propose a fast inter-mode prediction and decision algorithm based on a contextual information for the P-slices in the H.264/AVC video standard. In the H.264/AVC standard, motion estimation part is composed of intra-modes and inter-modes. In the inter-mode prediction, 7 block types exist to get the best coding gain based on rate-distortion (R-D) optimization. This scheme gives rise to an exhaustive computation (search) in the coding procedure. To overcome this computational exhaustiveness, an improved technique is suggested by using the contextual prediction. Also, we will verify the performance of the proposed scheme through the analysis of some experimental results.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15224880,p. 1333-1336
Efficient Inter-Mode Decision Based on Contextual Prediction for the P-Slice in H.264/AVC Video Coding
We propose a fast inter-mode prediction and decision algorithm based on a contextual information for the P-slices in the H.264/AVC video standard. In the H.264/AVC standard, motion estimation part is composed of intra-modes and inter-modes. In the inter-mode prediction, 7 block types exist to get the best coding gain based on rate-distortion (R-D) optimization. This scheme gives rise to an exhaustive computation (search) in the coding procedure. To overcome this computational exhaustiveness, an improved technique is suggested by using the contextual prediction. Also, we will verify the performance of the proposed scheme through the analysis of some experimental results.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15224880,p. 2357-2360
A Directional & Adaptive Diamond Search by Adaptive Pattern Switching with a Predicted Motion Vector
We propose a simple fast block-matching algorithm (BMA) based on the direction of the predicted motion vector called directional & adaptive diamond search by adaptive pattern switching (DADS-APS). The proposal method has two sequential search steps, including 1) an initial search, and 2) a refinement search for the local area. Adaptive pattern switching (APS) is proposed for the initial search and a unit-size rood pattern is used for the refinement. The initial search step consists of pattern size determination and selection of a pattern shape. We use an adaptive pattern size that is adjusted by the amount of motion. This method is superior to a fixed-pattern size algorithm, regardless of the amount of motion. In video sequences, each motion has a unique direction. Using this property, we use adaptive pattern switching between ARPS and DADS. APS considers the motion direction so we can easily and correctly find the minimal matching error (MME) point with less error distortion. APS can thus reduce the number of poorly related search points. Analysis shows that DADS-APS exhibits good PSNR performance and the average number of search points compares favorably with other methods.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15224880,p. 2357-2360
A Directional & Adaptive Diamond Search by Adaptive Pattern Switching with a Predicted Motion Vector
We propose a simple fast block-matching algorithm (BMA) based on the direction of the predicted motion vector called directional & adaptive diamond search by adaptive pattern switching (DADS-APS). The proposal method has two sequential search steps, including 1) an initial search, and 2) a refinement search for the local area. Adaptive pattern switching (APS) is proposed for the initial search and a unit-size rood pattern is used for the refinement. The initial search step consists of pattern size determination and selection of a pattern shape. We use an adaptive pattern size that is adjusted by the amount of motion. This method is superior to a fixed-pattern size algorithm, regardless of the amount of motion. In video sequences, each motion has a unique direction. Using this property, we use adaptive pattern switching between ARPS and DADS. APS considers the motion direction so we can easily and correctly find the minimal matching error (MME) point with less error distortion. APS can thus reduce the number of poorly related search points. Analysis shows that DADS-APS exhibits good PSNR performance and the average number of search points compares favorably with other methods.
- Open Access
- 8 August 2006
- Published by Wiley in ETRI Journal
- Vol. 28 (4) , 425-434
Enhanced Inter Mode Decision Based on Contextual Prediction for P-Slices in H.264/AVC Video Coding
- 8 August 2006
- Published by Wiley in ETRI Journal
- Vol. 28 (4) , 425-434
Open AccessEnhanced Inter Mode Decision Based on Contextual Prediction for P-Slices in H.264/AVC Video Coding