Matching by linear programming and successive convexification
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 rela...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 29(2007), 6 vom: 14. Juni, Seite 959-75 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2007
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
| Schlagworte: | Evaluation Study Journal Article |