|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM260995630 |
| 003 |
DE-627 |
| 005 |
20231224194609.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2017 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2016.2574706
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0870.xml
|
| 035 |
|
|
|a (DE-627)NLM260995630
|
| 035 |
|
|
|a (NLM)27254858
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Nguyen, Quynh
|e verfasserin
|4 aut
|
| 245 |
1 |
3 |
|a An Efficient Multilinear Optimization Framework for Hypergraph Matching
|
| 264 |
|
1 |
|c 2017
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 25.10.2018
|
| 500 |
|
|
|a Date Revised 25.10.2018
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows the use of higher-order geometric information. Hypergraph matching can be formulated as a third-order optimization problem subject to assignment constraints which turns out to be NP-hard. In recent work, we have proposed an algorithm for hypergraph matching which first lifts the third-order problem to a fourth-order problem and then solves the fourth-order problem via optimization of the corresponding multilinear form. This leads to a tensor block coordinate ascent scheme which has the guarantee of providing monotonic ascent in the original matching score function and leads to state-of-the-art performance both in terms of achieved matching score and accuracy. In this paper we show that the lifting step to a fourth-order problem can be avoided yielding a third-order scheme with the same guarantees and performance but being two times faster. Moreover, we introduce a homotopy type method which further improves the performance
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 700 |
1 |
|
|a Tudisco, Francesco
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Gautier, Antoine
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Hein, Matthias
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 39(2017), 6 vom: 01. Juni, Seite 1054-1075
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:39
|g year:2017
|g number:6
|g day:01
|g month:06
|g pages:1054-1075
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2016.2574706
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 39
|j 2017
|e 6
|b 01
|c 06
|h 1054-1075
|