Sciweavers

153 search results - page 6 / 31
» On the Optimal Compression of Sets in PSPACE
Sort
View
ISBI
2009
IEEE
15 years 6 months ago
Fast Algorithms for Nonconvex Compressive Sensing: MRI Reconstruction from Very Few Data
Compressive sensing is the reconstruction of sparse images or signals from very few samples, by means of solving a tractable optimization problem. In the context of MRI, this can ...
Rick Chartrand
ICIP
2000
IEEE
16 years 1 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller
DCC
2007
IEEE
15 years 11 months ago
Algorithms and Hardware Structures for Unobtrusive Real-Time Compression of Instruction and Data Address Traces
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software de...
Milena Milenkovic, Aleksandar Milenkovic, Martin B...
ICPR
2006
IEEE
16 years 16 days ago
Simultaneous Image Denoising and Compression by Multiscale 2D Tensor Voting
In this paper we propose a method that simultaneously performs image denoising and compression by using multiscale tensor voting. Given a real color image, the pixels are first co...
Yu-Wing Tai, Wai-Shun Tong, Chi-Keung Tang
CORR
2007
Springer
110views Education» more  CORR 2007»
14 years 11 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright