sparse-plex
  • About Sparse-Plex
  • Getting Started
  • Demos
  • Sparse Signal Models
  • Compressive Sensing
  • Data Analysis
  • Data Clustering
  • Pursuit Algorithms
    • Prelude to greedy pursuit algorithms
    • Matching Pursuit
    • Orthogonal Matching Pursuit
      • The OMP Algorithm
      • Exact recovery conditions
      • Sparse approximation conditions
      • Fast Implementation of OMP
      • Batch OMP
    • Orthogonal least squares
    • Compressive sampling matching pursuit
    • Iterative hard thresholding
    • Hard thresholding pursuit
    • Framework for study of performance of pursuit algorithms
  • Subspace Clustering
  • Dictionary Learning
  • Set Theory
  • Linear Algebra
  • Matrix Algebra
  • Real Analysis
  • Convex Analysis
  • Probability and Random Variables
  • Geometry
  • Numerical Optimization
  • Digital Signal Processing
  • Wavelets
  • Detection, Classification and Estimation
  • ECG
  • Computational Complexity
  • Library Classes
  • Exercises
  • Scripts
  • References
  • Index
  • File an issue
    • sparse-plex
    • Docs »
    • Pursuit Algorithms »
    • Orthogonal Matching Pursuit

    Orthogonal Matching PursuitΒΆ

    • The OMP Algorithm
      • Hands-on with Orthogonal Matching Pursuit
    • Exact recovery conditions
      • Babel function estimates
    • Sparse approximation conditions
    • Fast Implementation of OMP
      • A Simple Example
      • Benchmarks
    • Batch OMP
      • Least Squares in OMP using Cholesky Update
      • Removing residuals from the computation
      • The Batch OMP Algorithm
      • Fast Batch OMP Implementation
    Next Previous

    © Copyright 2015-2019, Shailesh Kumar Revision 5657edfe.

    Built with Sphinx using a theme provided by Read the Docs.