Sciweavers

39 search results - page 3 / 8
» Trading Accuracy for Sparsity in Optimization Problems with ...
Sort
View
ICIP
2009
IEEE
14 years 6 months ago
Dequantizing Compressed Sensing With Non-gaussian Constraints
In this paper, following the Compressed Sensing (CS) paradigm, we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present ...
ICASSP
2011
IEEE
12 years 9 months ago
Source localization using time difference of arrival within a sparse representation framework
The problem addressed is source localization via time-differenceof-arrival estimation in a multipath channel. Solving this localization problem typically implies cross-correlating...
Ciprian R. Comsa, Alexander M. Haimovich, Stuart C...
ECCV
2004
Springer
14 years 7 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
CVPR
2006
IEEE
14 years 7 months ago
Learning Semantic Patterns with Discriminant Localized Binary Projections
In this paper, we present a novel approach to learning semantic localized patterns with binary projections in a supervised manner. The pursuit of these binary projections is refor...
Shuicheng Yan, Tianqiang Yuan, Xiaoou Tang
ICML
2010
IEEE
13 years 6 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein