Show simple item record

dc.contributor.authorTruong, Ba
dc.contributor.authorVenkatesh, Svetha
dc.contributor.editorSuviSoft Oy Ltd
dc.identifier.citationTruong, B. and Venkatesh, S. 2005. Finding the optimal temporal partitioning of video sequences, in IEEE International Conference on Multimedia & Expo (ICME), Jul 6 2005, pp. 1182-1185. Amerstad, Netherlands: IEEE Computer Society Press.

The existing techniques for shot partitioning either process each shot boundary independently or proceed sequentially. The sequential process assumes the last shot boundary is correctly detected and utilizes the shot length distribution to adapt the threshold for detecting the next boundary. These techniques are only locally optimal and suffer from the strong assumption about the correct detection of the last boundary. Addressing these fundamental issues, in this paper, we aim to find the global optimal shot partitioning by utilizing Bayesian principles to model the probability of a particular video partition being the shot partition. A computationally efficient algorithm based on dynamic programming is then formulated. The experimental results on a large movie set show that our algorithm performs consistently better than the best adaptive-thresholding technique commonly used for the task.

dc.publisherIEEE Computer Society Press
dc.titleFinding the optimal temporal partitioning of video sequences
dc.typeConference Paper
dcterms.source.titleProceedings of IEEE International Conference on Multimedia & Expo (ICME 2005)
dcterms.source.seriesProceedings of IEEE International Conference on Multimedia & Expo (ICME 2005)
dcterms.source.conferenceIEEE International Conference on Multimedia & Expo (ICME 2005)
dcterms.source.conferencedatesJul 6 2005
dcterms.source.conferencelocationAmerstad, Netherlands
curtin.departmentDepartment of Computing
curtin.accessStatusFulltext not available

Files in this item


This item appears in the following Collection(s)

Show simple item record