Kyutae Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kyutae Kim has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Euee Seon Jang
Department of Computer Science, Hanyang University, Seoul, South Korea
2 shared publications - Min Ku Lee
Korea Electronics Technology Institute, Seongnam-si, Republic of Korea
1 shared publication - Qiong Jia
Department of Computer Science, Hanyang University, Seoul, Republic of Korea
1 shared publication - Tianyu Dong
Department of Computer Science, Hanyang University, Seoul 04763, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 5 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 23695-23706
Simple Grid-Based Refinement Segmentation Algorithm for MPEG Video-Based Point Cloud Compression
In this paper, we proposed two simple refinement segmentation algorithms that can provide options to improve the computational complexity of the Video-based Point Cloud Compression (V-PCC) encoder. The patch image generation process in the encoding process is the most time-consuming and computationally intensive, accounting for about 70% of the encoder’s self-running time in TMC2 v13.0. Since the real-time encoding of V-PCC is within the requirement of industry, it is highly necessary to research methods that can achieve good compression performance with low computational complexity. The grid-based refinement segmentation is one of the most computationally intensive processes in V-PCC. We found that the computational complexity can be reduced by further reducing the refinement segmentation process. Therefore, we propose to change the grid-based refinement segmentation loop process, thereby reducing the computational complexity by reducing some computational processes when the projection plane index of the neighboring grid point does not change. In the experiment, the compression performance of some sequences is improved by 0.1% to 0.9%, and the refinement segmentation time used is 79.21% and 79.53% of the anchor.
- 5 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 23695-23706
Open AccessSimple Grid-Based Refinement Segmentation Algorithm for MPEG Video-Based Point Cloud Compression
In this paper, we proposed two simple refinement segmentation algorithms that can provide options to improve the computational complexity of the Video-based Point Cloud Compression (V-PCC) encoder. The patch image generation process in the encoding process is the most time-consuming and computationally intensive, accounting for about 70% of the encoder’s self-running time in TMC2 v13.0. Since the real-time encoding of V-PCC is within the requirement of industry, it is highly necessary to research methods that can achieve good compression performance with low computational complexity. The grid-based refinement segmentation is one of the most computationally intensive processes in V-PCC. We found that the computational complexity can be reduced by further reducing the refinement segmentation process. Therefore, we propose to change the grid-based refinement segmentation loop process, thereby reducing the computational complexity by reducing some computational processes when the projection plane index of the neighboring grid point does not change. In the experiment, the compression performance of some sequences is improved by 0.1% to 0.9%, and the refinement segmentation time used is 79.21% and 79.53% of the anchor.
- Open Access
- 20 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 167990-168003
Performance Evaluation of the Codec Agnostic Approach in MPEG-I Video-Based Point Cloud Compression
In this study, we evaluated the codec agnostic approach of video-based point cloud compression (V-PCC) by applying several video codecs to V-PCC. The main concept of V-PCC is to use a video codec to compress the 2D patch images generated from a 3D point cloud. As a new immersive media standard of the Moving Picture Experts Group (MPEG), V-PCC is designed to support the codec agnostic approach, which can be employed to compress point cloud data using any video codec. The V-PCC reference software is currently designed using MPEG High-Efficiency Video Coding. We extended the evaluation of video codec applicability for PCC using well-known MPEG video coding standards, such as Advanced Video Coding, Essential Video Coding, and Versatile Video Coding. We identified several key strategies for applying a video codec to V-PCC to maximize the compression efficiency or computational complexity during the evaluation. Furthermore, the coding efficiency and time complexity of each codec are tested. The evaluation tests revealed that V-PCC supports the codec agnostic approach, and that the performance of the video codec is positively correlated with the V-PCC final coding efficiency. Reviewing these key strategies would help to develop V-PCC with different video codecs based on their profiles and levels.
- 20 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 167990-168003
Open AccessPerformance Evaluation of the Codec Agnostic Approach in MPEG-I Video-Based Point Cloud Compression
In this study, we evaluated the codec agnostic approach of video-based point cloud compression (V-PCC) by applying several video codecs to V-PCC. The main concept of V-PCC is to use a video codec to compress the 2D patch images generated from a 3D point cloud. As a new immersive media standard of the Moving Picture Experts Group (MPEG), V-PCC is designed to support the codec agnostic approach, which can be employed to compress point cloud data using any video codec. The V-PCC reference software is currently designed using MPEG High-Efficiency Video Coding. We extended the evaluation of video codec applicability for PCC using well-known MPEG video coding standards, such as Advanced Video Coding, Essential Video Coding, and Versatile Video Coding. We identified several key strategies for applying a video codec to V-PCC to maximize the compression efficiency or computational complexity during the evaluation. Furthermore, the coding efficiency and time complexity of each codec are tested. The evaluation tests revealed that V-PCC supports the codec agnostic approach, and that the performance of the video codec is positively correlated with the V-PCC final coding efficiency. Reviewing these key strategies would help to develop V-PCC with different video codecs based on their profiles and levels.