You are on page 1of 16

SUBMITTED TO

:
MR. SUMIT BUDHIRAJA
ASSTT. PROFESSOR
SUBMIITED BY : MEENAKSHI
ME-ECE (2nd YEAR)
ROLL NO. -13-713
UIET (P.U), CHD.

. As a consequence. compression. measurement and recording techniques designed to produce the images depend deeply on the application considered. and generation of images. modification. Image reconstruction can be seen as the solution of a mathematical inverse problem in which the cause is inferred from the effect. visualization.  Imaging is a broad field which covers all aspects of the analysis.

that is. by only a small number of non-zero coefficients to be incomplete information. When reconstructing the signal the non-stored coefficients are simply set to zero .   Compressive sensing is a new type of sampling theory. which predicts that sparse signals and images can be reconstructed easily . CS relies on the empirical observation that many types of signals or image can be well-approximated by a sparse expansion in terms of a suitable basis. A compression is obtained by simply storing only the largest basic coefficients.

.

The image at the decoder side can be recovered easily with some sparse information . Sparsity expresses the idea that the “information rate” of a continuous time signal may be much smaller than suggested by its bandwidth and CS exploits the fact that many natural signals are sparse or compressible in the sense that they have concise representations when expressed in the proper basis. For that purpose. different techniques and parameter can be implemented and used. reduce data rate and low complexity encoders. thereby saving the storage memory. Incoherence extends the duality between time and frequency and expresses the idea that objects having a sparse representation in one domain must be spread out in the domain in which they are acquired .    The problem defined here is image reconstruction using compressive sensing technique. fewer measurements and short scan time.

but the required type and number of measurements were sub-optimal and subsequently greatly improved by compressed sensing. In statistics. At first glance. It was used in matching pursuit in 1993 and basis pursuit in 1998. There were theoretical results describing when these algorithms recovered sparse solutions. the least squares method was complemented by the norm. because compressed sensing depends on the sparsity of the signal in question and not its highest frequency but this is a misconception . which several other scientific fields have used historically.COMPRESSIVE SENSING   Compressed sensing relies on L1 techniques. which was introduced by Laplace. compressed sensing might seem to violate the sampling theorem. .

.L.r. Donoho for image reconstruction with different algorithms of recovery for better storage and less CPU recovery time.  It can be empolyed with different techniques and their modifications for achieving better PSNR.t number of measurements and number of blocks. lesser CPU time w.  Compressive Sensing was employed by D. Sparse signals with high frequency components can be highly under-sampled using compressed sensing compared to classical fixed-rate sampling.

.

.

.

.

.

number of rows.  The effect of noise is not considered with every minimizing technique. permutations of the coefficients. strength of pixel can be used.  While collecting the coefficients (sampling) can be based on other side information too like contrast.  .adaptive and kalman filters can be used.Different intraprediction modes or intraprediction modes can be considered concerning the smoothing and boundary strength and various smoothing filters like butterworth . Earlier work has used only variance and energy. which is a crucial obstruction in recovery.

various side information. sampling of residual coefficients can be employed.  Earlier work has rarely used domains like contourlet. adaptive filtering with the technique. variable index set at each iterations.  For OMP. radon transform and norms can be considered along with TV. DCT constraint. curvelet . .DDWT. The constraint of TV minimization can be wavelet constraint.

with generalised form followed by smoothing filters. contourlet. Contourlet [16]. fourier transform in domains like spatial. variance . Design of Measurement matrix [15]. OMP with side information. Analysis of parameters like PSNR. radon transform. Shear. Quantization noise with respect to number of measurements. curvelet etc. permutations of coefficients. . applied only on high level coefficients. DDWT (Dual tree Discreet Wavelet Transform). Sampling optimization like adaptive (based on energy. number of blocks.TV minimization either by intraprediction modes . Daubechies.     Implementation of block compressive sensing and applying transform like wavelet transform (Haar. kroneckor product).). gradient descent method. norm method or with side information and other constraints like DCT.