Sciweavers

147 search results - page 5 / 30
» Very sparse random projections
Sort
View
FOCM
2008
156views more  FOCM 2008»
13 years 7 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
ICIP
2009
IEEE
13 years 5 months ago
A compressive-sensing based watermarking scheme for sparse image tampering identification
In this paper we describe a robust watermarking scheme for image tampering identification and localization. A compact representation of the image is first produced by assembling a...
Giuseppe Valenzise, Marco Tagliasacchi, Stefano Tu...
TWC
2008
133views more  TWC 2008»
13 years 7 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...
IEEECGIV
2009
IEEE
14 years 2 months ago
Two Dimensional Compressive Classifier for Sparse Images
The theory of compressive sampling involves making random linear projections of a signal. Provided signal is sparse in some basis, small number of such measurements preserves the ...
Armin Eftekhari, Hamid Abrishami Moghaddam, Massou...
IROS
2009
IEEE
163views Robotics» more  IROS 2009»
14 years 2 months ago
On the performance of random linear projections for sampling-based motion planning
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
Ioan Alexandru Sucan, Lydia E. Kavraki