Sciweavers

2843 search results - page 75 / 569
» On Efficient Spatial Matching
Sort
View
CVPR
2008
IEEE
16 years 5 months ago
Efficient sequential correspondence selection by cosegmentation
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...
Jan Cech, Jiri Matas, Michal Perdoch
WWW
2001
ACM
16 years 4 months ago
Efficient Web form entry on PDAs
We propose a design for displaying and manipulating HTML forms on small PDA screens. The form input widgets are not shown until the user is ready to fill them in. At that point, o...
Oliver Kaljuvee, Orkut Buyukkokten, Hector Garcia-...
144
Voted
CVPR
2004
IEEE
16 years 5 months ago
Window-Based, Discontinuity Preserving Stereo
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
Motilal Agrawal, Larry S. Davis
151
Voted
PRL
2008
122views more  PRL 2008»
15 years 3 months ago
Constraints for closest point finding
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
Yonghuai Liu
ECCV
2008
Springer
16 years 5 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...