Sciweavers

21 search results - page 2 / 5
» Feature Correspondence Via Graph Matching: Models and Global...
Sort
View
ICIP
2010
IEEE
13 years 4 months ago
Learning image similarities via Probabilistic Feature Matching
In this paper, we propose a novel image similarity learning approach based on Probabilistic Feature Matching (PFM). We consider the matching process as the bipartite graph matchin...
Ziming Zhang, Ze-Nian Li, Mark S. Drew
CVPR
2008
IEEE
14 years 8 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
ECCV
2006
Springer
14 years 8 months ago
Optimal Multi-frame Correspondence with Assignment Tensors
Abstract. Establishing correspondence between features of a set of images has been a long-standing issue amongst the computer vision community. We propose a method that solves the ...
R. Oliveira, R. Ferreira, J. P. Costeira
ICASSP
2010
IEEE
13 years 6 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
CVPR
2011
IEEE
13 years 2 months ago
Global Stereo Matching Leveraged by Sparse Ground Control Points
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
Liang Wang, Ruigang Yang