Final Project

Image Compression via

Compressive Sampling

Digital Image Processing

Hassan (Student id =2010315440)
Depar tment of Computer Engineering

1
Sequence of presentation
qIntroduction and Motivation
qProblem Statement
qMethodology
qImplementation
qResults
qConclusion

2
Introduction
ØThe Shannon/Nyquist sampling theorem says we must sample
a single at least two times faster than its bandwidth
However we may end up with too many samples and must

compress in order to store or transmit them



In Past , Transform coding is used to sample-then-compress an

image
But it suffers from three inefficiencies:

üstart with large number of samples N

üencoder must compute all of the N transform coefficients
üthe overhead of encoding the locations of the large coefficients.
ü


3
Motivation
Image compression algorithm convert high-
resolution image to small bit stream
But is there a way to avoid the large date set

to begin with ?


The existing image compression methods

(e.g. Jpeg2000, SPIHT) are vulnerable to bit
loss
We require a compressions scheme that

tackles these loses



4
CS Theory


Compressive sensing (CS), also known as



compressive sampling, is a new sensing and sampling

paradigm, which involves three major aspect:
• Sparse representation
•
•
•
• CS measurements taking


• CS reconstruction


5
 Practical examples (1/2)
qOne of the first prototype demonstrations of compressed sensing is the single
pixel camera, developed by Rice University
q
q
q
q
q
q
q
q


Test image (16384 pixels) and CS reconstruction using 1600 and 3300 measurements
(http://dsp.rice.edu/cscamera)

6
 Practical examples (2/2)
q
q
q
q
q
q
q
q
q
q


MRI image of a mouse heart, and CS reconstruction using 20% of available



measurements

7
Problem statement (1/2)

8
Problem statement (2/2)

9
Methodology
ØChoose measurement matrix as IID Gaussian
Random matrix
Ø
ØThe reconstruction algorithm is a Linear
Algebra Problem!!
Ø
ØMinimum l1 norm reconstruction:


ØThis is a convex optimization problem that can be solved

using Linear Programing

10
Implementation in MTES(1/2)


11
MTES Implementation (2/2)

Encoder

Decoder

12
 Results (1/2)

a) Original cameraman Image b) Reconstructed cameraman Image

c) Original Lena Image b) Reconstructed Lena Image

13
From Matlab
 Results (2/2)

e) Original 32x32 section of f)Reconstructed 32x32 section of MRIscan

MRIscan Image Image

14
g) Original 128x128 hardware Image h) reconst. 128x128 hardware Image
From Matlab
Conclusions
ØCompressed sensing is a fairly new paradigm,
but is already being used in practical settings,
for instance to speed up MRI scans by requiring
fewer measurements to achieve a given amount
of resolution.
Ø
ØIt is better to divide the image into blocks rather
then taking a whole image.


15
References
B. Han et all., “Image representation by compressed sensing,” in
IEEE Int. Conf. Image Process.(ICIP’08),
Chenwei Deng et all , “Robust Image Compression Based on

Compressive Sensing”, ICME 2010

Y.F. Zhang, S.L. Mei, and Q.Q. Chen, “A novel image video

coding method based on compressed sensing theory,” in IEEE Int.

conf. Acoustics, Speech. Signal Process. (ICASSP’08)
Richard Baraniuk, “A Lecture on Compressive Sensing”, IEEE

Signal Processing Magazine, July 2007

E.J. Cand`es, M.B. Wakin, and S.P. Boyd, “Enhancing sparsity by

reweighted ℓ1 minimization,” J. Fourier Analy. and Applic., vol. 14,

no. 5, pp. 877–905, Oct. 2008.


16