Adaptive Frame Rate Up-Conversion Algorithm using the Neighbouring Pixel Information and Bilateral Motion Estimation 


Vol. 35,  No. 9, pp. 761-770, Sep.  2010


PDF
  Abstract

In this paper, we propose a new Frame Rate Up-Conversion (FRUC) scheme to increase the frame rate from a lower number into a higher one and enhance the decoded video quality at the decoder. The proposed algorithm utilizes the preliminary frames of forward and backward direction using bilateral prediction. In the process of the preliminary frames, an additional interpolation is performed for the occlusion area because if the calculated value of the block with reference frame if larger than the predetermine thresholdn the block is selected as the occlusion area. In order to interpolate the occlusion area, we perform re-search to obtain the osiomal block considerhe osiomnumber of available ne block consblock. The experimental results show that performance of the proposed algorithm has better PSNR and visual quality than the conventional methods.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Oh, J. Lee, C. Min, J. Jeong, "Adaptive Frame Rate Up-Conversion Algorithm using the Neighbouring Pixel Information and Bilateral Motion Estimation," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 9, pp. 761-770, 2010. DOI: .

[ACM Style]

Hyeongchul Oh, Joohyun Lee, Changki Min, and Jechang Jeong. 2010. Adaptive Frame Rate Up-Conversion Algorithm using the Neighbouring Pixel Information and Bilateral Motion Estimation. The Journal of Korean Institute of Communications and Information Sciences, 35, 9, (2010), 761-770. DOI: .

[KICS Style]

Hyeongchul Oh, Joohyun Lee, Changki Min, Jechang Jeong, "Adaptive Frame Rate Up-Conversion Algorithm using the Neighbouring Pixel Information and Bilateral Motion Estimation," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 9, pp. 761-770, 9. 2010.