We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different opti...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!