Sciweavers

116 search results - page 9 / 24
» Separable convex optimization problems with linear ascending...
Sort
View
ICASSP
2008
IEEE
14 years 3 months ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...
CVPR
2012
IEEE
11 years 11 months ago
Bag of textons for image segmentation via soft clustering and convex shift
We propose an unsupervised image segmentation method based on texton similarity and mode seeking. The input image is first convolved with a filter-bank, followed by soft cluster...
Zhiding Yu, Ang Li, Oscar C. Au, Chunjing Xu
ICML
2008
IEEE
14 years 10 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
CDC
2008
IEEE
139views Control Systems» more  CDC 2008»
14 years 3 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
MP
2008
99views more  MP 2008»
13 years 9 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph