Sciweavers

312 search results - page 11 / 63
» Iterative compression and exact algorithms
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Look ahead orthogonal matching pursuit
For compressive sensing, we endeavor to improve the recovery performance of the existing orthogonal matching pursuit (OMP) algorithm. To achieve a better estimate of the underlyin...
Saikat Chatterjee, Dennis Sundman, Mikael Skoglund
ICIP
2008
IEEE
14 years 4 months ago
Iterative pre- and post-processing for MRC layers of scanned documents
The Mixed Raster Content (MRC) document compression standard (ITU T.44) specifies a multi-layer multi-resolution representation of a compound document. The model is very efficie...
Alexandre Zaghetto, Ricardo L. de Queiroz
CIKM
2009
Springer
14 years 2 months ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz
ICASSP
2010
IEEE
13 years 10 months ago
Wideband spectral estimation from compressed measurements exploiting spectral a priori information in Cognitive Radio systems
In Cognitive Radio scenarios channelization information from primary network may be available to the spectral monitor. Under this assumption we propose a spectral estimation algor...
Gonzalo Vazquez-Vilar, Roberto López-Valcar...
CORR
2010
Springer
166views Education» more  CORR 2010»
13 years 10 months ago
The dynamics of message passing on dense graphs, with applications to compressed sensing
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
Mohsen Bayati, Andrea Montanari