NDLI: On Sparse Representation in Fourier and Local Bases

Content Provider	IEEE Xplore Digital Library
Author	Dragotti, P.L. Lu, Y.M.
Copyright Year	1963
Abstract	We consider the classical problem of finding the sparse representation of a signal in a pair of bases. When both bases are orthogonal, it is known that the sparse representation is unique when the sparsity K of the signal satisfies K <; 1/μ(D), where μ(D) is the mutual coherence of the dictionary. Furthermore, the sparse representation can be obtained in polynomial time by basis pursuit (BP), when K <; 0.91/μ(D). Therefore, there is a gap between the unicity condition and the one required to use the polynomial-complexity BP formulation. For the case of general dictionaries, it is also well known that finding the sparse representation under the only constraint of unicity is NP-hard. In this paper, we introduce, for the case of Fourier and canonical bases, a polynomial complexity algorithm that finds all the possible K-sparse representations of a signal under the weaker condition that K <; √2/μ(D). Consequently, when K <; 1/μ(D), the proposed algorithm solves the unique sparse representation problem for this structured dictionary in polynomial time. We further show that the same method can be extended to many other pairs of bases, one of which must have local atoms. Examples include the union of Fourier and local Fourier bases, the union of discrete cosine transform and canonical bases, and the union of random Gaussian and canonical bases.
Sponsorship	IEEE Information Theory Society
Starting Page	7888
Ending Page	7899
Page Count	12
File Size	722741
File Format	PDF
ISSN	00189448
Volume Number	60
Issue Number	12
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Complexity theory Vectors Polynomials Dictionaries Signal processing algorithms Sparse matrices Coherence mutual coherence Sparse representation union of bases Prony’s method harmonic retrieval basis pursuit
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise

Stable recovery of sparse overcomplete representations in the presence of noise

Matching Pursuit With Block Incoherent Dictionaries

On Polar Polytopes and the Recovery of Sparse Representations

Performance of Sparse Representation Algorithms Using Randomly Generated Frames

Theoretical Results on Sparse Representations of Multiple-Measurement Vectors

Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation

Compressed Sensing and Redundant Dictionaries

On the exponential convergence of matching pursuits in quasi-incoherent dictionaries

On Sparse Representation in Fourier and Local Bases

Similar Documents

Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise

Stable recovery of sparse overcomplete representations in the presence of noise

Matching Pursuit With Block Incoherent Dictionaries

On Polar Polytopes and the Recovery of Sparse Representations

Performance of Sparse Representation Algorithms Using Randomly Generated Frames

Theoretical Results on Sparse Representations of Multiple-Measurement Vectors

Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation

Compressed Sensing and Redundant Dictionaries

On the exponential convergence of matching pursuits in quasi-incoherent dictionaries

On Sparse Representation in Fourier and Local Bases