Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Reports, Documentation, and Standards
  4. On the Use of A Priori Information for Sparse Signal Representations
 
Loading...
Thumbnail Image
report

On the Use of A Priori Information for Sparse Signal Representations

Divorra Escoda, O.  
•
Granai, L.  
•
Vandergheynst, P.  
2004

This report studies the effect of introducing a priori knowledge to recover sparse representations when overcomplete dictionaries are used. We focus mainly on Greedy algorithms and Basis Pursuit as for our algorithmic basement, while a priori is incorporated by suitably weighting the elements of the dictionary. A unique sufficient condition is provided under which Orthogonal Matching Pursuit, Matching Pursuit and Basis Pursuit are able to recover the optimally sparse representation of a signal when a priori information is available. Theoretical results show how the use of "reliable" a priori information can improve the performances of these algorithms. In particular, we prove that sufficient conditions to guarantee the retrieval of the sparsest solution can be established for dictionaries unable to satisfy the results of Gribonval and Vandergheynst and Tropp. As one might expect, our results reduce to the classical case when no a priori information is available. Some examples illustrate our theoretical findings.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

Divorra_Escoda2004_927.pdf

Access type

openaccess

Size

388.78 KB

Format

Adobe PDF

Checksum (MD5)

2f1db81ca7fee0c407fb1f4a0e9c450b

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés