✦ LIBER ✦

Design and Generalization Analysis of Orthogonal Matching Pursuit Algorithms

✍ Scribed by Hussain, Z.; Shawe-Taylor, J.; Hardoon, D.R.; Dhanjal, C.

Book ID: 114642782
Publisher: IEEE
Year: 2011
Tongue: English
Weight: 901 KB
Volume: 57
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2011.2158880

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of Orthogonal Matching Pursuit

Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property

✍ Davenport, M.A.; Wakin, M.B. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 185 KB

Generalization of matching extensions in

Generalization of matching extensions in graphs—combinatorial interpretation of orthogonal and q-orthogonal polynomials

✍ A. Kyriakoussis; M.G. Vamvakari 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Signal Recovery From Incomplete and Inac

Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit

✍ Needell, Deanna (author);Vershynin, Roman (author) 📂 Article 📅 2010 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 793 KB

Signal Recovery From Incomplete and Inac

Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit

✍ Needell, Deanna (author);Vershynin, Roman (author) 📂 Article 📅 2010 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 793 KB

Hyperspectral Data Processing (Algorithm

Hyperspectral Data Processing (Algorithm Design and Analysis) || Orthogonal Subspace Projection Revisited

✍ Chang, Chein-I 📂 Article 📅 2013 🏛 John Wiley & Sons, Inc. ⚖ 982 KB

Balanced network flows. I. A unifying fr

Balanced network flows. I. A unifying framework for design and analysis of matching algorithms

✍ Fremuth-Paeger, Christian; Jungnickel, Dieter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB 👁 2 views

We discuss a wide range of matching problems in terms of a network flow model. More than this, we start up a matching theory which is very intuitive and independent from the original graph context. This first paper contains a standardized theory for the performance analysis of augmentation algorithm