CHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT

Size: px
Start display at page:

Download "CHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT"

Transcription

1 CHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT 9.1 Introduction In the previous chapters the inpainting was considered as an iterative algorithm. PDE based method uses iterations to converge to the solution and the Exemplar based method uses iterations to propagate the information from the boundary to the interior of the inpainting area. The exemplar based methods incur additional cost as they adopt an exhaustive search looking for a best matching patch. All the inpainting algorithms depend on the information present in the boundary. Hence the error caused near the boundary is propagated into the interior regions of inpainting. These problems are avoided by the method proposed in this chapter, thus addressing the last research objective. 9.2 Compressive Sensing Compressive sensing is a data acquisition technique that aims to reduce a number of measurements required for representation of signals/images by exploiting its compressibility or sparsity. Most of the signals/images will be sparse in some transform domain. A signal is said to be sparse signal if that can be compactly expressed as a linear combination of a small number of elementary signals[37]. The sparse representation theory states that sparse signals can be exactly approximated from a small number of elementary signals. The sparse representation of the signals can be 123

2 achieved by exploiting its compressibility or diversity, where only a small fraction of the coefficients are zero. The discrete cosine transform (DCT) represents an image as a sum of sinusoids of varying magnitudes and frequencies. The DCT has the property that, for a given image, most of the visually significant information about the image is concentrated only in a few coefficients. This ability of DCT is called energy compaction. This helps to discard the coefficients that are relatively small without introducing any visual distortion in the reconstructed image. This property of DCT is generally used in compression but in this chapter, it is used to inpaint the images. (a) (b) Fig 9.1: (a) image compression, (b) reconstruction; X - Input image, Ψ Transform matrix, S sparse transform coefficients, S= X, Ψ, Φ stable measurement matrix that ensures that the salient information in any K-sparse or compressible signal is not damaged by the dimensionality reduction from X M x N to Y m x n, Y- compressed image (ΦX) 124

3 Compressive sensing predicts that sparse signals and images can be reconstructed from what was previously believed to be incomplete information. Instead of taking the whole data about the images/signals it takes only the data where the coefficient value is high. The process of compressive sensing is shown in Fig 9.1 Hence, any image/signal can be expressed as, X = ΨS, where S= X, Ψ = Ψ T X and where T denotes the transpose operation. Clearly, X and S are equivalent representations of the same signal/image, with X in the time domain and S in the Ψ domain. Relating the above terms with the proposed method: X is the input image, Ψ is the transform matrix which can be thought of as DCT transform coefficient matrix, Φ is the random selection in CS which can be the pixels that we leave during downsampling, S is the sparse transform coefficients in CS; in this case it can be the transform matrix that remains after thresholding and Y is the downsampled image. The final step of getting back the image in CS is X= ΨS; here it is the zero padded transform matrix passing through inverse discrete cosine transform. Inpainting could be considered as the reconstruction step of compressive sensing where the image has to be predicted from few coefficients. Super resolution[32] image is a higher resolution image extracted from one or more low resolution image. This can be thought of as an inpainting process where the new pixels in higher resolution are considered as unknown pixels. In all these cases the sparse coefficients in the transform domain could be calculated with the known image pixels and these coefficients are used to predict the unknown values by applying suitable sized inverse DCT. The theory was derived from Compressive sensing developed by Donoho [40], [41]. More theory on sparse representation could be found in [42], [43]. Inpainting in Sparse domain is considered as denoising task in [44], [45]. These methods create 125

4 dictionaries as in [46] to perform the denoising. In [47] a Bayesian framework is used with an iterative EM algorithm to inpaint the image. 9.3 Inpainting Using Inverse DCT (IDCT) The two dimensional DCT transform for an image is described in chapter The transformation kernel can be represented in a matrix form φ, which remains the same for any image of the same size. The DCT coefficients can be represented as transformed matrix A. For a square image a, it can be calculated using the kernel as given in Eq 9.1. [A]=[φ].[a].[φ T ] (9.1) where [.] represents the matrix and φ T is the transpose of φ. Similarly the image could be reconstructed from the coefficients using Eq. 9.2 [a]=[φ T ].[A].[φ] (9.2) The first element in the transformed matrix represents the DC element and entries with increasing vertical and horizontal index values represent higher vertical and horizontal frequencies. The values on the upper left correspond to the low frequencies and those on the bottom right correspond to the high frequencies. For most images, all the significant values are populated on the top left and the values at the bottom right corner are negligible. The images could be reconstructed from few significant values in a visually plausible manner. Conversely the insignificant values added in the high frequency range could be used to reconstruct an enlarged image. This principle is being utilized in this chapter for inpainting and producing super resolution images. The block diagram for inpainting is shown in Fig

5 Fig 9.2: Block diagram showing the process of inpainting For inpainting an image, the mask is accepted from the user and the mask pixels are eliminated which results in reduced size of the image. The DCT coefficients are constructed for the reduced image (m x n) using DCT kernel of same size (m x n) and zeros are added in the high frequency area to make the transformed matrix size equal to that of the original size (M x N). The image is reconstructed from the coefficients using the Inverse DCT kernel of size (M x N). For irregular aperiodic masks the elimination of the mask pixels creates distortion. To avoid this, the lines containing the mask pixels are eliminated. This enables the image to be in regular shape. For color images, the algorithm is applied separately to each of the three color component. The RGB components of the image are separated and after processing each component separately, the results are combined to get back the inpainted color image. For producing the super resolution images, the DCT coefficients are obtained from the low resolution image and zeros are padded to the right and bottom ends of the transformed matrix to convert the image to the required resolution. An Inverse DCT kernel for the updated size is used and the image is reconstructed using Eq

