ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1606.05889
51
13
v1v2 (latest)

Tight Performance Bounds for Compressed Sensing With Group Sparsity

19 June 2016
Shashank Ranjan
M. Vidyasagar
ArXiv (abs)PDFHTML
Abstract

Compressed sensing refers to the recovery of a high-dimensional but sparse vector using a small number of linear measurements. Minimizing the ℓ1\ell_1ℓ1​-norm is among the more popular approaches for compressed sensing. A recent paper by Cai and Zhang has provided the "best possible" bounds for ℓ1\ell_1ℓ1​-norm minimization to achieve robust sparse recovery (a formal statement of compressed sensing). In some applications, "group sparsity" is more natural than conventional sparsity. In this paper we present sufficient conditions for ℓ1\ell_1ℓ1​-norm minimization to achieve robust group sparse recovery. When specialized to conventional sparsity, these conditions reduce to the known "best possible" bounds proved earlier by Cai and Zhang. This is achieved by stating and proving a group robust null space property, which is a new result even for conventional sparsity. We also derive bounds for the ℓp\ell_pℓp​-norm of the residual error between the true vector and its approximation, for all p∈[1,2]p \in [1,2]p∈[1,2]. These bounds are new even for conventional sparsity and of course also for group sparsity, because previously error bounds were available only for the ℓ2\ell_2ℓ2​-norm.

View on arXiv
Comments on this paper