A branch-and-bound framework for unsupervised common event discovery

DOI10.1007/s11263-017-0989-7zbMath1455.68220OpenAlexW2586954579WikidataQ49874641 ScholiaQ49874641MaRDI QIDQ2193773

Wen-Sheng Chu, Daniel S. Messinger, Fernando De La Torre, Jeffrey F. Cohn

Publication date: 20 August 2020

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc5605189

zbMATH Keywords

global optimizationbranch and boundunsupervised learningevent detectionvideo indexinghuman interactionbag of wordscommon event discoverysynchrony discovery

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Machine vision and scene understanding (68T45)

Related Items (1)

A branch and bound algorithm for dynamic resource allocation in population disease management

Uses Software

• Cohn-Kanade
• PMTK
• EMD
• PASCAL VOC

Cites Work

• Unnamed Item
• Unnamed Item
• Fast PRISM: branch and bound Hough transform for object class detection
• The earth mover's distance as a metric for image retrieval
• A Stochastic Grammar of Images
• Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
• A Branch and Bound Algorithm for Feature Subset Selection
• The Complexity of Some Problems on Subsequences and Supersequences
• Algorithms on Strings, Trees and Sequences
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis

This page was built for publication: A branch-and-bound framework for unsupervised common event discovery