6 9.4 Experimental Analysis The effectiveness of the DCT in energy compaction is analyzed at various levels. A percentage of the DCT coefficients of the images are neglected from the lower right part of the matrix and the images are reconstructed with lesser coefficients. The mean square error between the actual image and the reconstructed image is calculated. The error values versus various percentages of unknown DCT coefficients for few images are plotted in Fig 9.3. The images used for the analysis is given in Table 9.4. Error % of unknown co-efficients DCT_1 DCT_2 DCT_3 DCT_4 DCT_5 DCT_6 Fig 9.3 Effect of unknown DCT coefficients in image reconstruction Image quality of the reconstructed image decreases as the number of known coefficients reduces. Fig 9.4 shows the comparison between the percentage of information known and the error value for an image. It can be seen that when the known information is less than 25% the error value increases tremendously. 128

7 percentage information Error value percentage information Percentage of information known Fig 9.4 performance of Image reconstruction using reduced DCT coefficients The performance of the system in producing super resolution images is measured by down sampling images and reconstructing back using suitable sized IDCT kernel. The enlargement is done in various levels. At each level the image is enlarged to twice the size of the reconstructed image of the previous level. The reconstruction up to two levels shows good results, beyond which the reconstructed images shows ringing effect. These are demonstrated in Fig The result of eliminating consecutive rows and columns and reconstructing the image with remaining portions of the image is given in Table 9.1. The percentage of the known pixels used to reconstruct and the mean square error calculated from the actual image is also tabulated. 129

8 (a) (b) Fig 9.5: (a),(b) 256 x 256 image constructed after one and 3 levels respectively For the inpainting application masks in the form of periodic, regular grids and aperiodic irregular grids are considered for various images. The result of inpainting by removing the grids for gray scale images are given in Table 9.2. The results of inpainting the periodic mask area in color images are listed in Table 9.3. The reconstructed images are clearly visible without much distortion but they appear darker than the original image when the inpainting area increases. This effect is noticeable in color images. 130

9 Table 9.1 Image reconstruction after ignoring varied number of rows and columns Before inpainting After inpainting % of coefficients known Mean Square error 64% % 2.26e+03 17% 4.27e

10 Table 9.2 Inpainting with various mask on gray scale images Image with grids Reconstructed image % of known coefficients Mean Square error 80% % % 1.2e % 2.3e

11 94.6% % %

12 Table 9.3 Inpainting of color images with periodic mask. Original Image Image with grids After reconstruction % known coefficients % per color channel % per color channel % per color channel % per color channel 134

13 Table 9.4 Input images used for experimenting DCT compaction. DCT_1 DCT_2 DCT_3 DCT_4 DCT_5 DCT_6 9.5 Conclusion DCT makes an image sparse in the transform domain. The transformed image consists of few significant values with which the image could be reconstructed. Through experimentation it is found that with 50% of the coefficients the images were reconstructed in a visually plausible way. Mild distortions are produced in certain 135

14 images when reconstructed with 30% of the coefficients. Visually noticeable distortions are produced when reconstructed with coefficients less than 25%. Introducing more insignificant values and reconstructing a larger sized image is explored in this chapter. This concept is used for super resolution and inpainting. The image is transformed into its sparse representation with the known coefficients and required amount of insignificant values are added to it. The image is then reconstructed using Inverse DCT. Due to periodic nature of DCT, the image pixels at periodic intervals are reconstructed in a better way. The aperiodic reconstruction is converted into periodic form by losing the information in a periodic form. This leads to additional loss of information. When the aperiodic mask becomes thicker, the quality of image reconstruction drops. The overall brightness of the reconstructed image reduces with reduced number of known coefficients which is predominant in color images. This is because the amplitude of the DC coefficient is to be shared with the newly added pixels. The method discussed in this chapter is a non iterative process and obtains the result with few matrix multiplication operations. This makes the algorithm as the fastest method suggested in the thesis. The inpainted value does not depend on the boundary, but on the entire set of known pixels. The dependency of the boundary pixels are eliminated which addresses the final research objective. 136

MRT based Fixed Block size Transform Coding

MRT based Fixed Block size Transform Coding 3 MRT based Fixed Block size Transform Coding Contents 3.1 Transform Coding..64 3.1.1 Transform Selection...65 3.1.2 Sub-image size selection... 66 3.1.3 Bit Allocation.....67 3.2 Transform coding using

More information

Compressive Sensing for Multimedia. Communications in Wireless Sensor Networks

Compressive Sensing for Multimedia. Communications in Wireless Sensor Networks Compressive Sensing for Multimedia 1 Communications in Wireless Sensor Networks Wael Barakat & Rabih Saliba MDDSP Project Final Report Prof. Brian L. Evans May 9, 2008 Abstract Compressive Sensing is an

More information

Image Inpainting Using Sparsity of the Transform Domain

Image Inpainting Using Sparsity of the Transform Domain Image Inpainting Using Sparsity of the Transform Domain H. Hosseini*, N.B. Marvasti, Student Member, IEEE, F. Marvasti, Senior Member, IEEE Advanced Communication Research Institute (ACRI) Department of

More information

Chapter 4 Face Recognition Using Orthogonal Transforms

Chapter 4 Face Recognition Using Orthogonal Transforms Chapter 4 Face Recognition Using Orthogonal Transforms Face recognition as a means of identification and authentication is becoming more reasonable with frequent research contributions in the area. In

More information

COMPRESSIVE VIDEO SAMPLING

COMPRESSIVE VIDEO SAMPLING COMPRESSIVE VIDEO SAMPLING Vladimir Stanković and Lina Stanković Dept of Electronic and Electrical Engineering University of Strathclyde, Glasgow, UK phone: +44-141-548-2679 email: {vladimir,lina}.stankovic@eee.strath.ac.uk

More information

ISSN (ONLINE): , VOLUME-3, ISSUE-1,

