An Integer Projected Fixed Point Method for Graph Matching and MAP Inference

Marius Leordeanu, Martial Hebert, and Rahul Sukthankar
Proceedings Neural Information Processing Systems, December, 2009.


Download
  • Adobe portable document format (pdf) (1MB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract
Graph matching and MAP inference are essential problems in computer vision and machine learning. We introduce a novel algorithm that can accommodate both problems and solve them efficiently. Recent graph matching algorithms are based on a general quadratic programming formulation, which takes in consideration both unary and second-order terms reflecting the similarities in local appearance as well as in the pairwise geometric relationships between the matched features. This problem is NP-hard, therefore most algorithms find approximate solutions by relaxing the original problem. They find the optimal continuous solution of the modified problem, ignoring during optimization the original discrete constraints. Then the continuous solution is quickly binarized at the end, but very little attention is put into this final discretization step. In this paper we argue that the stage in which a discrete solution is found is crucial for good performance. We propose an efficient algorithm, with climbing and convergence properties, that optimizes in the discrete domain the quadratic score, and it gives excellent results either by itself or by starting from the solution returned by any graph matching algorithm. In practice it outperforms state-or-the art graph matching algorithms and it also significantly improves their performance if used in combination. When applied to MAP inference, the algorithm is a parallel extension of Iterated Conditional Modes (ICM) with climbing and convergence properties that make it a compelling alternative to the sequential ICM. In our experiments on MAP inference our algorithm proved its effectiveness by significantly outperforming [13], ICM and Max-Product Belief Propagation.

Notes

Text Reference
Marius Leordeanu, Martial Hebert, and Rahul Sukthankar, "An Integer Projected Fixed Point Method for Graph Matching and MAP Inference ," Proceedings Neural Information Processing Systems, December, 2009.

BibTeX Reference
@inproceedings{Leordeanu_2009_6508,
   author = "Marius Leordeanu and Martial Hebert and Rahul Sukthankar",
   title = "An Integer Projected Fixed Point Method for Graph Matching and MAP Inference ",
   booktitle = "Proceedings Neural Information Processing Systems",
   publisher = "Springer",
   month = "December",
   year = "2009",
}