Learning Hypergraph Labeling for Feature Matching

Details Learning Hypergraph Labeling for Feature Matching Learning Hypergraph Labeling for Feature Matching

2011-07-13

arxiv.org/abs/1107.2553v1

Computer Science

Computer Vision and Pattern Recognition

Scientific paper

This study poses the feature correspondence problem as a hypergraph node labeling problem. Candidate feature matches and their subsets (usually of size larger than two) are considered to be the nodes and hyperedges of a hypergraph. A hypergraph labeling algorithm, which models the subset-wise interaction by an undirected graphical model, is applied to label the nodes (feature correspondences) as correct or incorrect. We describe a method to learn the cost function of this labeling algorithm from labeled examples using a graphical model training algorithm. The proposed feature matching algorithm is different from the most of the existing learning point matching methods in terms of the form of the objective function, the cost function to be learned and the optimization method applied to minimize it. The results on standard datasets demonstrate how learning over a hypergraph improves the matching performance over existing algorithms, notably one that also uses higher order information without learning.

Affiliated with

Also associated with

No associations

Rating

Learning Hypergraph Labeling for Feature Matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Learning Hypergraph Labeling for Feature Matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning Hypergraph Labeling for Feature Matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-165855