ISSN (ONLINE): , VOLUME-3, ISSUE-1, PERFORMANCE ANALYSIS OF LOSSLESS COMPRESSION TECHNIQUES TO INVESTIGATE THE OPTIMUM IMAGE COMPRESSION TECHNIQUE Dr. S. Swapna Rani Associate Professor, ECE Department M.V.S.R Engineering College, Nadergul,

More information

HYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION

HYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION 31 st July 01. Vol. 41 No. 005-01 JATIT & LLS. All rights reserved. ISSN: 199-8645 www.jatit.org E-ISSN: 1817-3195 HYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION 1 SRIRAM.B, THIYAGARAJAN.S 1, Student,

More information

Video Compression An Introduction

Video Compression An Introduction Video Compression An Introduction The increasing demand to incorporate video data into telecommunications services, the corporate environment, the entertainment industry, and even at home has made digital

More information

Review and Implementation of DWT based Scalable Video Coding with Scalable Motion Coding.

Review and Implementation of DWT based Scalable Video Coding with Scalable Motion Coding. Project Title: Review and Implementation of DWT based Scalable Video Coding with Scalable Motion Coding. Midterm Report CS 584 Multimedia Communications Submitted by: Syed Jawwad Bukhari 2004-03-0028 About

More information

4. Image Retrieval using Transformed Image Content

4. Image Retrieval using Transformed Image Content 4. Image Retrieval using Transformed Image Content The desire of better and faster retrieval techniques has always fuelled to the research in content based image retrieval (CBIR). A class of unitary matrices

More information

DIGITAL TELEVISION 1. DIGITAL VIDEO FUNDAMENTALS

DIGITAL TELEVISION 1. DIGITAL VIDEO FUNDAMENTALS DIGITAL TELEVISION 1. DIGITAL VIDEO FUNDAMENTALS Television services in Europe currently broadcast video at a frame rate of 25 Hz. Each frame consists of two interlaced fields, giving a field rate of 50

More information

TERM PAPER ON The Compressive Sensing Based on Biorthogonal Wavelet Basis

TERM PAPER ON The Compressive Sensing Based on Biorthogonal Wavelet Basis TERM PAPER ON The Compressive Sensing Based on Biorthogonal Wavelet Basis Submitted By: Amrita Mishra 11104163 Manoj C 11104059 Under the Guidance of Dr. Sumana Gupta Professor Department of Electrical

More information

RECONSTRUCTION ALGORITHMS FOR COMPRESSIVE VIDEO SENSING USING BASIS PURSUIT

RECONSTRUCTION ALGORITHMS FOR COMPRESSIVE VIDEO SENSING USING BASIS PURSUIT RECONSTRUCTION ALGORITHMS FOR COMPRESSIVE VIDEO SENSING USING BASIS PURSUIT Ida Wahidah 1, Andriyan Bayu Suksmono 1 1 School of Electrical Engineering and Informatics, Institut Teknologi Bandung Jl. Ganesa

More information

An Intuitive Explanation of Fourier Theory

An Intuitive Explanation of Fourier Theory An Intuitive Explanation of Fourier Theory Steven Lehar slehar@cns.bu.edu Fourier theory is pretty complicated mathematically. But there are some beautifully simple holistic concepts behind Fourier theory

More information

Compression of Stereo Images using a Huffman-Zip Scheme

Compression of Stereo Images using a Huffman-Zip Scheme Compression of Stereo Images using a Huffman-Zip Scheme John Hamann, Vickey Yeh Department of Electrical Engineering, Stanford University Stanford, CA 94304 jhamann@stanford.edu, vickey@stanford.edu Abstract

More information

Image Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi

Image Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi Image Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi 1. Introduction The choice of a particular transform in a given application depends on the amount of

More information

Optimised corrections for finite-difference modelling in two dimensions

Optimised corrections for finite-difference modelling in two dimensions Optimized corrections for 2D FD modelling Optimised corrections for finite-difference modelling in two dimensions Peter M. Manning and Gary F. Margrave ABSTRACT Finite-difference two-dimensional correction

More information

A Comparative Study of DCT, DWT & Hybrid (DCT-DWT) Transform

A Comparative Study of DCT, DWT & Hybrid (DCT-DWT) Transform A Comparative Study of DCT, DWT & Hybrid (DCT-DWT) Transform Archana Deshlahra 1, G. S.Shirnewar 2,Dr. A.K. Sahoo 3 1 PG Student, National Institute of Technology Rourkela, Orissa (India) deshlahra.archana29@gmail.com

More information

CHAPTER 3 DISPARITY AND DEPTH MAP COMPUTATION

CHAPTER 3 DISPARITY AND DEPTH MAP COMPUTATION CHAPTER 3 DISPARITY AND DEPTH MAP COMPUTATION In this chapter we will discuss the process of disparity computation. It plays an important role in our caricature system because all 3D coordinates of nodes

More information

P257 Transform-domain Sparsity Regularization in Reconstruction of Channelized Facies

P257 Transform-domain Sparsity Regularization in Reconstruction of Channelized Facies P257 Transform-domain Sparsity Regularization in Reconstruction of Channelized Facies. azemi* (University of Alberta) & H.R. Siahkoohi (University of Tehran) SUMMARY Petrophysical reservoir properties,

More information

Multimedia Systems Image III (Image Compression, JPEG) Mahdi Amiri April 2011 Sharif University of Technology

Multimedia Systems Image III (Image Compression, JPEG) Mahdi Amiri April 2011 Sharif University of Technology Course Presentation Multimedia Systems Image III (Image Compression, JPEG) Mahdi Amiri April 2011 Sharif University of Technology Image Compression Basics Large amount of data in digital images File size

More information

A Parallel Reconfigurable Architecture for DCT of Lengths N=32/16/8

A Parallel Reconfigurable Architecture for DCT of Lengths N=32/16/8 Page20 A Parallel Reconfigurable Architecture for DCT of Lengths N=32/16/8 ABSTRACT: Parthiban K G* & Sabin.A.B ** * Professor, M.P. Nachimuthu M. Jaganathan Engineering College, Erode, India ** PG Scholar,

