42 search results - page 7 / 9 » One sketch for all: fast algorithms for compressed sensing |
TSP
2010
13 years 1 months ago
2010
We study the distributed sampling and centralized reconstruction of two correlated signals, modeled as the input and output of an unknown sparse filtering operation. This is akin ...
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
This work focuses on several optimization problems involved in recovery of sparse solutions of linear inverse problems. Such problems appear in many fields including image and sig...
SAC
2002
ACM
13 years 6 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
ICIP
2004
IEEE
14 years 8 months ago
2004
IEEE
Lagrangian minimization is one of the most powerful tools for Rate-Distortion optimal coding mode selection. However, in the latest video compression standard H.264/AVC, the total...
FSE
2011
Springer
12 years 10 months ago
2011
Springer
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...