Matching by Linear Programming and Successive Convexification

@article{Jiang2007MatchingBL,
  title={Matching by Linear Programming and Successive Convexification},
  author={Hao Jiang and Mark S. Drew and Ze-Nian Li},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={2007},
  volume={29},
  pages={959-975}
}
We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. Matching is formulated as metric labeling with L1 regularization terms, for which we propose a novel linear programming relaxation method and an efficient successive convexification implementation. The unique feature of the proposed relaxation scheme is that a much smaller set of basis labels is used to represent the… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 52 CITATIONS, ESTIMATED 43% COVERAGE

FILTER CITATIONS BY YEAR

2007
2018

CITATION STATISTICS

  • 8 Highly Influenced Citations

  • Averaged 4 Citations per year over the last 3 years

Similar Papers

Loading similar papers…