Sciweavers

1056 search results - page 70 / 212
» Constraint-Based Graph Matching
Sort
View
CVPR
2009
IEEE
15 years 4 months ago
Stereo Matching with Nonparametric Smoothness Priors in Feature Space
We propose a novel formulation of stereo matching that considers each pixel as a feature vector. Under this view, matching two or more images can be cast as matching point clouds i...
Brandon M. Smith, Hailin Jin, Li Zhang
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
14 years 1 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
CVPR
2011
IEEE
13 years 5 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
KCAP
2003
ACM
14 years 2 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
FASE
2010
Springer
14 years 13 days ago
Incremental Service Composition Based on Partial Matching of Visual Contracts
Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requesters may be able to use demand support...
Muhammad Naeem, Reiko Heckel, Fernando Orejas, Fra...