Share Email Print
cover

Proceedings Paper

Bi-directional probabilistic hypergraph matching method using Bayes theorem
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Establishing correspondences between two hyper-graphs is a fundamental issue in computer vision, pattern recognition, and machine learning. A hyper-graph is modeled by feature set where the complex relations are represented by hyperedges. Hence, a match between two vertex sets determines a hyper-graph matching problem. We propose a new bidirectional probabilistic hyper-graph matching method using Bayesian inference principle. First, we formulate the corresponding hyper-graph matching problem as the maximization of a matching score function over all permutations of the vertexes. Second, we induce an algebraic relation between the hyper-edge weight matrixes and derive the desired vertex to vertex probabilistic matching algorithm using Bayes theorem. Third, we apply the well known convex relaxation procedure with probabilistic soft matching matrix to get a complete hard matching result. Finally, we have conducted the comparative experiments on synthetic data and real images. Experimental results show that the proposed method clearly outperforms existing algorithms especially in the presence of noise and outliers.

Paper Details

Date Published: 10 February 2012
PDF: 10 pages
Proc. SPIE 8304, Multimedia on Mobile Devices 2012; and Multimedia Content Access: Algorithms and Systems VI, 83040J (10 February 2012); doi: 10.1117/12.910255
Show Author Affiliations
Wanhyun Cho, Chonnam National Univ. (Korea, Republic of)
Sunworl Kim, Chonnam National Univ. (Korea, Republic of)
Sangcheol Park, Chonnam National Univ. (Korea, Republic of)


Published in SPIE Proceedings Vol. 8304:
Multimedia on Mobile Devices 2012; and Multimedia Content Access: Algorithms and Systems VI
Cees G. M. Snoek; Reiner Creutzburg; Nicu Sebe; David Akopian; Lyndon Kennedy, Editor(s)

© SPIE. Terms of Use
Back to Top