Sciweavers

39 search results - page 7 / 8
» Trading Accuracy for Sparsity in Optimization Problems with ...
Sort
View
TSMC
2010
13 years 1 days ago
Probability Density Estimation With Tunable Kernels Using Orthogonal Forward Regression
A generalized or tunable-kernel model is proposed for probability density function estimation based on an orthogonal forward regression procedure. Each stage of the density estimat...
Sheng Chen, Xia Hong, Chris J. Harris
DAGSTUHL
2007
13 years 6 months ago
Nonlinear Approximation and Image Representation using Wavelets
We address the problem of finding sparse wavelet representations of high-dimensional vectors. We present a lower-bounding technique and use it to develop an algorithm for computi...
Sudipto Guha, Boulos Harb
ICCV
2009
IEEE
13 years 3 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden
ICASSP
2011
IEEE
12 years 9 months ago
Spatially sparsed Common Spatial Pattern to improve BCI performance
Common Spatial Pattern (CSP) is widely used in discriminating two classes of EEG in Brain Computer Interface applications. However, the performance of the CSP algorithm is affecte...
Mahnaz Arvaneh, Cuntai Guan, Kai Keng Ang, Hiok Ch...
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
13 years 6 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang