TY - GEN
T1 - Rate-Distortion Optimized Temporal Segmentation Using Reinforcement Learning for Video Coding
AU - Lee, Jung Kyung
AU - Kim, Nayoung
AU - Kang, Je Won
N1 - Funding Information:
ACKNOWLEDGMENT This work has been supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIT)(No.NRF-2019R1C1C1010249). This research was supported by the MSIT(Ministry of Science and ICT), Korea, under the ITRC(Information Technology Research Center) support program(IITP-2021-2020-0-01460) supervised by the IITP(Institute for Information & Communications Technology Planning & Evaluation. This work was supported by Institute of Information & communications TechnologyPlanning & Evaluation(IITP) grant funded by the Korea government(MSIT) (No. 2020-0-00920, Development of Ultra High Resolution Unstructured Plenoptic Video Storage/Compression/Streaming Technologyfor Medium to Large Space)
Publisher Copyright:
© 2021 APSIPA.
PY - 2021
Y1 - 2021
N2 - In this paper, we present a reinforcement learning (RL)-based coding method to recursively divide video frames into several groups displaying similar temporal characteristics and improve rate-distortion (R-D) performance. Although the previous works have attempted to challenge the problem with analytical models, it was difficult to address complicated de-pendencies of video frames. In the proposed method, we cast the recursive problem as a sequence of a state-action for an agent to conduct an RL, by partitioning the current group to the half. The optimal solution is obtained by maximizing a reward function of the RL policy. Experimental results demonstrate that the proposed method can adapt to a video sequence whereas a fixed coding scheme cannot efficiently achieve optimal coding performance in dynamic video sequences.
AB - In this paper, we present a reinforcement learning (RL)-based coding method to recursively divide video frames into several groups displaying similar temporal characteristics and improve rate-distortion (R-D) performance. Although the previous works have attempted to challenge the problem with analytical models, it was difficult to address complicated de-pendencies of video frames. In the proposed method, we cast the recursive problem as a sequence of a state-action for an agent to conduct an RL, by partitioning the current group to the half. The optimal solution is obtained by maximizing a reward function of the RL policy. Experimental results demonstrate that the proposed method can adapt to a video sequence whereas a fixed coding scheme cannot efficiently achieve optimal coding performance in dynamic video sequences.
UR - http://www.scopus.com/inward/record.url?scp=85126722621&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85126722621
T3 - 2021 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2021 - Proceedings
SP - 1598
EP - 1601
BT - 2021 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2021 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 14 December 2021 through 17 December 2021
ER -