https://github.com/augustunderground/cosamp

CoSaMP algorithm in Haskell

https://github.com/augustunderground/cosamp

Science Score: 23.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
  • codemeta.json file
    Found codemeta.json file
  • .zenodo.json file
  • DOI references
  • Academic publication links
    Links to: arxiv.org
  • Academic email domains
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (6.1%) to scientific vocabulary

Keywords

compressed-sensing cosamp haskell sparse-sampling
Last synced: 5 months ago · JSON representation

Repository

CoSaMP algorithm in Haskell

Basic Info
Statistics
  • Stars: 0
  • Watchers: 1
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Topics
compressed-sensing cosamp haskell sparse-sampling
Created about 3 years ago · Last pushed about 3 years ago
Metadata Files
Readme Changelog License

README.md

CoSaMP

CoSaMP algorithm in Haskell.

Documentation

Use in Stack Project

Add this to stack.yaml:

yaml extra-deps: - github: augustunderground/cosamp commit: 264f4ec2f6a74d10a7cc484e0bbbe7f24d85d3cc

Example

```haskell import CoSaMP import Numeric.LinearAlgebra import Graphics.Plot

main :: IO () main = mplot [t, s] >> mplot [tWin, xWin, xWin'] where n = 4096 :: Int t = linspace n (0.0, 1.0 :: Double) x = sin ( 91 * 2 * pi * t ) + sin ( 412 * 2 * pi * t ) p = 128 :: Int aquis = cmap floor $ scale (realToFrac n - 1) (randomVector 666 Uniform p) :: Vector I y = flatten $ asRow x ?? (All, Pos aquis) φ = dctOrtho (ident n :: Matrix Double) cφ = φ ?? (Pos aquis, All) s = cosamp cφ y 10 100 1.0e-10 x' = idctOrtho s wIdx = idxs $ find (\i -> i >= 0.4 && i <= 0.5) t tWin = flatten $ asRow t ?? (All, Pos wIdx) xWin = flatten $ asRow x ?? (All, Pos wIdx) xWin' = flatten $ asRow x' ?? (All, Pos wIdx) ```

Build From Source

$ git clone https://github.com/augustunderground/cosamp $ cd cosamp $ stack build $ stack install $ stack run

References and Resources

This is a Haskell implementation of the Compressive Sampling Matched Pursuit (CoSaMP) algorithm as presented in Needell and Tropp's 2008 paper.

There are also reference implementations available in: - MATLAB. - Python which is based on

Owner

  • Name: ynk
  • Login: AugustUnderground
  • Kind: user
  • Location: Innsmouth
  • Company: @electronics-and-drives

PhD Student at Reutlingen University

GitHub Events

Total
Last Year

Issues and Pull Requests

Last synced: 12 months ago

All Time
  • Total issues: 0
  • Total pull requests: 0
  • Average time to close issues: N/A
  • Average time to close pull requests: N/A
  • Total issue authors: 0
  • Total pull request authors: 0
  • Average comments per issue: 0
  • Average comments per pull request: 0
  • Merged pull requests: 0
  • Bot issues: 0
  • Bot pull requests: 0
Past Year
  • Issues: 0
  • Pull requests: 0
  • Average time to close issues: N/A
  • Average time to close pull requests: N/A
  • Issue authors: 0
  • Pull request authors: 0
  • Average comments per issue: 0
  • Average comments per pull request: 0
  • Merged pull requests: 0
  • Bot issues: 0
  • Bot pull requests: 0
Top Authors
Issue Authors
Pull Request Authors
Top Labels
Issue Labels
Pull Request Labels