Sciweavers

87 search results - page 6 / 18
» Separation and Approximation of Polyhedral Objects
Sort
View
SIAMIS
2011
13 years 3 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
ICML
2010
IEEE
13 years 9 months ago
A scalable trust-region algorithm with application to mixed-norm regression
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
INFOVIS
1999
IEEE
14 years 27 days ago
Efficient Multi-Object Dynamic Query Histograms
Dynamic Queries offer continuous feedback during range queries, and have been shown to be effective and satisfying. Recent work has extended them to datasets of 100,000 objects an...
Mark Derthick, James Harrison, Andrew Moore, Steve...
ICASSP
2010
IEEE
13 years 6 months ago
A short-time objective intelligibility measure for time-frequency weighted noisy speech
Existing objective speech-intelligibility measures are suitable for several types of degradation, however, it turns out that they are less appropriate for methods where noisy spee...
Cees H. Taal, Richard C. Hendriks, Richard Heusden...
ICIP
2009
IEEE
14 years 9 months ago
Modified Grabcut For Unsupervised Object Segmentation
We propose a fully automated variation of the GrabCut technique for segmenting comparatively simple images with little variation in background colour and relatively high contrast ...