Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the efficiency of the Orthogonal Matching Pursuit in compressed sensing

From MaRDI portal
Publication:2884662
Jump to:navigation, search

DOI10.1070/SM2012V203N02ABEH004218zbMath1259.94019MaRDI QIDQ2884662

E. D. Livshits

Publication date: 30 May 2012

Published in: Sbornik: Mathematics (Search for Journal in Brave)


zbMATH Keywords

coherencesparsitycompressed sensingorthogonal matching pursuitrestricted isometry propertyorthogonal greedy algorithm


Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Application of orthogonal and other special functions (94A11) Applications of functional analysis in numerical analysis (46N40)


Related Items (2)

A new result on recovery sparse signals using orthogonal matching pursuit ⋮ Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit


Uses Software

  • PDCO






This page was built for publication: On the efficiency of the Orthogonal Matching Pursuit in compressed sensing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2884662&oldid=15840233"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki