Reading PAGE
Peer Evaluation activity
| Trusted by | 1 |
| Downloads | 7 |
| Views | 6 |
Total impact ?
Send a 
Michael has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
This was brought to you by:
Followblock this user Michael Elad Trusted member
Professor
Technion - Israel institute of Technology
A Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases
Oh la la
Your session has expired but don’t worry, your message
has been saved.Please log in and we’ll bring you back
to this page. You’ll just need to click “Send”.
Your evaluation is of great value to our authors and readers. Many thanks for your time.
Your mailing list is currently empty.
It will build up as you send messages
and links to your peers.
Enter the e-mail addresses of your recipients in the box below. Note: Peer Evaluation will NOT store these email addresses log in
Your message has been sent.
Description
Title : A Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases
Area : Engineering
Language : English
Url : http://www-sccm.stanford.edu/%7Eelad/Journals/10_Sparseness_IT.ps
Doi : 10.1.1.24.1723
Abstract : An elementary proof of a basic uncertainty principle concerning pairs of representations of # N vectors in di#erent orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pairs of orthonormal bases as overcomplete dictionaries. The main contribution in this paper is the improvement of an important result due to Donoho and Huo concerning the replacement of the l 0 optimization problem by a linear programming minimization when searching for the unique sparse representation. 1
Subject : unspecifiedArea : Engineering
Language : English
| Affiliations : |
Doi : 10.1.1.24.1723
Leave a comment
This contribution has not been reviewed yet. review?
You may receive the Trusted member label after :
• Reviewing 10 uploads, whatever the media type.
• Being trusted by 10 peers.
• If you are blocked by 10 peers the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.
Please select an affiliation to sign your evaluation:
Please select an affiliation:
Michael's Peer Evaluation activity
| Trusted by | 1 |
- FPeer Evaluation, Publisher, Peer Evaluation.
| Downloads | 7 |
- 2IMPROVING THE K-SVD FACIAL IMAGE COMPRESSION USING A LINEAR DEBLOCKING METHOD
- 1 K-SVD: Design of dictionaries for sparse representation
- 1A Non-Negative and Sparse Enough Solution of an Underdetermined Linear System of Equations is Unique
- 1Accurate and Fast Discrete Polar Fourier Transform
- 1Recursive Super-Resolution Restoration of Continuous Image
- 1Restoration of a Single Superresolution Image from Several Blurred, Noisy, and Undersampled Measured Images
| Views | 6 |
- 1 K-SVD: Design of dictionaries for sparse representation
- 11 Closed-Form MMSE Estimation for Signal Denoising Under Sparse Representation Modeling Over a Unitary Dictionary
- 1A Fast Super-Resolution Reconstruction Algorithm for Pure Translational Motion and Common Space-Invariant Blur
- 1A Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases
- 1A Near-Optimal Filtering Scheme for Low Bit-Rate Block Coders Using Variable Projection
- 1A Non-Negative and Sparse Enough Solution of an Underdetermined Linear System of Equations is Unique
Michael has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
Full Text request
Your request will be sent.
Please enter your email address to be notified
when this article becomes available
Your email