Sciweavers

1092 search results - page 113 / 219
» Convex Methods for Transduction
Sort
View
CVPR
2009
IEEE
16 years 5 months ago
Efficient Reduction of L-infinity Geometry Problems
This paper presents a new method for computing optimal L1 solutions for vision geometry problems, particularly for those problems of fixed-dimension and of large-scale. Our strat...
Hongdong Li (Australian National University)
ICCV
2001
IEEE
15 years 11 months ago
Calibration with Robust Use of Cheirality by Quasi-Affine Reconstruction of the Set of Camera Projection Centres
A methodfor upgrading a projective reconstruction to metric is presented. The reconstruction is first transformed by considering cheirality so that the convex hull of the set of c...
David Nistér
ICRA
2009
IEEE
106views Robotics» more  ICRA 2009»
15 years 4 months ago
On-line time-optimal path tracking for robots
— This paper focuses on time-optimal path tracking, which involves planning of robot motions along prescribed geometric paths. Starting from a discretized convex reformulation of...
Diederik Verscheure, Moritz Diehl, Joris De Schutt...
AAAI
2006
14 years 11 months ago
Embedding Heterogeneous Data Using Statistical Models
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
Amir Globerson, Gal Chechik, Fernando Pereira, Naf...
ICA
2010
Springer
14 years 11 months ago
Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
Mehrdad Yaghoobi, Mike E. Davies