Sciweavers

1697 search results - page 67 / 340
» On Bayesian Case Matching
Sort
View
CVPR
2008
IEEE
14 years 11 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
NIPS
2000
13 years 10 months ago
Feature Correspondence: A Markov Chain Monte Carlo Approach
When trying to recover 3D structure from a set of images, the most di cult problem is establishing the correspondence between the measurements. Most existing approaches assume tha...
Frank Dellaert, Steven M. Seitz, Sebastian Thrun, ...
PR
2010
148views more  PR 2010»
13 years 7 months ago
Registration and interactive planar segmentation for stereo images of polyhedral scenes
We introduce a two-step iterative segmentation and registration method to find coplanar surfaces among stereo images of a polyhedral environment. The novelties of this paper are:...
Javier-Flavio Vigueras, Mariano Rivera
CVPR
2010
IEEE
14 years 5 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
ICSM
2003
IEEE
14 years 2 months ago
On Modeling Software Architecture Recovery as Graph Matching
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
Kamran Sartipi, Kostas Kontogiannis