Compressive Sensing
Compressive Sensing
IMAGE RECONSTRUCTION
Internal Guide External Guide
Prof. Jigna Patel Prof. Ketki Pathak
E.C .Department E. C. Department,
Dr. S. & S. S. Ghandhy GEC, Surat SCET, Surat.
Submitted By:-
SHERIN C ABRAHAM (150230727015)
M.E. (ELECTRONICS AND COMMUNICATION)
Wireless Communication Systems and Networks
Semester-3, Year 2016,
Dr. S. & S. S. Ghandhy Govt. Engineering College, Surat.
CONTENTS
• Introduction
• Applications
• Motivation
• Literature survey
• Objectives
• Problem statement
• Block Diagram
• Work Done
• Future works
• Conclusion
• References
Compressive sensing based image reconstruction
2
150230727015
INTRODUCTION – SIGNAL COMPRESSION
TECHNIQUE
• Shannon’s Nyquist sampling theorem
– A signal sampled at a Rate > 2* fmax - for fidelity of signal reconstruction.
M N
receive decompress
“Can we not just directly measure the part that will not
end up being thrown away ?” Donoho
M N
X Compressed sensing Reconstruction
• x is in time domain.
• x=Ψf
– f is the basis domain representation of signal x by the orthonormal basis Ψ
of size NxN.
– If signal x is K-sparse, it’s a linear combination of only K basis vectors.
• y = ФΨf = Acsf = Фx
– Acs = ФΨ is the sensing matrix.
– Ф is the measurement matrix. [11]
Compressive sensing based image reconstruction
10
150230727015
CS MATRIX REPRESENTATION
K < M << N y = Φx
Fig. 5: Matrix representation of CS. [13]
f
x Orthonormal
basis Ψ
Measurement
matrix φ
Ψ* Inverse of Ψ Reconstruction
algorithm
• The increasing demand for visual communication over Internet and wireless
networks.
f
x Transform
Domain
Measurement
matrix φ
Inverse Reconstruction
transform algorithm
f
x Transform
Domain
Measurement
matrix φ
Inverse Reconstruction
transform algorithm
• The sparsity level of prediction residual is higher than its original image block.
• Because the sparsity level of prediction residual is higher than its original
image block, the performance will be more better.
Compressive sensing based image reconstruction
31
150230727015
PAPER 3
• Title: Image Reconstruction Based on The Improved Compressive Sensing Algorithm
• Authors: Xiumeni Li and Guoan Bi
• Publication & Year: IEEE International Conference on Digital Signal Processing
(DSP), 2015
• Problem Identified:
Low frequency coefficients are not sparse, multiplying with measurement
matrix, the coherence will be disrupted
• Measuring Parameters
PSNR for different measurement matrices, for different values of M value.
• Research Gaps
Low frequency coefficients have coherence nature which can be utilized by intra
prediction
Compressive sensing based image reconstruction
32
150230727015
REVIEW
• Only measure the high-frequency sub band coefficients, and keep the low-
frequency sub-band coefficients unchanged.
• High frequency wavelet coefficients non – zero mean distributions are made to
zero, thus improve sparsity of the image.
• The resulting conditional PDF P(αi −μi|Ci) is centered at zero, (αi−μi) is more
likely to be zero or very small than αi, meaning that the bias-removed wavelet
representation becomes sparser.
Compressive sensing based image reconstruction
35
150230727015
PAPER 5
• Title: A New Wavelet Based Efficient Image Compression Algorithm Using
Compressive Sensing
• Authors: Muhammad Ali Qureshi and M. Deriche
• Publication & Year: Springer Science Multimedia tools and applications,
March 2015
• Problem Identified:
Measurement matrix is fixed and not depend on signal
• Measuring Parameters
PSNR for different measurement matrices, for different values of M
value.
• Research Gaps
More sparsity, Gaussian matrix will perform well.
Compressive sensing based image reconstruction
36
150230727015
REVIEW
High gradient
Sparse nature, Developing
amplitudes and rapid IEEE
incoherence of MRI sparsity. Improve Michael Mar
switching produce Signal
6 CS - MRI images. Applications speed of Lustig ch,
nerve stimulation. Processing
of CS in MRI are also reconstruction and et.al 2008
MRI data are Magazine
explained. algorithms
redundant 40
No Paper Problem identified Summary Gaps Authors Publication Year
Chen
Science
Sparsity in wavelet Chen
Wavelet Wavelet tree structure- Slow Direct
domain or gradient and July,
8 Structure fewer data only computation due Magnetic
domain only Junzho 2014
CS MRI required. to tree structure Resonance
exploited. u
Imaging
Huang
• Use good measurement matrices separately for low frequency components and
high frequency components.
• To optimise compressive based algorithm for better visual quality for medical
image application.
Side Information
partition Y Y
Measurements Measurements
Gabor sampling (φL) sampling (φH) Bit- N Bit- N
filtering loss? loss?
YL YH
Similar N Quantization
output?
De-quantization
Y Packeting
Intra- Un-packet
prediction Entropy Coding
Entropy decoding
Side info.
Channel
Compressive sensing based image reconstruction
Block diagram from base paper[1] 150230727015
44
IMPROVEMENT & SUGGESTIONS
Original Image Channel
(256x256)
CS Recovery
Block Low frequency High frequency using L1 CS Recovery
partition components components minimization using OMP
L1 - 50.08 42.74 - -
L1 0 0.6382 3.45 - -
In OMP, each image undergoes 50 iterations.
Compressive sensing based image reconstruction
49
150230727015
MATLAB OUTPUT IMAGES
BACK
Fig. 14: PSNR of different sizes of an image for 15 iterations in OMP reconstruction algorithm.
Compressive sensing based image reconstruction
54
150230727015
MATLAB OUTPUT IMAGES
• Low frequency components are the approximation of the image (not sparse)
and high frequency components are details (sparse) of the image.
• Hadamard matrix will give better image quality. For n x n matrix, HHT = n In .
• L1 minimisation technique is better than OMP for large size images, and vice
versa for small images.
• In Medical field, CS will help in less number of samples, less radiation for
patients.
Compressive sensing based image reconstruction
58
150230727015
PLANNING FOR NEXT SEMESTER