deposit_your_work

Compressive sensing for signal ensembles

Files in this item

Files Size Format View
3421189.PDF 5.765Mb application/pdf Thumbnail

Show simple item record

Item Metadata

dc.contributor.advisor Baraniuk, Richard G.
dc.creator Duarte, Marco F.
dc.date.accessioned 2011-07-25T02:07:23Z
dc.date.available 2011-07-25T02:07:23Z
dc.date.issued 2010
dc.identifier.uri http://hdl.handle.net/1911/62195
dc.description.abstract Compressive sensing (CS) is a new approach to simultaneous sensing and compression that enables a potentially large reduction in the sampling and computation costs for acquisition of signals having a sparse or compressible representation in some basis. The CS literature has focused almost exclusively on problems involving single signals in one or two dimensions. However, many important applications involve distributed networks or arrays of sensors. In other applications, the signal is inherently multidimensional and sensed progressively along a subset of its dimensions; examples include hyperspectral imaging and video acquisition. Initial work proposed joint sparsity models for signal ensembles that exploit both intra- and inter-signal correlation structures. Joint sparsity models enable a reduction in the total number of compressive measurements required by CS through the use of specially tailored recovery algorithms. This thesis reviews several different models for sparsity and compressibility of signal ensembles and multidimensional signals and proposes practical CS measurement schemes for these settings. For joint sparsity models, we evaluate the minimum number of measurements required under a recovery algorithm with combinatorial complexity. We also propose a framework for CS that uses a union-of-subspaces signal model. This framework leverages the structure present in certain sparse signals and can exploit both intra- and inter-signal correlations in signal ensembles. We formulate signal recovery algorithms that employ these new models to enable a reduction in the number of measurements required. Additionally, we propose the use of Kronecker product matrices as sparsity or compressibility bases for signal ensembles and multidimensional signals to jointly model all types of correlation present in the signal when each type of correlation can be expressed using sparsity. We compare the performance of standard global measurement ensembles, which act on all of the signal samples; partitioned measurements, which act on a partition of the signal with a given measurement depending only on a piece of the signal; and Kronecker product measurements, which can be implemented in distributed measurement settings. The Kronecker product formulation in the sparsity and measurement settings enables the derivation of analytical bounds for transform coding compression of signal ensembles and multidimensional signals. We also provide new theoretical results for performance of CS recovery when Kronecker product matrices are used, which in turn motivates new design criteria for distributed CS measurement schemes.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.subject Applied Mathematics
Engineering
Electronics and Electrical
dc.title Compressive sensing for signal ensembles
dc.type.genre Thesis
dc.type.material Text
thesis.degree.discipline Engineering
thesis.degree.grantor Rice University
thesis.degree.level Doctoral
thesis.degree.name Doctor of Philosophy
dc.identifier.citation Duarte, Marco F.. (2010) "Compressive sensing for signal ensembles." Doctoral Thesis, Rice University. http://hdl.handle.net/1911/62195.

This item appears in the following Collection(s)