Sciweavers

38 search results - page 3 / 8
» Convex Quadratic Programming for Object Localization
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
JMLR
2010
143views more  JMLR 2010»
13 years 6 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
EMMCVPR
2005
Springer
14 years 1 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
14 years 9 days ago
Fault tolerant control allocation for a thruster-controlled floating platform using parametric programming
— The task in control allocation is to determine how to generate a specified generalized force from a redundant set of control effectors where the associated actuator control in...
Jørgen Spjøtvold, Tor Arne Johansen
GLOBECOM
2006
IEEE
14 years 1 months ago
Sensor Localization from WLS Optimization with Closed-form Gradient and Hessian
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
Giuseppe Destino, Giuseppe Thadeu Freitas de Abreu