A Stidy on The Algorithm of The Scene Change Detection that Minimizes The Number of The Frame Comparison 


Vol. 27,  No. 5, pp. 506-516, May  2002


PDF
  Abstract

Most of the existing algorithms of the scene change detection are the sequential algorithms to spend much time because of sequentially comparing each frame with its previous frame in video sequence. To solve those problems, the non-sequential algorithms using the temporal sampling have been proposed. In the non-sequential algorithms, the distance sampling the video sequence is very important. We derive the best optimized distance that minimizes the number of the frame comparison in the video sequence. Using the derived distance, the non-sequential algorithm is proposed. Experimental results show that the proposed algorithm is more effective than the previous ones.

  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]

S. Kim, J. Kim, B. Chun, D. Park, J. Jang, "A Stidy on The Algorithm of The Scene Change Detection that Minimizes The Number of The Frame Comparison," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 5, pp. 506-516, 2002. DOI: .

[ACM Style]

Shin-Hyoung Kim, Joong-Heon Kim, Byung-Tea Chun, Doo-Yeong Park, and Jong-Whan Jang. 2002. A Stidy on The Algorithm of The Scene Change Detection that Minimizes The Number of The Frame Comparison. The Journal of Korean Institute of Communications and Information Sciences, 27, 5, (2002), 506-516. DOI: .

[KICS Style]

Shin-Hyoung Kim, Joong-Heon Kim, Byung-Tea Chun, Doo-Yeong Park, Jong-Whan Jang, "A Stidy on The Algorithm of The Scene Change Detection that Minimizes The Number of The Frame Comparison," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 5, pp. 506-516, 5. 2002.