Sciweavers

161 search results - page 17 / 33
» Methods for convex and general quadratic programming
Sort
View

Publication
210views
15 years 11 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...
Gemma Roig, Xavier Boix, Fernando De la Torre
TIT
2010
130views Education» more  TIT 2010»
14 years 11 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
ICCV
2007
IEEE
16 years 6 months ago
Convex Optimization for Deformable Surface 3-D Tracking
3?D shape recovery of non-rigid surfaces from 3?D to 2?D correspondences is an under-constrained problem that requires prior knowledge of the possible deformations. State-of-the-a...
Mathieu Salzmann, Richard Hartley, Pascal Fua
CDC
2008
IEEE
139views Control Systems» more  CDC 2008»
15 years 11 months ago
Iterative Risk Allocation: A new approach to robust Model Predictive Control with a joint chance constraint
Abstract— This paper proposes a novel two-stage optimization method for robust Model Predictive Control (RMPC) with Gaussian disturbance and state estimation error. Since the dis...
Masahiro Ono, Brian C. Williams
CDC
2008
IEEE
236views Control Systems» more  CDC 2008»
15 years 11 months ago
Non-monotonic Lyapunov functions for stability of discrete time nonlinear and switched systems
Abstract— We relax the monotonicity requirement of Lyapunov’s theorem to enlarge the class of functions that can provide certificates of stability. To this end, we propose two...
Amir Ali Ahmadi, Pablo A. Parrilo