The document summarizes a novel method for reversible encrypted data concealment in images. The proposed method reserves room in the original image before encryption using a traditional reversible data hiding algorithm like lifting wavelet transform. This makes it easy for a data hider to reversibly embed data in the encrypted image by simply filling the pre-reserved space. The method is compared to previous "vacating room after encryption" methods and shows it can embed over 10 times as large payloads with the same image quality, as well as achieve better performance in terms of PSNR and MSE. Experiments on test images demonstrate the benefits of the proposed "reserving room before encryption" approach.
A NEW ALGORITHM FOR DATA HIDING USING OPAP AND MULTIPLE KEYSEditor IJMTER
Steganography gained significance in the past few years due to the increasing need
for providing secrecy in an open environment like the internet. With almost anyone can
observe the communicated data all around, steganography attempts to hide the very existence
of the message and make communication undetectable. In this paper we propose a modern
technique with Integer Wavelet transform (IWT) and double key to accomplish high hiding
capability, high security and good visual quality. Here cover image is transformed in to
wavelet transform co-efficients and the coefficients are selected randomly by using Key-2 for
embedding the data. Key-1 is used to calculate the number of bits to be embedded in the
randomly selected coefficients. Finally the Optimum Pixel Adjustment Process(OPAP) is
applied to the stego image to reduce the data embedding error.
Comparative Analysis of Lossless Image Compression Based On Row By Row Classi...IJERA Editor
Lossless image compression is needed in many fields like medical imaging, telemetry, geophysics, remote
sensing and other applications, which require exact replica of original image and loss of information is not
tolerable. In this paper, a near lossless image compression algorithm based on row by row classifier with
encoding schemes like Lempel Ziv Welch (LZW), Huffman and Run Length Encoding (RLE) on color images
is proposed. The algorithm divides the image into three parts R, G and B, apply row by row classification on
each part and result of this classification is records in the mask image. After classification the image data is
decomposed into two sequences each for R, G and B and mask image is hidden in them. These sequences are
encoded using different encoding schemes like LZW, Huffman and RLE. An exhaustive comparative analysis is
performed to evaluate these techniques, which reveals that the pro
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.
A High Performance Modified SPIHT for Scalable Image CompressionCSCJournals
In this paper, we present a novel extension technique to the Set Partitioning in Hierarchical Trees (SPIHT) based image compression with spatial scalability. The present modification and the preprocessing techniques provide significantly better quality (both subjectively and objectively) reconstruction at the decoder with little additional computational complexity. There are two proposals for this paper. Firstly, we propose a pre-processing scheme, called Zero-Shifting, that brings the spatial values in signed integer range without changing the dynamic ranges, so that the transformed coefficient calculation becomes more consistent. For that reason, we have to modify the initialization step of the SPIHT algorithms. The experiments demonstrate a significant improvement in visual quality and faster encoding and decoding than the original one. Secondly, we incorporate the idea to facilitate resolution scalable decoding (not incorporated in original SPIHT) by rearranging the order of the encoded output bit stream. During the sorting pass of the SPIHT algorithm, we model the transformed coefficient based on the probability of significance, at a fixed threshold of the offspring. Calling it a fixed context model and generating a Huffman code for each context, we achieve comparable compression efficiency to that of arithmetic coder, but with much less computational complexity and processing time. As far as objective quality assessment of the reconstructed image is concerned, we have compared our results with popular Peak Signal to Noise Ratio (PSNR) and with Structural Similarity Index (SSIM). Both these metrics show that our proposed work is an improvement over the original one.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
High Speed Data Exchange Algorithm in Telemedicine with Wavelet based on 4D M...Dr. Amarjeet Singh
Existing Medical imaging techniques such as fMRI, positron emission tomography (PET), dynamic 3D ultrasound and dynamic computerized tomography yield large amounts of four-dimensional sets. 4D medical data sets are the series of volumetric images netted in time, large in size and demand a great of assets for storage and transmission. Here, in this paper, we present a method wherein 3D image is taken and Discrete Wavelet Transform(DWT) and Dual-Tree Complex Wavelet Transform(DTCWT) techniques are applied separately on it and the image is split into sub-bands. The encoding and decoding are done using 3D-SPIHT, at different bit per pixels(bpp). The reconstructed image is synthesized using Inverse DWT technique. The quality of the compressed image has been evaluated using some factors such as Mean Square Error(MSE) and Peak-Signal to Noise Ratio (PSNR).
A NEW ALGORITHM FOR DATA HIDING USING OPAP AND MULTIPLE KEYSEditor IJMTER
Steganography gained significance in the past few years due to the increasing need
for providing secrecy in an open environment like the internet. With almost anyone can
observe the communicated data all around, steganography attempts to hide the very existence
of the message and make communication undetectable. In this paper we propose a modern
technique with Integer Wavelet transform (IWT) and double key to accomplish high hiding
capability, high security and good visual quality. Here cover image is transformed in to
wavelet transform co-efficients and the coefficients are selected randomly by using Key-2 for
embedding the data. Key-1 is used to calculate the number of bits to be embedded in the
randomly selected coefficients. Finally the Optimum Pixel Adjustment Process(OPAP) is
applied to the stego image to reduce the data embedding error.
Comparative Analysis of Lossless Image Compression Based On Row By Row Classi...IJERA Editor
Lossless image compression is needed in many fields like medical imaging, telemetry, geophysics, remote
sensing and other applications, which require exact replica of original image and loss of information is not
tolerable. In this paper, a near lossless image compression algorithm based on row by row classifier with
encoding schemes like Lempel Ziv Welch (LZW), Huffman and Run Length Encoding (RLE) on color images
is proposed. The algorithm divides the image into three parts R, G and B, apply row by row classification on
each part and result of this classification is records in the mask image. After classification the image data is
decomposed into two sequences each for R, G and B and mask image is hidden in them. These sequences are
encoded using different encoding schemes like LZW, Huffman and RLE. An exhaustive comparative analysis is
performed to evaluate these techniques, which reveals that the pro
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.
A High Performance Modified SPIHT for Scalable Image CompressionCSCJournals
In this paper, we present a novel extension technique to the Set Partitioning in Hierarchical Trees (SPIHT) based image compression with spatial scalability. The present modification and the preprocessing techniques provide significantly better quality (both subjectively and objectively) reconstruction at the decoder with little additional computational complexity. There are two proposals for this paper. Firstly, we propose a pre-processing scheme, called Zero-Shifting, that brings the spatial values in signed integer range without changing the dynamic ranges, so that the transformed coefficient calculation becomes more consistent. For that reason, we have to modify the initialization step of the SPIHT algorithms. The experiments demonstrate a significant improvement in visual quality and faster encoding and decoding than the original one. Secondly, we incorporate the idea to facilitate resolution scalable decoding (not incorporated in original SPIHT) by rearranging the order of the encoded output bit stream. During the sorting pass of the SPIHT algorithm, we model the transformed coefficient based on the probability of significance, at a fixed threshold of the offspring. Calling it a fixed context model and generating a Huffman code for each context, we achieve comparable compression efficiency to that of arithmetic coder, but with much less computational complexity and processing time. As far as objective quality assessment of the reconstructed image is concerned, we have compared our results with popular Peak Signal to Noise Ratio (PSNR) and with Structural Similarity Index (SSIM). Both these metrics show that our proposed work is an improvement over the original one.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
High Speed Data Exchange Algorithm in Telemedicine with Wavelet based on 4D M...Dr. Amarjeet Singh
Existing Medical imaging techniques such as fMRI, positron emission tomography (PET), dynamic 3D ultrasound and dynamic computerized tomography yield large amounts of four-dimensional sets. 4D medical data sets are the series of volumetric images netted in time, large in size and demand a great of assets for storage and transmission. Here, in this paper, we present a method wherein 3D image is taken and Discrete Wavelet Transform(DWT) and Dual-Tree Complex Wavelet Transform(DTCWT) techniques are applied separately on it and the image is split into sub-bands. The encoding and decoding are done using 3D-SPIHT, at different bit per pixels(bpp). The reconstructed image is synthesized using Inverse DWT technique. The quality of the compressed image has been evaluated using some factors such as Mean Square Error(MSE) and Peak-Signal to Noise Ratio (PSNR).
Reversible Data Hiding in Encrypted color images by Reserving Room before Enc...ijceronline
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.
With the enhance in the digital media, modification
and transfer of information is very easy. So this
work focus on transferring data by hiding in the
image. Here a robust approach is achieved by using
the skew tent map as an encryption/ decryption
algorithm at the sender and receiver side. In this
work image is transformed into inverse S-order as
the initial step of the work so little confusion can be
created for the intruder. Here whole data hiding is
done by modifying by using the modified histogram
shifting method. This approach was utilized to the
point that hiding information and image can be
effectively recovered with no information loss. An
investigation is done on the genuine dataset image.
Assessment parameter esteems and demonstrates
that the proposed work has kept up the SNR, PSNR,
Throughput, Data Hiding Execution Time and
Extraction Time values with high security of the
information.
Data Steganography for Optical Color Image CryptosystemsCSCJournals
In this paper, an optical color image cryptosystem with a data hiding scheme is proposed. In the proposed optical cryptosystem, a confidential color image is embedded into the host image of the same size. Then the stego-image is encrypted by using the double random phase encoding algorithm. The seeds to generate random phase data are hidden in the encrypted stego-image by a content-dependent and low distortion data embedding technique. The confidential image and secret data delivery is accomplished by hiding the image into the host image and embedding the data into the encrypted stego-image. Experimental results show that the proposed data steganographic cryptosystem provides large data hiding capacity and high reconstructed image quality.
An Efficient Block Matching Algorithm Using Logical ImageIJERA Editor
Motion estimation, which has been widely used in various image sequence coding schemes, plays a key role in the transmission and storage of video signals at reduced bit rates. There are two classes of motion estimation methods, Block matching algorithms (BMA) and Pel-recursive algorithms (PRA). Due to its implementation simplicity, block matching algorithms have been widely adopted by various video coding standards such as CCITT H.261, ITU-T H.263, and MPEG. In BMA, the current image frame is partitioned into fixed-size rectangular blocks. The motion vector for each block is estimated by finding the best matching block of pixels within the search window in the previous frame according to matching criteria. The goal of this work is to find a fast method for motion estimation and motion segmentation using proposed model. Recent day Communication between ends is facilitated by the development in the area of wired and wireless networks. And it is a challenge to transmit large data file over limited bandwidth channel. Block matching algorithms are very useful in achieving the efficient and acceptable compression. Block matching algorithm defines the total computation cost and effective bit budget. To efficiently obtain motion estimation different approaches can be followed but above constraints should be kept in mind. This paper presents a novel method using three step and diamond algorithms with modified search pattern based on logical image for the block based motion estimation. It has been found that, the improved PSNR value obtained from proposed algorithm shows a better computation time (faster) as compared to original Three step Search (3SS/TSS ) method .The experimental results based on the number of video sequences were presented to demonstrate the advantages of proposed motion estimation technique.
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.
A REGULARIZED ROBUST SUPER-RESOLUTION APPROACH FORALIASED IMAGES AND LOW RESO...cscpconf
This paper presents a hybrid approach for images and video super-resolution. We have proposed the approach for enhancing the resolution of images and low resolution, under
sampled videos. We exploited the shift and motion based robust super-resolution (SR)algorithm [1] and the diffusion image regularization method proposed in [2] to obtain the alias free and jerk free smooth SR image.We presented a framework for obtaining super-resolution video thatis robust,even in the presence of fast changing video frames. Wecompare our hybrid
approach framework’s simulation results with different resolution enhancement techniques i.e. Robust Super-resolution, IBP and Interpolation methods reported in the literature. This
approach shows good results in term of different quality parameters.
Secured Reversible Data Hiding In Encrypted Images Using Hyper ChaosCSCJournals
Recently, more and more attention is paid to reversible data hiding (RDH) in encrypted images, since it maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while protecting the image content’s confidentiality. All previous methods embed data by reversibly vacating room from the encrypted images, which may be subject to some errors on data extraction and/or image restoration. Here a novel method is proposed by reserving room before encryption with a traditional RDH algorithm, and thus it is easy for the data hider to reversibly embed data in the encrypted image. Moreover data to be embedded is shuffled using a hyper chaotic function which is difficult to be extracted from the stego image without original key. A digital water mark is also embedded which ensures integrity of the data. The proposed method has been validated against three other available RDH schemes and it is observed that the proposed scheme outperforms these RDH schemes both in visual quality and payload. The proposed method can achieve real reversibility, that is, data extraction and image recovery are free of any error.
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.
Reversible Data Hiding in Encrypted color images by Reserving Room before Enc...ijceronline
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.
With the enhance in the digital media, modification
and transfer of information is very easy. So this
work focus on transferring data by hiding in the
image. Here a robust approach is achieved by using
the skew tent map as an encryption/ decryption
algorithm at the sender and receiver side. In this
work image is transformed into inverse S-order as
the initial step of the work so little confusion can be
created for the intruder. Here whole data hiding is
done by modifying by using the modified histogram
shifting method. This approach was utilized to the
point that hiding information and image can be
effectively recovered with no information loss. An
investigation is done on the genuine dataset image.
Assessment parameter esteems and demonstrates
that the proposed work has kept up the SNR, PSNR,
Throughput, Data Hiding Execution Time and
Extraction Time values with high security of the
information.
Data Steganography for Optical Color Image CryptosystemsCSCJournals
In this paper, an optical color image cryptosystem with a data hiding scheme is proposed. In the proposed optical cryptosystem, a confidential color image is embedded into the host image of the same size. Then the stego-image is encrypted by using the double random phase encoding algorithm. The seeds to generate random phase data are hidden in the encrypted stego-image by a content-dependent and low distortion data embedding technique. The confidential image and secret data delivery is accomplished by hiding the image into the host image and embedding the data into the encrypted stego-image. Experimental results show that the proposed data steganographic cryptosystem provides large data hiding capacity and high reconstructed image quality.
An Efficient Block Matching Algorithm Using Logical ImageIJERA Editor
Motion estimation, which has been widely used in various image sequence coding schemes, plays a key role in the transmission and storage of video signals at reduced bit rates. There are two classes of motion estimation methods, Block matching algorithms (BMA) and Pel-recursive algorithms (PRA). Due to its implementation simplicity, block matching algorithms have been widely adopted by various video coding standards such as CCITT H.261, ITU-T H.263, and MPEG. In BMA, the current image frame is partitioned into fixed-size rectangular blocks. The motion vector for each block is estimated by finding the best matching block of pixels within the search window in the previous frame according to matching criteria. The goal of this work is to find a fast method for motion estimation and motion segmentation using proposed model. Recent day Communication between ends is facilitated by the development in the area of wired and wireless networks. And it is a challenge to transmit large data file over limited bandwidth channel. Block matching algorithms are very useful in achieving the efficient and acceptable compression. Block matching algorithm defines the total computation cost and effective bit budget. To efficiently obtain motion estimation different approaches can be followed but above constraints should be kept in mind. This paper presents a novel method using three step and diamond algorithms with modified search pattern based on logical image for the block based motion estimation. It has been found that, the improved PSNR value obtained from proposed algorithm shows a better computation time (faster) as compared to original Three step Search (3SS/TSS ) method .The experimental results based on the number of video sequences were presented to demonstrate the advantages of proposed motion estimation technique.
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.
A REGULARIZED ROBUST SUPER-RESOLUTION APPROACH FORALIASED IMAGES AND LOW RESO...cscpconf
This paper presents a hybrid approach for images and video super-resolution. We have proposed the approach for enhancing the resolution of images and low resolution, under
sampled videos. We exploited the shift and motion based robust super-resolution (SR)algorithm [1] and the diffusion image regularization method proposed in [2] to obtain the alias free and jerk free smooth SR image.We presented a framework for obtaining super-resolution video thatis robust,even in the presence of fast changing video frames. Wecompare our hybrid
approach framework’s simulation results with different resolution enhancement techniques i.e. Robust Super-resolution, IBP and Interpolation methods reported in the literature. This
approach shows good results in term of different quality parameters.
Secured Reversible Data Hiding In Encrypted Images Using Hyper ChaosCSCJournals
Recently, more and more attention is paid to reversible data hiding (RDH) in encrypted images, since it maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while protecting the image content’s confidentiality. All previous methods embed data by reversibly vacating room from the encrypted images, which may be subject to some errors on data extraction and/or image restoration. Here a novel method is proposed by reserving room before encryption with a traditional RDH algorithm, and thus it is easy for the data hider to reversibly embed data in the encrypted image. Moreover data to be embedded is shuffled using a hyper chaotic function which is difficult to be extracted from the stego image without original key. A digital water mark is also embedded which ensures integrity of the data. The proposed method has been validated against three other available RDH schemes and it is observed that the proposed scheme outperforms these RDH schemes both in visual quality and payload. The proposed method can achieve real reversibility, that is, data extraction and image recovery are free of any error.
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.
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.
Image Encryption Using Differential Evolution Approach in Frequency Domainsipij
This paper presents a new effective method for image encryption which employs magnitude and phase manipulation using Differential Evolution (DE) approach. The novelty of this work lies in deploying the concept of keyed discrete Fourier transform (DFT) followed by DE operations for encryption purpose. To this end, a secret key is shared between both encryption and decryption sides. Firstly two dimensional (2-D) keyed discrete Fourier transform is carried out on the original image to be encrypted. Secondly crossover is performed between two components of the encrypted image, which are selected based on Linear Feedback Shift Register (LFSR) index generator. Similarly, keyed mutation is performed on the real parts of a certain components selected based on LFSR index generator. The LFSR index generator initializes it seed with the shared secret key to ensure the security of the resulting indices. The process shuffles the positions of image pixels. A new image encryption scheme based on the DE approach is developed which is composed with a simple diffusion mechanism. The deciphering process is an invertible process using the same key. The resulting encrypted image is found to be fully distorted, resulting in increasing the robustness of the proposed work. The simulation results validate the proposed image encryption scheme.
Reversible Encrypytion and Information ConcealmentIJERA Editor
Recently, a lot of attention is paid to reversible data hiding (RDH) in encrypted pictures, since it maintains the wonderful property that the initial image cover will be losslessly recovered when embedded data is extracted, whereas protects the image content that is need to be kept confidential. Other techniques used antecedently are to embed data by reversibly vacating area from the pictures, that area unit been encryted, may cause some errors on information extraction or image restoration. In this paper, we propose a unique methodology by reserving room before secret writing (i.e reserving room before encryption) with a conventional RDH algorithmic rule, and thus it becomes straightforward for hider to reversibly embed data in the encrypted image. The projected methodology is able to implement real reversibility, that is, information extraction and image recovery area unit free of any error. This methodology embedds larger payloads for constant image quality than the antecedently used techniques, like for PSNR= 40db.
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.
Abstract: The increasing amount of applications using digital multimedia technologies has accentuated the need to provide copyright protection to multimedia data. This paper reviews one of the data hiding techniques - digital image watermarking. Through this paper we will explore some basic concepts of digital image watermarking techniques.Two different methods of digital image watermarking namely spatial domain watermarking and transform domain watermarking are briefly discussed in this paper. Furthermore, two different algorithms for a digital image watermarking have also been discussed. Also the comparision between the different algorithms,tests performed for the robustness and the applications of the digital image watermarking have also been discussed.
A Novel Technique for Image Steganography Based on DWT and Huffman EncodingCSCJournals
Image steganography is the art of hiding information into a cover image. This paper presents a novel technique for Image steganography based on DWT, where DWT is used to transform original image (cover image) from spatial domain to frequency domain. Firstly two dimensional Discrete Wavelet Transform (2-D DWT) is performed on a gray level cover image of size M × N and Huffman encoding is performed on the secret messages/image before embedding. Then each bit of Huffman code of secret message/image is embedded in the high frequency coefficients resulted from Discrete Wavelet Transform. Image quality is to be improved by preserving the wavelet coefficients in the low frequency sub-band. The experimental results show that the algorithm has a high capacity and a good invisibility. Moreover PSNR of cover image with stego-image shows the better results in comparison with other existing steganography approaches. Furthermore, satisfactory security is maintained since the secret message/image cannot be extracted without knowing decoding rules and Huffman table.
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.
Similar to Reversible encrypted data concealment in images by reserving room approach (20)
Submission Deadline: 30th September 2022
Acceptance Notification: Within Three Days’ time period
Online Publication: Within 24 Hrs. time Period
Expected Date of Dispatch of Printed Journal: 5th October 2022
MODELING AND ANALYSIS OF SURFACE ROUGHNESS AND WHITE LATER THICKNESS IN WIRE-...IAEME Publication
White layer thickness (WLT) formed and surface roughness in wire electric discharge turning (WEDT) of tungsten carbide composite has been made to model through response surface methodology (RSM). A Taguchi’s standard Design of experiments involving five input variables with three levels has been employed to establish a mathematical model between input parameters and responses. Percentage of cobalt content, spindle speed, Pulse on-time, wire feed and pulse off-time were changed during the experimental tests based on the Taguchi’s orthogonal array L27 (3^13). Analysis of variance (ANOVA) revealed that the mathematical models obtained can adequately describe performance within the parameters of the factors considered. There was a good agreement between the experimental and predicted values in this study.
A STUDY ON THE REASONS FOR TRANSGENDER TO BECOME ENTREPRENEURSIAEME Publication
The study explores the reasons for a transgender to become entrepreneurs. In this study transgender entrepreneur was taken as independent variable and reasons to become as dependent variable. Data were collected through a structured questionnaire containing a five point Likert Scale. The study examined the data of 30 transgender entrepreneurs in Salem Municipal Corporation of Tamil Nadu State, India. Simple Random sampling technique was used. Garrett Ranking Technique (Percentile Position, Mean Scores) was used as the analysis for the present study to identify the top 13 stimulus factors for establishment of trans entrepreneurial venture. Economic advancement of a nation is governed upon the upshot of a resolute entrepreneurial doings. The conception of entrepreneurship has stretched and materialized to the socially deflated uncharted sections of transgender community. Presently transgenders have smashed their stereotypes and are making recent headlines of achievements in various fields of our Indian society. The trans-community is gradually being observed in a new light and has been trying to achieve prospective growth in entrepreneurship. The findings of the research revealed that the optimistic changes are taking place to change affirmative societal outlook of the transgender for entrepreneurial ventureship. It also laid emphasis on other transgenders to renovate their traditional living. The paper also highlights that legislators, supervisory body should endorse an impartial canons and reforms in Tamil Nadu Transgender Welfare Board Association.
BROAD UNEXPOSED SKILLS OF TRANSGENDER ENTREPRENEURSIAEME Publication
Since ages gender difference is always a debatable theme whether caused by nature, evolution or environment. The birth of a transgender is dreadful not only for the child but also for their parents. The pain of living in the wrong physique and treated as second class victimized citizen is outrageous and fully harboured with vicious baseless negative scruples. For so long, social exclusion had perpetuated inequality and deprivation experiencing ingrained malign stigma and besieged victims of crime or violence across their life spans. They are pushed into the murky way of life with a source of eternal disgust, bereft sexual potency and perennial fear. Although they are highly visible but very little is known about them. The common public needs to comprehend the ravaged arrogance on these insensitive souls and assist in integrating them into the mainstream by offering equal opportunity, treat with humanity and respect their dignity. Entrepreneurship in the current age is endorsing the gender fairness movement. Unstable careers and economic inadequacy had inclined one of the gender variant people called Transgender to become entrepreneurs. These tiny budding entrepreneurs resulted in economic transition by means of employment, free from the clutches of stereotype jobs, raised standard of living and handful of financial empowerment. Besides all these inhibitions, they were able to witness a platform for skill set development that ignited them to enter into entrepreneurial domain. This paper epitomizes skill sets involved in trans-entrepreneurs of Thoothukudi Municipal Corporation of Tamil Nadu State and is a groundbreaking determination to sightsee various skills incorporated and the impact on entrepreneurship.
DETERMINANTS AFFECTING THE USER'S INTENTION TO USE MOBILE BANKING APPLICATIONSIAEME Publication
The banking and financial services industries are experiencing increased technology penetration. Among them, the banking industry has made technological advancements to better serve the general populace. The economy focused on transforming the banking sector's system into a cashless, paperless, and faceless one. The researcher wants to evaluate the user's intention for utilising a mobile banking application. The study also examines the variables affecting the user's behaviour intention when selecting specific applications for financial transactions. The researcher employed a well-structured questionnaire and a descriptive study methodology to gather the respondents' primary data utilising the snowball sampling technique. The study includes variables like performance expectations, effort expectations, social impact, enabling circumstances, and perceived risk. Each of the aforementioned variables has a major impact on how users utilise mobile banking applications. The outcome will assist the service provider in comprehending the user's history with mobile banking applications.
ANALYSE THE USER PREDILECTION ON GPAY AND PHONEPE FOR DIGITAL TRANSACTIONSIAEME Publication
Technology upgradation in banking sector took the economy to view that payment mode towards online transactions using mobile applications. This system enabled connectivity between banks, Merchant and user in a convenient mode. there are various applications used for online transactions such as Google pay, Paytm, freecharge, mobikiwi, oxygen, phonepe and so on and it also includes mobile banking applications. The study aimed at evaluating the predilection of the user in adopting digital transaction. The study is descriptive in nature. The researcher used random sample techniques to collect the data. The findings reveal that mobile applications differ with the quality of service rendered by Gpay and Phonepe. The researcher suggest the Phonepe application should focus on implementing the application should be user friendly interface and Gpay on motivating the users to feel the importance of request for money and modes of payments in the application.
VOICE BASED ATM FOR VISUALLY IMPAIRED USING ARDUINOIAEME Publication
The prototype of a voice-based ATM for visually impaired using Arduino is to help people who are blind. This uses RFID cards which contain users fingerprint encrypted on it and interacts with the users through voice commands. ATM operates when sensor detects the presence of one person in the cabin. After scanning the RFID card, it will ask to select the mode like –normal or blind. User can select the respective mode through voice input, if blind mode is selected the balance check or cash withdraw can be done through voice input. Normal mode procedure is same as the existing ATM.
IMPACT OF EMOTIONAL INTELLIGENCE ON HUMAN RESOURCE MANAGEMENT PRACTICES AMONG...IAEME Publication
There is increasing acceptability of emotional intelligence as a major factor in personality assessment and effective human resource management. Emotional intelligence as the ability to build capacity, empathize, co-operate, motivate and develop others cannot be divorced from both effective performance and human resource management systems. The human person is crucial in defining organizational leadership and fortunes in terms of challenges and opportunities and walking across both multinational and bilateral relationships. The growing complexity of the business world requires a great deal of self-confidence, integrity, communication, conflict and diversity management to keep the global enterprise within the paths of productivity and sustainability. Using the exploratory research design and 255 participants the result of this original study indicates strong positive correlation between emotional intelligence and effective human resource management. The paper offers suggestions on further studies between emotional intelligence and human capital development and recommends for conflict management as an integral part of effective human resource management.
VISUALISING AGING PARENTS & THEIR CLOSE CARERS LIFE JOURNEY IN AGING ECONOMYIAEME Publication
Our life journey, in general, is closely defined by the way we understand the meaning of why we coexist and deal with its challenges. As we develop the "inspiration economy", we could say that nearly all of the challenges we have faced are opportunities that help us to discover the rest of our journey. In this note paper, we explore how being faced with the opportunity of being a close carer for an aging parent with dementia brought intangible discoveries that changed our insight of the meaning of the rest of our life journey.
A STUDY ON THE IMPACT OF ORGANIZATIONAL CULTURE ON THE EFFECTIVENESS OF PERFO...IAEME Publication
The main objective of this study is to analyze the impact of aspects of Organizational Culture on the Effectiveness of the Performance Management System (PMS) in the Health Care Organization at Thanjavur. Organizational Culture and PMS play a crucial role in present-day organizations in achieving their objectives. PMS needs employees’ cooperation to achieve its intended objectives. Employees' cooperation depends upon the organization’s culture. The present study uses exploratory research to examine the relationship between the Organization's culture and the Effectiveness of the Performance Management System. The study uses a Structured Questionnaire to collect the primary data. For this study, Thirty-six non-clinical employees were selected from twelve randomly selected Health Care organizations at Thanjavur. Thirty-two fully completed questionnaires were received.
Living in 21st century in itself reminds all of us the necessity of police and its administration. As more and more we are entering into the modern society and culture, the more we require the services of the so called ‘Khaki Worthy’ men i.e., the police personnel. Whether we talk of Indian police or the other nation’s police, they all have the same recognition as they have in India. But as already mentioned, their services and requirements are different after the like 26th November, 2008 incidents, where they without saving their own lives has sacrificed themselves without any hitch and without caring about their respective family members and wards. In other words, they are like our heroes and mentors who can guide us from the darkness of fear, militancy, corruption and other dark sides of life and so on. Now the question arises, if Gandhi would have been alive today, what would have been his reaction/opinion to the police and its functioning? Would he have some thing different in his mind now what he had been in his mind before the partition or would he be going to start some Satyagraha in the form of some improvement in the functioning of the police administration? Really these questions or rather night mares can come to any one’s mind, when there is too much confusion is prevailing in our minds, when there is too much corruption in the society and when the polices working is also in the questioning because of one or the other case throughout the India. It is matter of great concern that we have to thing over our administration and our practical approach because the police personals are also like us, they are part and parcel of our society and among one of us, so why we all are pin pointing towards them.
A STUDY ON TALENT MANAGEMENT AND ITS IMPACT ON EMPLOYEE RETENTION IN SELECTED...IAEME Publication
The goal of this study was to see how talent management affected employee retention in the selected IT organizations in Chennai. The fundamental issue was the difficulty to attract, hire, and retain talented personnel who perform well and the gap between supply and demand of talent acquisition and retaining them within the firms. The study's main goals were to determine the impact of talent management on employee retention in IT companies in Chennai, investigate talent management strategies that IT companies could use to improve talent acquisition, performance management, career planning and formulate retention strategies that the IT firms could use. The respondents were given a structured close-ended questionnaire with the 5 Point Likert Scale as part of the study's quantitative research design. The target population consisted of 289 IT professionals. The questionnaires were distributed and collected by the researcher directly. The Statistical Package for Social Sciences (SPSS) was used to collect and analyse the questionnaire responses. Hypotheses that were formulated for the various areas of the study were tested using a variety of statistical tests. The key findings of the study suggested that talent management had an impact on employee retention. The studies also found that there is a clear link between the implementation of talent management and retention measures. Management should provide enough training and development for employees, clarify job responsibilities, provide adequate remuneration packages, and recognise employees for exceptional performance.
ATTRITION IN THE IT INDUSTRY DURING COVID-19 PANDEMIC: LINKING EMOTIONAL INTE...IAEME Publication
Globally, Millions of dollars were spent by the organizations for employing skilled Information Technology (IT) professionals. It is costly to replace unskilled employees with IT professionals possessing technical skills and competencies that aid in interconnecting the business processes. The organization’s employment tactics were forced to alter by globalization along with technological innovations as they consistently diminish to remain lean, outsource to concentrate on core competencies along with restructuring/reallocate personnel to gather efficiency. As other jobs, organizations or professions have become reasonably more appropriate in a shifting employment landscape, the above alterations trigger both involuntary as well as voluntary turnover. The employee view on jobs is also afflicted by the COVID-19 pandemic along with the employee-driven labour market. So, having effective strategies is necessary to tackle the withdrawal rate of employees. By associating Emotional Intelligence (EI) along with Talent Management (TM) in the IT industry, the rise in attrition rate was analyzed in this study. Only 303 respondents were collected out of 350 participants to whom questionnaires were distributed. From the employees of IT organizations located in Bangalore (India), the data were congregated. A simple random sampling methodology was employed to congregate data as of the respondents. Generating the hypothesis along with testing is eventuated. The effect of EI and TM along with regression analysis between TM and EI was analyzed. The outcomes indicated that employee and Organizational Performance (OP) were elevated by effective EI along with TM.
INFLUENCE OF TALENT MANAGEMENT PRACTICES ON ORGANIZATIONAL PERFORMANCE A STUD...IAEME Publication
By implementing talent management strategy, organizations would have the option to retain their skilled professionals while additionally working on their overall performance. It is the course of appropriately utilizing the ideal individuals, setting them up for future top positions, exploring and dealing with their performance, and holding them back from leaving the organization. It is employee performance that determines the success of every organization. The firm quickly obtains an upper hand over its rivals in the event that its employees having particular skills that cannot be duplicated by the competitors. Thus, firms are centred on creating successful talent management practices and processes to deal with the unique human resources. Firms are additionally endeavouring to keep their top/key staff since on the off chance that they leave; the whole store of information leaves the firm's hands. The study's objective was to determine the impact of talent management on organizational performance among the selected IT organizations in Chennai. The study recommends that talent management limitedly affects performance. On the off chance that this talent is appropriately management and implemented properly, organizations might benefit as much as possible from their maintained assets to support development and productivity, both monetarily and non-monetarily.
A STUDY OF VARIOUS TYPES OF LOANS OF SELECTED PUBLIC AND PRIVATE SECTOR BANKS...IAEME Publication
Banking regulations act of India, 1949 defines banking as “acceptance of deposits for the purpose of lending or investment from the public, repayment on demand or otherwise and withdrawable through cheques, drafts order or otherwise”, the major participants of the Indian financial system are commercial banks, the financial institution encompassing term lending institutions. Investments institutions, specialized financial institution and the state level development banks, non banking financial companies (NBFC) and other market intermediaries such has the stock brokers and money lenders are among the oldest of the certain variants of NBFC and the oldest market participants. The asset quality of banks is one of the most important indicators of their financial health. The Indian banking sector has been facing severe problems of increasing Non- Performing Assets (NPAs). The NPAs growth directly and indirectly affects the quality of assets and profitability of banks. It also shows the efficiency of banks credit risk management and the recovery effectiveness. NPA do not generate any income, whereas, the bank is required to make provisions for such as assets that why is a double edge weapon. This paper outlines the concept of quality of bank loans of different types like Housing, Agriculture and MSME loans in state Haryana of selected public and private sector banks. This study is highlighting problems associated with the role of commercial bank in financing Small and Medium Scale Enterprises (SME). The overall objective of the research was to assess the effect of the financing provisions existing for the setting up and operations of MSMEs in the country and to generate recommendations for more robust financing mechanisms for successful operation of the MSMEs, in turn understanding the impact of MSME loans on financial institutions due to NPA. There are many research conducted on the topic of Non- Performing Assets (NPA) Management, concerning particular bank, comparative study of public and private banks etc. In this paper the researcher is considering the aggregate data of selected public sector and private sector banks and attempts to compare the NPA of Housing, Agriculture and MSME loans in state Haryana of public and private sector banks. The tools used in the study are average and Anova test and variance. The findings reveal that NPA is common problem for both public and private sector banks and is associated with all types of loans either that is housing loans, agriculture loans and loans to SMES. NPAs of both public and private sector banks show the increasing trend. In 2010-11 GNPA of public and private sector were at same level it was 2% but after 2010-11 it increased in many fold and at present there is GNPA in some more than 15%. It shows the dark area of Indian banking sector.
EXPERIMENTAL STUDY OF MECHANICAL AND TRIBOLOGICAL RELATION OF NYLON/BaSO4 POL...IAEME Publication
An experiment conducted in this study found that BaSO4 changed Nylon 6's mechanical properties. By changing the weight ratios, BaSO4 was used to make Nylon 6. This Researcher looked into how hard Nylon-6/BaSO4 composites are and how well they wear. Experiments were done based on Taguchi design L9. Nylon-6/BaSO4 composites can be tested for their hardness number using a Rockwell hardness testing apparatus. On Nylon/BaSO4, the wear behavior was measured by a wear monitor, pinon-disc friction by varying reinforcement, sliding speed, and sliding distance, and the microstructure of the crack surfaces was observed by SEM. This study provides significant contributions to ultimate strength by increasing BaSO4 content up to 16% in the composites, and sliding speed contributes 72.45% to the wear rate
ROLE OF SOCIAL ENTREPRENEURSHIP IN RURAL DEVELOPMENT OF INDIA - PROBLEMS AND ...IAEME Publication
The majority of the population in India lives in villages. The village is the back bone of the country. Village or rural industries play an important role in the national economy, particularly in the rural development. Developing the rural economy is one of the key indicators towards a country’s success. Whether it be the need to look after the welfare of the farmers or invest in rural infrastructure, Governments have to ensure that rural development isn’t compromised. The economic development of our country largely depends on the progress of rural areas and the standard of living of rural masses. Village or rural industries play an important role in the national economy, particularly in the rural development. Rural entrepreneurship is based on stimulating local entrepreneurial talent and the subsequent growth of indigenous enterprises. It recognizes opportunity in the rural areas and accelerates a unique blend of resources either inside or outside of agriculture. Rural entrepreneurship brings an economic value to the rural sector by creating new methods of production, new markets, new products and generate employment opportunities thereby ensuring continuous rural development. Social Entrepreneurship has the direct and primary objective of serving the society along with the earning profits. So, social entrepreneurship is different from the economic entrepreneurship as its basic objective is not to earn profits but for providing innovative solutions to meet the society needs which are not taken care by majority of the entrepreneurs as they are in the business for profit making as a sole objective. So, the Social Entrepreneurs have the huge growth potential particularly in the developing countries like India where we have huge societal disparities in terms of the financial positions of the population. Still 22 percent of the Indian population is below the poverty line and also there is disparity among the rural & urban population in terms of families living under BPL. 25.7 percent of the rural population & 13.7 percent of the urban population is under BPL which clearly shows the disparity of the poor people in the rural and urban areas. The need to develop social entrepreneurship in agriculture is dictated by a large number of social problems. Such problems include low living standards, unemployment, and social tension. The reasons that led to the emergence of the practice of social entrepreneurship are the above factors. The research problem lays upon disclosing the importance of role of social entrepreneurship in rural development of India. The paper the tendencies of social entrepreneurship in India, to present successful examples of such business for providing recommendations how to improve situation in rural areas in terms of social entrepreneurship development. Indian government has made some steps towards development of social enterprises, social entrepreneurship, and social in- novation, but a lot remains to be improved.
OPTIMAL RECONFIGURATION OF POWER DISTRIBUTION RADIAL NETWORK USING HYBRID MET...IAEME Publication
Distribution system is a critical link between the electric power distributor and the consumers. Most of the distribution networks commonly used by the electric utility is the radial distribution network. However in this type of network, it has technical issues such as enormous power losses which affect the quality of the supply. Nowadays, the introduction of Distributed Generation (DG) units in the system help improve and support the voltage profile of the network as well as the performance of the system components through power loss mitigation. In this study network reconfiguration was done using two meta-heuristic algorithms Particle Swarm Optimization and Gravitational Search Algorithm (PSO-GSA) to enhance power quality and voltage profile in the system when simultaneously applied with the DG units. Backward/Forward Sweep Method was used in the load flow analysis and simulated using the MATLAB program. Five cases were considered in the Reconfiguration based on the contribution of DG units. The proposed method was tested using IEEE 33 bus system. Based on the results, there was a voltage profile improvement in the system from 0.9038 p.u. to 0.9594 p.u.. The integration of DG in the network also reduced power losses from 210.98 kW to 69.3963 kW. Simulated results are drawn to show the performance of each case.
APPLICATION OF FRUGAL APPROACH FOR PRODUCTIVITY IMPROVEMENT - A CASE STUDY OF...IAEME Publication
Manufacturing industries have witnessed an outburst in productivity. For productivity improvement manufacturing industries are taking various initiatives by using lean tools and techniques. However, in different manufacturing industries, frugal approach is applied in product design and services as a tool for improvement. Frugal approach contributed to prove less is more and seems indirectly contributing to improve productivity. Hence, there is need to understand status of frugal approach application in manufacturing industries. All manufacturing industries are trying hard and putting continuous efforts for competitive existence. For productivity improvements, manufacturing industries are coming up with different effective and efficient solutions in manufacturing processes and operations. To overcome current challenges, manufacturing industries have started using frugal approach in product design and services. For this study, methodology adopted with both primary and secondary sources of data. For primary source interview and observation technique is used and for secondary source review has done based on available literatures in website, printed magazines, manual etc. An attempt has made for understanding application of frugal approach with the study of manufacturing industry project. Manufacturing industry selected for this project study is Mahindra and Mahindra Ltd. This paper will help researcher to find the connections between the two concepts productivity improvement and frugal approach. This paper will help to understand significance of frugal approach for productivity improvement in manufacturing industry. This will also help to understand current scenario of frugal approach in manufacturing industry. In manufacturing industries various process are involved to deliver the final product. In the process of converting input in to output through manufacturing process productivity plays very critical role. Hence this study will help to evolve status of frugal approach in productivity improvement programme. The notion of frugal can be viewed as an approach towards productivity improvement in manufacturing industries.
A MULTIPLE – CHANNEL QUEUING MODELS ON FUZZY ENVIRONMENTIAEME Publication
In this paper, we investigated a queuing model of fuzzy environment-based a multiple channel queuing model (M/M/C) ( /FCFS) and study its performance under realistic conditions. It applies a nonagonal fuzzy number to analyse the relevant performance of a multiple channel queuing model (M/M/C) ( /FCFS). Based on the sub interval average ranking method for nonagonal fuzzy number, we convert fuzzy number to crisp one. Numerical results reveal that the efficiency of this method. Intuitively, the fuzzy environment adapts well to a multiple channel queuing models (M/M/C) ( /FCFS) are very well.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
2. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
204
emerged in recent years. Fridrich et al. [3] constructed a general framework for RDH. By first extracting compressible
features of original cover and then compressing them losslessly, spare space can be saved for embedding auxiliary data.
A more popular method is based on difference expansion (DE) [4], in which the difference of each pixel group is
expanded, e.g., multiplied by 2, and thus the least significant bits (LSBs) of the difference are all-zero and can be used
for embedding messages. Another methods [5] usually combined DE or histogram shift (HS) to residuals of the image,
e.g., the predicted errors, to achieve better performance.
In [6], Zhang divided the encrypted image into several blocks. By flipping 3 LSBs of the half of pixels in each
block, room can be vacated for the embedded bit. The data extraction and image recovery proceed by finding which part
has been flipped in one block. This process can be realized with the help of spatial correlation in decrypted image.
Zhang’s method in [7] pseudo-randomly permuted and divided encrypted image into a number of groups with size of The
LSB-planes of each group are compressed with a parity-check matrix and the vacated room is used to embed data.
Fig. 1: Framework: “vacating room after encryption (VRAE)” versus framework: “reserving room before encryption
(RRBE). (a) Framework VRAE. (b) Framework RRBE
We elaborate a practical method based on the Framework “RRBE”, shown in Fig(1) which primarily consists of
four stages: generation of encrypted image, data hiding in encrypted image, data extraction and image recovery. Note
that the reserving operation adopt in the proposed method is a traditional RDH approach. As shown in Fig. 1(b), the
content owner first reserves enough space on original image and then convert the image into its encrypted version with
the encryption key. Now, the data embedding process in encrypted images is inherently reversible for the data hider only
needs to accommodate data into the spare space previous emptied out. The data extraction and image recovery are
identical to that of Framework VRAE. Obviously, standard RDH [8],[9] algorithms are the ideal operator for reserving
room before encryption and can be easily applied to Framework RRBE to achieve better performance compared with
techniques from Framework VRAE. This is because in this new framework, we follow the customary idea that first
losslessly compresses the redundant image content (e.g., using excellent RDH techniques) and then encrypts it with
respect to protecting privacy. Two RRBE Methods are considered here.
2. METHODOLOGY
In this section two methods of reserving room before encryption is discussed.
2.1 RRBE using LWT
The Methodologies followed in this method is (1) Lifting Wavelet Transformer, (2) Chaos based image
encryption, (3) Adaptive LSB Replacement, (4)Data Recovery by decryption and is shown in fig. 2.
3. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
Fig 2: Block Diagram of image encryption and data hiding
2.1.1 Lifting wavelet transformer (LWT)
Wavelet transform [10] provides time frequency representation. The wavelet transform of an image is created by
repeated filtering the image coefficients on a row by row and column by column basis. To generate four wavelet bands
such as Approximation band, Vertical band, Diagonal band and Horizontal band. The approximation band has low
frequency component and significant information is present i
insignificant information of an image such as detailed and minute information such as edge information, corner detailed
information etc., Daubechies (db2) wavelet transform is applied on cover im
wavelet (Daubechies db1) is used to transform payload into wavelet domain. Harr wavelet is discontinuous and
resembles a step function which represents the same wavelet as Daubechies (db1).
The lifting scheme (LS) [10] has been introduced for the efficient computation of Discrete Wavelet
Transform(DWT)[10].For image compression, it is very necessary that the selection of transform should reduce the size
of the resultant data as compared to the original data s
Wavelet using the lifting scheme significantly reduces the computation time, speed up the computation process. The
lifting transform even at its highest level is very simple. The lifting transform
Predict and Update. Suppose we have the one dimensional signal a0. Lifting is done by performing the following
sequence of operations:
1. Split a0 into Even-1 and Odd-1
2. dj-1 = Oddj-1 – Predict (Evenj-1)
3. aj-1 = Evenj-1 + Update( dj-1 )
These steps are repeated to construct multiple scales of the transform. The wire diagram in Fig. 3 shows the
forward transform visually. The coefficients “a” are representing the averages in the signal that is Approximation
coefficient, while the coefficients in “d” represent the differences in the signal that is Detailed Coefficient. Thus, these
two sets also correspond to the low- pass and high
Fig 3: Wire diagram of forward tran
International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
205
Block Diagram of image encryption and data hiding
(LWT)
Wavelet transform [10] provides time frequency representation. The wavelet transform of an image is created by
oefficients on a row by row and column by column basis. To generate four wavelet bands
such as Approximation band, Vertical band, Diagonal band and Horizontal band. The approximation band has low
frequency component and significant information is present in this band. The vertical, diagonal and horizontal bands has
insignificant information of an image such as detailed and minute information such as edge information, corner detailed
information etc., Daubechies (db2) wavelet transform is applied on cover image to convert into wavelet domain and Haar
wavelet (Daubechies db1) is used to transform payload into wavelet domain. Harr wavelet is discontinuous and
resembles a step function which represents the same wavelet as Daubechies (db1).
e (LS) [10] has been introduced for the efficient computation of Discrete Wavelet
Transform(DWT)[10].For image compression, it is very necessary that the selection of transform should reduce the size
of the resultant data as compared to the original data set .So a new lossless image compression method is proposed.
Wavelet using the lifting scheme significantly reduces the computation time, speed up the computation process. The
lifting transform even at its highest level is very simple. The lifting transform can be performed via two operations: Split,
Predict and Update. Suppose we have the one dimensional signal a0. Lifting is done by performing the following
1
1)
These steps are repeated to construct multiple scales of the transform. The wire diagram in Fig. 3 shows the
forward transform visually. The coefficients “a” are representing the averages in the signal that is Approximation
coefficient, while the coefficients in “d” represent the differences in the signal that is Detailed Coefficient. Thus, these
pass and high- pass frequencies present in the signal.
Wire diagram of forward transformation with the lifting scheme
International Conference on Emerging Trends in Engineering and Management (ICETEM14)
31, December 2014, Ernakulam, India
Wavelet transform [10] provides time frequency representation. The wavelet transform of an image is created by
oefficients on a row by row and column by column basis. To generate four wavelet bands
such as Approximation band, Vertical band, Diagonal band and Horizontal band. The approximation band has low
n this band. The vertical, diagonal and horizontal bands has
insignificant information of an image such as detailed and minute information such as edge information, corner detailed
age to convert into wavelet domain and Haar
wavelet (Daubechies db1) is used to transform payload into wavelet domain. Harr wavelet is discontinuous and
e (LS) [10] has been introduced for the efficient computation of Discrete Wavelet
Transform(DWT)[10].For image compression, it is very necessary that the selection of transform should reduce the size
et .So a new lossless image compression method is proposed.
Wavelet using the lifting scheme significantly reduces the computation time, speed up the computation process. The
can be performed via two operations: Split,
Predict and Update. Suppose we have the one dimensional signal a0. Lifting is done by performing the following
These steps are repeated to construct multiple scales of the transform. The wire diagram in Fig. 3 shows the
forward transform visually. The coefficients “a” are representing the averages in the signal that is Approximation
coefficient, while the coefficients in “d” represent the differences in the signal that is Detailed Coefficient. Thus, these
sformation with the lifting scheme
4. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
206
The inverse transformation is also very simple as well. We only reverse the order of operations and change the
signs. The even and odd sequences are then merged together to form the original signal. The wire diagram of inverse
transformation is shown below in Fig. 4
s
d
Fig 4: Wire diagram of Inverse Transformation with the lifting scheme
LWT decomposes the image into different subband images, shown in Fig 5. namely, LL, LH, HL, and HH for
embedding the messages in the pixel coefficients of subbands. Lifting scheme is a technique to convert DWT coefficients
to Integer coefficients without losing information. LL subbands contains the significant part of the spatial domain image.
High-frequency subband contains the edge information of input image. These coefficients are selected as reserved space
for hiding the text data. The secret text data is embedded into the wavelet coefficients of high frequency subbands
because it is non sensitive to human visual system.
Forward Lifting in IWT is calculated by following steps:
Step1: Column wise processing to get H and L
H = (Co-Ce) and L = (Ce+ [H/2]) (1)
Where Co and Ce is the odd column and even column wise pixel values.
Step 2: Row wise processing to get LL,LH,HL and HH. Separate odd and even rows of H and L,Namely, Hodd – odd
row of H, Lodd- odd row of L,Heven- even row of H, Leven- even row of L.
LH = Lodd-Leven (2)
LL = Leven + [LH / 2] (3)
HH = Hodd – Heven (4)
HL = Heven + [HH / 2] (5)
Fig 5: Block Diagram of LWT
Update Predict Merge
-
+
a(n)
5. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
Reverse Lifting scheme in IWT
Procedure is similar to the forward lifting scheme.
cover image and transformed image is shown in Fig.6.
Fig 6
2.1.2 Chaos Encryption
Chaos is a dynamical system that is extremely sensitive to its initial conditions. It is a deterministic nonlinear
system that has random-like behaviors. Chaos theory has become a new branch of scientific studies today. Discrete
chaotic dynamic systems are used in this system. The implemented map is logistic map,[11],[12] which is one of the
simplest form of one dimensional chaotic maps and mathematically its equation (6) can be written as:
Xn+1 = u*x(1-x)
Where x is a real value in (0,1), and u is bifurcation parameter satisfying 0
initial value x0 represents the key. The logistic map is chaotic on the condition 0.3
advanced encryption standard to encrypt the image for secure transmission.
with encryption key value generated from chaotic sequence with threshold function by bitxor operation
is used for generation of chaotic map sequence.
securely which prevents data hacking. The flow diagram is shown in Fig.7.
Fig .7
2.1.3 Adaptive LSB Embedding
A 8-bit gray scale image matrix consisting m × n pixels and a secret message consisting of k bits.
message is embedded into the LSB of the first pixel and the second bit of message is embedded into the
so on.The resultant Stego-image which holds the secret message is also a 8
International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
207
Reverse Lifting scheme in IWT: Inverse Integer wavelet transform is formed by Reverse lifting scheme.
e is similar to the forward lifting scheme. Inverse wavelet transform is important to get the original image.The
cover image and transformed image is shown in Fig.6.
Fig 6: Cover Image and Transformed Image
a dynamical system that is extremely sensitive to its initial conditions. It is a deterministic nonlinear
like behaviors. Chaos theory has become a new branch of scientific studies today. Discrete
this system. The implemented map is logistic map,[11],[12] which is one of the
simplest form of one dimensional chaotic maps and mathematically its equation (6) can be written as:
(6)
Where x is a real value in (0,1), and u is bifurcation parameter satisfying 0≤ u ≤4.n=0,1,.......The parameter U and the
represents the key. The logistic map is chaotic on the condition 0.35699≤ u ≤4.
advanced encryption standard to encrypt the image for secure transmission. It encrypts the original image pixel values
with encryption key value generated from chaotic sequence with threshold function by bitxor operation
is used for generation of chaotic map sequence. It is very useful to transmit the secret image through unsecure channel
The flow diagram is shown in Fig.7.
Fig .7: Flow diagram for chaotic Encryption
bit gray scale image matrix consisting m × n pixels and a secret message consisting of k bits.
message is embedded into the LSB of the first pixel and the second bit of message is embedded into the
image which holds the secret message is also a 8-bit gray scale image and difference between
International Conference on Emerging Trends in Engineering and Management (ICETEM14)
31, December 2014, Ernakulam, India
Inverse Integer wavelet transform is formed by Reverse lifting scheme.
Inverse wavelet transform is important to get the original image.The
a dynamical system that is extremely sensitive to its initial conditions. It is a deterministic nonlinear
like behaviors. Chaos theory has become a new branch of scientific studies today. Discrete
this system. The implemented map is logistic map,[11],[12] which is one of the
simplest form of one dimensional chaotic maps and mathematically its equation (6) can be written as:
4.n=0,1,.......The parameter U and the
≤4. This method is one of the
It encrypts the original image pixel values
with encryption key value generated from chaotic sequence with threshold function by bitxor operation Here logistic map
It is very useful to transmit the secret image through unsecure channel
bit gray scale image matrix consisting m × n pixels and a secret message consisting of k bits. The first bit of
message is embedded into the LSB of the first pixel and the second bit of message is embedded into the second pixel and
bit gray scale image and difference between
6. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
the cover image and the Stegoimage is not visually perceptible.
increase in number of LSBs. This hiding process will introduce the error between input and output image and it is
determined by mean square error and Peak signal to noise ratio determines the image quality.
shown in Fig 8.
2.1.4 Data Extraction and Image Restoration
Since data extraction is completely independent from image decryption, the order of them implies two different
practical applications. To manage and update personal information of images
privacy, an inferior database manager may only get access to the data hiding key and have to manipulate data in
encrypted domain. The order of data extraction before image decryption guarantees the feasibility o
case. When the database manager gets the data hiding key, he can decrypt the LSB
data by directly reading the decrypted version. When requesting for updating information of encrypted images, the
database manager, then, updates information through LSB replacement and encrypts updated information according to
the data hiding key all over again. As the whole process is entirely operated on encrypted domain, it avoids the leakage
of original content. Retrivel [13]of data and the image consist of,
1. Decompose the stego image into four bands using Daubechies
2. Detail CH band is used for extracting payload
3. Using the extracting Function payload is extracted by retrieving the l
4. Then chaotic decryption is used for cover image retrieval.
5. Then perform the inverse LWT to get the cover image.
2.2 RRBE Without Using LWT.(Traditional Method)
This Method consists of five steps
(4) Image decryption, (5) Data extraction and Image recovery.
2.2.1. Image Partition
To construct the encrypted image, the very first stage is being divided into three steps: image partition,
reversible embedding [14] followed by image encryption. Initially, image partition step divides original image into two
parts A and B then, the LSBs of A are reversibly embedded into B with a standard RDH algorithm so that LSBs of A can
be used for accommodating messages; at last, encrypt the rearranged image to generate its final version. The operator
here for reserving room before encryption is a standard RDH technique, so the goal of image partition is to construct a
smoother area B , on which standard RDH algorithms can achieve better performance. To do that, without loss of
generality, assume the original image C is an 8 bits gray
1≤ i ≤ M, 1≤ j ≤ N. First, the content owner extracts from the original image, along the rows
whose number is determined by the size of to
rows, where m = [l/N] and the number of blocks can be computed through n = M
International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
208
the cover image and the Stegoimage is not visually perceptible. The quality of the image, however degrades with the
This hiding process will introduce the error between input and output image and it is
determined by mean square error and Peak signal to noise ratio determines the image quality.
Fig.8: LSB embedding block diagram
2.1.4 Data Extraction and Image Restoration
Since data extraction is completely independent from image decryption, the order of them implies two different
To manage and update personal information of images which are encrypted for protecting clients’
privacy, an inferior database manager may only get access to the data hiding key and have to manipulate data in
encrypted domain. The order of data extraction before image decryption guarantees the feasibility o
case. When the database manager gets the data hiding key, he can decrypt the LSB-planes of and extract the additional
data by directly reading the decrypted version. When requesting for updating information of encrypted images, the
ase manager, then, updates information through LSB replacement and encrypts updated information according to
the data hiding key all over again. As the whole process is entirely operated on encrypted domain, it avoids the leakage
vel [13]of data and the image consist of,
to four bands using Daubechies Lifting Wavelet Transformation.
Detail CH band is used for extracting payload.
payload is extracted by retrieving the least two bits of CH band of stego image.
Then chaotic decryption is used for cover image retrieval.
Then perform the inverse LWT to get the cover image.
2.2 RRBE Without Using LWT.(Traditional Method)
This Method consists of five steps. (1) Image Partition, (2) Self Reversible embedding,
(5) Data extraction and Image recovery.
To construct the encrypted image, the very first stage is being divided into three steps: image partition,
reversible embedding [14] followed by image encryption. Initially, image partition step divides original image into two
parts A and B then, the LSBs of A are reversibly embedded into B with a standard RDH algorithm so that LSBs of A can
commodating messages; at last, encrypt the rearranged image to generate its final version. The operator
here for reserving room before encryption is a standard RDH technique, so the goal of image partition is to construct a
ard RDH algorithms can achieve better performance. To do that, without loss of
C is an 8 bits gray-scale image with its size M x N and pixels Cij
N. First, the content owner extracts from the original image, along the rows,
whose number is determined by the size of to-be-embedded messages, denoted by l. In detail
/N] and the number of blocks can be computed through n = M – m + 1. An important
International Conference on Emerging Trends in Engineering and Management (ICETEM14)
31, December 2014, Ernakulam, India
The quality of the image, however degrades with the
This hiding process will introduce the error between input and output image and it is
determined by mean square error and Peak signal to noise ratio determines the image quality. The block diagram is
Since data extraction is completely independent from image decryption, the order of them implies two different
which are encrypted for protecting clients’
privacy, an inferior database manager may only get access to the data hiding key and have to manipulate data in
encrypted domain. The order of data extraction before image decryption guarantees the feasibility of our work in this
planes of and extract the additional
data by directly reading the decrypted version. When requesting for updating information of encrypted images, the
ase manager, then, updates information through LSB replacement and encrypts updated information according to
the data hiding key all over again. As the whole process is entirely operated on encrypted domain, it avoids the leakage
Lifting Wavelet Transformation.
east two bits of CH band of stego image.
(2) Self Reversible embedding, (3) Image Encryption,
To construct the encrypted image, the very first stage is being divided into three steps: image partition, self
reversible embedding [14] followed by image encryption. Initially, image partition step divides original image into two
parts A and B then, the LSBs of A are reversibly embedded into B with a standard RDH algorithm so that LSBs of A can
commodating messages; at last, encrypt the rearranged image to generate its final version. The operator
here for reserving room before encryption is a standard RDH technique, so the goal of image partition is to construct a
ard RDH algorithms can achieve better performance. To do that, without loss of
ith its size M x N and pixels Cij€ [0, 255],
, several overlapping blocks
. In detail, every block consists of
. An important point here is that
7. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
209
each block is overlapped by pervious and/or sub-sequential blocks along the rows. For each block, define a function to
measure its first-order smoothness.
f=∑ ∑ ܥ௨,௩
ேିଵ
௩ୀଶ
௨ୀଶ −
ೠషభ,ೡశೠశభ,ೡశ ೠ,ೡషభశೠ,ೡశభ
ସ
(7)
Higher f relates to blocks which contain relatively more complex textures. The content owner, therefore, selects
the particular block with the highest to f be A, and puts it to the front of the image concatenated by the rest part B with
fewer textured areas, as shown in Fig. 9. It is obvious that the content owner can also embed two or more LSB-planes of
A into B, which leads to half, or more than half, reduction in size of A.
Fig 9: Illustration of Image partition and embedding process
However, the performance of A decreases significantly in terms of PSNR, after embedding the data in the
second stage with growing bit-planes exploited. Hence, we investigate situations that at most three LSB-planes of A are
employed and determine the number of bit-plane with regard to different payloads.
2.2.2 Self-Reversible Embedding
The motive of self-reversible embedding [14] is to embed the LSB-planes of A into B by employing traditional
RDH algorithms. Pixels in image B are first categorized into two sets as, white pixels with its indices i and j satisfying ( i
+j)mod 2=0 and black pixels with indices ( i +j)mod 2= 1 as in Fig. 9. Then, each white pixel Bi,j is estimated by the
interpolation value obtained with the four black pixels surrounding it as follows,
B୧,୨
′
= wଵB୧ିଵ,୨ + wଶB୧ାଵ,୨ + wଷB୧,୨ିଵ + wସB୧,୨ାଵ (8)
Where the weight wi, 1 ≤ i ≤ 4, Then the estimating error is calculated via eij = Bi,j – B’i,j along with
embedding some data into the estimating error sequence with histogram shift. Then, we further calculate the estimating
errors of black pixels with the help of surrounding white pixels that may have been modified. Then another estimating
error sequence is produced that can accommodate messages. Thus we summarize that, to exploit all pixels of B, two
estimating error sequences are constructed for embedding messages in every single-layer of embedding process.
Using bidirectional histogram shift, some messages can be embedded on each error sequence i.e. firstly we
divide the histogram of estimating errors into two parts namely the left part and the right part, and search for the highest
point in each part, denoted by LM and RM, respectively. For typical images, LM = -1and RM=0. Further, look for the
zero point in each part, denoted by LN and RN. To embed messages into positions with an estimating error that is equal
to RM , shift all error values between RM+1 and RN-1 with one step towards right, and then, we can represent the bit 0
with RM and the bit 1with RM=1. The embedding process in the left part is similar except that the shifting direction is
left, and the shift is realized by subtracting 1 from the corresponding pixel values.
In RDH algorithms, there occurs the overflow and underflow problem when the natural boundary pixels change
from 255to 256. For its avoidance, just embed data into estimating error with its corresponding pixel that are valued from
1 to 254. However, problems still arise when non-boundary pixels are changed from 1 to 0 or from 254 to 255 during the
embedding process. These created boundary pixels are defined as pseudo-boundary pixels in the embedding process.
Hence, a boundary map is introduced to indicate whether boundary pixels in marked image are natural or pseudo in
extracting process.
8. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
210
2.2.3. Image Encryption
After the rearranged self-embedded image which is denoted by X is generated, we encrypt X to construct the
encrypted image denoted by E .Using stream cipher; the encryption version of X can be easily obtained. For example,
agray value Xi,j ranging from 0 to 25 can be represented by8 bits, Xi,j(0), Xi,j(1), . . . , Xi,j(7), such that,
ܺ,ሺ݇ሻ = ቂ
,ೕ
ଶೖ ቃ ݉,2݀ ݇ = 0,1, … .7 (9)
The encrypted bits Ei,j(k) can be calculated through exclusive-or operation.
ܧ,ሺ݇ሻ=ܺ,ሺ݇ሻ ⊕ ݎ,ሺ݇ሻ (10)
Where ri,j(k) is generated via a standard stream cipher determined by the encryption key. Finally, we embed 10
bits information into LSBs of first 10 pixels in encrypted version of A to indicate data hider the total number of rows and
the bit-planes he can embed information into. Since after image encryption, none of the data hider and the third party
access the content of original image without the encryption key, hence privacy of the content owner is protected.
2.2.4 Image Decryption
With the encryption key, the content owner decrypts the image except the LSB-planes of AE. The decrypted
version of E' containing the embedded data can be calculated by
ܺ,
"
ሺ݇ሻ = ܧ,
′
ሺ݇ሻ ⊕ ݎ,ሺ݇ሻ (11)
ܺ,
"
= ∑ ܺ,
"
ୀ ሺ݇ሻ × 2
(12)
Where E’i,j(k) and X”i,j(k) are the binary bits of E’i.j and X”i,j obtained via (11) and (12) respectively.
2.2.5 Data Extraction and Image Recovery
The content owner can further extract the data and recover original image after generating the marked decrypted
image. The process is similar to the traditional RDH methods. The following outlines the specific steps[14]:
• Step 1. Record and decrypt the LSB-planes of A” according to the data hiding key; extract the data until the end
label is reached.
• Step 2. Extract LN, RN, LM, RM, LP, RP, Rb, x and boundary map from the LSB of marginal area of B”. Then,
scan B” to -undertake the following steps.
• Step 3. If Rb is equal to 0, which means no black pixels participate in embedding process, go to Step5.
• Step 4. Calculate estimating errors e’i,j of the black pixels B”i,j. If B”i,j belongs to [1, 254], recover the estimating
error and original pixel value in a reverse order and extract embedded bits when e’i,j is equal to LN, LM (or LP ),
RM (or RP ) and RN. Else, if B”i,j € { 0, 255 } , refer to the corresponding bit b in boundary map. If b = 0, skip this
one, else operate like B”i,j € [1, 254] . Repeat this step until the part of payload Rb is extracted. If extracted bits are
LSBs of pixels in marginal area then it restores them immediately.
• Step 5. Calculate estimating errors e’i,j of the white pixels B”i,j ,and extract embedded bits and recover white pixels
in the same manner with Step 4. If extracted bits are LSBs of pixels in marginal area, restore them immediately.
• Step 6. Continue doing Step 2 to Step 5 x - 1 rounds on B” and merge all extracted bits to form LSB-planes of A.
Until now, we have perfectly recover B.
• Step 7. Replace marked LSB-planes of A” with its original bits extracted from B” to get original cover image C.
2.3 Performance Analysis
The quality of marked decrypted images is compared in the terms of PSNR and MSE [13].The performance can
be measured by these two quantities.
Mean Square Error (MSE): It is defined as the square of error between cover image and stego image. The distortion in
the image can be measured using MSE.
Peak Signal to Noise Ratio (PSNR): It is the measure of quality of stego image as compared to cover image, i.e., the
percentage of noise present in the cover image.
9. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
211
3. RESULT AND DISCUSSION
The Table I and II shows the values Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR) for different
images for different image formats of the Proposed method and traditional method respectively.
The test images are gray scale images of Baboon.png, Airplane.png, Environment.jpg, Fruits.png, Nature.jpg.
are shown in Fig.10. The performance is measured interms of PSNR and MSE..The cover image of size 256*256 is used
and the payload is of 53 bytes. The data embedded in this work is,” calicut university institute of engineering and
technology@”.
(a) (b) (c) (d) (e)
Fig.11: Test Images (a) Airplane (b) Baboon (c) Environment (d) Fruits (e) Nature
The value of PSNR and MSE should varies from payload of different sizes and it also varies for different cover
image sizes. The quality of the image degrades when size of the payload increases.
Table I: PSNR & MSE Values Of Test Images Using LWT
Input Images PSNR MSE
Nature 82.1459 0.0010
Environment 73.3953 0.003
Baboon 76.6108 0.0014
Airplane 74.9284 0.0021
Fruits 76.4279 0.0015
Table II: PSNR & MSE Values Of Test Images Of Traditional Method
Input Images PSNR MSE
Nature 48.05 1.02
Environment 48.74 0.87
Baboon 34.83 2.14
Airplane 47.59 1.13
Fruits 46.64 1.41
From the above two tables we can see that the PSNR value is improved in the case of test images using LWT
decomposition. The Fig. 12, 13, 14, 15. shows the graphical representation of PSNR and MSE values of reserving room
before encryption by using LWT and without using LWT .
10. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
212
From the graphical representation, we can see that nature image has high PSNR value and lowest MSE value.
Thus we can conclude that the image decomposition method using LWT is better than the previous method by measuring
the MSE and PSNR of two proposed methods.
Fig.12: Performance interms of PSNR (db) using LWT Fig.13: Performance in terms of MSE Using LWT
Fig 14: Performance interms of PSNR in RRBE Fig 15: Performance interms of MSE in RRBE
without LWT without LWT
3.1 Comparisons and Results
We take a image of nature shown in Fig.16: Resultant Image; to demonstrate the feasibility of proposed method
using LWT image decomposition.
11. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
213
(a) (b) (c)
(d) (e)
Fig 16: Resultant Image (a) Cover image (b) LWT transformed Image (c) Stego Image (d) Encrypted Image
(e) Recovered Cover Image
The proposed method is compared with the existing method for the different images given above. The proposed
method have a significant improvement in the image quality over the existing RRBE and evaluated in terms of
performance parameters like PSNR and MSE. The existing method maybe introduce some errors on data extraction
and/or image restoration, while the proposed method is free of any error for all kinds of images. The two graphs shown in
Fig.17 and 18 give the variation of PSNR & MSE of the modified proposed method and the existing method.
Fig 17: Plot of MSE between current method and modified method
12. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
214
Fig 18: Plot of PSNR between current method and modified method
It can be clearly seen from above two graphs that the modified method have the improved PSNR and MSE values.
4. CONCLUSION
Reversible data hiding in encrypted images is a new topic drawing attention because of the privacy-preserving
requirements from cloud data management. Here performance comparison LWT based RRBE and traditional RRBE is
done . LWT based RRBE outperforms the other method. Performance of the system is evaluated based on PSNR and
MSE. The proposed method can take advantage of all traditional RDH techniques for plain images and achieve excellent
performance without loss of perfect secrecy. Furthermore, this novel method can achieve real reversibility, separate data
extraction and greatly improvement on the quality of marked decrypted images.
The future work of this project would be Reversible Data Hiding using color images. Also we can use audio,
video in case of image as cover for hiding the data.
REFERENCES
[1] T. Kalker and F.M.Willems, “Capacity bounds and code constructions for reversible data- hiding,” in Proc. 14th
Int. Conf. Digital Signal Processing (DSP2002), 2002, pp. 71–76
[2] W. Zhang, B. Chen, and N. Yu, “Capacity-approaching codes for reversible data hiding,” in Proc 13th
Information Hiding (IH’2011), LNCS 6958, 2011, pp. 255–269, Springer-Verlag.
[3] J. Fridrich and M. Goljan, “Lossless data embedding for all image formats,” in Proc. SPIE Proc. Photonics West,
Electronic Imaging, Security and Watermarking of Multimedia Contents, San Jose, CA, USA, Jan. 2002,
vol. 4675, pp. 572–583.
[4] J. Tian, “Reversible data embedding using a difference expansion,” IEEE Trans. Circuits Syst. Video Technol.,
vol. 13, no. 8, pp. 890–896, Aug. 2003.
[5] X. L. Li, B. Yang, and T. Y. Zeng, “Efficient reversible watermarking based on adaptive prediction-error
expansion and pixel selection,” IEEE Trans. Image Process., vol. 20, no. 12, pp. 3524–3533, Dec.2011
[6] X. Zhang, “Reversible data hiding in encrypted images,” IEEE Signal Process. Lett., vol. 18, no. 4, pp. 255–258,
Apr. 2011.
[7] X. Zhang, “Separable reversible data hiding in encrypted image,” IEEE Trans. Inf. Forensics Security, vol. 7,
no. 2, pp. 826 832, Apr. 2012.
[8] L. Luo et al., “Reversible image watermarking using interpolation technique,” IEEE Trans. Inf. Forensics
Security, vol. 5, no. 1, pp. 187–193,Mar. 2010.
[9] V. Sachnev, H. J. Kim, J. Nam, S. Suresh, and Y.-Q. Shi, “Reversible watermarking algorithm using sorting and
prediction,” IEEE Trans. Circuits Syst. Video Technol., vol. 19, no. 7, pp. 989–999, Jul. 2009.
13. Proceedings of the International Conference on Emerging Trends in Engineering and Management (ICETEM14)
30 – 31, December 2014, Ernakulam, India
215
[10] Mrs. Preet Kaur, Geetu lalit, “Comparative Analysis of DCT, DWT & LWT for Image Compression” (IJITEE)
ISSN: 2278-3075, Volume-1, Issue-3, August 2012.
[11] Haojiang Gao *, Yisheng Zhang, Shuyun Liang, Dequn Li,” A new chaotic algorithm for image encryption”
Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan 430074, PR China Accepted 16
August 2005.
[12] Mazhar Tayel, Hamed Shawky, Alaa El-Din Sayed Hafez,” A New Chaos Steganography Algorithm for Hiding
Multimedia Data” Electrical Engineering Department, Faculty of Engineering, Alexandria University, Feb.2012.
[13] H S Manjunatha Reddy, K B Raja,” Wavelet based Secure Steganography with Scrambled Payload”, International
Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-1, Issue-2,
July 2012.
[14] Kede Ma, Weiming Zhang,” Reversible data hiding in encrypted images by reserving room before encryption”,
IEEE transactions on information forensics and security, vol. 8, no. 3, march 2013.
[15] Rohini N. Shrikhande and Prof. Vinayak K. Bairagi, “Prediction Based Lossless Medical Image Compression”,
International Journal of Electronics and Communication Engineering & Technology (IJECET), Volume 4,
Issue 2, 2013, pp. 191 - 197, ISSN Print: 0976- 6464, ISSN Online: 0976 –6472.
[16] Vismita Nagrale, Ganesh Zambre and Aamir Agwani, “Image Stegano-Cryptography Based on LSB Insertion &
Symmetric Key Encryption”, International Journal of Electronics and Communication Engineering & Technology
(IJECET), Volume 2, Issue 1, 2011, pp. 35 - 42, ISSN Print: 0976- 6464, ISSN Online: 0976 –6472.