Sciweavers

616 search results - page 29 / 124
» Local Feature Matching Using Entropic Graphs
Sort
View
SAC
2004
ACM
14 years 1 months ago
Concatenate feature extraction for robust 3D elliptic object localization
Developing an efficient object localization system for complicated industrial objects is an important, yet difficult robotic task. To tackle this problem, we have developed a syst...
Yuichi Motai, Akio Kosaka
CVPR
2003
IEEE
14 years 10 months ago
Extracting Dense Features for Visual Correspondence with Graph Cuts
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
Olga Veksler
CORR
2000
Springer
96views Education» more  CORR 2000»
13 years 7 months ago
Robustness of Regional Matching Scheme over Global Matching Scheme
Analyzing the effect of concentrated noise on a typical decision-making process of a simplified two-candidate voting model, we have demonstrated that a local approach using a regi...
Liang Chen, Naoyuki Tokuda
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
ICPR
2002
IEEE
14 years 9 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...