A video retrieval and sequencing system
ACM Transactions on Information Systems (TOIS) - Special issue on video information retrieval
Introduction to Algorithms
Video Skimming and Characterization through the Combination of Image and Language Understanding
CAIVD '98 Proceedings of the 1998 International Workshop on Content-Based Access of Image and Video Databases (CAIVD '98)
Efficient matching and clustering of video shots
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1
Time-Constrained Clustering for Segmentation of Video into Story Unites
ICPR '96 Proceedings of the International Conference on Pattern Recognition (ICPR '96) Volume III-Volume 7276 - Volume 7276
A New Hybrid Approach to Video Organization for Content-Based Indexing
ICMCS '98 Proceedings of the IEEE International Conference on Multimedia Computing and Systems
Bandwidth Allocation for Layered Multicasted Video
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Time-Constrained Keyframe Selection Technique
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Applying QoS Guaranteed Multicast Audio and Video to the Web
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
A Semantic Modeling Approach for Video Retrieval by Content
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
Semantic Video Model for Content-Based Retrieval
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
Dynamic QoS control of multimedia applications based on RTP
Computer Communications
Efficient video indexing scheme for content-based retrieval
IEEE Transactions on Circuits and Systems for Video Technology
Disruption-tolerant content-aware video streaming
Proceedings of the 12th annual ACM international conference on Multimedia
Hierarchical Indexing Structure for Efficient Similarity Search in Video Retrieval
IEEE Transactions on Knowledge and Data Engineering
Video abstraction: A systematic review and classification
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Key frame vector and its application to shot retrieval
IMCE '09 Proceedings of the 1st international workshop on Interactive multimedia for consumer electronics
IEEE Transactions on Circuits and Systems for Video Technology
A framework for video abstraction systems analysis and modelling from an operational point of view
Multimedia Tools and Applications
Introducing risplayer: real-time interactive generation of personalized video summaries
Proceedings of the 2010 ACM workshop on Social, adaptive and personalized multimedia interaction and access
On-line video abstract generation of multimedia news
Multimedia Tools and Applications
Active frame selection for label propagation in videos
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Frontiers of Computer Science: Selected Publications from Chinese Universities
Efficient keyframe-based real-time camera tracking
Computer Vision and Image Understanding
Hi-index | 0.00 |
This paper presents a novel optimization-based approach for video key frame selection. We define key frames to be a temporally ordered subsequence of the original video sequence, and the optimal k key frames are the subsequence of length k that optimizes an energy function we define on all subsequences. These optimal key subsequences form a hierarchy, with one such subsequence for every k less than the length of the video n, and this hierarchy can be retrieved all at once using a dynamic programming process with polynomial (O(n3)) computation time. To further reduce computation, an approximate solution based on a greedy algorithm can compute the key frame hierarchy in O(n驴log(n)). We also present a hybrid method, which flexibly captures the virtues of both approaches. Our empirical comparisons between the optimal and greedy solutions indicate their results are very close. We show that the greedy algorithm is more appropriate for video streaming and network applications where compression ratios may change dynamically, and provide a method to compute the appropriate times to advance through key frames during video playback of the compressed stream. Additionally, we exploit the results of the greedy algorithm to devise an interactive video content browser. To quantify our algorithms' effectiveness, we propose a new evaluation measure, called "well-distributed" key frames. Our experimental results on several videos show that both the optimal and the greedy algorithms outperform several popular existing algorithms in terms of summarization quality, computational time, and guaranteed convergence.