{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:36:59Z","timestamp":1723016219494},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>Hyper graph matching problems have drawn attention recently due to their ability to embed higher order relations between nodes.  In this paper, we formulate hyper graph matching problems as constrained MAP inference problems in graphical models. Whereas previous discrete approaches introduce several global correspondence vectors, we introduce only one global correspondence vector, but several local correspondence vectors. This allows us to decompose the problem into a (linear) bipartite matching problem and several belief propagation sub-problems. Bipartite matching can be solved by traditional approaches, while the belief propagation sub-problem is further decomposed as two sub-problems with optimal substructure. Then a newly proposed dynamic programming procedure is used to solve the belief propagation sub-problem. Experiments show that the proposed methods outperform state-of-the-art techniques for hyper graph matching.<\/jats:p>","DOI":"10.24963\/ijcai.2017\/650","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T05:14:07Z","timestamp":1501218847000},"page":"4662-4668","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic Programming Bipartite Belief Propagation For Hyper   Graph Matching"],"prefix":"10.24963","author":[{"given":"Zhen","family":"Zhang","sequence":"first","affiliation":[{"name":"Northwestern Polytechnical University"}]},{"given":"Julian","family":"McAuley","sequence":"additional","affiliation":[{"name":"UC San Diego"}]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University"}]},{"given":"Wei","family":"Wei","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University"}]},{"given":"Yanning","family":"Zhang","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University"}]},{"given":"Qinfeng","family":"Shi","sequence":"additional","affiliation":[{"name":"The University of Adelaide"}]}],"member":"10584","event":{"number":"26","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)","University of Technology Sydney (UTS)","Australian Computer Society (ACS)"],"acronym":"IJCAI-2017","name":"Twenty-Sixth International Joint Conference on Artificial Intelligence","start":{"date-parts":[[2017,8,19]]},"theme":"Artificial Intelligence","location":"Melbourne, Australia","end":{"date-parts":[[2017,8,26]]}},"container-title":["Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T07:54:57Z","timestamp":1501228497000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2017\/650"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2017\/650","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}