본문 바로가기
KERD
논문KCI 등재

Implementation of an efficient super resolution algorithm for game images using sparse matrix multiplication

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

초록

We present a super resolution algorithm that increases the resolution of game scenes. Since game scenes are required to be rendered in real time, rendering high-resolutional game scenes in real time is very challenging. Therefore, increasing the resolution of game scenes rendered in low resolution is very promising. In order to present a fast super resolution algorithm, we implement our super resolution algorithm using a sparse matrix operation that can be accelerated through a matrix multiplication unit (MMU). Since many open source GPUs present an acceleration environment, our MMU-based approach can be implemented in many open source GPUs. As a baseline of our approach, we present a sparse matrix multiplication formula of bilinear interpolation and bicubic interpolation. We furthermore present a sparse matrix multiplication form of a convolution operation, which is necessary for deep learning-based super resolution algorithms. The filters employed in the convolution operations are converted to a series of sparse matrices, which are multiplied to complete the deep learning-based super resolution model. We demonstrate the performance of our approach by measuring peak signal-to-noise ratio (PSNR) and mean opinion score (MOS) of the result images generated by our approach and by the existing methods.

Abstract

We present a super resolution algorithm that increases the resolution of game scenes. Since game scenes are required to be rendered in real time, rendering high-resolutional game scenes in real time is very challenging. Therefore, increasing the resolution of game scenes rendered in low resolution is very promising. In order to present a fast super resolution algorithm, we implement our super resolution algorithm using a sparse matrix operation that can be accelerated through a matrix multiplication unit (MMU). Since many open source GPUs present an acceleration environment, our MMU-based approach can be implemented in many open source GPUs. As a baseline of our approach, we present a sparse matrix multiplication formula of bilinear interpolation and bicubic interpolation. We furthermore present a sparse matrix multiplication form of a convolution operation, which is necessary for deep learning-based super resolution algorithms. The filters employed in the convolution operations are converted to a series of sparse matrices, which are multiplied to complete the deep learning-based super resolution model. We demonstrate the performance of our approach by measuring peak signal-to-noise ratio (PSNR) and mean opinion score (MOS) of the result images generated by our approach and by the existing methods.

참고문헌 (11)

  1. Dong, C., "Image super-resolution using deep onvolutional networks", Proc. of IEEE 2015, pp.295~307 (2015)
  2. Ledig, C., "Photo-realistic single image super-resolution using a generative adversarial network", Proc. of CVPR, pp.4681~4690 (2017)
  3. Kim, J., "Accurate image super-resolution using very deep convolutional networks", Proc. of CVPR, pp.1646~1654 (2016)
  4. Lim, B., "Enhanced deep residual networks for single image super-resolution", Proc. of CVPR, pp.136~144 (2017)
  5. "Dynamic Super Resolution Improves Your Games With 4K-Quality Graphics On HD Monitors" (2014)[URL]
  6. "FidelityFX Super Resolution"[URL]
  7. "Bilinear interpolation"[URL]
  8. "Bicubic interpolation"[URL]
  9. Elsabbagh, F., "Vortex : OpenCL Compatible RISC-V GPGPU", arXiv : 2002. 12151, ~ (2020)
  10. "Sparse matrix"[URL]
  11. Kim. Y., "Comparison of Rendering Speeds and PSNRs of 3D Game Visual Effect Techniques based on Deferred Rendering according to Screen Resolutions", Proc. of KSCG (2020)

관련 논문AI추천

이 간행물의 다른 논문 (11건)