1. Home
  2. Ece 301 projects fall 2003
  3. Image compression through sparse
  4. Code

9.5 Code

<< Chapter < Page
  Ece 301 projects fall 2003   Page 1 / 1
Chapter >> Page >
Code for our ELEC 301 Project for Fall 2003. By: Chris Omidiran, Genaro Picazo, Ian Wells, Daniel Wu

Basis/orthogonal matching pursuit code

This is our code for the basis pursuit and orthogonal matching pursuit algorithms for 2 dimensional signals, namely images. All of the code was written from scratch by members of the group, and was based on ideas drawn from our research. The code is shown below.

Bp basis

Code to define our dictionary for the algorithms.

Bp decompose

Given a an image, it decomposes the image into a representation of k terms.

Omp decompose

Given a an image, it docomposes the image into a representation of k terms (this one is for OMP, it is the only function that differs between algorithms).

Bp block decompose

Decomposes and image into row signals.

Bp construct

Reconstructs the approximate representation of the original image.

Bp block construct

Reconstructs each row of the approximate representation of the original image.

Applying bp to an image

This algorithm takes in an image and the number of coefficients to use to approximate it and applies the BP algorithm to it.

Continue
<< Chapter < Page Page > Chapter >>

Read also:

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Ece 301 projects fall 2003. OpenStax CNX. Jan 22, 2004 Download for free at http://cnx.org/content/col10223/1.5
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Ece 301 projects fall 2003' conversation and receive update notifications?

Ask