Sciweavers

196 search results - page 1 / 40
» Globally optimal bilinear programming for computer vision ap...
Sort
View
CVPR
2008
IEEE
14 years 6 months ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 5 months ago
Global Optimization for Value Function Approximation
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
Marek Petrik, Shlomo Zilberstein
BMVC
2010
13 years 2 months ago
StyP-Boost: A Bilinear Boosting Algorithm for Learning Style-Parameterized Classifiers
We introduce a novel bilinear boosting algorithm, which extends the multi-class boosting framework of JointBoost to optimize a bilinear objective function. This allows style param...
Jonathan Warrell, Philip H. S. Torr, Simon Prince
SCIA
2009
Springer
183views Image Analysis» more  SCIA 2009»
13 years 11 months ago
Globally Optimal Least Squares Solutions for Quasiconvex 1D Vision Problems
Abstract. Solutions to non-linear least squares problems play an essential role in structure and motion problems in computer vision. The predominant approach for solving these prob...
Carl Olsson, Martin Byröd, Fredrik Kahl
ICCV
2005
IEEE
13 years 10 months ago
Learning Effective Image Metrics from Few Pairwise Examples
We present a new approach to learning image metrics. The main advantage of our method lies in a formulation that requires only a few pairwise examples. Apparently, based on the li...
Hwann-Tzong Chen, Tyng-Luh Liu, Chiou-Shann Fuh