Graph based event detection from realistic videos using weak feature correspondence.

ICASSP(2010)

引用 9|浏览21
暂无评分
摘要
We study the problem of event detection from realistic videos with repetitive sequential human activities. Despite the large body of work on event detection and recognition, very few have addressed low-quality videos captured from realistic en- vironments. Our framework is based on solving the shortest path on a temporal-event graph constructed from the video content. Graph vertices correspond to detected event primi- tives, and edge weights are set according to generic knowl- edge of the event patterns and the discrepancy between event primitives based on a greedy matching of their visual features. Experimental results on videos collected from a retail envi- ronment validate the usefulness of the proposed approach.
更多
查看译文
关键词
pixel,indexing terms,feature extraction,shortest path,visualization,hidden markov models,graph theory,image analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要