Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/339819
Title: Design and development of joint image compression encryption framework using chaotic compressive sensing
Researcher: Ponuma, R
Guide(s): Amutha, R
Keywords: Image compression
Pervasive computing
Compressive sensing
University: Anna University
Completed Date: 2021
Abstract: The proliferation of smart devices and pervasive computing has resulted in the increased use of multimedia data. The deluge of multimedia data leads to a drastic dearth of communication bandwidth, storage resources and the need for secure data transmission. The aforementioned requirements have resulted in the emergence of joint compression-encryption framework for multimedia communication. The objective of these frameworks is to reduce computation complexity, enhance security and speed in communication. Compressive Sensing helps simultaneous compression and encryption of a sparse signal or a compressible signal. A low complex sampling process, which is computationally secure, samples the signal at a rate lesser than the traditional Nyquist criterion. The sampling or the measurement matrix compressively samples the signal and the matrix acts as the secret key of the encryption process. Traditionally random measurement matrices are used as the sampling matrix. However, random matrices are prone to security attacks, the overhead to securely store and transmit these matrices are high. In this research work, chaotic compressive sensing based joint compressionencryption frameworks for images are proposed. Chaotic systems have properties like high sensitivity, long-term unpredictability, ergodicity and random-like behavior. The sensitivity to initial conditions and mixing property of chaotic systems are mapped to confusion and diffusion operations. Also, the chaotic measurement matrix satisfies the restricted isometry property with high probability. The necessary and sufficient condition for perfect recovery in compressive sensing applications is that the signal must be sparse, and the sampling matrix must satisfy restricted isometry property. The sparse representation of the image can be obtained using a fixed or learned basis A learned dictionary and compressive sensing based image compression-encryption is proposed. Sparse coding is used for finding the sparse representation of the images. A Gaussian measurement mat
Pagination: xxiii,146 p.
URI: http://hdl.handle.net/10603/339819
Appears in Departments:Faculty of Information and Communication Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File180.22 kBAdobe PDFView/Open
02_certificates.pdf664.53 kBAdobe PDFView/Open
03_vivaproceedings.pdf1.02 MBAdobe PDFView/Open
04_bonafidecertificate.pdf700.15 kBAdobe PDFView/Open
05_abstracts.pdf122.06 kBAdobe PDFView/Open
06_acknowledgements.pdf351.35 kBAdobe PDFView/Open
07_contents.pdf189.79 kBAdobe PDFView/Open
08_listoftables.pdf124.44 kBAdobe PDFView/Open
09_listoffigures.pdf215.51 kBAdobe PDFView/Open
10_listofabbreviations.pdf253.71 kBAdobe PDFView/Open
11_chapter1.pdf244.07 kBAdobe PDFView/Open
12_chapter2.pdf261.99 kBAdobe PDFView/Open
13_chapter3.pdf1.11 MBAdobe PDFView/Open
14_chapter4.pdf1.74 MBAdobe PDFView/Open
15_chapter5.pdf1.61 MBAdobe PDFView/Open
16_chapter6.pdf1.31 MBAdobe PDFView/Open
17_conclusion.pdf283.75 kBAdobe PDFView/Open
18_references.pdf267.04 kBAdobe PDFView/Open
19_listofpublications.pdf144.48 kBAdobe PDFView/Open
80_recommendation.pdf200.38 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: