Covering trees and lower-bounds on quadratic assignment

@article{Yarkony2010CoveringTA,
  title={Covering trees and lower-bounds on quadratic assignment},
  author={Julian Yarkony and Charless C. Fowlkes and Alexander T. Ihler},
  journal={2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition},
  year={2010},
  pages={887-894}
}
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computationally infeasible in general but recent advances in discrete optimization such as tree-reweighted belief propagation (TRW) often provide high-quality solutions. In this paper, we improve upon these algorithms in two ways. First, we introduce covering trees, a variant of TRW which provide the same bounds on the MAP… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

A Dual Decomposition Approach to Feature Correspondence

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2013
View 8 Excerpts
Highly Influenced

A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems

2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) • 2017
View 2 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Convergent Tree-Reweighted Message Passing for Energy Minimization

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2005
View 9 Excerpts
Highly Influenced

A Path Following Algorithm for the Graph Matching Problem

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2009

Learning Graph Matching

IEEE Trans. Pattern Anal. Mach. Intell. • 2009
View 1 Excerpt

M

R. Burkard
Dell’Amico, and S. Martello. Assignment problems. Society for Industrial Mathematics • 2009
View 1 Excerpt

MRF Optimization via Dual Decomposition: Message-Passing Revisited

2007 IEEE 11th International Conference on Computer Vision • 2007
View 2 Excerpts

A spectral technique for correspondence problems using pairwise constraints

Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 • 2005
View 1 Excerpt

Shape matching and object recognition using low distortion correspondences

2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) • 2005
View 2 Excerpts

A Global Solution to Sparse Correspondence Problems

IEEE Trans. Pattern Anal. Mach. Intell. • 2003
View 2 Excerpts

Similar Papers

Loading similar papers…