arXiv:1712.06914
Bipartite Graph Matching for Keyframe Summary Evaluation
원문 초록
A keyframe summary, or "static storyboard", is a collection of frames from a video designed to summarise its semantic content. Many algorithms have been proposed to extract such summaries automatically. How best to evaluate these outputs is an important but little-discussed question. We review the current methods for matching frames between two summaries in the formalism of graph theory. Our analysis revealed different behaviours of these methods, which we illustrate with a number of case studies. Based on the results, we recommend a greedy matching algorithm due to Kannappan et al.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Optimizing Incomplete, Large-Scale and Sparse Multi-Graph Matching in Bioimaging
Probing Neural Topology of Large Language Models
PackHero: A Scalable Graph-based Approach for Efficient Packer Identification
Learning without Isolation: Pathway Protection for Continual Learning
Graph-Reward-SQL: Execution-Free Reinforcement Learning for Text-to-SQL via Graph Matching and Stepwise Reward
Test-Time Domain Generalization via Universe Learning: A Multi-Graph Matching Approach for Medical Image Segmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.