More information

Computer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier

Computer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier Computer Vision 2 SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung Computer Vision 2 Dr. Benjamin Guthier 1. IMAGE PROCESSING Computer Vision 2 Dr. Benjamin Guthier Content of this Chapter Non-linear

More information

Haar Wavelet Image Compression

Haar Wavelet Image Compression Math 57 Haar Wavelet Image Compression. Preliminaries Haar wavelet compression is an efficient way to perform both lossless and lossy image compression. It relies on averaging and differencing the values

More information

DCT image denoising: a simple and effective image denoising algorithm

DCT image denoising: a simple and effective image denoising algorithm IPOL Journal Image Processing On Line DCT image denoising: a simple and effective image denoising algorithm Guoshen Yu, Guillermo Sapiro article demo archive published reference 2011-10-24 GUOSHEN YU,

More information

SOME CONCEPTS IN DISCRETE COSINE TRANSFORMS ~ Jennie G. Abraham Fall 2009, EE5355

SOME CONCEPTS IN DISCRETE COSINE TRANSFORMS ~ Jennie G. Abraham Fall 2009, EE5355 SOME CONCEPTS IN DISCRETE COSINE TRANSFORMS ~ Jennie G. Abraham Fall 009, EE5355 Under Digital Image and Video Processing files by Dr. Min Wu Please see lecture10 - Unitary Transform lecture11 - Transform

More information

Statistical Image Compression using Fast Fourier Coefficients

Statistical Image Compression using Fast Fourier Coefficients Statistical Image Compression using Fast Fourier Coefficients M. Kanaka Reddy Research Scholar Dept.of Statistics Osmania University Hyderabad-500007 V. V. Haragopal Professor Dept.of Statistics Osmania

More information

Compression of Light Field Images using Projective 2-D Warping method and Block matching

Compression of Light Field Images using Projective 2-D Warping method and Block matching Compression of Light Field Images using Projective 2-D Warping method and Block matching A project Report for EE 398A Anand Kamat Tarcar Electrical Engineering Stanford University, CA (anandkt@stanford.edu)

More information

FACE RECOGNITION USING INDEPENDENT COMPONENT

FACE RECOGNITION USING INDEPENDENT COMPONENT Chapter 5 FACE RECOGNITION USING INDEPENDENT COMPONENT ANALYSIS OF GABORJET (GABORJET-ICA) 5.1 INTRODUCTION PCA is probably the most widely used subspace projection technique for face recognition. A major

More information

Optimizing the Deblocking Algorithm for. H.264 Decoder Implementation

Optimizing the Deblocking Algorithm for. H.264 Decoder Implementation Optimizing the Deblocking Algorithm for H.264 Decoder Implementation Ken Kin-Hung Lam Abstract In the emerging H.264 video coding standard, a deblocking/loop filter is required for improving the visual

More information

CSEP 521 Applied Algorithms Spring Lossy Image Compression

