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...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
One of the principal bottlenecks in applying learning techniques to classification problems is the large amount of labeled training data required. Especially for images and video, ...
Ajay J. Joshi, Fatih Porikli, Nikolaos Papanikolop...
In this paper, we investigate the detection of semantic
human actions in complex scenes. Unlike conventional
action recognition in well-controlled environments,
action detection...
We introduce an algorithm that guides the user to tag
faces in the best possible order during a face recognition assisted
tagging scenario. In particular, we extend the active
l...
Ashish Kapoor, Gang Hua, Amir Akbarzadeh and Simon...
Structured outputs such as multidimensional vectors or graphs are frequently encountered in real world pattern recognition applications such as computer vision, natural language pr...