A Path Following Algorithm for the Graph Matching Problem
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...
Saved in:
| Published in: | IEEE transactions on pattern analysis and machine intelligence Vol. 31; no. 12; pp. 2227 - 2242 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Los Alamitos, CA
IEEE
01.12.2009
IEEE Computer Society The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers |
| Subjects: | |
| ISSN: | 0162-8828, 1939-3539, 1939-3539 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!