A probabilistic approach to spectral graph matching

Spectral Matching (SM) is a computationally efficient approach to approximate the solution of pairwise matching problems that are np-hard. In this paper, we present a probabilistic interpretation of spectral matching schemes and derive a novel Probabilistic Matching (PM) scheme that is shown to outp...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 35(2013), 1 vom: 21. Jan., Seite 18-27
1. Verfasser: Egozi, Amir (VerfasserIn)
Weitere Verfasser: Keller, Yosi, Guterman, Hugo
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2013
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM215573064
003 DE-627
005 20231224025801.0
007 cr uuu---uuuuu
008 231224s2013 xx |||||o 00| ||eng c
028 5 2 |a pubmed24n0718.xml 
035 |a (DE-627)NLM215573064 
035 |a (NLM)22350163 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Egozi, Amir  |e verfasserin  |4 aut 
245 1 2 |a A probabilistic approach to spectral graph matching 
264 1 |c 2013 
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 11.07.2013 
500 |a Date Revised 05.03.2013 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a Spectral Matching (SM) is a computationally efficient approach to approximate the solution of pairwise matching problems that are np-hard. In this paper, we present a probabilistic interpretation of spectral matching schemes and derive a novel Probabilistic Matching (PM) scheme that is shown to outperform previous approaches. We show that spectral matching can be interpreted as a Maximum Likelihood (ML) estimate of the assignment probabilities and that the Graduated Assignment (GA) algorithm can be cast as a Maximum a Posteriori (MAP) estimator. Based on this analysis, we derive a ranking scheme for spectral matchings based on their reliability, and propose a novel iterative probabilistic matching algorithm that relaxes some of the implicit assumptions used in prior works. We experimentally show our approaches to outperform previous schemes when applied to exhaustive synthetic tests as well as the analysis of real image sequences 
650 4 |a Journal Article 
700 1 |a Keller, Yosi  |e verfasserin  |4 aut 
700 1 |a Guterman, Hugo  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 35(2013), 1 vom: 21. Jan., Seite 18-27  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:35  |g year:2013  |g number:1  |g day:21  |g month:01  |g pages:18-27 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 35  |j 2013  |e 1  |b 21  |c 01  |h 18-27