40 search results - page 5 / 8 » Bipartite graph matching for video clip localization |
CIVR
2007
Springer
14 years 1 months ago
2007
Springer
The ability to match faces in video is a crucial component for many multimedia applications such as searching and recognizing people in semantic video browsing, surveillance and h...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We propose a space-time Markov Random Field (MRF)
model to detect abnormal activities in video. The nodes in
the MRF graph correspond to a grid of local regions in the
video fra...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...