The restricted isometry property of block diagonal matrices for group-sparse signal recovery

DOI10.1016/J.ACHA.2022.03.007zbMATH Open1492.94031arXiv1901.06214OpenAlexW2909495980WikidataQ114214254 ScholiaQ114214254MaRDI QIDQ2155809FDOQ2155809

Niklas Koep, R. Mathar, A. Behboodi

Publication date: 15 July 2022

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Abstract: Group-sparsity is a common low-complexity signal model with widespread application across various domains of science and engineering. The recovery of such signal ensembles from compressive measurements has been extensively studied in the literature under the assumption that measurement operators are modeled as densely populated random matrices. In this paper, we turn our attention to an acquisition model intended to ease the energy consumption of sensing devices by splitting the measurements up into distinct signal blocks. More precisely, we present uniform guarantees for group-sparse signal recovery in the scenario where a number of sensors obtain independent partial signal observations modeled by block diagonal measurement matrices. We establish a group-sparse variant of the classical restricted isometry property for block diagonal sensing matrices acting on group-sparse vectors, and provide conditions under which subgaussian block diagonal random matrices satisfy this group-RIP with high probability. Two different scenarios are considered in particular. In the first scenario, we assume that each sensor is equipped with an independently drawn measurement matrix. We later lift this requirement by considering measurement matrices with constant block diagonal entries. In other words, every sensor is equipped with a copy of the same prototype matrix. The problem of establishing the group-RIP is cast into a form in which one needs to establish the concentration behavior of the suprema of chaos processes which involves estimating Talagrand's $gamm{a}_2$ functional. As a side effect of the proof, we present an extension to Maurey's empirical method to provide new bounds on the covering number of sets consisting of finite convex combinations of possibly infinite sets.

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

zbMATH Keywords

compressed sensingrestricted isometry propertysuprema of chaos processes

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Sparsity and Smoothness Via the Fused Lasso
• High-Dimensional Probability
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Stable signal recovery from incomplete and inaccurate measurements
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• The Generalized Lasso With Non-Linear Observations
• A mathematical introduction to compressive sensing
• Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
• Sparse solutions to linear inverse problems with multiple measurement vectors
• Neighborliness of randomly projected simplices in high dimensions
• Some limit theorems for empirical processes (with discussion)
• High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
• The convex geometry of linear inverse problems
• Compressed Sensing and Redundant Dictionaries
• Living on the edge: phase transitions in convex programs with random data
• Counting faces of randomly projected polytopes when the projection radically lowers dimension
• Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling
• Suprema of chaos processes and the restricted isometry property
• Counting the faces of randomly-projected hypercubes and orthants, with applications
• Model-Based Compressive Sensing
• Tail bounds via generic chaining
• Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
• Robust Recovery of Signals From a Structured Union of Subspaces
• Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
• Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
• The restricted isometry property for random block diagonal matrices
• Uniform recovery of fusion frame structured sparse signals
• Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness
• On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions
• A new bound on the block restricted isometry constant in compressed sensing
• Uniform recovery from subgaussian multi-sensor measurements

Cited In (1)

• The Group Lasso for Stable Recovery of Block-Sparse Signal Representations

This page was built for publication: The restricted isometry property of block diagonal matrices for group-sparse signal recovery

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