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...
Uložené v:
| Vydané v: | IEEE transactions on pattern analysis and machine intelligence Ročník 31; číslo 12; s. 2227 - 2242 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
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 |
| Predmet: | |
| ISSN: | 0162-8828, 1939-3539, 1939-3539 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!