The budgeted maximum coverage problem
Information Processing Letters
The MIR flickr retrieval evaluation
MIR '08 Proceedings of the 1st ACM international conference on Multimedia information retrieval
Finding sparse cuts locally using evolving sets
Proceedings of the forty-first annual ACM symposium on Theory of computing
NUS-WIDE: a real-world web image database from National University of Singapore
Proceedings of the ACM International Conference on Image and Video Retrieval
Efficient k-nearest neighbor graph construction for generic similarity measures
Proceedings of the 20th international conference on World wide web
Proceedings of the 1st ACM International Conference on Multimedia Retrieval
Beyond search: Event-driven summarization for web videos
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Image collection summarization for search result overviewing on mobile devices
IMMPD '11 Proceedings of the 2011 international ACM workshop on Interactive multimedia on mobile and portable devices
Social image search with diverse relevance ranking
MMM'10 Proceedings of the 16th international conference on Advances in Multimedia Modeling
Computer Science Review
Proceedings of the 20th ACM international conference on Multimedia
Hi-index | 0.00 |
Image/video collection summarization is an emerging paradigm to provide an overview of contents stored in massive databases. Existing algorithms require at least O(N) time to generate a summary, which cannot be applied to online scenarios. Assuming that contents are represented as a sparse graph, we propose a fast image/video collection summarization algorithm using local graph clustering. After a query node is specified, our algorithm first finds a small sub-graph near the query without looking at the whole graph, and then selects fewer number of nodes diverse to each other. Our algorithm thus provides a summary in nearly constant time in the number of contents. Experimental results demonstrate that our algorithm is more than 1500 times faster than a state-of-the-art method, with comparable summarization quality.