Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/183481
Title: Studies on image encryption compression and watermarking using multiple parameter discrete fractional fourier transform
Researcher: Sharma, Deepak
Guide(s): Saxena, Rajiv and Singh,Narendra
Keywords: Fractional Fourier Transform
Image Encryption
Image Watermarking
University: Jaypee University of Engineering and Technology, Guna
Completed Date: 19/11/2017
Abstract: In image processing the transforms plays a vital role in wide range of applications such as image analysis encryption compression and watermarking etc Earlier in image processing, several transforms have been used like Discrete Cosine Transform Discrete Wavelet Transform Fourier Transforms Hotelling Transform etc Among all of them Fourier Transform is an important image processing tool which is used to decompose an image into its sine and cosine components Later it has been recognized that the integral transforms as FT etc are replaced by their respective fractional counter parts as FRFT et. This further enhances an additional degree of freedom incorporated by fractional order parameter In every area where FT and frequency domain concept are used the scope exists for potential generalization and implementation using FRFT and its generalized version newlineWith the advent of computers and enhanced computational capabilities the Discrete Fourier Transform came into existence in evaluation of FT for real time processing Further for efficient implementation of DFT is done with the help of Fast Fourier Transform algorithms To Analyze and compute signal in digital domain the Discrete Fractional Fourier Transform came into the existence with several definitions as adopted by various researchers The DFRFT is a generalization of the discrete Fourier transform with one additional order parameter But if the DFRFT extended to N order parameters where N is the number of the input N data points, this newly derived DFRFT is known as multipleparameter discrete fractional Fourier transform It also shows to have all of the desired properties for fractional transforms The MPDFRFT will be converted to the DFRFT when all of its order parameters are the same newline newline
Pagination: xiv,202
URI: http://hdl.handle.net/10603/183481
Appears in Departments:Department of Electronics and Communication

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File65.75 kBAdobe PDFView/Open
02_certificate.pdf16.06 kBAdobe PDFView/Open
03_synopsis.pdf17.63 kBAdobe PDFView/Open
04_declaration.pdf18.62 kBAdobe PDFView/Open
05_acknowledgement.pdf12.2 kBAdobe PDFView/Open
06_content.pdf22.14 kBAdobe PDFView/Open
07_list of tables.pdf11.36 kBAdobe PDFView/Open
08_list_of_figures.pdf56.15 kBAdobe PDFView/Open
09_acronyms and abbreviations.pdf13.14 kBAdobe PDFView/Open
10_glossory of symbols.pdf83.21 kBAdobe PDFView/Open
11-chapter-1.pdf183.83 kBAdobe PDFView/Open
12-chapter-2.pdf527.03 kBAdobe PDFView/Open
13_chapter-3.pdf1.13 MBAdobe PDFView/Open
14_chapter-4.pdf2.77 MBAdobe PDFView/Open
15-chapter-5.pdf4.74 MBAdobe PDFView/Open
16_chapter-6.pdf2.17 MBAdobe PDFView/Open
17-chapter-7.pdf47 kBAdobe PDFView/Open
18_ conclusion.pdf53.07 kBAdobe PDFView/Open
19-references.pdf106.29 kBAdobe PDFView/Open
20_list of publications.pdf16.82 kBAdobe PDFView/Open


Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.