1118 search results - page 43 / 224 » Convex Optimization |
148
Voted
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
121
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
169
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
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...
144
click to vote
SIAMJO
2000
15 years 4 months ago
2000
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
104
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
We present a method for designing operational amplifiers using reversed geometric programming, which is an extension of geometric programming that allows both convex and non-conve...