Sciweavers

455 search results - page 51 / 91
» A local approximation algorithm for maximum weight matching
Sort
View
82
Voted
CVPR
2005
IEEE
15 years 11 months ago
Parameter Estimation for MRF Stereo
This paper presents a novel approach for estimating parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterior (MAP...
Li Zhang, Steven M. Seitz
NECO
2008
129views more  NECO 2008»
14 years 9 months ago
Sparse Coding via Thresholding and Local Competition in Neural Circuits
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
Christopher J. Rozell, Don H. Johnson, Richard G. ...
78
Voted
ICPR
2000
IEEE
15 years 10 months ago
Attributed Tree Homomorphism Using Association Graphs
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi,...
75
Voted
WACV
2005
IEEE
15 years 3 months ago
Realtime Road Detection by Learning from One Example
Realtime detection and localization of a road from an aerial image is an emerging research area that can be applied to vision-based navigation of unmanned air vehicles. Existing r...
Zu Whan Kim
86
Voted
COMPGEOM
2006
ACM
15 years 3 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy