Timezone: »

Maximal Cliques that Satisfy Hard Constraints with Application to Deformable Object Model Learning
Xinggang Wang · Xiang Bai · Xingwei Yang · Wenyu Liu · Longin Jan J Latecki

Tue Dec 13 08:45 AM -- 02:59 PM (PST) @

We propose a novel inference framework for finding maximal cliques in a weighted graph that satisfy hard constraints. The constraints specify the graph nodes that must belong to the solution as well as mutual exclusions of graph nodes, i.e., sets of nodes that cannot belong to the same solution. The proposed inference is based on a novel particle filter algorithm with state permeations. We apply the inference framework to a challenging problem of learning part-based, deformable object models. Two core problems in the learning framework, matching of image patches and finding salient parts, are formulated as two instances of the problem of finding maximal cliques with hard constraints. Our learning framework yields discriminative part based object models that achieve very good detection rate, and outperform other methods on object classes with large deformation.

Author Information

Xinggang Wang (Huazhong University of Science and Technology)
Xiang Bai (Huazhong University of Science and Technology)
Xingwei Yang
Wenyu Liu (Huazhong University of Science and Technology)
Longin Jan J Latecki (Temple University)

More from the Same Authors