Binary Searching Algorithm for High Speed Scene Change Indexing of Moving Pictures


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 4, pp. 1044-1049, Apr. 2000
10.3745/KIPSTE.2000.7.4.1044,   PDF Download:

Abstract

In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has faster searching speed than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect searching time and searching precision. In this study, the whole moving pictures were primarily retrieved by the temporal sampling method. When there exist a scene change within the sampling interval, we suggested a fast searching algorithm using binary searching and derived an equation formula to determine optimal primary retrieval which can minimize computation, and showed the result of the experiment on MPEG moving pictures. The result of the experiment shows that the searching speed of the suggested algorithm is maximum 13 times faster than the one of the sequential searching method.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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. C. Kim, I. K. Oh, J. W. Jang, "Binary Searching Algorithm for High Speed Scene Change Indexing of Moving Pictures," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 4, pp. 1044-1049, 2000. DOI: 10.3745/KIPSTE.2000.7.4.1044.

[ACM Style]
Sung Chul Kim, Il Kyun Oh, and Jong Whan Jang. 2000. Binary Searching Algorithm for High Speed Scene Change Indexing of Moving Pictures. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 4, (2000), 1044-1049. DOI: 10.3745/KIPSTE.2000.7.4.1044.