This paper presents the design and optimization of image compression and ciphering depend on optimized embedded zero tree of wavelet (EZW) techniques. Nowadays, the compression and ciphering of image have become particularly important in a protected image storage and communication. The challenge is put in application for both compression and encryption where the parameters of images such as quality and size are critical in secure image transmission. A new technique for secure image storage and transmission is proposed in this work. The compression is achieved by remodel the EZW scheme combine with discrete cosine transform (DCT). Encrypted the XOR ten bits by initial threshold of EZW with random bits produced from linear-feedback shift register (LFSR). The obtained result shows that the suggested techniques provide acceptable compression ratio, reduced the computational time for both compression and encryption, immunity against the statistical and the frequency attacks.
Uncompressed Image Steganography using BPCS: Survey and AnalysisIOSR Journals
Abstract: Steganography is the art and science of hide secret information in some carrier data without leaving
any apparent evidence of data alternation. In the past, people use hidden tattoos, invisible ink or punching on
papers to convey stenographic data. Now, information is first hide in digital image, text, video and audio. This
paper discusses existing BPCS (Bit Plane Complexity Segmentation) steganography techniques and presences
of some modification. BPCS technique makes use of the characteristics of the human visible system. BPCS
scheme allows for large capacity of embedded secret data and is highly customized. This algorithm offers higher
hiding capacity due to that it exploits the variance of complex regions in each bit plane. In contrast, the BPCS
algorithm provided a much more effective method for obtaining a 50% capacity since visual attacks did not
suffice for detection.
Keywords: BPCS, Data security, Information hiding, Steganography, Stego image
Secured Data Transmission Using Video Steganographic SchemeIJERA Editor
Steganography is the art of hiding information in ways that avert the revealing of hiding messages. Video Steganography is focused on spatial and transform domain. Spatial domain algorithm directly embedded information in the cover image with no visual changes. This kind of algorithms has the advantage in Steganography capacity, but the disadvantage is weak robustness. Transform domain algorithm is embedding the secret information in the transform space. This kind of algorithms has the advantage of good stability, but the disadvantage of small capacity. These kinds of algorithms are vulnerable to steganalysis. This paper proposes a new Compressed Video Steganographic scheme. The data is hidden in the horizontal and the vertical components of the motion vectors. The PSNR value is calculated so that the quality of the video after the data hiding is evaluated.
Design and Implementation of Lifting Based Wavelet and Adaptive LSB Steganogr...Dr. Amarjeet Singh
Image steganography is an art of hiding images
secretly within another image. There are several ways of
performing image steganography; one among them is the
spatial approach. The most popular spatial domain approach
of image steganography is the Least Significant Bit (LSB)
method, which hides the secret image pixel information in the
LSB of the cover image pixel information. In this paper a
LSB based steganography approach is used to design
hardware architecture for the Image steganography. The
Discrete Wavelet Transform (DWT) is used here to transform
the cover image into higher and lower wavelet coefficients
and use these coefficients in hiding the secret image. the
design also includes encryption of secret image data, to
provide a higher level of security to the secret image. The
steganography system involving the stegno module and a
decode module is designed here. The design was simulated,
synthesized and implemented on Artix -7 FPGA. The
operation hiding and retrieving images was successfully
verified through simulations.
Imperceptible and secure image watermarking using DCT and random spread techn...TELKOMNIKA JOURNAL
Watermarking is a copyright protection technique, while cryptography is a message encoding
technique. Imperceptibility, robustness, and safety are aspects that are often investigated in watermarking.
Cryptography can be implemented to increase watermark security. Beaufort cipher is the algorithm
proposed in this research to encrypt watermark. The new idea proposed in this research is the utilization of
Beaufort key for watermark encryption process as well as for spread watermark when inserted as PN
Sequence substitute with the aim to improve imperceptibility and security aspects. Where PN Sequence is
widely used in spread spectrum watermarking technique. Based on the experimental results and testing of
the proposed method proved that imperceptibility and watermark security are increased. Improved
imperceptibility measured by PSNR rose by about 5dB and so did the MSE score better. Robustness
aspect is also maintained which has been proven by the excellent value of NCC.
IRJET- An Overview of Hiding Information in H.264/Avc Compressed VideoIRJET Journal
This document provides an overview of hiding information in H.264/AVC compressed video. It discusses different information hiding techniques such as bit plane replacement, spread spectrum, histogram manipulation and matrix encryption. It identifies locations within the H.264 video compression process where information can be hidden, such as during prediction, transformation, quantization and entropy coding. It reviews related information hiding strategies for each location and compares strategies based on payload, overhead, video quality and complexity. The document aims to provide a better understanding of information hiding in compressed video and identify new opportunities.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Design of an adaptive JPEG Steganalysis with UED IJCERT JOURNAL
Steganography is the art and science of writing hidden messages in such a way that no one apart from the sender and intended recipient suspects the existence of the message a form of security through obscurity. The internet as a whole does not use secure links, thus information in transit may be vulnerable to interception as well. The important of reducing a chance of the information being detected during the transmission is being an issue now days. In this paper, we proposed a class of new distortion functions known as uniform embedding distortion function (UED) is presented. By incorporating the syndrome trellis coding, the best code word with undetectable data hiding is achieved. Due to hiding more amounts of data into the intersected area, embedding capacity is increased. Our aim is to hide the secret information behind the image file. Steganography hides the secret message so that intruder’s can’t detect the communication. When hiding data into the intersected area, thus provides a higher level of security with more efficient data mean square error is reduced and embedding capacity is increased.
This document summarizes a research paper that proposes a new data hiding technique for hiding data in compressed video files. The technique embeds data by modifying the least significant bits of motion vectors used during video compression. Motion vectors associated with higher prediction errors are selected as candidate motion vectors to embed data. An adaptive threshold is used for each frame to minimize prediction error while maximizing data payload. The data can be extracted directly from the encoded video stream without the original video. The technique was tested on standard video sequences and was found to introduce minimal distortion and overhead.
Uncompressed Image Steganography using BPCS: Survey and AnalysisIOSR Journals
Abstract: Steganography is the art and science of hide secret information in some carrier data without leaving
any apparent evidence of data alternation. In the past, people use hidden tattoos, invisible ink or punching on
papers to convey stenographic data. Now, information is first hide in digital image, text, video and audio. This
paper discusses existing BPCS (Bit Plane Complexity Segmentation) steganography techniques and presences
of some modification. BPCS technique makes use of the characteristics of the human visible system. BPCS
scheme allows for large capacity of embedded secret data and is highly customized. This algorithm offers higher
hiding capacity due to that it exploits the variance of complex regions in each bit plane. In contrast, the BPCS
algorithm provided a much more effective method for obtaining a 50% capacity since visual attacks did not
suffice for detection.
Keywords: BPCS, Data security, Information hiding, Steganography, Stego image
Secured Data Transmission Using Video Steganographic SchemeIJERA Editor
Steganography is the art of hiding information in ways that avert the revealing of hiding messages. Video Steganography is focused on spatial and transform domain. Spatial domain algorithm directly embedded information in the cover image with no visual changes. This kind of algorithms has the advantage in Steganography capacity, but the disadvantage is weak robustness. Transform domain algorithm is embedding the secret information in the transform space. This kind of algorithms has the advantage of good stability, but the disadvantage of small capacity. These kinds of algorithms are vulnerable to steganalysis. This paper proposes a new Compressed Video Steganographic scheme. The data is hidden in the horizontal and the vertical components of the motion vectors. The PSNR value is calculated so that the quality of the video after the data hiding is evaluated.
Design and Implementation of Lifting Based Wavelet and Adaptive LSB Steganogr...Dr. Amarjeet Singh
Image steganography is an art of hiding images
secretly within another image. There are several ways of
performing image steganography; one among them is the
spatial approach. The most popular spatial domain approach
of image steganography is the Least Significant Bit (LSB)
method, which hides the secret image pixel information in the
LSB of the cover image pixel information. In this paper a
LSB based steganography approach is used to design
hardware architecture for the Image steganography. The
Discrete Wavelet Transform (DWT) is used here to transform
the cover image into higher and lower wavelet coefficients
and use these coefficients in hiding the secret image. the
design also includes encryption of secret image data, to
provide a higher level of security to the secret image. The
steganography system involving the stegno module and a
decode module is designed here. The design was simulated,
synthesized and implemented on Artix -7 FPGA. The
operation hiding and retrieving images was successfully
verified through simulations.
Imperceptible and secure image watermarking using DCT and random spread techn...TELKOMNIKA JOURNAL
Watermarking is a copyright protection technique, while cryptography is a message encoding
technique. Imperceptibility, robustness, and safety are aspects that are often investigated in watermarking.
Cryptography can be implemented to increase watermark security. Beaufort cipher is the algorithm
proposed in this research to encrypt watermark. The new idea proposed in this research is the utilization of
Beaufort key for watermark encryption process as well as for spread watermark when inserted as PN
Sequence substitute with the aim to improve imperceptibility and security aspects. Where PN Sequence is
widely used in spread spectrum watermarking technique. Based on the experimental results and testing of
the proposed method proved that imperceptibility and watermark security are increased. Improved
imperceptibility measured by PSNR rose by about 5dB and so did the MSE score better. Robustness
aspect is also maintained which has been proven by the excellent value of NCC.
IRJET- An Overview of Hiding Information in H.264/Avc Compressed VideoIRJET Journal
This document provides an overview of hiding information in H.264/AVC compressed video. It discusses different information hiding techniques such as bit plane replacement, spread spectrum, histogram manipulation and matrix encryption. It identifies locations within the H.264 video compression process where information can be hidden, such as during prediction, transformation, quantization and entropy coding. It reviews related information hiding strategies for each location and compares strategies based on payload, overhead, video quality and complexity. The document aims to provide a better understanding of information hiding in compressed video and identify new opportunities.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Design of an adaptive JPEG Steganalysis with UED IJCERT JOURNAL
Steganography is the art and science of writing hidden messages in such a way that no one apart from the sender and intended recipient suspects the existence of the message a form of security through obscurity. The internet as a whole does not use secure links, thus information in transit may be vulnerable to interception as well. The important of reducing a chance of the information being detected during the transmission is being an issue now days. In this paper, we proposed a class of new distortion functions known as uniform embedding distortion function (UED) is presented. By incorporating the syndrome trellis coding, the best code word with undetectable data hiding is achieved. Due to hiding more amounts of data into the intersected area, embedding capacity is increased. Our aim is to hide the secret information behind the image file. Steganography hides the secret message so that intruder’s can’t detect the communication. When hiding data into the intersected area, thus provides a higher level of security with more efficient data mean square error is reduced and embedding capacity is increased.
This document summarizes a research paper that proposes a new data hiding technique for hiding data in compressed video files. The technique embeds data by modifying the least significant bits of motion vectors used during video compression. Motion vectors associated with higher prediction errors are selected as candidate motion vectors to embed data. An adaptive threshold is used for each frame to minimize prediction error while maximizing data payload. The data can be extracted directly from the encoded video stream without the original video. The technique was tested on standard video sequences and was found to introduce minimal distortion and overhead.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
A Review of Comparison Techniques of Image SteganographyIOSR Journals
This document reviews and compares three common techniques for hiding information in digital images: Least Significant Bit (LSB) steganography, Discrete Cosine Transform (DCT) steganography, and Discrete Wavelet Transform (DWT) steganography. LSB is implemented in the spatial domain by replacing the least significant bits of cover image pixels with payload bits. DCT and DWT are implemented in the frequency domain by transforming the cover image and embedding payload bits in the transformed coefficients. The document evaluates and compares the performance of these three techniques based on metrics like mean squared error, peak signal-to-noise ratio, embedding capacity, and robustness.
Hiding data in images using steganography techniques with compression algorithmsTELKOMNIKA JOURNAL
Steganography is the science and art of secret communication between two sides that attempt to hide the content of the message. It is the science of embedding information into the cover image without causing a loss in the cover image after embedding.Steganography is the art and technology of writing hidden messages in such a manner that no person, apart from the sender and supposed recipient, suspects the lifestyles of the message. It is gaining huge attention these days as it does now not attract attention to its information's existence. In this paper, a comparison of two different techniques is given. The first technique used Least Significant Bit (LSB) with no encryption and no compression. In the second technique, the secret message is encrypted first then LSB technique is applied. Moreover, Discrete Cosine Transform (DCT) is used to transform the image into the frequency domain. The LSB algorithm is implemented in spatial domain in which the payload bits are inserted into the least significant bits of cover image to develop the stego-image while DCT algorithm is implemented in frequency domain in which the stego-image is transformed from spatial domain to the frequency domain and the payload bits are inserted into the frequency components of the cover image.The performance of these two techniques is evaluated on the basis of the parameters MSE and PSNR.
1) The document discusses VLSI architecture and implementation for 3D neural network based image compression. It proposes developing new hardware architectures optimized for area, power, and speed for implementing 3D neural networks for image compression.
2) A block diagram is presented showing the overall process of image acquisition, preprocessing, compression using a 3D neural network, and encoding for transmission.
3) The proposed 3D neural network architecture uses multiple hidden layers with lower dimensions than the input and output layers to perform compression and decompression. The network is trained using backpropagation.
IRJET- A Hybrid Image and Video Compression of DCT and DWT Techniques for H.2...IRJET Journal
This document discusses a hybrid image and video compression technique using both discrete cosine transform (DCT) and discrete wavelet transform (DWT) for H.265/HEVC video compression. The proposed hybrid DWT-DCT method exploits the advantages of both techniques for improved compression performance compared to using them individually. It involves applying DWT-DCT transformations to video frames, entropy coding the compressed frames with Huffman coding, and transmitting the bitstreams to the decoder. The technique is evaluated based on compression ratio, peak signal-to-noise ratio, and mean square error.
This document proposes a video data embedding scheme that hides data in an AVI video file by replacing the least significant bits (LSBs) of pixels in the video frames. It analyzes replacing 1, 2, or 3 LSBs and calculates the peak signal-to-noise ratio and correlation between the original and embedded frames. Replacing higher numbers of LSBs (3 bits vs 1 bit) decreases correlation more, improving security but also lowering visual quality. Experimental results show 3-bit LSB substitution achieves a correlation of around 0.9968, indicating greater security than 1-bit or 2-bit substitution, though at the cost of increased distortion. The scheme could securely transmit hidden information via modified video files without
This document presents a novel approach for jointly optimizing spatial prediction and transform coding in video compression. It aims to improve performance and reduce complexity compared to existing techniques. The proposed method uses singular value decomposition (SVD) to compress images. SVD decomposes an image matrix into three matrices, allowing the image to be approximated using only a few singular values. This achieves compression by removing redundant information. The document outlines the SVD approach for image compression and measures compression performance using compression ratio and mean squared error between the original and compressed images. It then discusses trends in image and video coding, including combining natural and synthetic content. Finally, it provides a block diagram of the proposed system and compares its compression performance to existing discrete cosine transform-
Hybrid compression based stationary wavelet transformsOmar Ghazi
This document presents a hybrid compression approach for images that uses Stationary Wavelet Transforms (SWT), Back Propagation Neural Network (BPNN), and Lempel-Ziv-Welch (LZW) compression. The approach involves: 1) preprocessing the image, 2) applying SWT, 3) converting to a 1D vector using zigzag scan, and 4) hybrid compression using BPNN vector quantization and LZW lossless compression. Experimental results show the SWT with BPNN and LZW achieves the highest compression ratios but the longest processing time, while SWT with Run Length encoding has a lower ratio but shorter time. The hybrid approach combines lossy and lossless compression techniques to obtain a
On Text Realization Image SteganographyCSCJournals
In this paper the steganography strategy is going to be implemented but in a different way from a different scope since the important data will neither be hidden in an image nor transferred through the communication channel inside an image, but on the contrary, a well known image will be used that exists on both sides of the channel and a text message contains important data will be transmitted. With the suitable operations, we can re-mix and re-make the source image. MATLAB7 is the program where the algorithm implemented on it, where the algorithm shows high ability for achieving the task to different type and size of images. Perfect reconstruction was achieved on the receiving side. But the most interesting is that the algorithm that deals with secured image transmission transmits no images at all
Image Authentication Using Digital Watermarkingijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
A new partial image encryption method for document images using variance base...IJECEIAES
The proposed method partially and completely encrypts the gray scale Document images. The complete image encryption is also performed to compare the performance with the existing encryption methods. The partial encryption is carried out by segmenting the image using the Quad-tree decomposition method based on the variance of the image block. The image blocks with uniform pixel levels are considered insignificant blocks and others the significant blocks. The pixels in the significant blocks are permuted by using 1D Skew tent chaotic map. The partially encrypted image blocks are further permuted using 2D Henon map to increase the security level and fed as input to complete encryption. The complete encryption is carried out by diffusing the partially encrypted image. Two levels of diffusion are performed. The first level simply modifies the pixels in the partially encrypted image with the Bernoulli’s chaotic map. The second level establishes the interdependency between rows and columns of the first level diffused image. The experiment is conducted for both partial and complete image encryption on the Document images. The proposed scheme yields better results for both partial and complete encryption on Speed, statistical and dynamical attacks. The results ensure better security when compared to existing encryption schemes.
This document summarizes a research paper that proposes a conditional entrench spatial domain steganography technique (CESS). CESS embeds secret information in the least significant bit and most significant bit of cover images based on predefined conditions to increase security and capacity. It decomposes cover images into 8x8 blocks. The first block embeds upper and lower bound values used for payload retrieval. Each subsequent 8x8 block embeds the payload in LSBs and MSBs of pixels based on the block's mean of median values and difference between consecutive pixels. The technique is evaluated based on capacity, security and PSNR compared to existing methods.
EMPIRICAL STUDY OF ALGORITHMS AND TECHNIQUES IN VIDEO STEGANOGRAPHYJournal For Research
Steganography is the art and science of hiding the actual important information under graphics, text, cover file etc. These techniques may be applied without fear of image destruction because they are more integrated into the image. Information can be in the form of text, audio, video. The purpose of steganography is to covert communication and to hide a message from a third party or intruder. Steganography is often confused with cryptography because the two are similar in the way that both are used to protect confidential information. Though there are many types of steganography, video Steganography is more reliable due to high capacity image, more data embedment, perceptual redundancy etc. This research paper deals with various Video Steganography techniques and algorithms including Spatial Domain, Pseudorandom permutations, TPVD (Tri-way pixel value differencing), Motion Vector Technique, Video Compression, and Motion Vector Technique. The Video compression which uses modern coding techniques to reduce redundancy in video data has been also studied and analyzed. In fact, Video compression operates on square-shaped groups or blocks of neighboring pixels, often called macro blocks. These pixel groups or blocks of pixels are compared from one frame to the next and the video compression code sends only the differences within those blocks. Generally, the motion field in video compression is assumed to be translational with horizontal component and vertical component and denoted in vector form for the spatial variables in the underlying image, such as three steps search, etc. The study also discusses and focusses on the evolution of the Video Steganography techniques and algorithms over the years based on its application and subsequent merits and demerits. Further, Advanced Video Steganography Algorithm/Bit Exchange Method based on the bit shifting and XOR operation in the secret message file has been studied and implemented. The encrypted secret message is embed in the cover file in alternate byte. The bits are substituted in LSB & LSB+3 bits in the cover file. Finally, the simulation and evaluation of the above mentioned approach is performed using MATLAB tools.
This document summarizes a research paper that proposes a new technique for data embedding and extraction in high resolution AVI videos. The technique encrypts a secret message before embedding it by alternately changing the LSB and LSB+3 bits of alternate bytes in the cover video file. An index is also created for the secret information and placed in a video frame to aid extraction. This technique aims to provide higher security, capacity and robustness compared to typical data embedding methods. The paper discusses related work on digital steganography techniques and the proposed video steganography algorithm in more detail.
FPGA Based Pattern Generation and Synchonization for High Speed Structured Li...TELKOMNIKA JOURNAL
Recently, structured light 3D imaging devices have gained a keen attention due to their potential
applications to robotics, industrial manufacturing and medical imaging. Most of these applications require
high 3D precision yet high speed in image capturing for hard and/or soft real time environments. This
paper presents a method of high speed image capturing for structured light 3D imaging sensors with FPGA
based structured light pattern generation and projector-camera synchronization. Suggested setup reduces
the time for pattern projection and camera triggering to 16msec from 100msec that should be required by
conventional methods.
JOINT IMAGE WATERMARKING, COMPRESSION AND ENCRYPTION BASED ON COMPRESSED SENS...ijma
ABSTRACT
Image usage over the internet becomes more and more important each day. Over 3 billion images are shared each day over the internet which raise a concern about how to protect images copyrights? Or how to utilize image sharing experience? This paper proposes a new robust image watermarking algorithm based on compressed sensing (CS) and quantization index modulation (QIM) watermark embedding. The algorithm capitalizes on the CS to compress and encrypt images jointly with Entropy Coding, Arnold Cat Map, Pseudo-random numbers and Advanced Encryption Standard (AES). Our proposed algorithm works under the JPEG standard umbrella. Watermark embedding is done in 3 different locations inside the image using QIM. Those locations differ with each 8-by-8 image block. Choosing which combination of coefficients to be used in QIM watermark embedding depends on selecting a combination from combinations table, which is generated at the same time with projection matrices using a 10-digits Pseudorandom number secret key SK1. After quantization phase, the algorithm shuffles image blocks using Arnold’s Cat Map with a 10-digits Pseudo-random number secret key SK2, followed by a unique method for splitting every 8x8 block into two unequal parts. Part number one will act as the host for two QIM watermarks then goes through encoding phase using Run-Length Encoding (RLE) followed by Huffman Encoding, while part number two goes through sparse watermark embedding followed by a third QIM watermark embedding and compression phase using CS, then Huffman encoder is used to encode this part. The algorithm aims to combine image watermarking, compression and encryption capabilities in one algorithm while balancing how those capabilities works with each other to achieve significant improvement in terms of image watermarking, compression and encryption. 15 different images usually used in image processing benchmarking were used for testing the algorithm capabilities and experiments show that our proposed algorithm achieves robust watermarking jointly with encryption and compression under the JPEG standard framework.
PERCEPTUAL COPYRIGHT PROTECTION USING MULTIRESOLUTION WAVELET-BASED WATERMARK...gerogepatton
In this paper, an efficiently DWT-based watermarking technique is proposed to embed signatures in images to attest the owner identification and discourage the unauthorized copying. This paper deals with a fuzzy inference filter to choose the larger entropy of coefficients to embed watermarks. Unlike most previous watermarking frameworks which embedded watermarks in the larger coefficients of inner coarser subbands, the proposed technique is based on utilizing a context model and fuzzy inference filter by embedding watermarks in the larger-entropy coefficients of coarser DWT subbands. The proposed approaches allow us to embed adaptive casting degree of watermarks for transparency and robustness to the general image-processing attacks such as smoothing, sharpening, and JPEG compression. The approach has no need the original host image to extract watermarks. Our schemes have been shown to provide very good results in both image transparency and robustness.
SECURE OMP BASED PATTERN RECOGNITION THAT SUPPORTS IMAGE COMPRESSIONsipij
In this paper, we propose a secure Orthogonal Matching Pursuit (OMP) based pattern recognition scheme that well supports image compression. The secure OMP is a sparse coding algorithm that chooses atoms sequentially and calculates sparse coefficients from encrypted images. The encryption is carried out by using a random unitary transform. The proposed scheme offers two prominent features. 1) It is capable of
pattern recognition that works in the encrypted image domain. Even if data leaks, privacy can be maintained because data remains encrypted. 2) It realizes Encryption-then-Compression (EtC) systems, where image encryption is conducted prior to compression. The pattern recognition can be carried out using a
few sparse coefficients. On the basis of the pattern recognition results, the scheme can compress selected images with high quality by estimating a sufficient number of sparse coefficients. We use the INRIA dataset to demonstrate its performance in detecting humans in images. The proposal is shown to realize human detection with encrypted images and efficiently compress the images selected in the image recognition stage.
An improved robust and secured image steganographic schemeiaemedu
The document summarizes an improved steganographic scheme that embeds secret data in images. It modifies an existing DCT-based scheme by embedding an "embedding map" to indicate the blocks used for concealment. The embedding map is also hidden using DWT coefficients and secured using SURF features. The proposed method aims to overcome limitations in the existing scheme like potential data loss during extraction due to changes in block energy values. Results show the scheme is robust against attacks like noise and compression while maintaining good image quality. However, capacity is still limited as only part of the image can hide the embedding map.
Performance and Analysis of Video Compression Using Block Based Singular Valu...IJMER
This document presents an analysis of low-complexity video compression using block-based singular value decomposition (SVD) algorithms. It begins with an introduction to video compression and its importance for reducing storage and transmission costs. Current video compression standards like MPEG and H.26x are computationally expensive, making them unsuitable for real-time applications. The document then discusses block SVD algorithms as an alternative that can provide higher quality compression at lower computational complexity. It analyzes reducing the time complexity of video compression using block SVD and compares it to other compression methods. The document outlines the SVD decomposition process and how a 2D version can be applied to groups of image blocks for more efficient compression than 1D SVD.
A secure image steganography based on burrows wheeler transform and dynamic b...IJECEIAES
In modern public communication networks, digital data is massively transmitted through the internet with a high risk of data piracy. Steganography is a technique used to transmit data without arousing suspicion of secret data existence. In this paper, a color image steganography technique is proposed in spatial domain. The cover image is segmented into non-overlapping blocks which are scattered among image size window using Burrows Wheeler transform before embedding. Secret data is embedded in each block according to its sequence in the Burrows Wheeler transform output. The hiding method is an operation of an exclusive-or between a virtual bit which is generated from the most significant bit and the least significant bits of the cover pixel. Results of the algorithm are analyzed according to its degradation of the output image and embedding capacity. The results are also compared with other existing methods.
Efficient Image Compression Technique using Clustering and Random PermutationIJERA Editor
Multimedia data compression is a challenging situation for compression technique, due to the possibility of loss
of data as well as it require large amount of storage place. The minimization of storage place and proper
transmission of these data need compression. In this dissertation we proposed a block based DWT image
compression technique using genetic algorithm and HCC code matrix. The HCC code matrix compressed into
two different set redundant and non-redundant which generate similar pattern of block coefficient. The similar
block coefficient generated by particle of swarm optimization. The process of particle of swarm optimization is
select for the optimal block of DWT transform function. For the experimental purpose we used some standard
image such as Lena, Barbara and cameraman image. The size of resolution of this image is 256*256. The source
of image is Google
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
A Review of Comparison Techniques of Image SteganographyIOSR Journals
This document reviews and compares three common techniques for hiding information in digital images: Least Significant Bit (LSB) steganography, Discrete Cosine Transform (DCT) steganography, and Discrete Wavelet Transform (DWT) steganography. LSB is implemented in the spatial domain by replacing the least significant bits of cover image pixels with payload bits. DCT and DWT are implemented in the frequency domain by transforming the cover image and embedding payload bits in the transformed coefficients. The document evaluates and compares the performance of these three techniques based on metrics like mean squared error, peak signal-to-noise ratio, embedding capacity, and robustness.
Hiding data in images using steganography techniques with compression algorithmsTELKOMNIKA JOURNAL
Steganography is the science and art of secret communication between two sides that attempt to hide the content of the message. It is the science of embedding information into the cover image without causing a loss in the cover image after embedding.Steganography is the art and technology of writing hidden messages in such a manner that no person, apart from the sender and supposed recipient, suspects the lifestyles of the message. It is gaining huge attention these days as it does now not attract attention to its information's existence. In this paper, a comparison of two different techniques is given. The first technique used Least Significant Bit (LSB) with no encryption and no compression. In the second technique, the secret message is encrypted first then LSB technique is applied. Moreover, Discrete Cosine Transform (DCT) is used to transform the image into the frequency domain. The LSB algorithm is implemented in spatial domain in which the payload bits are inserted into the least significant bits of cover image to develop the stego-image while DCT algorithm is implemented in frequency domain in which the stego-image is transformed from spatial domain to the frequency domain and the payload bits are inserted into the frequency components of the cover image.The performance of these two techniques is evaluated on the basis of the parameters MSE and PSNR.
1) The document discusses VLSI architecture and implementation for 3D neural network based image compression. It proposes developing new hardware architectures optimized for area, power, and speed for implementing 3D neural networks for image compression.
2) A block diagram is presented showing the overall process of image acquisition, preprocessing, compression using a 3D neural network, and encoding for transmission.
3) The proposed 3D neural network architecture uses multiple hidden layers with lower dimensions than the input and output layers to perform compression and decompression. The network is trained using backpropagation.
IRJET- A Hybrid Image and Video Compression of DCT and DWT Techniques for H.2...IRJET Journal
This document discusses a hybrid image and video compression technique using both discrete cosine transform (DCT) and discrete wavelet transform (DWT) for H.265/HEVC video compression. The proposed hybrid DWT-DCT method exploits the advantages of both techniques for improved compression performance compared to using them individually. It involves applying DWT-DCT transformations to video frames, entropy coding the compressed frames with Huffman coding, and transmitting the bitstreams to the decoder. The technique is evaluated based on compression ratio, peak signal-to-noise ratio, and mean square error.
This document proposes a video data embedding scheme that hides data in an AVI video file by replacing the least significant bits (LSBs) of pixels in the video frames. It analyzes replacing 1, 2, or 3 LSBs and calculates the peak signal-to-noise ratio and correlation between the original and embedded frames. Replacing higher numbers of LSBs (3 bits vs 1 bit) decreases correlation more, improving security but also lowering visual quality. Experimental results show 3-bit LSB substitution achieves a correlation of around 0.9968, indicating greater security than 1-bit or 2-bit substitution, though at the cost of increased distortion. The scheme could securely transmit hidden information via modified video files without
This document presents a novel approach for jointly optimizing spatial prediction and transform coding in video compression. It aims to improve performance and reduce complexity compared to existing techniques. The proposed method uses singular value decomposition (SVD) to compress images. SVD decomposes an image matrix into three matrices, allowing the image to be approximated using only a few singular values. This achieves compression by removing redundant information. The document outlines the SVD approach for image compression and measures compression performance using compression ratio and mean squared error between the original and compressed images. It then discusses trends in image and video coding, including combining natural and synthetic content. Finally, it provides a block diagram of the proposed system and compares its compression performance to existing discrete cosine transform-
Hybrid compression based stationary wavelet transformsOmar Ghazi
This document presents a hybrid compression approach for images that uses Stationary Wavelet Transforms (SWT), Back Propagation Neural Network (BPNN), and Lempel-Ziv-Welch (LZW) compression. The approach involves: 1) preprocessing the image, 2) applying SWT, 3) converting to a 1D vector using zigzag scan, and 4) hybrid compression using BPNN vector quantization and LZW lossless compression. Experimental results show the SWT with BPNN and LZW achieves the highest compression ratios but the longest processing time, while SWT with Run Length encoding has a lower ratio but shorter time. The hybrid approach combines lossy and lossless compression techniques to obtain a
On Text Realization Image SteganographyCSCJournals
In this paper the steganography strategy is going to be implemented but in a different way from a different scope since the important data will neither be hidden in an image nor transferred through the communication channel inside an image, but on the contrary, a well known image will be used that exists on both sides of the channel and a text message contains important data will be transmitted. With the suitable operations, we can re-mix and re-make the source image. MATLAB7 is the program where the algorithm implemented on it, where the algorithm shows high ability for achieving the task to different type and size of images. Perfect reconstruction was achieved on the receiving side. But the most interesting is that the algorithm that deals with secured image transmission transmits no images at all
Image Authentication Using Digital Watermarkingijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
A new partial image encryption method for document images using variance base...IJECEIAES
The proposed method partially and completely encrypts the gray scale Document images. The complete image encryption is also performed to compare the performance with the existing encryption methods. The partial encryption is carried out by segmenting the image using the Quad-tree decomposition method based on the variance of the image block. The image blocks with uniform pixel levels are considered insignificant blocks and others the significant blocks. The pixels in the significant blocks are permuted by using 1D Skew tent chaotic map. The partially encrypted image blocks are further permuted using 2D Henon map to increase the security level and fed as input to complete encryption. The complete encryption is carried out by diffusing the partially encrypted image. Two levels of diffusion are performed. The first level simply modifies the pixels in the partially encrypted image with the Bernoulli’s chaotic map. The second level establishes the interdependency between rows and columns of the first level diffused image. The experiment is conducted for both partial and complete image encryption on the Document images. The proposed scheme yields better results for both partial and complete encryption on Speed, statistical and dynamical attacks. The results ensure better security when compared to existing encryption schemes.
This document summarizes a research paper that proposes a conditional entrench spatial domain steganography technique (CESS). CESS embeds secret information in the least significant bit and most significant bit of cover images based on predefined conditions to increase security and capacity. It decomposes cover images into 8x8 blocks. The first block embeds upper and lower bound values used for payload retrieval. Each subsequent 8x8 block embeds the payload in LSBs and MSBs of pixels based on the block's mean of median values and difference between consecutive pixels. The technique is evaluated based on capacity, security and PSNR compared to existing methods.
EMPIRICAL STUDY OF ALGORITHMS AND TECHNIQUES IN VIDEO STEGANOGRAPHYJournal For Research
Steganography is the art and science of hiding the actual important information under graphics, text, cover file etc. These techniques may be applied without fear of image destruction because they are more integrated into the image. Information can be in the form of text, audio, video. The purpose of steganography is to covert communication and to hide a message from a third party or intruder. Steganography is often confused with cryptography because the two are similar in the way that both are used to protect confidential information. Though there are many types of steganography, video Steganography is more reliable due to high capacity image, more data embedment, perceptual redundancy etc. This research paper deals with various Video Steganography techniques and algorithms including Spatial Domain, Pseudorandom permutations, TPVD (Tri-way pixel value differencing), Motion Vector Technique, Video Compression, and Motion Vector Technique. The Video compression which uses modern coding techniques to reduce redundancy in video data has been also studied and analyzed. In fact, Video compression operates on square-shaped groups or blocks of neighboring pixels, often called macro blocks. These pixel groups or blocks of pixels are compared from one frame to the next and the video compression code sends only the differences within those blocks. Generally, the motion field in video compression is assumed to be translational with horizontal component and vertical component and denoted in vector form for the spatial variables in the underlying image, such as three steps search, etc. The study also discusses and focusses on the evolution of the Video Steganography techniques and algorithms over the years based on its application and subsequent merits and demerits. Further, Advanced Video Steganography Algorithm/Bit Exchange Method based on the bit shifting and XOR operation in the secret message file has been studied and implemented. The encrypted secret message is embed in the cover file in alternate byte. The bits are substituted in LSB & LSB+3 bits in the cover file. Finally, the simulation and evaluation of the above mentioned approach is performed using MATLAB tools.
This document summarizes a research paper that proposes a new technique for data embedding and extraction in high resolution AVI videos. The technique encrypts a secret message before embedding it by alternately changing the LSB and LSB+3 bits of alternate bytes in the cover video file. An index is also created for the secret information and placed in a video frame to aid extraction. This technique aims to provide higher security, capacity and robustness compared to typical data embedding methods. The paper discusses related work on digital steganography techniques and the proposed video steganography algorithm in more detail.
FPGA Based Pattern Generation and Synchonization for High Speed Structured Li...TELKOMNIKA JOURNAL
Recently, structured light 3D imaging devices have gained a keen attention due to their potential
applications to robotics, industrial manufacturing and medical imaging. Most of these applications require
high 3D precision yet high speed in image capturing for hard and/or soft real time environments. This
paper presents a method of high speed image capturing for structured light 3D imaging sensors with FPGA
based structured light pattern generation and projector-camera synchronization. Suggested setup reduces
the time for pattern projection and camera triggering to 16msec from 100msec that should be required by
conventional methods.
JOINT IMAGE WATERMARKING, COMPRESSION AND ENCRYPTION BASED ON COMPRESSED SENS...ijma
ABSTRACT
Image usage over the internet becomes more and more important each day. Over 3 billion images are shared each day over the internet which raise a concern about how to protect images copyrights? Or how to utilize image sharing experience? This paper proposes a new robust image watermarking algorithm based on compressed sensing (CS) and quantization index modulation (QIM) watermark embedding. The algorithm capitalizes on the CS to compress and encrypt images jointly with Entropy Coding, Arnold Cat Map, Pseudo-random numbers and Advanced Encryption Standard (AES). Our proposed algorithm works under the JPEG standard umbrella. Watermark embedding is done in 3 different locations inside the image using QIM. Those locations differ with each 8-by-8 image block. Choosing which combination of coefficients to be used in QIM watermark embedding depends on selecting a combination from combinations table, which is generated at the same time with projection matrices using a 10-digits Pseudorandom number secret key SK1. After quantization phase, the algorithm shuffles image blocks using Arnold’s Cat Map with a 10-digits Pseudo-random number secret key SK2, followed by a unique method for splitting every 8x8 block into two unequal parts. Part number one will act as the host for two QIM watermarks then goes through encoding phase using Run-Length Encoding (RLE) followed by Huffman Encoding, while part number two goes through sparse watermark embedding followed by a third QIM watermark embedding and compression phase using CS, then Huffman encoder is used to encode this part. The algorithm aims to combine image watermarking, compression and encryption capabilities in one algorithm while balancing how those capabilities works with each other to achieve significant improvement in terms of image watermarking, compression and encryption. 15 different images usually used in image processing benchmarking were used for testing the algorithm capabilities and experiments show that our proposed algorithm achieves robust watermarking jointly with encryption and compression under the JPEG standard framework.
PERCEPTUAL COPYRIGHT PROTECTION USING MULTIRESOLUTION WAVELET-BASED WATERMARK...gerogepatton
In this paper, an efficiently DWT-based watermarking technique is proposed to embed signatures in images to attest the owner identification and discourage the unauthorized copying. This paper deals with a fuzzy inference filter to choose the larger entropy of coefficients to embed watermarks. Unlike most previous watermarking frameworks which embedded watermarks in the larger coefficients of inner coarser subbands, the proposed technique is based on utilizing a context model and fuzzy inference filter by embedding watermarks in the larger-entropy coefficients of coarser DWT subbands. The proposed approaches allow us to embed adaptive casting degree of watermarks for transparency and robustness to the general image-processing attacks such as smoothing, sharpening, and JPEG compression. The approach has no need the original host image to extract watermarks. Our schemes have been shown to provide very good results in both image transparency and robustness.
SECURE OMP BASED PATTERN RECOGNITION THAT SUPPORTS IMAGE COMPRESSIONsipij
In this paper, we propose a secure Orthogonal Matching Pursuit (OMP) based pattern recognition scheme that well supports image compression. The secure OMP is a sparse coding algorithm that chooses atoms sequentially and calculates sparse coefficients from encrypted images. The encryption is carried out by using a random unitary transform. The proposed scheme offers two prominent features. 1) It is capable of
pattern recognition that works in the encrypted image domain. Even if data leaks, privacy can be maintained because data remains encrypted. 2) It realizes Encryption-then-Compression (EtC) systems, where image encryption is conducted prior to compression. The pattern recognition can be carried out using a
few sparse coefficients. On the basis of the pattern recognition results, the scheme can compress selected images with high quality by estimating a sufficient number of sparse coefficients. We use the INRIA dataset to demonstrate its performance in detecting humans in images. The proposal is shown to realize human detection with encrypted images and efficiently compress the images selected in the image recognition stage.
An improved robust and secured image steganographic schemeiaemedu
The document summarizes an improved steganographic scheme that embeds secret data in images. It modifies an existing DCT-based scheme by embedding an "embedding map" to indicate the blocks used for concealment. The embedding map is also hidden using DWT coefficients and secured using SURF features. The proposed method aims to overcome limitations in the existing scheme like potential data loss during extraction due to changes in block energy values. Results show the scheme is robust against attacks like noise and compression while maintaining good image quality. However, capacity is still limited as only part of the image can hide the embedding map.
Performance and Analysis of Video Compression Using Block Based Singular Valu...IJMER
This document presents an analysis of low-complexity video compression using block-based singular value decomposition (SVD) algorithms. It begins with an introduction to video compression and its importance for reducing storage and transmission costs. Current video compression standards like MPEG and H.26x are computationally expensive, making them unsuitable for real-time applications. The document then discusses block SVD algorithms as an alternative that can provide higher quality compression at lower computational complexity. It analyzes reducing the time complexity of video compression using block SVD and compares it to other compression methods. The document outlines the SVD decomposition process and how a 2D version can be applied to groups of image blocks for more efficient compression than 1D SVD.
A secure image steganography based on burrows wheeler transform and dynamic b...IJECEIAES
In modern public communication networks, digital data is massively transmitted through the internet with a high risk of data piracy. Steganography is a technique used to transmit data without arousing suspicion of secret data existence. In this paper, a color image steganography technique is proposed in spatial domain. The cover image is segmented into non-overlapping blocks which are scattered among image size window using Burrows Wheeler transform before embedding. Secret data is embedded in each block according to its sequence in the Burrows Wheeler transform output. The hiding method is an operation of an exclusive-or between a virtual bit which is generated from the most significant bit and the least significant bits of the cover pixel. Results of the algorithm are analyzed according to its degradation of the output image and embedding capacity. The results are also compared with other existing methods.
Efficient Image Compression Technique using Clustering and Random PermutationIJERA Editor
Multimedia data compression is a challenging situation for compression technique, due to the possibility of loss
of data as well as it require large amount of storage place. The minimization of storage place and proper
transmission of these data need compression. In this dissertation we proposed a block based DWT image
compression technique using genetic algorithm and HCC code matrix. The HCC code matrix compressed into
two different set redundant and non-redundant which generate similar pattern of block coefficient. The similar
block coefficient generated by particle of swarm optimization. The process of particle of swarm optimization is
select for the optimal block of DWT transform function. For the experimental purpose we used some standard
image such as Lena, Barbara and cameraman image. The size of resolution of this image is 256*256. The source
of image is Google
Efficient Image Compression Technique using Clustering and Random PermutationIJERA Editor
Multimedia data compression is a challenging situation for compression technique, due to the possibility of loss
of data as well as it require large amount of storage place. The minimization of storage place and proper
transmission of these data need compression. In this dissertation we proposed a block based DWT image
compression technique using genetic algorithm and HCC code matrix. The HCC code matrix compressed into
two different set redundant and non-redundant which generate similar pattern of block coefficient. The similar
block coefficient generated by particle of swarm optimization. The process of particle of swarm optimization is
select for the optimal block of DWT transform function. For the experimental purpose we used some standard
image such as Lena, Barbara and cameraman image. The size of resolution of this image is 256*256. The source
of image is Google.
This survey propose a Novel Joint Data-Hiding and
Compression Scheme (JDHC) for digital images using side match
vector quantization (SMVQ) and image in painting. In this
JDHC scheme image compression and data hiding scheme are
combined into a single module. On the client side, the data should
be hided and compressed in sub codebook such that remaining
block except left and top most of the image. The data hiding and
compression scheme follows raster scanning order i.e. block by
block on row basis. Vector Quantization used with SMVQ and
Image In painting for complex block to control distortion and
error injection. The receiver side process is based on two
methods. First method divide the received image into series of
blocks the receiver achieve hided data and original image
according to the index value in the segmented block. Second
method use edge based harmonic in painting is used to get
original image if any loss in the image.
A hybrid predictive technique for lossless image compressionjournalBEEI
Compression of images is of great interest in applications where efficiency with respect to data storage or transmission bandwidth is sought.The rapid growth of social media and digital networks have given rise to huge amount of image data being accessed and exchanged daily. However, the larger the image size, the longer it takes to transmit and archive. In other words, high quality images require huge amount of transmission bandwidth and storage space. Suitable image compression can help in reducing the image size and improving transmission speed. Lossless image compression is especially crucial in fields such as remote sensing healthcare network, security and military applications as the quality of images needs to be maintained to avoid any errors during analysis or diagnosis. In this paper, a hybrid prediction lossless image compression algorithm is proposed to address these issues. The algorithm is achieved by combining predictive Differential Pulse Code Modulation (DPCM) and Integer Wavelet Transform (IWT). Entropy and compression ratio calculation are used to analyze the performance of the designed coding. The analysis shows that the best hybrid predictive algorithm is the sequence of DPCM-IWT-Huffman which has bits sizes reduced by 36%, 48%, 34% and 13% for tested images of Lena, Cameraman, Pepper and Baboon, respectively.
The document describes an improved image encryption and compression system using error clustering and random permutation. It proposes a highly efficient image encryption-then-compression framework. The image encryption method works in the prediction error domain and can provide a reasonably high level of security. Notably, the proposed compression approach applied to encrypted images is only slightly worse than compressing unencrypted images. In contrast, most existing encryption-then-compression systems significantly reduce compression efficiency. The system includes image encryption by Alice, image compression by Charlie, and sequential decryption and decompression by Bob. It analyzes the security of the proposed permutation-based encryption method and efficiency of compressing encrypted data.
SELECTIVE IMAGE ENCRYPTION USING DCT WITH AES CIPHERcscpconf
Selective encryption presents a great solution to optimize time efficiency during encryption
process. In this paper a novel selective encryption scheme based on DCT transform with AES
algorithm is presented. In the DCT method, the basic idea is to decompose the image into 8×8
blocks and these blocks are transformed from the spatial domain to the frequency domain by the
DCT. Then, the DCT coefficients correlated to the lower frequencies of the image block are
encrypted. The proposed cryptosystem is evaluated using various security and statistical
analysis; results show that the proposed algorithm is strong against attacks and suitable for
practical application.
Selective encryption presents a great solution to optimize time efficiency during encryption
process. In this paper a novel selective encryption scheme based on DCT transform with AES
algorithm is presented. In the DCT method, the basic idea is to decompose the image into 8×8
blocks and these blocks are transformed from the spatial domain to the frequency domain by the
DCT. Then, the DCT coefficients correlated to the lower frequencies of the image block are
encrypted. The proposed cryptosystem is evaluated using various security and statistical
analysis; results show that the proposed algorithm is strong against attacks and suitable for
practical application.
International Journal on Soft Computing ( IJSC )ijsc
This document provides a summary of various wavelet-based image coding schemes. It discusses the basics of image compression including transformation, quantization, and encoding. It then reviews the wavelet transform approach and several popular wavelet coding techniques such as EZW, SPIHT, SPECK, EBCOT, WDR, ASWDR, SFQ, EPWIC, CREW, SR and GW coding. These techniques exploit the multi-resolution properties of wavelets for superior energy compaction and compression performance compared to DCT-based methods like JPEG. The document provides details on how each coding scheme works and compares their features.
A novel image encryption scheme based on DCT transform and DNA sequencenooriasukmaningtyas
This document summarizes a novel image encryption scheme based on discrete cosine transform (DCT) and DNA sequences. The scheme divides color images into red, green, and blue layers and applies DCT to each layer to obtain coefficient matrices. It then uses DNA encoding rules to encrypt the DC coefficients. The AC coefficients are encrypted using a random number. The scheme generates a secret key image based on a random matrix and DNA encoding to improve diffusion. Experimental results and security analysis demonstrate the scheme encrypts images efficiently while resisting common attacks like entropy and statistical attacks.
Wavelet based Image Coding Schemes: A Recent Survey ijsc
A variety of new and powerful algorithms have been developed for image compression over the years. Among them the wavelet-based image compression schemes have gained much popularity due to their overlapping nature which reduces the blocking artifacts that are common phenomena in JPEG compression and multiresolution character which leads to superior energy compaction with high quality reconstructed images. This paper provides a detailed survey on some of the popular wavelet coding techniques such as the Embedded Zerotree Wavelet (EZW) coding, Set Partitioning in Hierarchical Tree (SPIHT) coding, the Set Partitioned Embedded Block (SPECK) Coder, and the Embedded Block Coding with Optimized Truncation (EBCOT) algorithm. Other wavelet-based coding techniques like the Wavelet Difference Reduction (WDR) and the Adaptive Scanned Wavelet Difference Reduction (ASWDR) algorithms, the Space Frequency Quantization (SFQ) algorithm, the Embedded Predictive Wavelet Image Coder (EPWIC), Compression with Reversible Embedded Wavelet (CREW), the Stack-Run (SR) coding and the recent Geometric Wavelet (GW) coding are also discussed. Based on the review, recommendations and discussions are presented for algorithm development and implementation.
Video steganography based on DCT psychovisual and object motionjournalBEEI
The document describes a proposed video steganography technique that embeds secret messages along object motion in video frames. It selects six middle-frequency DCT coefficients using psychovisual effects to minimize quality degradation when hiding messages. The technique modifies the DCT coefficients to embed bits according to an algorithm. It evaluates video quality and robustness against MPEG compression, showing minimum distortion and high message recovery rates after compression.
Reversible Data Hiding Using Contrast Enhancement ApproachCSCJournals
Reverse Data Hiding is a technique used to hide the object's data details. This technique is used to ensure the security and to protect the integrity of the object from any modification by preventing intended and unintended changes. Digital watermarking is a key ingredient to multimedia protection. However, most existing techniques distort the original content as a side effect of image protection. As a way to overcome such distortion, reversible data embedding has recently been introduced and is growing rapidly. In reversible data embedding, the original content can be completely restored after the removal of the watermark. Therefore, it is very practical to protect legal, medical, or other important imagery. In this paper a novel removable (lossless) data hiding technique is proposed. This technique is based on the histogram modification to produce extra space for embedding, and the redundancy in digital images is exploited to achieve a very high embedding capacity. This method has been applied to various standard images. The experimental results have demonstrated a promising outcome and the proposed technique achieved satisfactory and stable performance both on embedding capacity and visual quality. The proposed method capacity is up to 129K bits with PSNR between 42-45dB. The performance is hence better than most exiting reversible data hiding algorithms.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
This document compares two video compression techniques: Embedded Zerotree Wavelet (EZW) algorithm and H.264 codec. It finds that H.264 provides higher compression ratios of 60-70% compared to EZW, which achieves lower compression. Frames compressed with H.264 show better visual quality than those compressed with EZW. The document concludes that while EZW achieves good compression performance, H.264 is currently the better technique for video compression applications.
AN EFFICIENT M-ARY QIM DATA HIDING ALGORITHM FOR THE APPLICATION TO IMAGE ERR...IJNSA Journal
Methods like edge directed interpolation and projection onto convex sets (POCS) that are widely used for image error concealment to produce better image quality are complex in nature and also time consuming. Moreover, those methods are not suitable for real time error concealment where the decoder may not have sufficient computation power or done in online. In this paper, we propose a data-hiding scheme for error concealment of digital image. Edge direction information of a block is extracted in the encoder and is embedded imperceptibly into the host media using quantization index modulation (QIM), thus reduces work load of the decoder. The system performance in term of fidelity and computational load is improved using M-ary data modulation based on near-orthogonal QIM. The decoder extracts the embedded
features (edge information) and those features are then used for recovery of lost data. Experimental results duly support the effectiveness of the proposed scheme.
The document proposes a secured reversible data transmission method for encoded AVC video using a Gzip Deflector algorithm. It embeds residual information from a visible watermarking process using reversible contrast mapping after compressing the information with Gzip Deflector and encrypting it with AES. Simulation results showed the proposed method achieved up to 7dB higher PSNR than the state of the art approach when recovering the original video frames.
Color image encryption based on chaotic shit keying with lossless compression IJECEIAES
In order to protect valuable data from undesirable readers or against illegal reproduction and modifications, there have been various data encryption techniques. Many methods are developed to perform image encryption. The use of chaotic map for image encryption is very effective, since it increases the security, due to its random behavior. The most attractive feature of deterministic chaotic systems is the extremely unexpected and random-look nature of chaotic signals that may lead to novel applications. A novel algorithm for image encryption based on compression and hyper chaotic map techniques is suggested. First, the RGB image is broken down into R, G and B subbands after that each band is compressed using lossless technique. The generated chaotic sequences from the 3D chaotic system are employed to code the compressed results by employing the idea of chaotic shift encoding (CSK) modulation to encode the three bands to generate the encrypted image. The experiments show that the proposed method give good results in term of security, feasibility, and robustness.
NEW IMPROVED 2D SVD BASED ALGORITHM FOR VIDEO CODINGcscpconf
Video compression is one of the most important blocks of an image acquisition system.
Compression of video results in reduction of transmission bandwidth. In real time video
compression the incoming video data is directly compressed without being stored first.
Therefore real time video compression system operates under stringent timing constraints.
Current video compression standards like MPEG, H.26x series, involve emotion estimation and
compensation blocks which are highly computationally expensive and hence they are not
suitable for real time applications on resource scarce systems. Current applications like video
calling, video conferencing require low complexity video compression algorithms so that they
can be implemented in environments that have scarce computational resources (like mobile
phones). A low complexity video compression algorithm based on 2D SVD exists. In this paper, a modification to that algorithm which provides higher PSNR at the same bit rate is presented.
Similar to Optimization of image compression and ciphering based on EZW techniques (20)
Amazon products reviews classification based on machine learning, deep learni...TELKOMNIKA JOURNAL
In recent times, the trend of online shopping through e-commerce stores and websites has grown to a huge extent. Whenever a product is purchased on an e-commerce platform, people leave their reviews about the product. These reviews are very helpful for the store owners and the product’s manufacturers for the betterment of their work process as well as product quality. An automated system is proposed in this work that operates on two datasets D1 and D2 obtained from Amazon. After certain preprocessing steps, N-gram and word embedding-based features are extracted using term frequency-inverse document frequency (TF-IDF), bag of words (BoW) and global vectors (GloVe), and Word2vec, respectively. Four machine learning (ML) models support vector machines (SVM), logistic regression (RF), logistic regression (LR), multinomial Naïve Bayes (MNB), two deep learning (DL) models convolutional neural network (CNN), long-short term memory (LSTM), and standalone bidirectional encoder representations (BERT) are used to classify reviews as either positive or negative. The results obtained by the standard ML, DL models and BERT are evaluated using certain performance evaluation measures. BERT turns out to be the best-performing model in the case of D1 with an accuracy of 90% on features derived by word embedding models while the CNN provides the best accuracy of 97% upon word embedding features in the case of D2. The proposed model shows better overall performance on D2 as compared to D1.
Design, simulation, and analysis of microstrip patch antenna for wireless app...TELKOMNIKA JOURNAL
In this study, a microstrip patch antenna that works at 3.6 GHz was built and tested to see how well it works. In this work, Rogers RT/Duroid 5880 has been used as the substrate material, with a dielectric permittivity of 2.2 and a thickness of 0.3451 mm; it serves as the base for the examined antenna. The computer simulation technology (CST) studio suite is utilized to show the recommended antenna design. The goal of this study was to get a more extensive transmission capacity, a lower voltage standing wave ratio (VSWR), and a lower return loss, but the main goal was to get a higher gain, directivity, and efficiency. After simulation, the return loss, gain, directivity, bandwidth, and efficiency of the supplied antenna are found to be -17.626 dB, 9.671 dBi, 9.924 dBi, 0.2 GHz, and 97.45%, respectively. Besides, the recreation uncovered that the transfer speed side-lobe level at phi was much better than those of the earlier works, at -28.8 dB, respectively. Thus, it makes a solid contender for remote innovation and more robust communication.
Design and simulation an optimal enhanced PI controller for congestion avoida...TELKOMNIKA JOURNAL
This document describes using a snake optimization algorithm to tune the gains of an enhanced proportional-integral controller for congestion avoidance in a TCP/AQM system. The controller aims to maintain a stable and desired queue size without noise or transmission problems. A linearized model of the TCP/AQM system is presented. An enhanced PI controller combining nonlinear gain and original PI gains is proposed. The snake optimization algorithm is then used to tune the parameters of the enhanced PI controller to achieve optimal system performance and response. Simulation results are discussed showing the proposed controller provides a stable and robust behavior for congestion control.
Improving the detection of intrusion in vehicular ad-hoc networks with modifi...TELKOMNIKA JOURNAL
Vehicular ad-hoc networks (VANETs) are wireless-equipped vehicles that form networks along the road. The security of this network has been a major challenge. The identity-based cryptosystem (IBC) previously used to secure the networks suffers from membership authentication security features. This paper focuses on improving the detection of intruders in VANETs with a modified identity-based cryptosystem (MIBC). The MIBC is developed using a non-singular elliptic curve with Lagrange interpolation. The public key of vehicles and roadside units on the network are derived from number plates and location identification numbers, respectively. Pseudo-identities are used to mask the real identity of users to preserve their privacy. The membership authentication mechanism ensures that only valid and authenticated members of the network are allowed to join the network. The performance of the MIBC is evaluated using intrusion detection ratio (IDR) and computation time (CT) and then validated with the existing IBC. The result obtained shows that the MIBC recorded an IDR of 99.3% against 94.3% obtained for the existing identity-based cryptosystem (EIBC) for 140 unregistered vehicles attempting to intrude on the network. The MIBC shows lower CT values of 1.17 ms against 1.70 ms for EIBC. The MIBC can be used to improve the security of VANETs.
Conceptual model of internet banking adoption with perceived risk and trust f...TELKOMNIKA JOURNAL
Understanding the primary factors of internet banking (IB) acceptance is critical for both banks and users; nevertheless, our knowledge of the role of users’ perceived risk and trust in IB adoption is limited. As a result, we develop a conceptual model by incorporating perceived risk and trust into the technology acceptance model (TAM) theory toward the IB. The proper research emphasized that the most essential component in explaining IB adoption behavior is behavioral intention to use IB adoption. TAM is helpful for figuring out how elements that affect IB adoption are connected to one another. According to previous literature on IB and the use of such technology in Iraq, one has to choose a theoretical foundation that may justify the acceptance of IB from the customer’s perspective. The conceptual model was therefore constructed using the TAM as a foundation. Furthermore, perceived risk and trust were added to the TAM dimensions as external factors. The key objective of this work was to extend the TAM to construct a conceptual model for IB adoption and to get sufficient theoretical support from the existing literature for the essential elements and their relationships in order to unearth new insights about factors responsible for IB adoption.
Efficient combined fuzzy logic and LMS algorithm for smart antennaTELKOMNIKA JOURNAL
The smart antennas are broadly used in wireless communication. The least mean square (LMS) algorithm is a procedure that is concerned in controlling the smart antenna pattern to accommodate specified requirements such as steering the beam toward the desired signal, in addition to placing the deep nulls in the direction of unwanted signals. The conventional LMS (C-LMS) has some drawbacks like slow convergence speed besides high steady state fluctuation error. To overcome these shortcomings, the present paper adopts an adaptive fuzzy control step size least mean square (FC-LMS) algorithm to adjust its step size. Computer simulation outcomes illustrate that the given model has fast convergence rate as well as low mean square error steady state.
Design and implementation of a LoRa-based system for warning of forest fireTELKOMNIKA JOURNAL
This paper presents the design and implementation of a forest fire monitoring and warning system based on long range (LoRa) technology, a novel ultra-low power consumption and long-range wireless communication technology for remote sensing applications. The proposed system includes a wireless sensor network that records environmental parameters such as temperature, humidity, wind speed, and carbon dioxide (CO2) concentration in the air, as well as taking infrared photos.The data collected at each sensor node will be transmitted to the gateway via LoRa wireless transmission. Data will be collected, processed, and uploaded to a cloud database at the gateway. An Android smartphone application that allows anyone to easily view the recorded data has been developed. When a fire is detected, the system will sound a siren and send a warning message to the responsible personnel, instructing them to take appropriate action. Experiments in Tram Chim Park, Vietnam, have been conducted to verify and evaluate the operation of the system.
Wavelet-based sensing technique in cognitive radio networkTELKOMNIKA JOURNAL
Cognitive radio is a smart radio that can change its transmitter parameter based on interaction with the environment in which it operates. The demand for frequency spectrum is growing due to a big data issue as many Internet of Things (IoT) devices are in the network. Based on previous research, most frequency spectrum was used, but some spectrums were not used, called spectrum hole. Energy detection is one of the spectrum sensing methods that has been frequently used since it is easy to use and does not require license users to have any prior signal understanding. But this technique is incapable of detecting at low signal-to-noise ratio (SNR) levels. Therefore, the wavelet-based sensing is proposed to overcome this issue and detect spectrum holes. The main objective of this work is to evaluate the performance of wavelet-based sensing and compare it with the energy detection technique. The findings show that the percentage of detection in wavelet-based sensing is 83% higher than energy detection performance. This result indicates that the wavelet-based sensing has higher precision in detection and the interference towards primary user can be decreased.
A novel compact dual-band bandstop filter with enhanced rejection bandsTELKOMNIKA JOURNAL
In this paper, we present the design of a new wide dual-band bandstop filter (DBBSF) using nonuniform transmission lines. The method used to design this filter is to replace conventional uniform transmission lines with nonuniform lines governed by a truncated Fourier series. Based on how impedances are profiled in the proposed DBBSF structure, the fractional bandwidths of the two 10 dB-down rejection bands are widened to 39.72% and 52.63%, respectively, and the physical size has been reduced compared to that of the filter with the uniform transmission lines. The results of the electromagnetic (EM) simulation support the obtained analytical response and show an improved frequency behavior.
Deep learning approach to DDoS attack with imbalanced data at the application...TELKOMNIKA JOURNAL
A distributed denial of service (DDoS) attack is where one or more computers attack or target a server computer, by flooding internet traffic to the server. As a result, the server cannot be accessed by legitimate users. A result of this attack causes enormous losses for a company because it can reduce the level of user trust, and reduce the company’s reputation to lose customers due to downtime. One of the services at the application layer that can be accessed by users is a web-based lightweight directory access protocol (LDAP) service that can provide safe and easy services to access directory applications. We used a deep learning approach to detect DDoS attacks on the CICDDoS 2019 dataset on a complex computer network at the application layer to get fast and accurate results for dealing with unbalanced data. Based on the results obtained, it is observed that DDoS attack detection using a deep learning approach on imbalanced data performs better when implemented using synthetic minority oversampling technique (SMOTE) method for binary classes. On the other hand, the proposed deep learning approach performs better for detecting DDoS attacks in multiclass when implemented using the adaptive synthetic (ADASYN) method.
The appearance of uncertainties and disturbances often effects the characteristics of either linear or nonlinear systems. Plus, the stabilization process may be deteriorated thus incurring a catastrophic effect to the system performance. As such, this manuscript addresses the concept of matching condition for the systems that are suffering from miss-match uncertainties and exogeneous disturbances. The perturbation towards the system at hand is assumed to be known and unbounded. To reach this outcome, uncertainties and their classifications are reviewed thoroughly. The structural matching condition is proposed and tabulated in the proposition 1. Two types of mathematical expressions are presented to distinguish the system with matched uncertainty and the system with miss-matched uncertainty. Lastly, two-dimensional numerical expressions are provided to practice the proposed proposition. The outcome shows that matching condition has the ability to change the system to a design-friendly model for asymptotic stabilization.
Implementation of FinFET technology based low power 4×4 Wallace tree multipli...TELKOMNIKA JOURNAL
Many systems, including digital signal processors, finite impulse response (FIR) filters, application-specific integrated circuits, and microprocessors, use multipliers. The demand for low power multipliers is gradually rising day by day in the current technological trend. In this study, we describe a 4×4 Wallace multiplier based on a carry select adder (CSA) that uses less power and has a better power delay product than existing multipliers. HSPICE tool at 16 nm technology is used to simulate the results. In comparison to the traditional CSA-based multiplier, which has a power consumption of 1.7 µW and power delay product (PDP) of 57.3 fJ, the results demonstrate that the Wallace multiplier design employing CSA with first zero finding logic (FZF) logic has the lowest power consumption of 1.4 µW and PDP of 27.5 fJ.
Evaluation of the weighted-overlap add model with massive MIMO in a 5G systemTELKOMNIKA JOURNAL
The flaw in 5G orthogonal frequency division multiplexing (OFDM) becomes apparent in high-speed situations. Because the doppler effect causes frequency shifts, the orthogonality of OFDM subcarriers is broken, lowering both their bit error rate (BER) and throughput output. As part of this research, we use a novel design that combines massive multiple input multiple output (MIMO) and weighted overlap and add (WOLA) to improve the performance of 5G systems. To determine which design is superior, throughput and BER are calculated for both the proposed design and OFDM. The results of the improved system show a massive improvement in performance ver the conventional system and significant improvements with massive MIMO, including the best throughput and BER. When compared to conventional systems, the improved system has a throughput that is around 22% higher and the best performance in terms of BER, but it still has around 25% less error than OFDM.
Reflector antenna design in different frequencies using frequency selective s...TELKOMNIKA JOURNAL
In this study, it is aimed to obtain two different asymmetric radiation patterns obtained from antennas in the shape of the cross-section of a parabolic reflector (fan blade type antennas) and antennas with cosecant-square radiation characteristics at two different frequencies from a single antenna. For this purpose, firstly, a fan blade type antenna design will be made, and then the reflective surface of this antenna will be completed to the shape of the reflective surface of the antenna with the cosecant-square radiation characteristic with the frequency selective surface designed to provide the characteristics suitable for the purpose. The frequency selective surface designed and it provides the perfect transmission as possible at 4 GHz operating frequency, while it will act as a band-quenching filter for electromagnetic waves at 5 GHz operating frequency and will be a reflective surface. Thanks to this frequency selective surface to be used as a reflective surface in the antenna, a fan blade type radiation characteristic at 4 GHz operating frequency will be obtained, while a cosecant-square radiation characteristic at 5 GHz operating frequency will be obtained.
Reagentless iron detection in water based on unclad fiber optical sensorTELKOMNIKA JOURNAL
A simple and low-cost fiber based optical sensor for iron detection is demonstrated in this paper. The sensor head consist of an unclad optical fiber with the unclad length of 1 cm and it has a straight structure. Results obtained shows a linear relationship between the output light intensity and iron concentration, illustrating the functionality of this iron optical sensor. Based on the experimental results, the sensitivity and linearity are achieved at 0.0328/ppm and 0.9824 respectively at the wavelength of 690 nm. With the same wavelength, other performance parameters are also studied. Resolution and limit of detection (LOD) are found to be 0.3049 ppm and 0.0755 ppm correspondingly. This iron sensor is advantageous in that it does not require any reagent for detection, enabling it to be simpler and cost-effective in the implementation of the iron sensing.
Impact of CuS counter electrode calcination temperature on quantum dot sensit...TELKOMNIKA JOURNAL
In place of the commercial Pt electrode used in quantum sensitized solar cells, the low-cost CuS cathode is created using electrophoresis. High resolution scanning electron microscopy and X-ray diffraction were used to analyze the structure and morphology of structural cubic samples with diameters ranging from 40 nm to 200 nm. The conversion efficiency of solar cells is significantly impacted by the calcination temperatures of cathodes at 100 °C, 120 °C, 150 °C, and 180 °C under vacuum. The fluorine doped tin oxide (FTO)/CuS cathode electrode reached a maximum efficiency of 3.89% when it was calcined at 120 °C. Compared to other temperature combinations, CuS nanoparticles crystallize at 120 °C, which lowers resistance while increasing electron lifetime.
In place of the commercial Pt electrode used in quantum sensitized solar cells, the low-cost CuS cathode is created using electrophoresis. High resolution scanning electron microscopy and X-ray diffraction were used to analyze the structure and morphology of structural cubic samples with diameters ranging from 40 nm to 200 nm. The conversion efficiency of solar cells is significantly impacted by the calcination temperatures of cathodes at 100 °C, 120 °C, 150 °C, and 180 °C under vacuum. The fluorine doped tin oxide (FTO)/CuS cathode electrode reached a maximum efficiency of 3.89% when it was calcined at 120 °C. Compared to other temperature combinations, CuS nanoparticles crystallize at 120 °C, which lowers resistance while increasing electron lifetime.
A progressive learning for structural tolerance online sequential extreme lea...TELKOMNIKA JOURNAL
This article discusses the progressive learning for structural tolerance online sequential extreme learning machine (PSTOS-ELM). PSTOS-ELM can save robust accuracy while updating the new data and the new class data on the online training situation. The robustness accuracy arises from using the householder block exact QR decomposition recursive least squares (HBQRD-RLS) of the PSTOS-ELM. This method is suitable for applications that have data streaming and often have new class data. Our experiment compares the PSTOS-ELM accuracy and accuracy robustness while data is updating with the batch-extreme learning machine (ELM) and structural tolerance online sequential extreme learning machine (STOS-ELM) that both must retrain the data in a new class data case. The experimental results show that PSTOS-ELM has accuracy and robustness comparable to ELM and STOS-ELM while also can update new class data immediately.
Electroencephalography-based brain-computer interface using neural networksTELKOMNIKA JOURNAL
This study aimed to develop a brain-computer interface that can control an electric wheelchair using electroencephalography (EEG) signals. First, we used the Mind Wave Mobile 2 device to capture raw EEG signals from the surface of the scalp. The signals were transformed into the frequency domain using fast Fourier transform (FFT) and filtered to monitor changes in attention and relaxation. Next, we performed time and frequency domain analyses to identify features for five eye gestures: opened, closed, blink per second, double blink, and lookup. The base state was the opened-eyes gesture, and we compared the features of the remaining four action gestures to the base state to identify potential gestures. We then built a multilayer neural network to classify these features into five signals that control the wheelchair’s movement. Finally, we designed an experimental wheelchair system to test the effectiveness of the proposed approach. The results demonstrate that the EEG classification was highly accurate and computationally efficient. Moreover, the average performance of the brain-controlled wheelchair system was over 75% across different individuals, which suggests the feasibility of this approach.
Adaptive segmentation algorithm based on level set model in medical imagingTELKOMNIKA JOURNAL
For image segmentation, level set models are frequently employed. It offer best solution to overcome the main limitations of deformable parametric models. However, the challenge when applying those models in medical images stills deal with removing blurs in image edges which directly affects the edge indicator function, leads to not adaptively segmenting images and causes a wrong analysis of pathologies wich prevents to conclude a correct diagnosis. To overcome such issues, an effective process is suggested by simultaneously modelling and solving systems’ two-dimensional partial differential equations (PDE). The first PDE equation allows restoration using Euler’s equation similar to an anisotropic smoothing based on a regularized Perona and Malik filter that eliminates noise while preserving edge information in accordance with detected contours in the second equation that segments the image based on the first equation solutions. This approach allows developing a new algorithm which overcome the studied model drawbacks. Results of the proposed method give clear segments that can be applied to any application. Experiments on many medical images in particular blurry images with high information losses, demonstrate that the developed approach produces superior segmentation results in terms of quantity and quality compared to other models already presented in previeous works.
Automatic channel selection using shuffled frog leaping algorithm for EEG bas...TELKOMNIKA JOURNAL
Drug addiction is a complex neurobiological disorder that necessitates comprehensive treatment of both the body and mind. It is categorized as a brain disorder due to its impact on the brain. Various methods such as electroencephalography (EEG), functional magnetic resonance imaging (FMRI), and magnetoencephalography (MEG) can capture brain activities and structures. EEG signals provide valuable insights into neurological disorders, including drug addiction. Accurate classification of drug addiction from EEG signals relies on appropriate features and channel selection. Choosing the right EEG channels is essential to reduce computational costs and mitigate the risk of overfitting associated with using all available channels. To address the challenge of optimal channel selection in addiction detection from EEG signals, this work employs the shuffled frog leaping algorithm (SFLA). SFLA facilitates the selection of appropriate channels, leading to improved accuracy. Wavelet features extracted from the selected input channel signals are then analyzed using various machine learning classifiers to detect addiction. Experimental results indicate that after selecting features from the appropriate channels, classification accuracy significantly increased across all classifiers. Particularly, the multi-layer perceptron (MLP) classifier combined with SFLA demonstrated a remarkable accuracy improvement of 15.78% while reducing time complexity.
artificial intelligence and data science contents.pptxGauravCar
What is artificial intelligence? Artificial intelligence is the ability of a computer or computer-controlled robot to perform tasks that are commonly associated with the intellectual processes characteristic of humans, such as the ability to reason.
› ...
Artificial intelligence (AI) | Definitio
Comparative analysis between traditional aquaponics and reconstructed aquapon...bijceesjournal
The aquaponic system of planting is a method that does not require soil usage. It is a method that only needs water, fish, lava rocks (a substitute for soil), and plants. Aquaponic systems are sustainable and environmentally friendly. Its use not only helps to plant in small spaces but also helps reduce artificial chemical use and minimizes excess water use, as aquaponics consumes 90% less water than soil-based gardening. The study applied a descriptive and experimental design to assess and compare conventional and reconstructed aquaponic methods for reproducing tomatoes. The researchers created an observation checklist to determine the significant factors of the study. The study aims to determine the significant difference between traditional aquaponics and reconstructed aquaponics systems propagating tomatoes in terms of height, weight, girth, and number of fruits. The reconstructed aquaponics system’s higher growth yield results in a much more nourished crop than the traditional aquaponics system. It is superior in its number of fruits, height, weight, and girth measurement. Moreover, the reconstructed aquaponics system is proven to eliminate all the hindrances present in the traditional aquaponics system, which are overcrowding of fish, algae growth, pest problems, contaminated water, and dead fish.
The CBC machine is a common diagnostic tool used by doctors to measure a patient's red blood cell count, white blood cell count and platelet count. The machine uses a small sample of the patient's blood, which is then placed into special tubes and analyzed. The results of the analysis are then displayed on a screen for the doctor to review. The CBC machine is an important tool for diagnosing various conditions, such as anemia, infection and leukemia. It can also help to monitor a patient's response to treatment.
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Sinan KOZAK
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
Mechanical Engineering on AAI Summer Training Report-003.pdf
Optimization of image compression and ciphering based on EZW techniques
1. TELKOMNIKA Telecommunication, Computing, Electronics and Control
Vol. 18, No. 1, February 2020, pp. 511~518
ISSN: 1693-6930, accredited First Grade by Kemenristekdikti, Decree No: 21/E/KPT/2018
DOI: 10.12928/TELKOMNIKA.v18i1.13092 511
Journal homepage: http://journal.uad.ac.id/index.php/TELKOMNIKA
Optimization of image compression and ciphering
based on EZW techniques
Majid S. Naghmash, Nazar J. Alhyani, Ali M. Kadhim
Iraqi Ministry of Higher Education and Scientific Research, Computer Engineering Techniques Department,
Dijlah University College, Iraq
Article Info ABSTRACT
Article history:
Received May 10, 2019
Revised July 2, 2019
Accepted July 18, 2019
This paper presents the design and optimization of image compression and
ciphering depend on optimized embedded zero tree of wavelet (EZW)
techniques. Nowadays, the compression and ciphering of image have become
particularly important in a protected image storage and communication.
The challenge is put in application for both compression and encryption
where the parameters of images such as quality and size are critical in secure
image transmission. A new technique for secure image storage and
transmission is proposed in this work. The compression is achieved by
remodel the EZW scheme combine with discrete cosine transform (DCT).
Encrypted the XOR ten bits by initial threshold of EZW with random bits
produced from linear-feedback shift register (LFSR). The obtained result
shows that the suggested techniques provide acceptable compression ratio,
reduced the computational time for both compression and encryption,
immunity against the statistical and the frequency attacks.
Keywords:
DCT
Embedded zero tree of wavelet
LFST
Vector quantization
This is an open access article under the CC BY-SA license.
Corresponding Author:
Majid S. Naghmash,
Iraqi Ministry of Higher Education and Scientific Research, Computer Engineering Techniques Department,
Dijlah University College,
Baghdad 00964, Iraq.
Email: majid.salal@duc.edu.iq
1. INTRODUCTION
Numerous technological transformation in the communication system has been presented in last
decade involved each growing internet and explosive improvements ever rapidly increasing of video
transmission [1]. One of the most technologies used of every aspect in multimedia is the data
compression [2]. Without these techniques, the cellular phones could not able to provide efficient
communication with secure path [3]. Large image files distribution remains a vital task within any
communication systems and the data compression is still an important component of available solution for
image creating [4].
In recent years, the compression and encryption of image become marketable with the development
of multimedia. The image conveyance over communication path is susceptible to spying. Consequently,
the transmit image requires dependable, rapidly and safe scheme during establishing and spreading
the image [5]. Generally, the image contents are large and will make their transmission through restricted
capacity channels is challenging. Therefore, the image compression should be considerable prior storage or
transmitted any image. Image compression depends on take out redundancies at image data. During
the image data transmission, the image data exposed to spy on. Consequently, to keep the safety of image
information from unlicensed entrée by encrypted image data become a major task in data transmission.
2. ISSN: 1693-6930
TELKOMNIKA Telecommun Comput El Control, Vol. 18, No. 1, February 2020: 511 - 518
512
The image encryption processing is used a technique to preserve security image. Normally, the image
contents are larger size and the traditional code such as DES, AES, RAS, etc. are not suitable real time
request [6, 7]. This work introduces efficient approach for both ciphering and image compression depends on
modified EZW and DCT. The offered algorithm is use as a basis to find the significant parts acquired by
the compression technique and only these parts are encrypting.
2. RELATED WORK
In general, the standardized image and video move compression such as Motion Picture Experts
Group and Joint Photographic Experts Group are based on DCT transform, which transforms the image
contents from spatial domain to another domain (frequency domain) [8]. The image is subdivided into
blocks and each block is DCT transforms, quantization, the insignificant coefficients are converting to zero.
Finally, Huffman encoding and RLE are applying to every block. The improvement of coding rate with
embedded DCT has been approved within 30% evaluated with JPEG coder by [9] and 5% in mathematics
coder in case of looking at was changed by look at layer. The embedded zero tree wavelet (EZW) is wavelet
transforms the input image to several image transformation schemes. To increase the compression efficiency,
the Huffman encoder is applied on the data out putted from EZW. On other hand, this method causes
increasing in the computational processing time [10].
The effect of chosen threshold value on quality, compression ratio and processing time is examined
by Shingate and Sontakke [11]. Said and Pearlman shows that the quality and compression ratio of image has
been improved by applied set partitioning in hierarchical trees (SPIHT) [12]. Jun and Wells suggested a new
approach to encode the place of wavelet coefficients. This approach called wavelet difference reduction
(WDR) [13]. For image compression ratio based on quantization strategy [14] has been proposed for enhance
compression ratio. The proposal suggested reorganized the DCT coefficients in a hierarchical sub-band
structure form, and generate compressed bit based on zero tree coding algorithms. The results obtained show
that the approach strategy surpasses the JPEG and EZW in term of compression ratio. The image
compression base on joint DCT and DWT has been proposed in [15-17].
In 2010, Shrestha and Wahid proposed an image compression scheme depends on combine DWT
and DCT transforms. The scheme beginning by applied DWT to image block, and throw away/out
the coefficients of high frequencies sub band and then the DCT applied on low frequencies of DWT blocks,
in decoding, zeros values are applied in places of high frequencies sub band coefficients of DWT.
Consequently, there is decay in image quality compared with original image. In [18], Singh and Kumar has
been proposed image compression base on joint DCT and DWT. The approach beginning by applying.
The DCT on elevated frequency sub-bands of stage 5 DWT of the image decomposition. There are various
algorithms have been applied for video and image encryption to keep the contents of them. A joint
compression and encryption for image and video has been demonstrated by [19]. The encryption algorithm
utilized the piece-wise linear disordered charts and arithmetic coding for both compression and encryption.
In [20], Horan and David suggested a nonlinear stream cipher of 5 LFSRs. For image encryption, BEL and
RED suggested a LFSR to product 607 bit from resilient function and nonlinear function [21, 22]. For image
encryption, SRINIVAS and CA have been proposed a cypher based on utilizing random pixel permutation.
Moreover, for video compression and encryption, a demonstration scheme used a vector quantization and
combine DCT and DWT in many researchers as in [23-34].
3. PROPOSED ALGORITHM
The proposal based on joint DCT and EZW algorithms. The suggestion will improve
the compression efficiency and reduce computational cost of EZW. The encryption used selective encryption
concepts to reduce time encryption. Therefore, in this proposal we used the initial threshold of the EZW
algorithm as the significant part and cyphered by LFSR. The concepts of EZW based on chose initial
threshold and comparing with coefficients of DWT decomposition by iterations Morton scan, this processing
will effect on compression efficiency and computational times of encoding method. Our suggestion scheme
using the DCT combines with EZW to reduce the iterated scanning and improve the compression efficiency.
We called this approach improve EZW (IEZW)
3.1. Proposal to improve EZW technique for and encryption image compression
The IEZW compression approach beginning by dividing uncompressed image into blocks size
(8x8) pixels. Then DWT, quantization and DCT are applied respectively. The DCT will rearrange
the significant coefficients (low frequency) with high value are concentrated in the peak left of block and
the elevated incidence with minimum value in the right base of the block that is regrets the progeny.
3. TELKOMNIKA Telecommun Comput El Control
Optimization of image compression and ciphering cased on EZW techniques (Majid S. Naghmash)
513
Accordingly, through EZW indoctrination dispensation the close relative is frequently bigger than offspring.
This scheme IEZW will make better the compression ratio and computational time of encoding. Eventually
the EZW is applied and for more compression we used lossless compression such as Huffman coding.
Generally, there are two kinds of ciphers for image encryption, stream and block cipher. The block cipher is
more efficient than steam cipher. On other hand, the stream cipher is effective for image encryption because
the simplicity and less computational time. Furthermore, in this proposal we used the selective encryption
concepts to reduce the encryption processing. In IEZW compression processing, the coding depends on
the initial threshold to produce sequence data of IEZW. Therefore, we encrypted only the initial threshold by
ciphering with ten bits outputted from LFSR as shown in Figure 1. The steps of suggested IEZW are
illustrated in the following:
a. Subdivision the image into blocks size (8x8) pixels
b. Decompose each block by DWT, DCT and quantize respectively
c. Implement EZW
d. Outputted data of EZW encoding by entropy encoding (Huffman encoding)
e. Every block is ciphered by 10 bits of XOP produced from LFSR as initial threshold
f. The compressed information and ciphering will send to the transmitter.
The block diagram of IEZW is illustrated in Figure 1. The decompression picture is recovered by
reversing the compression scheme.
Figure 1. The scheme diagram of proposed IEZW
4. EXPERIMENTAL RESULTS
To assess the performance of our proposal IEZW scheme with original EZW algorithm, we shall
compare the performance between them. We used 30 various images have size (258x320) pixels tested by
means of quality, ratio of compression and the time of inspired processing. All tested pictures were changed
to grey scale as illustrated in Figure 2. For IEZW implementation, the MATLAB environments have been
used in this work.
4.1. Compression analysis
Figure 3 illustrate the presentation of IEZW and EZW in term of CR, PSNR and consume time.
Generally, it can observe that the quality (represented by PSNR) of IEZW is better than EZW. For example,
the archived quality of second image of IEZW is less than in EZW, but the IEZW fulfilled CR better than
EZW technique as illustrated in Table 1 and Figure 3. The encoding computational time of IEZW is less than
default EZW for all tested images. In general, the results showed that DWT combine with DCT enhance
quality, encoding time and compression ratio.
Furthermore, Figures 3 and Figure 4 show the performance of rate distortion and PSNR of all tested
images. These figures illustrated that IEZW outperformance EZW in bit rate and PSNR. There was special
case in image 28; it has limited texture and relatively smoother background compared with other tested
images.
4.2. Encryption analysis
This part contain analyzed and examine the presentation of suggested encryption depend on two
analyses: histogram and correlation analysis. The utilization of histogram is analysis to evaluate any statically
attack. Figure 5 shows some images chosen from 30 images; the figure illustrates the histograms of
the chosen images after encryption and decryption. It can be seen that the histograms of original images are
completely different from encrypted images and does not given information used for statistical attack.
4.3. Correlation analysis
Between any two variables, the relationship between then is called a correlation. Accordingly,
the association between two adjacent pixels becomes difficult in case of correlation among them approach is
4. ISSN: 1693-6930
TELKOMNIKA Telecommun Comput El Control, Vol. 18, No. 1, February 2020: 511 - 518
514
zero and their relation becomes not easy. Therefore, to approximate the correlation among two neighboring
pixels, in two directions inside image, we selected randomly 1000 pairs of two pixels vertically and
horizontally contiguous from the raw and encrypted image. Then, the correlation between these pairs is
calculated based on subsequent (1):
(1)
where y and x are the worth of 2 adjoining pixels and N represent the whole numeral of pixels within
the picture. From Table 2, It can be seen that the correlation between two adjacent pixels of the raw image
equal to one or near to one. On other hand, the correlation of the ciphered image is tending to zero.
Images 1 to 5
Images 6 to 10
Images 11 to 15
Images 16 to 20
Images 21 to 25
Images 26 to 30
Figure 2. Shows raw test image
6. ISSN: 1693-6930
TELKOMNIKA Telecommun Comput El Control, Vol. 18, No. 1, February 2020: 511 - 518
516
Figure 4. Comparison between rate-distortion curves achieved with IEZW and EZW
Washington
Original
Image
Histogram of
Original
Image
Encrypted
Image
Histogram of
Encrypted
Image
Cameraman
Original
Image
Histogram of
Original
Image
Encrypted
Image
Histogram of
Encrypted
Image
Dollar
Original
Image
Histogram of
Original
Image
Encrypted
Image
Histogram of
Encrypted
Image
Figure 5. Shows the diffrence between histogram of original and encrypted image
7. TELKOMNIKA Telecommun Comput El Control
Optimization of image compression and ciphering cased on EZW techniques (Majid S. Naghmash)
517
Table 2. The correlation coefficient of original and ciphered image
Image
Original image Encrypted image
Correlation coefficients Correlation coefficients Correlation coefficients Correlation coefficients
Horizontal Vertical Horizontal Vertical
Images-1 0.578911 0.9309 -0.00552 -0.0037
Images-2 -1 -1 -0.00242 -0.0026
Images-3 -1 -1 -0.00063 -0.0011
Images-4 -0.9503 -1 -0.00199 -0.0016
Images-5 -1 -1 -0.00122 -0.0015
Images-6 -1 -0.9997 -0.01235 -0.0139
Images-7 0.7646 1 -0.00389 -0.0017
Images-8 -1 -1 -0.00230 -0.0036
Images-9 -1 -1 -0.00602 -0.0011
Images-10 -1 -1 -0.00315 -0.0016
Images-11 -1 -0.9998 -0.00262 -0.0023
Images-12 -1 -1 -0.00283 -0.0027
Images-13 0.800438 0.9826 -0.00663 -0.0022
Images-14 -1 -1 -0.00134 -0.0013
Images-15 -1 -1 -0.00275 -0.0018
Images-16 0.74123 1 -0.00216 -0.0012
Images-17 -1 0.9083 -0.00341 -0.0009
Images-18 -0.99924 -0.9990 -0.00533 -0.0017
Images-19 -0.9990 -1 -0.00266 -0.0009
Images-20 0.6175 0.7398 -0.00334 -0.0011
Images-21 -0.9206 -0.9985 -0.00151 -0.0014
Images-22 -1 -1 -0.00247 -0.0008
Images-23 0.8081 1 -0.00231 -0.0011
Images-24 0.89205 0.6231 -0.00213 -0.0012
Images-25 -1 -1 -0.00209 -0.0011
Images-26 -0.99995 0.9999 -0.00223 -0.0015
Images-27 -1 -0.8775 -0.00267 -0.0013
Images-28 0.6411 0.5487 -0.00359 -0.0012
Images-29 -0.99965 -1.0001 -0.00214 -0.0015
Images-30 0.84279 -1.0000 -0.00096 -0.0018
5. CONCLUSION
This paper introduces combined algorithms of DCT and EZW to improve the image encryption and
compression. The repeated numbers of scan loop has been reduced by DCT to improve the EWZ algorithms
which will reduce the computational time of compression compared with EWZ algorithms. The encryption
algorithms implemented the selective encryption concepts by exploit initial threshold of IEZW as significant
part and encrypted by XOR with bits formed by LFSR. Results show that the encryption approach is
resistance to the arithmetical and the frequency bothers.
REFERENCES
[1] D. Ravichandran, P. Praveenkumar, J. B. B. Rayappan, and R. Amirtharajan, “Chaos based crossover and mutation
for securing DICOM image,” Computers in Biology and Medicine, vol. 72, pp. 170-184, 2016.
[2] Zhang, M.; Tong, X., “Joint image encryption and compression scheme based on IWT and SPIHT,” Optics and
Lasers in Engineering, vol. 90, pp. 254–274, 2017.
[3] Stoyanov B., Kordov K., “Novel secure pseudo-random number generation scheme based on two tinkerbell maps,”
Advanced Studies in Theoretical Physics, vol. 9, no. 4, pp. 411–421, 2015.
[4] Stoyanov B., Kordov K., “A novel pseudorandom bit generator based on Chirikov standard map filtered with
shrinking rule,” Mathematical Problem in Engineering, vol. 2014, pp. 1-4, 2014.
[5] C. Wu and C. Kuo, "Design of integrated multimedia compression and encryption systems," IEEE Transactions on
Multimedia, vol. 7, no. 5, pp. 828-839, 2005.
[6] A. Uhl, A. Pommer, “Image and video encryption: from digital rights management to secured personal
communication, Springer, vol. 15, 2005.
[7] S. Li, X. Zheng, X. Mou and Y. Cai, "Chaotic encryption scheme for real-time digital video," Proc. SPIE 4666,
Real-Time Imaging VI, 2002, https://doi.org/10.1117/12.458527.
[8] K. Cabeen, P. Gent, "Image compression and the discrete cosine transform," College of Redwoods, Department of
Mathematics, The Chinese University of Hong Kong, 1998.
[9] J. Li, J. Li, C. Kuo, "Embedded DCT Still Image Compression," Signal and Information Display, 1996.
[10] R. Janaki, A. Tamilarasi and others, "Still Image Compression by Combining EZW Encoding with Huffman
Encoder," International Journal of Computer Applications, vol. 13, no. 7, pp. 1-7, 2011.
[11] V. Shingate, T. Sontakke and S. Talbar, "Still Image Compression using Embedded Zerotree Wavelet Encoding,"
International Journal of Computer Science & Communication, vol. 1, no. 1, pp. 21-24, 2010.
8. ISSN: 1693-6930
TELKOMNIKA Telecommun Comput El Control, Vol. 18, No. 1, February 2020: 511 - 518
518
[12] A. Said, W. Pearlman, "A new, fast, and efficient image codec based on set partitioning in hierarchical trees," IEEE
Transactions on Circuits and Systems for Video Technology, vol. 6, no. 3, pp. 243-250, 1996.
[13] J. Tian, R. W. Jr, "A lossy image codec based on index coding," Proceedings of Data Compression Conference -
DCC '96, 1996.
[14] D. Monro, G. Dickson, "Zerotree Coding of DCT coefficients," Proceedings of International Conference on Image
Processing, vol. 2, pp. 625-628, 1997.
[15] S. Shrestha, K. Wahid, "Hybrid DWT-DCT algorithm for biomedical image and video compression applications,"
10th
International Conference on Information Science, Signal Processing and their Applications (ISSPA 2010),
2010.
[16] S. Benchikh, M. Corinthios, "A hybrid image compression technique based on DWT and DCT transforms,"
International Conference on Advanced Infocom Technology 2011 (ICAIT 2011), 2011.
[17] S. Singh, V. Kumar and H. Verma, "DWT-DCT hybrid scheme for medical image compression," Journal of
Medical Engineering & Technology, vol. 31, no. 2, pp. 109-122, 2007.
[18] A. Pande, P. Mohapatra and J. Zambreno, "Using chaotic maps for encrypting image and video content," 2011
IEEE International Symposium on Multimedia, 2011.
[19] D. Horan, R. Guinee, "A novel stream cipher for cryptographic applications," MILCOM 2006 - 2006 IEEE Military
Communications conference, 2006.
[20] D. Nadir, R. Mohamed, F. Banhawi, N. M. Ali, H. M. Judi, S. Venkateswari, R. Muthaiah, B. Thamotharan,
M. Menaka and others, "An image encryption approach using stream ciphers based on nonlinear filter generator,"
Journal of Theoretical and Applied Information Technology, vol. 41, no. 1, 2012.
[21] G. Sathishkumar, S. Ramachandran and K. B. Bagan, "Image encryption using random pixel permutation by
chaotic mapping," 2012 IEEE Symposium on Computers & Informatics (ISCI), 2012.
[22] Nasrullah, et al., "Joint Image Compression and Encryption Using IWT with SPIHT, Kd-Tree and Chaotic Maps,
Applied Science, vol. 8, no. 10, 2018, doi:10.3390/app8101963
[23] Padmavati S, Vaibhar M., “DCT combined with fractal quadtree decomposition and Huffman coding for image
compression,” 2015 International Conference on Condition Assessment Techniques in Electrical Systems
(CATCON), pp. 28-33, 2015.
[24] Kamisli F., “Block-based spatial prediction and transforms based on 2D Markov processes for image and video
compression,” IEEE Transactions on Image Processing, vol. 24, no. 4, pp. 1247-1260, 2015.
[25] G. S. Chandel and P. Patel, "Image Encryption with RSA and RGB randomized Histograms," International Journal
of Advanced Research in Electrical, Electronics and Instrumentation Engineering, vol. 3, no. 5, pp. 9750-9757,
2014.
[26] R. U. Ginting and R. Y. Dillak, "Digital color image encryption using RC4 stream cipher and chaotic logistic map,"
2013 International Conference on Information Technology and Electrical Engineering (ICITEE), pp. 101-105,
2013.
[27] W. W. Zhang, et al., "A watermark strategy for quantum images based on quantum fourier transform," Quantum
Information Processing, vol. 12, pp. 793-803, 2013.
[28] C. Sankara Narayanan and S. Annadurai, "A Critical Study on Encryption Based Compression Techniques,"
Journal of Computers, vol. 11, no. 5, pp. 380-389, 2016.
[29] P. Kumar, P. K. Pateriya, "RC4 Enrichment Algorithm Approach for Selective Image Encryption," International
Journal of Computer Science and Communication Networks, 2012.
[30] P. Singh and K. Singh, "Image Encryption and Decryption Using Blowfish Algorithm in Matlab," International
Journal of Scientific & Engineering Research, vol. 4, no. 7, pp. 150-154, 2013.
[31] Y.-G. Yang, et al., "Novel image encryption/decryption based on quantum Fourier transform and double phase
encoding," Quantum information processing, vol. 12, pp. 3477-3493, 2013.
[32] X. Zhang, et al., "Compression of encrypted images with multi-layer decomposition," Multimedia Tools and
Applications, vol. 72, pp. 489–502, 2014.
[33] T. Hoang and D. Tran, "Cryptanalysis and security improvement for selective image encryption," The European
Physical Journal Special Topics, vol. 223, pp. 1635–1646, 2014.
[34] Abdul Jaleel.J and Jisha MaryThomas, "Guarding Images using a Symmetric key Cryptographic Technique:
Blowfish Algorithm," International Journal of Engineering and Innovative Technology (IJEIT), vol. 3, no. 2,
pp. 196-201, 2013.