Sequential adaptive compressed sampling via Huffman codes

zbMATH Open1346.94012arXiv0810.4916MaRDI QIDQ2817065FDOQ2817065

Authors: Haichao Wang, Kourosh Zarringhalam, Akram Aldroubi 

Publication date: 29 August 2016

Published in: Sampling Theory in Signal and Image Processing (Search for Journal in Brave)

Abstract: There are two main approaches in compressed sensing: the geometric approach and the combinatorial approach. In this paper we introduce an information theoretic approach and use results from the theory of Huffman codes to construct a sequence of binary sampling vectors to determine a sparse signal. Unlike other approaches, our approach is adaptive in the sense that each sampling vector depends on the previous sample. The number of measurements we need for a k-sparse vector in n-dimensional space is no more than O(k log n) and the reconstruction is O(k).

Full work available at URL: https://arxiv.org/abs/0810.4916

Recommendations

• Improved algorithms for adaptive compressed sensing
• Combinatorial Algorithms for Compressed Sensing
• Compressed sensing
• Adaptive sparse recovery with limited adaptivity
• Lower bounds for adaptive sparse recovery

zbMATH Keywords

samplingsparsityHuffman codescompressed sampling

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20) Other types of codes (94B60)

Cited In (4)

• On high-resolution adaptive sampling of deterministic signals
• Improved algorithms for adaptive compressed sensing
• A discrete-time Markov-based dynamic control approach for compressed sampling
• Discriminative Fine-Grained Mixing for Adaptive Compression of Data Streams

Uses Software

• CoSaMP

This page was built for publication: Sequential adaptive compressed sampling via Huffman codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817065)