Sampling theorems for signals from the union of finitedimensional linear subspaces
Blumensath, Thomas and Davies, Mike E. (2009) Sampling theorems for signals from the union of finitedimensional linear subspaces IEEE Transactions on Signal Processing, 55, (4), pp. 18721882. (doi:10.1109/TIT.2009.2013003).
Download
PDF BDIT07.pdf
 Other
Restricted to Repository staff only Download (226kB) 
Description/Abstract
Compressed sensing is an emerging signal acquisition technique that enables signals to be sampled well below the Nyquist rate, given that the signal has a sparse representation in an orthonormal basis. In fact, sparsity in an orthonormal basis is only one possible signal model that allows for sampling strategies below the Nyquist rate. In this paper we consider a more general signal model and assume signals that live on or close to the union of linear subspaces of low dimension. We present sampling theorems for this model that are in the same spirit as the NyquistShannon sampling theorem in that they connect the number of required samples to certain model parameters.
Contrary to the NyquistShannon sampling theorem, which gives a necessary and sufficient condition for the number of required samples as well as a simple linear algorithm for signal reconstruction, the model studied here is more complex. We therefore concentrate on two aspects of the signal model, the existence of one to one maps to lower dimensional observation spaces and the smoothness of the inverse map. We show that almost all linear maps are one to one when the observation space is at least of the same dimension as the largest dimension of the convex hull of the union of any two subspaces in the model. However, we also show that in order for the inverse map to have certain smoothness properties such as a given finite Lipschitz constant, the required observation dimension necessarily depends logarithmically on the number of subspaces in the signal model. In other words, while unique linear sampling schemes require a small number of samples depending only on the dimension of the subspaces involved, in order to have stable sampling methods, the number of samples depends necessarily logarithmically on the number of subspaces in the model. These results are then applied to two examples, the standard compressed sensing signal model in which the signal has a sparse representation in an orthonormal basis and to a sparse signal model with additional tree structure
Item Type:  Article  

Digital Object Identifier (DOI):  doi:10.1109/TIT.2009.2013003  
ISSNs:  1053587X (print) 

Keywords:  compressed sensing, unions of linear subspaces, sampling theorems, embedding and restricted isometry  
Subjects:  
Organisations:  Signal Processing & Control Grp  
ePrint ID:  142517  
Date : 


Date Deposited:  31 Mar 2010 15:25  
Last Modified:  18 Apr 2017 20:06  
Further Information:  Google Scholar  
URI:  http://eprints.soton.ac.uk/id/eprint/142517 
Actions (login required)
View Item 