Sciweavers

CVPR
2012
IEEE
12 years 2 months ago
Real time robust L1 tracker using accelerated proximal gradient approach
Recently sparse representation has been applied to visual tracker by modeling the target appearance using a sparse approximation over a template set, which leads to the so-called ...
Chenglong Bao, Yi Wu, Haibin Ling, Hui Ji
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
12 years 2 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
DAC
2011
ACM
13 years 7 days ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
ICCV
2011
IEEE
13 years 13 days ago
Blurred Target Tracking by Blur-driven Tracker
Visual tracking plays an important role in many computer vision tasks. A common assumption in previous methods is that the video frames are blur free. In reality, motion blurs are...
Yi Wu, Haibin Ling, Jingyi Yu, Feng Li, Xue Mei, E...
CISS
2011
IEEE
13 years 4 months ago
Sparsity penalties in dynamical system estimation
—In this work we address the problem of state estimation in dynamical systems using recent developments in compressive sensing and sparse approximation. We formulate the traditio...
Adam Charles, Muhammad Salman Asif, Justin K. Romb...
ICASSP
2011
IEEE
13 years 4 months ago
Compressive sensing meets game theory
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
Sina Jafarpour, Robert E. Schapire, Volkan Cevher
CORR
2011
Springer
152views Education» more  CORR 2011»
13 years 7 months ago
Sparsity Equivalence of Anisotropic Decompositions
Anisotropic decompositions using representation systems such as curvelets, contourlet, or shearlets have recently attracted significantly increased attention due to the fact that...
Gitta Kutyniok
ICANN
2007
Springer
14 years 4 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel
ICIP
2007
IEEE
14 years 6 months ago
Locally Competitive Algorithms for Sparse Approximation
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
Christopher J. Rozell, Don H. Johnson, Richard G. ...
IPSN
2009
Springer
14 years 7 months ago
Near-optimal Bayesian localization via incoherence and sparsity
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
Volkan Cevher, Petros Boufounos, Richard G. Barani...