Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Simultaneous Sparse Approximation and Common Component Extraction using Fast Distributed Compressive Sensing (1510.02877v2)

Published 10 Oct 2015 in cs.IT and math.IT

Abstract: Simultaneous sparse approximation is a generalization of the standard sparse approximation, for simultaneously representing a set of signals using a common sparsity model. Generalizing the compressive sensing concept to the simultaneous sparse approximation yields distributed compressive sensing (DCS). DCS finds the sparse representation of multiple correlated signals using the common + innovation signal model. However, DCS is not efficient for joint recovery of a large number of signals since it requires large memory and computational time. In this paper, we propose a new hierarchical algorithm to implement the jointly sparse recovery framework of DCS more efficiently. The proposed algorithm is applied to video background extraction problem, where the background corresponds to the common sparse activity across frames.

Summary

We haven't generated a summary for this paper yet.