CSEP 521 Applied Algorithms Spring Lossy Image Compression CSEP 521 Applied Algorithms Spring 2005 Lossy Image Compression Lossy Image Compression Methods Scalar quantization (SQ). Vector quantization (VQ). DCT Compression JPEG Wavelet Compression SPIHT UWIC (University

More information

Detecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference

Detecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference Detecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference Minh Dao 1, Xiang Xiang 1, Bulent Ayhan 2, Chiman Kwan 2, Trac D. Tran 1 Johns Hopkins Univeristy, 3400

More information

CHAPTER 6. 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform. 6.3 Wavelet Transform based compression technique 106

CHAPTER 6. 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform. 6.3 Wavelet Transform based compression technique 106 CHAPTER 6 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform Page No 6.1 Introduction 103 6.2 Compression Techniques 104 103 6.2.1 Lossless compression 105 6.2.2 Lossy compression

More information

Problem Set 4. Assigned: March 23, 2006 Due: April 17, (6.882) Belief Propagation for Segmentation

Problem Set 4. Assigned: March 23, 2006 Due: April 17, (6.882) Belief Propagation for Segmentation 6.098/6.882 Computational Photography 1 Problem Set 4 Assigned: March 23, 2006 Due: April 17, 2006 Problem 1 (6.882) Belief Propagation for Segmentation In this problem you will set-up a Markov Random

More information

Structurally Random Matrices

Structurally Random Matrices Fast Compressive Sampling Using Structurally Random Matrices Presented by: Thong Do (thongdo@jhu.edu) The Johns Hopkins University A joint work with Prof. Trac Tran, The Johns Hopkins University it Dr.

More information

Redundant Data Elimination for Image Compression and Internet Transmission using MATLAB

Redundant Data Elimination for Image Compression and Internet Transmission using MATLAB Redundant Data Elimination for Image Compression and Internet Transmission using MATLAB R. Challoo, I.P. Thota, and L. Challoo Texas A&M University-Kingsville Kingsville, Texas 78363-8202, U.S.A. ABSTRACT

More information

CSE237A: Final Project Mid-Report Image Enhancement for portable platforms Rohit Sunkam Ramanujam Soha Dalal

CSE237A: Final Project Mid-Report Image Enhancement for portable platforms Rohit Sunkam Ramanujam Soha Dalal CSE237A: Final Project Mid-Report Image Enhancement for portable platforms Rohit Sunkam Ramanujam (rsunkamr@ucsd.edu) Soha Dalal (sdalal@ucsd.edu) Project Goal The goal of this project is to incorporate

More information

2D and 3D Far-Field Radiation Patterns Reconstruction Based on Compressive Sensing

2D and 3D Far-Field Radiation Patterns Reconstruction Based on Compressive Sensing Progress In Electromagnetics Research M, Vol. 46, 47 56, 206 2D and 3D Far-Field Radiation Patterns Reconstruction Based on Compressive Sensing Berenice Verdin * and Patrick Debroux Abstract The measurement

More information

CHAPTER 6 A SECURE FAST 2D-DISCRETE FRACTIONAL FOURIER TRANSFORM BASED MEDICAL IMAGE COMPRESSION USING SPIHT ALGORITHM WITH HUFFMAN ENCODER

CHAPTER 6 A SECURE FAST 2D-DISCRETE FRACTIONAL FOURIER TRANSFORM BASED MEDICAL IMAGE COMPRESSION USING SPIHT ALGORITHM WITH HUFFMAN ENCODER 115 CHAPTER 6 A SECURE FAST 2D-DISCRETE FRACTIONAL FOURIER TRANSFORM BASED MEDICAL IMAGE COMPRESSION USING SPIHT ALGORITHM WITH HUFFMAN ENCODER 6.1. INTRODUCTION Various transforms like DCT, DFT used to

More information

Face identification system using MATLAB

Face identification system using MATLAB Project Report ECE 09.341 Section #3: Final Project 15 December 2017 Face identification system using MATLAB Stephen Glass Electrical & Computer Engineering, Rowan University Table of Contents Introduction

More information

CHAPTER 7. Page No. 7 Conclusions and Future Scope Conclusions Future Scope 123

CHAPTER 7. Page No. 7 Conclusions and Future Scope Conclusions Future Scope 123 CHAPTER 7 Page No 7 Conclusions and Future Scope 121 7.1 Conclusions 121 7.2 Future Scope 123 121 CHAPTER 7 CONCLUSIONS AND FUTURE SCOPE 7.1 CONCLUSIONS In this thesis, the investigator discussed mainly

More information

Automatic Logo Detection and Removal

Automatic Logo Detection and Removal Automatic Logo Detection and Removal Miriam Cha, Pooya Khorrami and Matthew Wagner Electrical and Computer Engineering Carnegie Mellon University Pittsburgh, PA 15213 {mcha,pkhorrami,mwagner}@ece.cmu.edu

More information

ECE 417 Guest Lecture Video Compression in MPEG-1/2/4. Min-Hsuan Tsai Apr 02, 2013

ECE 417 Guest Lecture Video Compression in MPEG-1/2/4. Min-Hsuan Tsai Apr 02, 2013 ECE 417 Guest Lecture Video Compression in MPEG-1/2/4 Min-Hsuan Tsai Apr 2, 213 What is MPEG and its standards MPEG stands for Moving Picture Expert Group Develop standards for video/audio compression

More information

Image processing in frequency Domain

Image processing in frequency Domain Image processing in frequency Domain Introduction to Frequency Domain Deal with images in: -Spatial domain -Frequency domain Frequency Domain In the frequency or Fourier domain, the value and location

More information

A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm

A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm International Journal of Engineering Research and General Science Volume 3, Issue 4, July-August, 15 ISSN 91-2730 A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm

More information

Schedule for Rest of Semester

Schedule for Rest of Semester Schedule for Rest of Semester Date Lecture Topic 11/20 24 Texture 11/27 25 Review of Statistics & Linear Algebra, Eigenvectors 11/29 26 Eigenvector expansions, Pattern Recognition 12/4 27 Cameras & calibration

More information

A Very Low Bit Rate Image Compressor Using Transformed Classified Vector Quantization

A Very Low Bit Rate Image Compressor Using Transformed Classified Vector Quantization Informatica 29 (2005) 335 341 335 A Very Low Bit Rate Image Compressor Using Transformed Classified Vector Quantization Hsien-Wen Tseng Department of Information Management Chaoyang University of Technology

More information

Sparse Reconstruction / Compressive Sensing

Sparse Reconstruction / Compressive Sensing Sparse Reconstruction / Compressive Sensing Namrata Vaswani Department of Electrical and Computer Engineering Iowa State University Namrata Vaswani Sparse Reconstruction / Compressive Sensing 1/ 20 The

More information

Compression of RADARSAT Data with Block Adaptive Wavelets Abstract: 1. Introduction

Compression of RADARSAT Data with Block Adaptive Wavelets Abstract: 1. Introduction Compression of RADARSAT Data with Block Adaptive Wavelets Ian Cumming and Jing Wang Department of Electrical and Computer Engineering The University of British Columbia 2356 Main Mall, Vancouver, BC, Canada

More information

A deblocking filter with two separate modes in block-based video coding

A deblocking filter with two separate modes in block-based video coding A deblocing filter with two separate modes in bloc-based video coding Sung Deu Kim Jaeyoun Yi and Jong Beom Ra Dept. of Electrical Engineering Korea Advanced Institute of Science and Technology 7- Kusongdong

More information

Overcompressing JPEG images with Evolution Algorithms

Overcompressing JPEG images with Evolution Algorithms Author manuscript, published in "EvoIASP2007, Valencia : Spain (2007)" Overcompressing JPEG images with Evolution Algorithms Jacques Lévy Véhel 1, Franklin Mendivil 2 and Evelyne Lutton 1 1 Inria, Complex

More information

Image Compression using Discrete Wavelet Transform Preston Dye ME 535 6/2/18

Image Compression using Discrete Wavelet Transform Preston Dye ME 535 6/2/18 Image Compression using Discrete Wavelet Transform Preston Dye ME 535 6/2/18 Introduction Social media is an essential part of an American lifestyle. Latest polls show that roughly 80 percent of the US

More information

CoE4TN3 Image Processing. Wavelet and Multiresolution Processing. Image Pyramids. Image pyramids. Introduction. Multiresolution.

CoE4TN3 Image Processing. Wavelet and Multiresolution Processing. Image Pyramids. Image pyramids. Introduction. Multiresolution. CoE4TN3 Image Processing Image Pyramids Wavelet and Multiresolution Processing 4 Introduction Unlie Fourier transform, whose basis functions are sinusoids, wavelet transforms are based on small waves,

More information

DEEP LEARNING OF COMPRESSED SENSING OPERATORS WITH STRUCTURAL SIMILARITY (SSIM) LOSS

DEEP LEARNING OF COMPRESSED SENSING OPERATORS WITH STRUCTURAL SIMILARITY (SSIM) LOSS DEEP LEARNING OF COMPRESSED SENSING OPERATORS WITH STRUCTURAL SIMILARITY (SSIM) LOSS ABSTRACT Compressed sensing (CS) is a signal processing framework for efficiently reconstructing a signal from a small

More information

Comparative Study of Partial Closed-loop Versus Open-loop Motion Estimation for Coding of HDTV

Comparative Study of Partial Closed-loop Versus Open-loop Motion Estimation for Coding of HDTV Comparative Study of Partial Closed-loop Versus Open-loop Motion Estimation for Coding of HDTV Jeffrey S. McVeigh 1 and Siu-Wai Wu 2 1 Carnegie Mellon University Department of Electrical and Computer Engineering

More information

BLIND MEASUREMENT OF BLOCKING ARTIFACTS IN IMAGES Zhou Wang, Alan C. Bovik, and Brian L. Evans. (

BLIND MEASUREMENT OF BLOCKING ARTIFACTS IN IMAGES Zhou Wang, Alan C. Bovik, and Brian L. Evans. ( BLIND MEASUREMENT OF BLOCKING ARTIFACTS IN IMAGES Zhou Wang, Alan C. Bovik, and Brian L. Evans Laboratory for Image and Video Engineering, The University of Texas at Austin (Email: zwang@ece.utexas.edu)

More information

Image Compression Algorithm and JPEG Standard

Image Compression Algorithm and JPEG Standard International Journal of Scientific and Research Publications, Volume 7, Issue 12, December 2017 150 Image Compression Algorithm and JPEG Standard Suman Kunwar sumn2u@gmail.com Summary. The interest in

More information

Copyright Detection System for Videos Using TIRI-DCT Algorithm

Copyright Detection System for Videos Using TIRI-DCT Algorithm Research Journal of Applied Sciences, Engineering and Technology 4(24): 5391-5396, 2012 ISSN: 2040-7467 Maxwell Scientific Organization, 2012 Submitted: March 18, 2012 Accepted: June 15, 2012 Published:

More information

Two Dimensional Microwave Imaging Using a Divide and Unite Algorithm

Two Dimensional Microwave Imaging Using a Divide and Unite Algorithm Two Dimensional Microwave Imaging Using a Divide and Unite Algorithm Disha Shur 1, K. Yaswanth 2, and Uday K. Khankhoje 2 1 Indian Institute of Engineering Science and Technology, Shibpur, India 2 Indian

More information

IN THIS PAPER we consider the solution of ill-posed

IN THIS PAPER we consider the solution of ill-posed IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 6, NO. 3, MARCH 1997 463 Tomographic Reconstruction and Estimation Based on Multiscale Natural-Pixel Bases Mickey Bhatia, William C. Karl, Member, IEEE, and

More information

Image Segmentation Techniques for Object-Based Coding

Image Segmentation Techniques for Object-Based Coding Image Techniques for Object-Based Coding Junaid Ahmed, Joseph Bosworth, and Scott T. Acton The Oklahoma Imaging Laboratory School of Electrical and Computer Engineering Oklahoma State University {ajunaid,bosworj,sacton}@okstate.edu

More information

SD 575 Image Processing

SD 575 Image Processing SD 575 Image Processing Fall 2014 Lab 5: Image Compression and Segmentation Due Thursday November 27 at 10:30am (in class/email) Note: All lab reports will be submitted as hard or soft copies to Robert

More information

G009 Scale and Direction-guided Interpolation of Aliased Seismic Data in the Curvelet Domain

G009 Scale and Direction-guided Interpolation of Aliased Seismic Data in the Curvelet Domain G009 Scale and Direction-guided Interpolation of Aliased Seismic Data in the Curvelet Domain M. Naghizadeh* (University of Alberta) & M. Sacchi (University of Alberta) SUMMARY We propose a robust interpolation

More information

Tomographic reconstruction: the challenge of dark information. S. Roux

Tomographic reconstruction: the challenge of dark information. S. Roux Tomographic reconstruction: the challenge of dark information S. Roux Meeting on Tomography and Applications, Politecnico di Milano, 20-22 April, 2015 Tomography A mature technique, providing an outstanding

More information

Digital Image Processing Lectures 11 & 12

Digital Image Processing Lectures 11 & 12 Lectures 11 & 12, Professor Department of Electrical and Computer Engineering Colorado State University Spring 2015 Matrix Representation of DFT Consider an -point finite-extent sequence x(n), n [0, 1]

More information

A Relationship between the Robust Statistics Theory and Sparse Compressive Sensed Signals Reconstruction

A Relationship between the Robust Statistics Theory and Sparse Compressive Sensed Signals Reconstruction THIS PAPER IS A POSTPRINT OF A PAPER SUBMITTED TO AND ACCEPTED FOR PUBLICATION IN IET SIGNAL PROCESSING AND IS SUBJECT TO INSTITUTION OF ENGINEERING AND TECHNOLOGY COPYRIGHT. THE COPY OF RECORD IS AVAILABLE

More information

AUDIOVISUAL COMMUNICATION

AUDIOVISUAL COMMUNICATION AUDIOVISUAL COMMUNICATION Laboratory Session: Discrete Cosine Transform Fernando Pereira The objective of this lab session about the Discrete Cosine Transform (DCT) is to get the students familiar with

More information

Bilevel Sparse Coding

Bilevel Sparse Coding Adobe Research 345 Park Ave, San Jose, CA Mar 15, 2013 Outline 1 2 The learning model The learning algorithm 3 4 Sparse Modeling Many types of sensory data, e.g., images and audio, are in high-dimensional

More information

A Novel Approach for Deblocking JPEG Images

A Novel Approach for Deblocking JPEG Images A Novel Approach for Deblocking JPEG Images Multidimensional DSP Final Report Eric Heinen 5/9/08 Abstract This paper presents a novel approach for deblocking JPEG images. First, original-image pixels are

More information

Limited view X-ray CT for dimensional analysis

Limited view X-ray CT for dimensional analysis Limited view X-ray CT for dimensional analysis G. A. JONES ( GLENN.JONES@IMPERIAL.AC.UK ) P. HUTHWAITE ( P.HUTHWAITE@IMPERIAL.AC.UK ) NON-DESTRUCTIVE EVALUATION GROUP 1 Outline of talk Industrial X-ray

More information

Computational Photography Denoising

Computational Photography Denoising Computational Photography Denoising Jongmin Baek CS 478 Lecture Feb 13, 2012 Announcements Term project proposal Due Wednesday Proposal presentation Next Wednesday Send us your slides (Keynote, PowerPoint,

More information

The interpolation of a 3-D data set by a pair of 2-D filters

The interpolation of a 3-D data set by a pair of 2-D filters Stanford Exploration Project, Report 84, May 9, 2001, pages 1 275 The interpolation of a 3-D data set by a pair of 2-D filters Matthias Schwab and Jon F. Claerbout 1 ABSTRACT Seismic 3-D field data is

More information

Compressive Sensing Based Image Reconstruction using Wavelet Transform

Compressive Sensing Based Image Reconstruction using Wavelet Transform Compressive Sensing Based Image Reconstruction using Wavelet Transform Sherin C Abraham #1, Ketki Pathak *2, Jigna J Patel #3 # Electronics & Communication department, Gujarat Technological University

More information

Context based optimal shape coding

Context based optimal shape coding IEEE Signal Processing Society 1999 Workshop on Multimedia Signal Processing September 13-15, 1999, Copenhagen, Denmark Electronic Proceedings 1999 IEEE Context based optimal shape coding Gerry Melnikov,

More information

Image Reconstruction from Multiple Sparse Representations

Image Reconstruction from Multiple Sparse Representations Image Reconstruction from Multiple Sparse Representations Robert Crandall Advisor: Professor Ali Bilgin University of Arizona Program in Applied Mathematics 617 N. Santa Rita, Tucson, AZ 85719 Abstract

More information

CHAPTER 3 DIFFERENT DOMAINS OF WATERMARKING. domain. In spatial domain the watermark bits directly added to the pixels of the cover

CHAPTER 3 DIFFERENT DOMAINS OF WATERMARKING. domain. In spatial domain the watermark bits directly added to the pixels of the cover 38 CHAPTER 3 DIFFERENT DOMAINS OF WATERMARKING Digital image watermarking can be done in both spatial domain and transform domain. In spatial domain the watermark bits directly added to the pixels of the

More information

Deep Learning of Compressed Sensing Operators with Structural Similarity Loss

Deep Learning of Compressed Sensing Operators with Structural Similarity Loss Deep Learning of Compressed Sensing Operators with Structural Similarity Loss Y. Zur and A. Adler Abstract Compressed sensing CS is a signal processing framework for efficiently reconstructing a signal

More information

Rate Distortion Optimization in Video Compression

Rate Distortion Optimization in Video Compression Rate Distortion Optimization in Video Compression Xue Tu Dept. of Electrical and Computer Engineering State University of New York at Stony Brook 1. Introduction From Shannon s classic rate distortion

More information

Adaptive Quantization for Video Compression in Frequency Domain

Adaptive Quantization for Video Compression in Frequency Domain Adaptive Quantization for Video Compression in Frequency Domain *Aree A. Mohammed and **Alan A. Abdulla * Computer Science Department ** Mathematic Department University of Sulaimani P.O.Box: 334 Sulaimani

More information

Steganography: Hiding Data In Plain Sight. Ryan Gibson

Steganography: Hiding Data In Plain Sight. Ryan Gibson Steganography: Hiding Data In Plain Sight Ryan Gibson What Is Steganography? The practice of concealing messages or information within other nonsecret text or data. Comes from the Greek words steganos

More information

Optimal Sampling Geometries for TV-Norm Reconstruction of fmri Data

Optimal Sampling Geometries for TV-Norm Reconstruction of fmri Data Optimal Sampling Geometries for TV-Norm Reconstruction of fmri Data Oliver M. Jeromin, Student Member, IEEE, Vince D. Calhoun, Senior Member, IEEE, and Marios S. Pattichis, Senior Member, IEEE Abstract

More information

SUMMARY. In combination with compressive sensing, a successful reconstruction

SUMMARY. In combination with compressive sensing, a successful reconstruction Higher dimensional blue-noise sampling schemes for curvelet-based seismic data recovery Gang Tang, Tsinghua University & UBC-Seismic Laboratory for Imaging and Modeling (UBC-SLIM), Reza Shahidi, UBC-SLIM,

More information

ECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis

ECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis ECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis Yuejie Chi Departments of ECE and BMI The Ohio State University September 24, 2015 Time, location, and office hours Time: Tue/Thu

More information

Artifacts and Textured Region Detection

Artifacts and Textured Region Detection Artifacts and Textured Region Detection 1 Vishal Bangard ECE 738 - Spring 2003 I. INTRODUCTION A lot of transformations, when applied to images, lead to the development of various artifacts in them. In

More information

Lecture 5: Compression I. This Week s Schedule

Lecture 5: Compression I. This Week s Schedule Lecture 5: Compression I Reading: book chapter 6, section 3 &5 chapter 7, section 1, 2, 3, 4, 8 Today: This Week s Schedule The concept behind compression Rate distortion theory Image compression via DCT

More information

Detecting Salient Contours Using Orientation Energy Distribution. Part I: Thresholding Based on. Response Distribution

Detecting Salient Contours Using Orientation Energy Distribution. Part I: Thresholding Based on. Response Distribution Detecting Salient Contours Using Orientation Energy Distribution The Problem: How Does the Visual System Detect Salient Contours? CPSC 636 Slide12, Spring 212 Yoonsuck Choe Co-work with S. Sarma and H.-C.

More information

ECE 533 Digital Image Processing- Fall Group Project Embedded Image coding using zero-trees of Wavelet Transform

ECE 533 Digital Image Processing- Fall Group Project Embedded Image coding using zero-trees of Wavelet Transform ECE 533 Digital Image Processing- Fall 2003 Group Project Embedded Image coding using zero-trees of Wavelet Transform Harish Rajagopal Brett Buehl 12/11/03 Contributions Tasks Harish Rajagopal (%) Brett

More information

Image Enhancement Techniques for Fingerprint Identification

Image Enhancement Techniques for Fingerprint Identification March 2013 1 Image Enhancement Techniques for Fingerprint Identification Pankaj Deshmukh, Siraj Pathan, Riyaz Pathan Abstract The aim of this paper is to propose a new method in fingerprint enhancement

More information

Illustration of SIR for CETB

Illustration of SIR for CETB Illustration of SIR for CETB David Long, BYU Version 1.1 3 Apr 2015 (last revised 11 Jan 2016) Abstract This brief report illustrates how the SIR algorithm works using actual SSM/I data. The results are

More information

The Benefit of Tree Sparsity in Accelerated MRI

The Benefit of Tree Sparsity in Accelerated MRI The Benefit of Tree Sparsity in Accelerated MRI Chen Chen and Junzhou Huang Department of Computer Science and Engineering, The University of Texas at Arlington, TX, USA 76019 Abstract. The wavelet coefficients

More information

Final Review. Image Processing CSE 166 Lecture 18

Final Review. Image Processing CSE 166 Lecture 18 Final Review Image Processing CSE 166 Lecture 18 Topics covered Basis vectors Matrix based transforms Wavelet transform Image compression Image watermarking Morphological image processing Segmentation

More information

Measurements and Bits: Compressed Sensing meets Information Theory. Dror Baron ECE Department Rice University dsp.rice.edu/cs

Measurements and Bits: Compressed Sensing meets Information Theory. Dror Baron ECE Department Rice University dsp.rice.edu/cs Measurements and Bits: Compressed Sensing meets Information Theory Dror Baron ECE Department Rice University dsp.rice.edu/cs Sensing by Sampling Sample data at Nyquist rate Compress data using model (e.g.,

More information

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) References: [1] http://homepages.inf.ed.ac.uk/rbf/hipr2/index.htm [2] http://www.cs.wisc.edu/~dyer/cs540/notes/vision.html

More information

Separate CT-Reconstruction for Orientation and Position Adaptive Wavelet Denoising

Separate CT-Reconstruction for Orientation and Position Adaptive Wavelet Denoising Separate CT-Reconstruction for Orientation and Position Adaptive Wavelet Denoising Anja Borsdorf 1,, Rainer Raupach, Joachim Hornegger 1 1 Chair for Pattern Recognition, Friedrich-Alexander-University

More information

ADVANCED RECONSTRUCTION TECHNIQUES IN MRI - 2

ADVANCED RECONSTRUCTION TECHNIQUES IN MRI - 2 ADVANCED RECONSTRUCTION TECHNIQUES IN MRI - 2 Presented by Rahil Kothari PARTIAL FOURIER RECONSTRUCTION WHAT IS PARTIAL FOURIER RECONSTRUCTION? In Partial Fourier Reconstruction data is not collected symmetrically

More information

Implementation and analysis of Directional DCT in H.264

Implementation and analysis of Directional DCT in H.264 Implementation and analysis of Directional DCT in H.264 EE 5359 Multimedia Processing Guidance: Dr K R Rao Priyadarshini Anjanappa UTA ID: 1000730236 priyadarshini.anjanappa@mavs.uta.edu Introduction A

More information

Meshless physical simulation of semiconductor devices using a wavelet-based nodes generator

Meshless physical simulation of semiconductor devices using a wavelet-based nodes generator Meshless physical simulation of semiconductor devices using a wavelet-based nodes generator Rashid Mirzavand 1, Abdolali Abdipour 1a), Gholamreza Moradi 1, and Masoud Movahhedi 2 1 Microwave/mm-wave &

More information

Non-Parametric Bayesian Dictionary Learning for Sparse Image Representations

Non-Parametric Bayesian Dictionary Learning for Sparse Image Representations Non-Parametric Bayesian Dictionary Learning for Sparse Image Representations Mingyuan Zhou, Haojun Chen, John Paisley, Lu Ren, 1 Guillermo Sapiro and Lawrence Carin Department of Electrical and Computer

More information

CHAPTER 3 WAVELET DECOMPOSITION USING HAAR WAVELET

CHAPTER 3 WAVELET DECOMPOSITION USING HAAR WAVELET 69 CHAPTER 3 WAVELET DECOMPOSITION USING HAAR WAVELET 3.1 WAVELET Wavelet as a subject is highly interdisciplinary and it draws in crucial ways on ideas from the outside world. The working of wavelet in

More information

SECURE SEMI-FRAGILE WATERMARKING FOR IMAGE AUTHENTICATION

SECURE SEMI-FRAGILE WATERMARKING FOR IMAGE AUTHENTICATION SECURE SEMI-FRAGILE WATERMARKING FOR IMAGE AUTHENTICATION Chuhong Fei a, Raymond Kwong b, and Deepa Kundur c a A.U.G. Signals Ltd., 73 Richmond St. W, Toronto, ON M4H 4E8 Canada b University of Toronto,

More information