Sciweavers

225 search results - page 14 / 45
» Approximating Parameterized Convex Optimization Problems
Sort
View
IJCV
2012
11 years 11 months ago
Sparse Occlusion Detection with Optical Flow
Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a vari...
Alper Ayvaci, Michalis Raptis, Stefano Soatto
ICASSP
2011
IEEE
13 years 7 days ago
Optimal wireless networks based on local channel state information
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
Yichuan Hu, Alejandro Ribeiro
SCALESPACE
2009
Springer
14 years 3 months ago
Convex Multi-class Image Labeling by Simplex-Constrained Total Variation
Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We sugg...
Jan Lellmann, Jörg H. Kappes, Jing Yuan, Flor...
CDC
2010
IEEE
182views Control Systems» more  CDC 2010»
13 years 3 months ago
An approximate dual subgradient algorithm for multi-agent non-convex optimization
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
Minghui Zhu, Sonia Martínez
PRL
2010
310views more  PRL 2010»
13 years 7 months ago
A Lagrangian Half-Quadratic approach to robust estimation and its applications to road scene analysis
We consider the problem of fitting linearly parameterized models, that arises in many computer vision problems such as road scene analysis. Data extracted from images usually cont...
Jean-Philippe Tarel, Pierre Charbonnier