Sciweavers

284 search results - page 18 / 57
» What Matchings Can Be Stable
Sort
View
PAMI
2007
245views more  PAMI 2007»
13 years 8 months ago
Conformal Geometry and Its Applications on 3D Shape Matching, Recognition, and Stitching
—Three-dimensional shape matching is a fundamental issue in computer vision with many applications such as shape registration, 3D object recognition, and classification. However,...
Sen Wang, Yang Wang, Miao Jin, Xianfeng David Gu, ...
ICCV
2005
IEEE
14 years 2 months ago
Mutual Information-Based 3D Surface Matching with Applications to Face Recognition and Brain Mapping
Face recognition and many medical imaging applications require the computation of dense correspondence vector fields that match one surface with another. In brain imaging, surfac...
Yalin Wang, Ming-Chang Chiang, Paul M. Thompson
ALGORITHMICA
2010
108views more  ALGORITHMICA 2010»
13 years 8 months ago
An Efficient Algorithm for Batch Stability Testing
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
John Dabney, Brian C. Dean
CVPR
2006
IEEE
14 years 10 months ago
The Panum Proxy Algorithm for Dense Stereo Matching over a Volume of Interest
Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision however does not do this. It works ov...
Ankur Agarwal, Andrew Blake
KCAP
2005
ACM
14 years 2 months ago
Matching utterances to rich knowledge structures to acquire a model of the speaker's goal
An ultimate goal of AI is to build end-to-end systems that interpret natural language, reason over the resulting logical forms, and perform actions based on that reasoning. This r...
Peter Z. Yeh, Bruce W. Porter, Ken Barker