Aligning random graphs with a sub-tree similarity message-passing algorithm.
Giovanni PiccioliGuilhem SemerjianGabriele SicuroLenka ZdeborováPublished in: CoRR (2021)
Keyphrases
- message passing
- random graphs
- k means
- similarity measure
- dynamic programming
- junction tree
- tree structure
- preprocessing
- objective function
- np hard
- optimal solution
- sum product algorithm
- factor graphs
- loopy belief propagation
- shared memory
- maximum likelihood
- multi view
- input data
- distributed systems
- markov random field
- worst case
- image registration