Publications

Recovering underlying Directed Acyclic Graph structures (DAG) from observational data is highly challenging due to the combinatorial …

Most of the successful deep neural network architectures are structured, often consisting of elements like convolutional neural …

We address the problem of Visual Relationship Detection (VRD) which aims to describe the relationships between pairs of objects in the …

The feature matching problem is a fundamental problem in various areas of computer vision including image registration, tracking and …

Human motion modeling is a classic problem in computer vision and graphics. Challenges in modeling human motion include high …

Hyper graph matching problems have drawn attention recently due to their robustness to noise, outliers, rotation and scaling variation. …

Solving constrained combinatorial optimization problems via MAP inference is often achieved by introducing extra potential functions …

Feature matching is a key problem in computer vision and pattern recognition. One way to encode the essential interdependence between …

Matching between two sets of objects is typically approached by finding the object pairs that collectively maximize the joint matching …

In this paper, we revisit the joint probabilistic data association (JPDA) technique and propose a novel solution based on recent …