Sciweavers

Share
JMLR
2012
7 years 1 months ago
Detecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guiba...
BSN
2011
IEEE
233views Sensor Networks» more  BSN 2011»
7 years 11 months ago
Compressive Sensing of Neural Action Potentials Using a Learned Union of Supports
—Wireless neural recording systems are subject to stringent power consumption constraints to support long-term recordings and to allow for implantation inside the brain. In this ...
Zainul Charbiwala, Vaibhav Karkare, Sarah Gibson, ...
ICASSP
2011
IEEE
8 years 2 months ago
Basis pursuit for spectrum cartography
A nonparametric version of the basis pursuit method is developed for field estimation. The underlying model entails known bases, weighted by generic functions to be estimated fro...
Juan Andrés Bazerque, Gonzalo Mateos, Georg...
ICASSP
2011
IEEE
8 years 3 months ago
Sparse decomposition of transformation-invariant signals with continuous basis pursuit
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
Chaitanya Ekanadham, Daniel Tranchina, Eero P. Sim...
SIAMIS
2010
190views more  SIAMIS 2010»
8 years 6 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
TSP
2008
106views more  TSP 2008»
8 years 11 months ago
Identification of Matrices Having a Sparse Representation
We consider the problem of recovering a matrix from its action on a known vector in the setting where the matrix can be represented efficiently in a known matrix dictionary. Conne...
Götz E. Pfander, Holger Rauhut, Jared Tanner
SIAMSC
2008
139views more  SIAMSC 2008»
8 years 11 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
CORR
2007
Springer
136views Education» more  CORR 2007»
8 years 11 months ago
Sparsity in time-frequency representations
We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an S-sparse Gabor representation in Cn with re...
Götz E. Pfander, Holger Rauhut
FOCM
2008
156views more  FOCM 2008»
8 years 11 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut
CORR
2010
Springer
127views Education» more  CORR 2010»
8 years 11 months ago
Analysis of Basis Pursuit Via Capacity Sets
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
Joseph Shtok, Michael Elad
books