Sciweavers

1190 search results - page 137 / 238
» Complex Salient Regions for Computer Vision Problems
Sort
View
CPAIOR
2007
Springer
15 years 9 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
CVPR
2009
IEEE
16 years 10 months ago
Error Propagations for Local Bundle Adjustment
Local bundle adjustment (LBA) has recently been introduced to estimate the geometry of image sequences taken by a calibrated camera. Its advantage over standard (global) bundle ...
Alexandre Eudes (LASMEA & CEA LIST), Maxime L...
ECCV
2004
Springer
16 years 5 months ago
Multiple View Feature Descriptors from Image Sequences via Kernel Principal Component Analysis
Abstract. We present a method for learning feature descriptors using multiple images, motivated by the problems of mobile robot navigation and localization. The technique uses the ...
Jason Meltzer, Ming-Hsuan Yang, Rakesh Gupta, Stef...
CVPR
2005
IEEE
15 years 5 months ago
Monocular 3-D Tracking of the Golf Swing
We propose an approach to incorporating dynamic models into the human body tracking process that yields full 3– D reconstructions from monocular sequences. We formulate the trac...
Raquel Urtasun, David J. Fleet, Pascal Fua
PPL
2010
117views more  PPL 2010»
14 years 10 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...