This article proposes bit flipping method to conceal secret data in the original image. Here a section consists of 2 pixels and there by flipping one or two LSBs of the pixels to hide secret information in it. It exists in 2 variants. The variant-1 and variant-2 both use 7th and 8th bit to conceal the secret data. Variant-1 hides 3 bits per a pair of pixels and the variant-2 hides 4 bits per a pair of pixels. Our proposed method notably raises the capacity as well as bits per pixel that can be hidden in the image compared to existing bit flipping method. The image steganographic parameters such as, peak signal to noise ratio (PSNR), hiding capacity, and the quality index of the proposed techniques has been compared with the existing bit flipping technique.
Modified weighted embedding method for image steganographyIAEME Publication
This document proposes a modified weighted embedding method for image steganography. It begins by discussing traditional LSB substitution methods and their weaknesses. It then describes the proposed method, which embeds data by complementing LSBs in image pixels based on the decimal value of the data, rather than direct bit replacement. This is intended to provide better security while maintaining high image quality. The embedding algorithm works by converting the data to decimal, dividing the cover image into blocks, and complementing LSBs in the block pixels based on the decimal digits and an embedding table. Extraction works similarly but in reverse. Experiments on grayscale images are said to support the method.
Colour Image Steganography Based on Pixel Value Differencing in Spatial Domainijistjournal
The document proposes a color image steganography method based on pixel value differencing (PVD) in the spatial domain. It separates each color channel of a pixel into separate matrices and applies PVD separately to embed bits in a sequential order across the channels. It embeds different number of bits in different channels for increased security and quality. It overcomes the issue of pixel values exceeding the 0-255 range in previous PVD methods by selectively embedding one less bit if needed to keep values in range. Experimental results show it provides better visual quality than previous PVD methods.
Concealogram digital image in image using lsb insertion methodIAEME Publication
This document summarizes a research paper that proposes a new algorithm for concealing a digital image within a cover image. The algorithm uses spatial domain techniques like least significant bit insertion to hide image data in the cover image. It describes two methods - a 4-bit method that embeds 4 most significant bits of the secret image into the 4 least significant bits of the cover image pixels. A 6-bit method is also described that embeds 6 bits of the secret image across two pixels of the cover image. The document concludes by mentioning that the algorithm was tested using peak signal-to-noise ratio to measure stego image quality.
This document summarizes a research paper that proposes a novel reversible data hiding scheme using AES encryption. The scheme consists of three phases: 1) AES encryption of the original image, 2) data embedding by modifying parts of the encrypted image, 3) data extraction and image recovery by decrypting the encrypted image and extracting the hidden data. The scheme aims to securely hide data in images while allowing perfect recovery of the original image. Experimental results show the decrypted image has a high PSNR value of 55.11dB and the hidden data can be successfully extracted.
AN ENHANCED SEPARABLE REVERSIBLE DATA HIDING IN ENCRYPTED IMAGES USING SIDE M...Editor IJMTER
This paper proposes a scheme for Enhanced Separable Reversible Data Hiding in
Encrypted images Using Side Match. In the first step the original image is encrypted using an
encryption key. Then additional data is embedded into the image by modifying a small portion of the
encrypted image using a data hiding key. With an encrypted image containing additional data, if a
receiver has the data hiding key, he can extract the additional data. If the receiver has the encryption
key, he can decrypt the image, but cannot extract the additional data. If the receiver has both the data
hiding key and encryption key, he can extract the additional data and recover the original content by
exploiting the spatial correlation in natural images. The accuracy of data extraction is improved by
using a better scheme for measuring the smoothness of the received image, and uses the Side Match
scheme to further decrease the error rate of extracted bits.
Histogram-based multilayer reversible data hiding method for securing secret ...journalBEEI
In this modern age, data can be easily transferred within networks. This condition has brought the data vulnerable; so they need protection at all times. To minimize this threat, data hiding appears as one of the potential methods to secure data. This protection is done by embedding the secret into various types of data, such as an image. In this case, histogram shifting has been proposed; however, the amount of secret and the respective stego image are still challenging. In this research, we offer a method to improve its performance by performing some steps, for example removing the shifting process and employing multilayer embedding. Here, the embedding is done directly to the peak of the histogram which has been generated by the cover. The experimental results show that this proposed method has a better quality of stego image than existing ones. So, it can be one of possible solutions to protect sensitive data.
A Hybrid Steganography Technique Based On LSBMR And OPAPIOSRJVSP
This paper presents a steganography technique based on two existing methods of data hiding i.e. LSBMR and OPAP. The proposed method uses the non-overlapping blocks, having three consecutive pixels. The center pixel of this block embeds k- bits of secret data using OPAP and the remaining pixels of the block embed data using LSBMR. The experimental results show that the proposed method provides better embedding capacity while maintaining the good image quality. The improved performance is shown in comparison to other data hiding methods that are investigated in this study.
An Uncompressed Image Encryption Algorithm Based on DNA Sequences cscpconf
The rapid growth of the Internet and digitized content made image and video distribution
simpler. Hence the need for image and video data protection is on the rise. In this paper, we
propose a secure and computationally feasible image and video encryption/decryption
algorithm based on DNA sequences. The main purpose of this algorithm is to reduce the big
image encryption time. This algorithm is implemented by using the natural DNA sequences as
main keys. The first part is the process of pixel scrambling. The original image is confused in
the light of the scrambling sequence which is generated by the DNA sequence. The second part
is the process of pixel replacement. The pixel gray values of the new image and the one of the
three encryption templates generated by the other DNA sequence are XORed bit-by-bit in turn.
The main scope of this paper is to propose an extension of this algorithm to videos and making
it secure using modern Biological technology. A security analysis for the proposed system is
performed and presented.
Modified weighted embedding method for image steganographyIAEME Publication
This document proposes a modified weighted embedding method for image steganography. It begins by discussing traditional LSB substitution methods and their weaknesses. It then describes the proposed method, which embeds data by complementing LSBs in image pixels based on the decimal value of the data, rather than direct bit replacement. This is intended to provide better security while maintaining high image quality. The embedding algorithm works by converting the data to decimal, dividing the cover image into blocks, and complementing LSBs in the block pixels based on the decimal digits and an embedding table. Extraction works similarly but in reverse. Experiments on grayscale images are said to support the method.
Colour Image Steganography Based on Pixel Value Differencing in Spatial Domainijistjournal
The document proposes a color image steganography method based on pixel value differencing (PVD) in the spatial domain. It separates each color channel of a pixel into separate matrices and applies PVD separately to embed bits in a sequential order across the channels. It embeds different number of bits in different channels for increased security and quality. It overcomes the issue of pixel values exceeding the 0-255 range in previous PVD methods by selectively embedding one less bit if needed to keep values in range. Experimental results show it provides better visual quality than previous PVD methods.
Concealogram digital image in image using lsb insertion methodIAEME Publication
This document summarizes a research paper that proposes a new algorithm for concealing a digital image within a cover image. The algorithm uses spatial domain techniques like least significant bit insertion to hide image data in the cover image. It describes two methods - a 4-bit method that embeds 4 most significant bits of the secret image into the 4 least significant bits of the cover image pixels. A 6-bit method is also described that embeds 6 bits of the secret image across two pixels of the cover image. The document concludes by mentioning that the algorithm was tested using peak signal-to-noise ratio to measure stego image quality.
This document summarizes a research paper that proposes a novel reversible data hiding scheme using AES encryption. The scheme consists of three phases: 1) AES encryption of the original image, 2) data embedding by modifying parts of the encrypted image, 3) data extraction and image recovery by decrypting the encrypted image and extracting the hidden data. The scheme aims to securely hide data in images while allowing perfect recovery of the original image. Experimental results show the decrypted image has a high PSNR value of 55.11dB and the hidden data can be successfully extracted.
AN ENHANCED SEPARABLE REVERSIBLE DATA HIDING IN ENCRYPTED IMAGES USING SIDE M...Editor IJMTER
This paper proposes a scheme for Enhanced Separable Reversible Data Hiding in
Encrypted images Using Side Match. In the first step the original image is encrypted using an
encryption key. Then additional data is embedded into the image by modifying a small portion of the
encrypted image using a data hiding key. With an encrypted image containing additional data, if a
receiver has the data hiding key, he can extract the additional data. If the receiver has the encryption
key, he can decrypt the image, but cannot extract the additional data. If the receiver has both the data
hiding key and encryption key, he can extract the additional data and recover the original content by
exploiting the spatial correlation in natural images. The accuracy of data extraction is improved by
using a better scheme for measuring the smoothness of the received image, and uses the Side Match
scheme to further decrease the error rate of extracted bits.
Histogram-based multilayer reversible data hiding method for securing secret ...journalBEEI
In this modern age, data can be easily transferred within networks. This condition has brought the data vulnerable; so they need protection at all times. To minimize this threat, data hiding appears as one of the potential methods to secure data. This protection is done by embedding the secret into various types of data, such as an image. In this case, histogram shifting has been proposed; however, the amount of secret and the respective stego image are still challenging. In this research, we offer a method to improve its performance by performing some steps, for example removing the shifting process and employing multilayer embedding. Here, the embedding is done directly to the peak of the histogram which has been generated by the cover. The experimental results show that this proposed method has a better quality of stego image than existing ones. So, it can be one of possible solutions to protect sensitive data.
A Hybrid Steganography Technique Based On LSBMR And OPAPIOSRJVSP
This paper presents a steganography technique based on two existing methods of data hiding i.e. LSBMR and OPAP. The proposed method uses the non-overlapping blocks, having three consecutive pixels. The center pixel of this block embeds k- bits of secret data using OPAP and the remaining pixels of the block embed data using LSBMR. The experimental results show that the proposed method provides better embedding capacity while maintaining the good image quality. The improved performance is shown in comparison to other data hiding methods that are investigated in this study.
An Uncompressed Image Encryption Algorithm Based on DNA Sequences cscpconf
The rapid growth of the Internet and digitized content made image and video distribution
simpler. Hence the need for image and video data protection is on the rise. In this paper, we
propose a secure and computationally feasible image and video encryption/decryption
algorithm based on DNA sequences. The main purpose of this algorithm is to reduce the big
image encryption time. This algorithm is implemented by using the natural DNA sequences as
main keys. The first part is the process of pixel scrambling. The original image is confused in
the light of the scrambling sequence which is generated by the DNA sequence. The second part
is the process of pixel replacement. The pixel gray values of the new image and the one of the
three encryption templates generated by the other DNA sequence are XORed bit-by-bit in turn.
The main scope of this paper is to propose an extension of this algorithm to videos and making
it secure using modern Biological technology. A security analysis for the proposed system is
performed and presented.
Experimental analysis of matching technique of steganography for greyscale an...ijcsit
Steganography and steganalysis are vital matter in information hiding. Steganography refers to the
technology of hiding data into digital media without depiction of any misgiving, while steganalysis is the
detection of the existence of steganography. In this paper, the impact of sequential matching method for
every possible location in pixel is analyzed experimentally. After matching the steganalysis is check by
image quality measures (IQM) and Statistics, Histogram Analysis and visual attack. This analysis provides
comprehensive study and understanding of basic matching technique and is helpful for those who want to
work in the field of image steganography.
This document presents a technique for steganography using the least significant bit (LSB) and an encryption method. It discusses how the LSB technique works by replacing the LSB of pixels in a cover image with bits from a secret image. It then proposes encrypting the LSB plane of the encoded image by altering its columns at regular intervals before generating the stego image. This increases security by making it harder to extract the secret image through steganalysis while maintaining image quality. MATLAB code demonstrates embedding a secret image in a cover image using LSB, encrypting the LSB plane, generating the stego image, and successfully extracting the secret image.
COMPARISON OF SECURE AND HIGH CAPACITY COLOR IMAGE STEGANOGRAPHY TECHNIQUES I...ijait
This document compares color image steganography techniques in the RGB and YCbCr color spaces. It summarizes previous related work and then describes a proposed method that hides two grayscale images in a color image. For RGB, the secret images are hidden in the green and blue color channels by matching blocks and storing the locations in encrypted keys. For YCbCr, one secret image is hidden in the Cb channel and the other in the Cr channel in the same way. The keys are extracted during retrieval and used to reconstruct the secret images from the color channels. Experimental results show YCbCr provides better steganography than RGB in terms of security and quality of extracted secret images.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Chaos Image Encryption using Pixel shuffling cscpconf
This document proposes a chaos-based image encryption algorithm using pixel shuffling. It uses elements from a chaotic map like the Henon map or Lorentz map to shuffle the pixel positions of an image. The chaotic elements are divided into blocks corresponding to the RGB channels. Pixel positions are reordered according to the sorted indices of each block. Encryption scrambles the pixel positions, while decryption restores the original positions using the same chaotic map. Experimental results on brain and Lena images show the encrypted images have very low correlation with the originals. Slight key changes also result in completely different decryptions, demonstrating key sensitivity of the algorithm.
Secured data hiding by using extended visual cryptographyeSAT Journals
Abstract
Due to the rapid advancement of the internet large amount of data is transmitted over the internet. Some of the transmitted
information is very important like password, confidential file, security codes etc. so it is very important to provide security to
these data. In computer technology there are two ways to provide security to the data they are cryptography & steganography.
Although, in the past, there has been various research related to cryptography & steganography but neither of them provide
enough & strong security. So this paper proposes a novel approach for data hiding by combining steganography & extended
visual cryptography. Visual cryptography was invented by Moni Naor & Adi Shamir in 1994. Visual cryptography hide secret
image within one or more images & then generate shares. For share generation this paper uses Visual Information Pixel (VIP) &
error diffusion technique.
Keywords: Steganography, Visual Cryptography, Share Generation, VIP, Extended Visual cryptography,
Cryptography
This document summarizes a research paper that proposes a novel approach for securing data by combining steganography and extended visual cryptography. It involves three main steps: 1) Hidden data is embedded into a cover image using a text embedding algorithm. 2) The cover image is then encrypted into two shares using a visual cryptography technique called VIP synchronization and error diffusion. 3) To extract the hidden data, the shares are combined and the extraction algorithm retrieves the text from the pixel values. The approach generates meaningful shares that look like random noise images. It analyzes the results by calculating the PSNR and MSE values between the original cover images and generated shares.
An LSB Method Of Image Steganographic TechniquesIJERA Editor
The art of information hiding has received much attention in the recent years as security of information has become a big concern in this internet era. As sharing of sensitive information via a common communication channel has become inevitable. Steganography means hiding a secret message (the embedded message) within a larger one (source cover) in such a way that an observer cannot detect the presence of contents of the hidden message [1]. Many different carrier file formats can be used, but digital images are the most popular because of their frequency on the Internet [2]. This paper intends to give an overview of image Steganography, its uses and techniques. It also attempts to identify the requirements of a good Steganography algorithm and briefly reflects on which Steganography techniques are more suitable for which applications.
Steganography based on random pixel selection for efficient data hiding 2IAEME Publication
This document discusses steganography techniques for hiding data in digital images. It begins with definitions of steganography and the RGB color model used in digital images. It then describes the least significant bit (LSB) insertion method for embedding secret messages into the LSB of pixels in an image. Specifically, it proposes randomly selecting pixels using a pseudorandom number generator to increase security. The document reviews related work on LSB-based steganography and discusses adaptive techniques and those using edge detection or patchwork algorithms. The goal is to combine security against visual and statistical attacks while hiding a large amount of data in the cover image.
This document discusses digital image compression techniques. It begins by defining digital images and the need for compression due to the large size of digital images. It then describes the three main types of redundancy in digital images that compression techniques aim to remove: coding redundancy, interpixel redundancy, and psychovisual redundancy. The document outlines different lossless and lossy compression techniques and how they work to remove these different types of redundancies in order to reduce the size of digital images.
Image steganography is the art of hiding a message, image, or file within another message, image, or file. Likely, an old term in Ancient Greek, Steganography is derived from steganos meaning ―”concealed” and graphein meaning ―”writing”, in other word we can say it refers to the science of “invisible” communication. Unlike cryptography, where the goal is to secure communications from an eavesdropper, steganography techniques strive to hide the very presence of the message itself froman observer. In this research paper we deal with hiding a digital message image inside a digital cover image leading us to the stego image. With the combination of Message Preparation using Spatial Domain image modification technique, discrete cosine transforms (DCT) and image scrambled using modified Arnold Transform, an algorithm based on the three technologies is proposed. The effectiveness of the proposed methods has been estimated by computing Mean square error (MSE) and Peak Signal to Noise Ratio (PSNR) and experimental result shows that the proposed algorithm is highly secured with good perceptual invisibility
The document proposes a reversible data hiding method that embeds secret bits into a compressed thumbnail image during an image interpolation process. As the original thumbnail is scaled up to the original size, secret data is embedded by modifying pixel values based on their maximum and minimum neighboring pixel values in the original thumbnail. Experimental results show this method achieves higher embedding capacities than an existing approach.
A new hybrid steganographic method for histogram preservation IJEEE
The document proposes a new hybrid steganographic method that embeds data in grayscale images while preserving the histogram characteristics. It uses pixel value differencing (PVD) and least significant bit (LSB) substitution. The method divides the pixel range into lower and higher levels and embeds more bits in higher levels. Each 3x3 block has a base pixel where 3 bits are embedded using LSB replacement. Remaining pixels are embedded using PVD. Experiments show it provides higher embedding capacity and image quality than existing methods while introducing fewer changes to the histogram.
Image steganography techniques can be classified into two major categories such as spatial domain techniques and frequency domain techniques.
In spatial domain techniques the secret message is hidden inside the image by applying some manipulation over the different pixels of the image.
In frequency domain techniques the image is transformed to another form by applying a transformation like discrete wavelet transform and then the message is hidden by applying any of the usual embedding techniques.
USING BIAS OPTIMIAZATION FOR REVERSIBLE DATA HIDING USING IMAGE INTERPOLATIONIJNSA Journal
In this paper, we propose a reversible data hiding method in the spatial domain for compressed grayscale images. The proposed method embeds secret bits into a compressed thumbnail of the original image by using a novel interpolation method and the Neighbour Mean Interpolation (NMI) technique as scaling up to the original image occurs. Experimental results presented in this paper show that the proposed method has significantly improved embedding capacities over the approach proposed by Jung and Yoo.
This document analyzes the process of adding and subtracting selective random noise signals (SRNS) to encrypt and decrypt color images. It discusses converting RGB images to YIQ format to allow adding noise, generating SRNS using an equation with a parameter k to control image quality, and the steps of the encryption and decryption processes which involve adding and subtracting the SRNS. Experimental results on test images show increasing k decreases image quality metrics like PSNR between the original and encrypted images as expected.
The Comparative Study on Visual Cryptography and Random Grid CryptographyIOSR Journals
Visual cryptography allows images to be encrypted into shares that can be decrypted by the human visual system without computers. Random grid cryptography encrypts images into cipher grids without pixel expansion, retaining the size of the original image. This document compares visual cryptography and random grid cryptography schemes based on analysis of Naor and Shamir's 2 out of 2 algorithm and Kafri and Keren's first random grid algorithm. It also discusses improving the contrast of reconstructed images using algorithms like linear error correcting codes and proposed decryption operations for random grids.
Implementation of image steganography using lab viewIJARIIT
Steganography is the one of the technique to hide secret messages within a larger one in such way that someone can
not know the presence or contents of the hidden message. The purpose of Steganography is to maintain secret communication
between two parties. This paper presents the implementation of a highly secured data hiding technique called Steganography.
This technique is applicable for image data type. The main aim of this technique is to encode the data image within the cover
image such that the data image's existence is concealed. Here we use the data as an image for Steganography. It deals with the
encoding data image information in a given image (called cover image) without making any visible changes to it. LabVIEW
graphical programming environment is a tool for realizing the image acquisition and processing. This software has several
advantages: simple implementation, modularity, flexibility, attractive user interface and the possibility to develop very easy new
features.
Colour Image Steganography Based on Pixel Value Differencing in Spatial Domainijistjournal
In a color image every pixel value composed of red, green and blue component and each of which ranges from 0 to 255 in case of 8-bit representation. In this paper, we have used pixel value differencing (PVD) method for secret data embedding in each of the component of a pixel in a color image. But when we use pixel-value differencing (PVD) method as image steganographic scheme, the pixel values in the stegoimage may exceed the range 0~255. We have eliminated this overflow problem of each component pixel. Furthermore for providing more security, we have used different number of bits in different pixel components. It would be very difficult to trace how many bits are embedded in a pixel of the stego image. From the experiments it is seen that the results obtained in proposed method provides better visual quality of stego-image compared to the PVD method.
Steganography is the technique of hiding the fact that communication is taking place,by hiding data in other data. Many different carrier file formats such as image, audio, video, DNA etc can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in images, there exist a large variety of steganographic techniques. In this paper different steganographic techniques are described.
Steganography is the technique of hiding the fact that communication is taking place,
by hiding data in other data. Many different carrier file formats can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in
images, there exist a large variety of steganographic techniques. Steganalysis, the detection of this
hidden information, is an inherently difficult problem.In this paper,I am going to cover different
steganographic techniques researched by different researchers.
Keywords — Cryptography, Steganography, LSB, Hash-LSB, RSA Encryption –Decryption
Implementation of LSB-Based Image Steganography Method for effectiveness of D...ijsrd.com
Increased use of electronic communication has given birth to new ways of transmitting information securely. Steganography is a science of hiding information by embedding it in some other data called host message. Images are most known objects for steganography. The host message before steganography and stego message after steganography have the same characteristics. The given work is to be done by evaluating it on MATALAB. While evaluation one can calculate SNR, PSNR and BER for individual information Bit for conceal bit and analysis effect on results.
Experimental analysis of matching technique of steganography for greyscale an...ijcsit
Steganography and steganalysis are vital matter in information hiding. Steganography refers to the
technology of hiding data into digital media without depiction of any misgiving, while steganalysis is the
detection of the existence of steganography. In this paper, the impact of sequential matching method for
every possible location in pixel is analyzed experimentally. After matching the steganalysis is check by
image quality measures (IQM) and Statistics, Histogram Analysis and visual attack. This analysis provides
comprehensive study and understanding of basic matching technique and is helpful for those who want to
work in the field of image steganography.
This document presents a technique for steganography using the least significant bit (LSB) and an encryption method. It discusses how the LSB technique works by replacing the LSB of pixels in a cover image with bits from a secret image. It then proposes encrypting the LSB plane of the encoded image by altering its columns at regular intervals before generating the stego image. This increases security by making it harder to extract the secret image through steganalysis while maintaining image quality. MATLAB code demonstrates embedding a secret image in a cover image using LSB, encrypting the LSB plane, generating the stego image, and successfully extracting the secret image.
COMPARISON OF SECURE AND HIGH CAPACITY COLOR IMAGE STEGANOGRAPHY TECHNIQUES I...ijait
This document compares color image steganography techniques in the RGB and YCbCr color spaces. It summarizes previous related work and then describes a proposed method that hides two grayscale images in a color image. For RGB, the secret images are hidden in the green and blue color channels by matching blocks and storing the locations in encrypted keys. For YCbCr, one secret image is hidden in the Cb channel and the other in the Cr channel in the same way. The keys are extracted during retrieval and used to reconstruct the secret images from the color channels. Experimental results show YCbCr provides better steganography than RGB in terms of security and quality of extracted secret images.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Chaos Image Encryption using Pixel shuffling cscpconf
This document proposes a chaos-based image encryption algorithm using pixel shuffling. It uses elements from a chaotic map like the Henon map or Lorentz map to shuffle the pixel positions of an image. The chaotic elements are divided into blocks corresponding to the RGB channels. Pixel positions are reordered according to the sorted indices of each block. Encryption scrambles the pixel positions, while decryption restores the original positions using the same chaotic map. Experimental results on brain and Lena images show the encrypted images have very low correlation with the originals. Slight key changes also result in completely different decryptions, demonstrating key sensitivity of the algorithm.
Secured data hiding by using extended visual cryptographyeSAT Journals
Abstract
Due to the rapid advancement of the internet large amount of data is transmitted over the internet. Some of the transmitted
information is very important like password, confidential file, security codes etc. so it is very important to provide security to
these data. In computer technology there are two ways to provide security to the data they are cryptography & steganography.
Although, in the past, there has been various research related to cryptography & steganography but neither of them provide
enough & strong security. So this paper proposes a novel approach for data hiding by combining steganography & extended
visual cryptography. Visual cryptography was invented by Moni Naor & Adi Shamir in 1994. Visual cryptography hide secret
image within one or more images & then generate shares. For share generation this paper uses Visual Information Pixel (VIP) &
error diffusion technique.
Keywords: Steganography, Visual Cryptography, Share Generation, VIP, Extended Visual cryptography,
Cryptography
This document summarizes a research paper that proposes a novel approach for securing data by combining steganography and extended visual cryptography. It involves three main steps: 1) Hidden data is embedded into a cover image using a text embedding algorithm. 2) The cover image is then encrypted into two shares using a visual cryptography technique called VIP synchronization and error diffusion. 3) To extract the hidden data, the shares are combined and the extraction algorithm retrieves the text from the pixel values. The approach generates meaningful shares that look like random noise images. It analyzes the results by calculating the PSNR and MSE values between the original cover images and generated shares.
An LSB Method Of Image Steganographic TechniquesIJERA Editor
The art of information hiding has received much attention in the recent years as security of information has become a big concern in this internet era. As sharing of sensitive information via a common communication channel has become inevitable. Steganography means hiding a secret message (the embedded message) within a larger one (source cover) in such a way that an observer cannot detect the presence of contents of the hidden message [1]. Many different carrier file formats can be used, but digital images are the most popular because of their frequency on the Internet [2]. This paper intends to give an overview of image Steganography, its uses and techniques. It also attempts to identify the requirements of a good Steganography algorithm and briefly reflects on which Steganography techniques are more suitable for which applications.
Steganography based on random pixel selection for efficient data hiding 2IAEME Publication
This document discusses steganography techniques for hiding data in digital images. It begins with definitions of steganography and the RGB color model used in digital images. It then describes the least significant bit (LSB) insertion method for embedding secret messages into the LSB of pixels in an image. Specifically, it proposes randomly selecting pixels using a pseudorandom number generator to increase security. The document reviews related work on LSB-based steganography and discusses adaptive techniques and those using edge detection or patchwork algorithms. The goal is to combine security against visual and statistical attacks while hiding a large amount of data in the cover image.
This document discusses digital image compression techniques. It begins by defining digital images and the need for compression due to the large size of digital images. It then describes the three main types of redundancy in digital images that compression techniques aim to remove: coding redundancy, interpixel redundancy, and psychovisual redundancy. The document outlines different lossless and lossy compression techniques and how they work to remove these different types of redundancies in order to reduce the size of digital images.
Image steganography is the art of hiding a message, image, or file within another message, image, or file. Likely, an old term in Ancient Greek, Steganography is derived from steganos meaning ―”concealed” and graphein meaning ―”writing”, in other word we can say it refers to the science of “invisible” communication. Unlike cryptography, where the goal is to secure communications from an eavesdropper, steganography techniques strive to hide the very presence of the message itself froman observer. In this research paper we deal with hiding a digital message image inside a digital cover image leading us to the stego image. With the combination of Message Preparation using Spatial Domain image modification technique, discrete cosine transforms (DCT) and image scrambled using modified Arnold Transform, an algorithm based on the three technologies is proposed. The effectiveness of the proposed methods has been estimated by computing Mean square error (MSE) and Peak Signal to Noise Ratio (PSNR) and experimental result shows that the proposed algorithm is highly secured with good perceptual invisibility
The document proposes a reversible data hiding method that embeds secret bits into a compressed thumbnail image during an image interpolation process. As the original thumbnail is scaled up to the original size, secret data is embedded by modifying pixel values based on their maximum and minimum neighboring pixel values in the original thumbnail. Experimental results show this method achieves higher embedding capacities than an existing approach.
A new hybrid steganographic method for histogram preservation IJEEE
The document proposes a new hybrid steganographic method that embeds data in grayscale images while preserving the histogram characteristics. It uses pixel value differencing (PVD) and least significant bit (LSB) substitution. The method divides the pixel range into lower and higher levels and embeds more bits in higher levels. Each 3x3 block has a base pixel where 3 bits are embedded using LSB replacement. Remaining pixels are embedded using PVD. Experiments show it provides higher embedding capacity and image quality than existing methods while introducing fewer changes to the histogram.
Image steganography techniques can be classified into two major categories such as spatial domain techniques and frequency domain techniques.
In spatial domain techniques the secret message is hidden inside the image by applying some manipulation over the different pixels of the image.
In frequency domain techniques the image is transformed to another form by applying a transformation like discrete wavelet transform and then the message is hidden by applying any of the usual embedding techniques.
USING BIAS OPTIMIAZATION FOR REVERSIBLE DATA HIDING USING IMAGE INTERPOLATIONIJNSA Journal
In this paper, we propose a reversible data hiding method in the spatial domain for compressed grayscale images. The proposed method embeds secret bits into a compressed thumbnail of the original image by using a novel interpolation method and the Neighbour Mean Interpolation (NMI) technique as scaling up to the original image occurs. Experimental results presented in this paper show that the proposed method has significantly improved embedding capacities over the approach proposed by Jung and Yoo.
This document analyzes the process of adding and subtracting selective random noise signals (SRNS) to encrypt and decrypt color images. It discusses converting RGB images to YIQ format to allow adding noise, generating SRNS using an equation with a parameter k to control image quality, and the steps of the encryption and decryption processes which involve adding and subtracting the SRNS. Experimental results on test images show increasing k decreases image quality metrics like PSNR between the original and encrypted images as expected.
The Comparative Study on Visual Cryptography and Random Grid CryptographyIOSR Journals
Visual cryptography allows images to be encrypted into shares that can be decrypted by the human visual system without computers. Random grid cryptography encrypts images into cipher grids without pixel expansion, retaining the size of the original image. This document compares visual cryptography and random grid cryptography schemes based on analysis of Naor and Shamir's 2 out of 2 algorithm and Kafri and Keren's first random grid algorithm. It also discusses improving the contrast of reconstructed images using algorithms like linear error correcting codes and proposed decryption operations for random grids.
Implementation of image steganography using lab viewIJARIIT
Steganography is the one of the technique to hide secret messages within a larger one in such way that someone can
not know the presence or contents of the hidden message. The purpose of Steganography is to maintain secret communication
between two parties. This paper presents the implementation of a highly secured data hiding technique called Steganography.
This technique is applicable for image data type. The main aim of this technique is to encode the data image within the cover
image such that the data image's existence is concealed. Here we use the data as an image for Steganography. It deals with the
encoding data image information in a given image (called cover image) without making any visible changes to it. LabVIEW
graphical programming environment is a tool for realizing the image acquisition and processing. This software has several
advantages: simple implementation, modularity, flexibility, attractive user interface and the possibility to develop very easy new
features.
Colour Image Steganography Based on Pixel Value Differencing in Spatial Domainijistjournal
In a color image every pixel value composed of red, green and blue component and each of which ranges from 0 to 255 in case of 8-bit representation. In this paper, we have used pixel value differencing (PVD) method for secret data embedding in each of the component of a pixel in a color image. But when we use pixel-value differencing (PVD) method as image steganographic scheme, the pixel values in the stegoimage may exceed the range 0~255. We have eliminated this overflow problem of each component pixel. Furthermore for providing more security, we have used different number of bits in different pixel components. It would be very difficult to trace how many bits are embedded in a pixel of the stego image. From the experiments it is seen that the results obtained in proposed method provides better visual quality of stego-image compared to the PVD method.
Steganography is the technique of hiding the fact that communication is taking place,by hiding data in other data. Many different carrier file formats such as image, audio, video, DNA etc can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in images, there exist a large variety of steganographic techniques. In this paper different steganographic techniques are described.
Steganography is the technique of hiding the fact that communication is taking place,
by hiding data in other data. Many different carrier file formats can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in
images, there exist a large variety of steganographic techniques. Steganalysis, the detection of this
hidden information, is an inherently difficult problem.In this paper,I am going to cover different
steganographic techniques researched by different researchers.
Keywords — Cryptography, Steganography, LSB, Hash-LSB, RSA Encryption –Decryption
Implementation of LSB-Based Image Steganography Method for effectiveness of D...ijsrd.com
Increased use of electronic communication has given birth to new ways of transmitting information securely. Steganography is a science of hiding information by embedding it in some other data called host message. Images are most known objects for steganography. The host message before steganography and stego message after steganography have the same characteristics. The given work is to be done by evaluating it on MATALAB. While evaluation one can calculate SNR, PSNR and BER for individual information Bit for conceal bit and analysis effect on results.
The document discusses combining cryptography and steganography to securely transmit secret messages. It proposes encrypting a secret image using DES encryption and hiding the encrypted image in the least significant bits of cover images. The algorithm and block diagrams for encryption, embedding, retrieval and decryption are described. Experimental results comparing embedding in the 1st-2nd vs 3rd-4th least significant bits are shown, with the former being less perceptible. The conclusion is that combining cryptography and steganography increases security, and the encrypted images can be accurately retrieved and decrypted.
Steganography is going to gain its importance due to the exponential growth and secret communication of potential computer users over the internet [5]. It can also be defined as the study of invisible communication that usually deals with the ways of hiding the existence of the communicated message. Generally data embedding is achieved in communication, image, text, voice or multimedia content for copyright, military communication, authentication and many other purposes [2]. In image Steganography, secret communication is achieved to embed a message into cover image (used as the carrier to embed message into) and generate a stego- image (generated image which is carrying a hidden message)[1]. In this paper we have critically analyzed various steganographic techniques and also have covered steganography overview its major types, classification, applications [3]. KEYWORDS: STEGANOGRAPHY, STEGO IMAGE, COVER IMAGE, LSB
Journal - DATA HIDING SECURITY USING BIT MATCHING-BASED STEGANOGRAPHY AND CR...Budi Prasetiyo
This document presents a new method for combining steganography and cryptography without changing the quality of the cover image. The method embeds secret messages by finding the bits in the message that match bits in the most significant bit (MSB) of cover images. It stores the indices of the matching bit positions. The indices are then encrypted using the Data Encryption Standard (DES) cryptographic algorithm. Experiments show that the proposed method can securely hide messages in images without degrading image quality. Larger cover images allow hiding more data but require more time for the bit-matching process. Adding noise to cover images starts degrading hidden messages at a mean squared error of 0.00049.
A New Algorithm for Digital Colour Image Encryption and DecryptionIRJET Journal
This document proposes a new algorithm for encrypting and decrypting digital color images. The algorithm uses pixel shuffling, logistic map encryption, and steganography.
The encryption process involves dividing the image into blocks and rotating them, embedding the image size using steganography, shuffling pixels according to a secret pattern, and XORing the shuffled image with one generated chaotically from a logistic map.
Decryption reverses the process by XORing with the logistic map image, descrambling pixels, extracting the size, and rotating blocks back to the original orientation. Experimental results on a sample image show the encrypted image has a uniform color distribution that resists statistical analysis attacks.
The document proposes a method to improve security for LSB2 steganography. It involves:
1. Using LSB2 to hide a message in a cover image, generating a holding image.
2. Encrypting the holding image by dividing it into blocks, reordering the blocks, and using the reordering sequence as a private key.
3. To extract the message, the encrypted image is decrypted using the private key, then LSB2 is applied to extract the message.
Experimental results show the proposed encryption reduces the peak signal to noise ratio and increases the mean squared error compared to LSB2 alone, improving security. Larger cover images provide better results for LSB2 hiding and
The document proposes a method to improve security for LSB2 steganography. It involves:
1. Using LSB2 to hide a message in a cover image, generating a holding image.
2. Encrypting the holding image by dividing it into blocks, reordering the blocks, and using the reordering sequence as a private key.
3. To extract the message, the encrypted image is decrypted using the private key, then LSB2 is applied to extract the message.
Experimental results show the proposed encryption method decreases PSNR and increases MSE between the original and encrypted images, improving security over LSB2 alone. Larger cover images provide better PSNR and MSE for data hiding.
The document proposes a method to improve security for LSB2 steganography. It involves:
1. Using LSB2 to hide a message in a cover image, generating a holding image.
2. Encrypting the holding image by dividing it into blocks, reordering the blocks, and using the reordering sequence as a private key.
3. Experiments showed the proposed method decreased PSNR and increased MSE between original and encrypted images, improving security over LSB2 alone. It allowed hiding messages in images with minimal impact on image quality.
This document proposes a method to improve the security of LSB2 steganography for hiding secret messages in digital color images. The method adds an encryption phase that divides the cover image into blocks and reorders the blocks to generate an encrypted image. The reordering sequence is used as a private key (PK) for decryption. Experimental results on several test images show that the proposed blocking and reordering encryption decreases the peak signal-to-noise ratio and increases the mean squared error between the original and encrypted images, indicating increased security. It also only slightly increases the processing time compared to the standard LSB2 method. The method provides improved security for secret message hiding in digital images without significantly impacting image quality or processing efficiency.
The document proposes a method to improve security for LSB2 steganography. It involves:
1. Using LSB2 to hide a message in a cover image, generating a holding image.
2. Encrypting the holding image by dividing it into blocks, reordering the blocks, and using the reordering sequence as a private key.
3. Experiments showed the proposed method decreased PSNR and increased MSE between original and encrypted images, improving security over LSB2 alone. It also maintained a high PSNR and low MSE between original and holding images.
This document proposes a method to improve the security of LSB2 steganography for hiding secret messages in digital color images. The method adds an encryption phase that divides the cover image into blocks and reorders the blocks to generate an encrypted image. The reordering sequence is used as a private key (PK) for decryption. Experimental results on several test images show that the proposed blocking and reordering encryption decreases the peak signal-to-noise ratio and increases the mean squared error between the original and encrypted images, indicating increased security. It also only slightly increases the processing time compared to the standard LSB2 method. The method provides improved security for secret message hiding in digital images without significantly impacting image quality or processing efficiency.
The document proposes a method to improve security for LSB2 steganography. It involves:
1. Using LSB2 to hide a message in a cover image, generating a holding image.
2. Encrypting the holding image by dividing it into blocks, reordering the blocks, and using the reordering sequence as a private key.
3. To extract the message, the encrypted image is decrypted using the private key, then LSB2 is applied to extract the message.
Experimental results show the proposed encryption reduces the peak signal to noise ratio and increases the mean squared error compared to LSB2 alone, improving security. Larger cover images provide better results for LSB2 hiding and
This document proposes a method to improve the security of LSB2 steganography for hiding secret messages in digital color images. The method adds an encryption phase that divides the cover image into blocks and reorders the blocks to generate an encrypted image. The reordering sequence is used as a private key (PK) for decryption. Experimental results on several test images show that the proposed blocking and reordering encryption decreases the peak signal-to-noise ratio and increases the mean squared error between the original and encrypted images, indicating increased security. It also only slightly increases the processing time compared to the standard LSB2 method. The method provides improved security for secret message hiding in digital images without significantly impacting image quality or processing efficiency.
Image Steganography Using HBC and RDH TechniqueEditor IJCATR
There are algorithms in existence for hiding data within an image. The proposed scheme treats the image as a whole. Here
Integer Cosine Transform (ICT) and Integer Wavelet Transform (IWT) is combined for converting signal to frequency. Hide Behind
Corner (HBC) algorithm is used to place a key at corners of the image. All the corner keys are encrypted by generating Pseudo
Random Numbers. The Secret keys are used for corner parts. Then the hidden image is transmitted. The receiver should be aware of
the keys that are used at the corners while encrypting the image. Reverse Data Hiding (RDH) is used to get the original image and it
proceeds once when all the corners are unlocked with proper secret keys. With these methods the performance of the stegnographic
technique is improved in terms of PSNR value.
Fast and Secure Transmission of Image by using Byte Rotation Algorithm in Net...IRJET Journal
This document proposes a new secure image transmission method using byte rotation algorithm that improves encryption speed and security. The key steps are:
1. The input image is divided into four blocks which are shuffled using byte rotation.
2. A cover image is used to embed the shuffled secret image blocks for transmission.
3. At the receiver, byte rotation is applied again to extract the original secret image blocks from the embedded image.
Experimental results show the proposed method recovers images with high PSNR quality scores while increasing encryption speed over other algorithms like AES. This provides a more secure and fast way to transmit encrypted images over networks.
Cecimg an ste cryptographic approach for data security in imageijctet
The document presents a new algorithm called CECIMG (Canny edge encryption image steganography) for securing data in images. It combines Blowfish encryption with embedding encrypted data in the edge pixels of an image detected using Canny edge detection. The algorithm is implemented in Java and experiments show it provides better security and higher PSNR values than existing LSB steganography techniques. It securely stores encrypted data in images in a series of steps and allows retrieval of the original data. The algorithm aims to maximize security compared to traditional approaches.
High Security Cryptographic Technique Using Steganography and Chaotic Image E...IOSR Journals
This document summarizes a proposed cryptographic technique that combines steganography and chaotic image encryption to provide high security. Steganography is used to hide a message within a cover image by embedding it in the least significant bits of pixel values without affecting image quality. The resulting stego-image is then encrypted using triple-key chaotic image encryption based on the logistic map, making the encrypted data highly sensitive to changes in the initial encryption keys. The technique provides four layers of security to securely transmit hidden messages within digital images.
This document describes an electronic doorbell system that uses a keypad and GSM for home security. The system consists of a doorbell connected to a microcontroller that triggers a GSM module to send an SMS to the homeowner when the doorbell is pressed. The homeowner can then respond via button press to open the door, or a message will be displayed if they do not respond. An authorized person can enter a password on the keypad, and if multiple wrong passwords are entered, a message will be sent to the homeowner about a potential burglary attempt. The system aims to provide notification to homeowners and prevent unauthorized access through use of passwords and messaging capabilities.
Augmented reality, the new age technology, has widespread applications in every field imaginable. This technology has proven to be an inflection point in numerous verticals, improving lives and improving performance. In this paper, we explore the various possible applications of Augmented Reality (AR) in the field of Medicine. The objective of using AR in medicine or generally in any field is the fact that, AR helps in motivating the user, making sessions interactive and assist in faster learning. In this paper, we discuss about the applicability of AR in the field of medical diagnosis. Augmented reality technology reinforces remote collaboration, allowing doctors to diagnose patients from a different locality. Additionally, we believe that a much more pronounced effect can be achieved by bringing together the cutting edge technology of AR and the lifesaving field of Medical sciences. AR is a mechanism that could be applied in the learning process too. Similarly, virtual reality could be used in the field where more of practical experience is needed such as driving, sports, neonatal care training.
Image fusion is a sub field of image processing in which more than one images are fused to create an image where all the objects are in focus. The process of image fusion is performed for multi-sensor and multi-focus images of the same scene. Multi-sensor images of the same scene are captured by different sensors whereas multi-focus images are captured by the same sensor. In multi-focus images, the objects in the scene which are closer to the camera are in focus and the farther objects get blurred. Contrary to it, when the farther objects are focused then closer objects get blurred in the image. To achieve an image where all the objects are in focus, the process of images fusion is performed either in spatial domain or in transformed domain. In recent times, the applications of image processing have grown immensely. Usually due to limited depth of field of optical lenses especially with greater focal length, it becomes impossible to obtain an image where all the objects are in focus. Thus, it plays an important role to perform other tasks of image processing such as image segmentation, edge detection, stereo matching and image enhancement. Hence, a novel feature-level multi-focus image fusion technique has been proposed which fuses multi-focus images. Thus, the results of extensive experimentation performed to highlight the efficiency and utility of the proposed technique is presented. The proposed work further explores comparison between fuzzy based image fusion and neuro fuzzy fusion technique along with quality evaluation indices.
Graphs have become the dominant life-form of many tasks as they advance a
structure to represent many tasks and the corresponding relations. A powerful
role of networks/graphs is to bridge local feats that exist in vertices as they
blossom into patterns that help explain how nodal relations and their edges
impacts a complex effect that ripple via a graph. User cluster are formed as a
result of interactions between entities. Many users can hardly categorize their
contact into groups today such as “family”, “friends”, “colleagues” etc. Thus,
the need to analyze such user social graph via implicit clusters, enables the
dynamism in contact management. Study seeks to implement this dynamism
via a comparative study of deep neural network and friend suggest algorithm.
We analyze a user’s implicit social graph and seek to automatically create
custom contact groups using metrics that classify such contacts based on a
user’s affinity to contacts. Experimental results demonstrate the importance
of both the implicit group relationships and the interaction-based affinity in
suggesting friends.
This paper projects Gryllidae Optimization Algorithm (GOA) has been applied to solve optimal reactive power problem. Proposed GOA approach is based on the chirping characteristics of Gryllidae. In common, male Gryllidae chirp, on the other hand some female Gryllidae also do as well. Male Gryllidae draw the females by this sound which they produce. Moreover, they caution the other Gryllidae against dangers with this sound. The hearing organs of the Gryllidae are housed in an expansion of their forelegs. Through this, they bias to the produced fluttering sounds. Proposed Gryllidae Optimization Algorithm (GOA) has been tested in standard IEEE 14, 30 bus test systems and simulation results show that the projected algorithms reduced the real power loss considerably.
In the wake of the sudden replacement of wood and kerosene by gas cookers for several purposes in Nigeria, gas leakage has caused several damages in our homes, Laboratories among others. installation of a gas leakage detection device was globally inspired to eliminate accidents related to gas leakage. We present an alternative approach to developing a device that can automatically detect and control gas leakages and also monitor temperature. The system detects the leakage of the LPG (Liquefied Petroleum Gas) using a gas sensor, then triggred the control system response which employs ventilator system, Mobile phone alert and alarm when the LPG concentration in the air exceeds a certain level. The performance of two gas sensors (MQ5 and MQ6) were tested for a guided decision. Also, when the temperature of the environment poses a danger, LED (indicator), buzzer and LCD (16x2) display was used to indicate temperature and gas leakage status in degree Celsius and PPM respectively. Attension was given to the response time of the control system, which was ascertained that this system significantly increases the chances and efficiency of eliminating gas leakage related accident.
Feature selection problem is one of the main important problems in the text and data mining domain. This paper presents a comparative study of feature selection methods for Arabic text classification. Five of the feature selection methods were selected: ICHI square, CHI square, Information Gain, Mutual Information and Wrapper. It was tested with five classification algorithms: Bayes Net, Naive Bayes, Random Forest, Decision Tree and Artificial Neural Networks. In addition, Data Collection was used in Arabic consisting of 9055 documents, which were compared by four criteria: Precision, Recall, F-measure and Time to build model. The results showed that the improved ICHI feature selection got almost all the best results in comparison with other methods.
The document proposes the Gentoo Penguin Algorithm (GPA) to solve the optimal reactive power problem. The goal is to minimize real power loss. GPA is inspired by the natural behaviors of Gentoo penguins. In GPA, penguin positions represent potential solutions. Penguins move toward other penguins with lower "cost" or higher heat concentration, representing better solutions. Cost is defined by heat concentration and distance between penguins. Heat radiation decreases with distance. The algorithm is tested on the IEEE 57 bus system and reduces real power loss effectively compared to other methods.
08 20272 academic insight on applicationIAESIJEECS
This research has thrown up many questions in need of further investigation.There was an expressive quantitative-qualitative research, which a common investigation form was used in.The dialogue item was also applied to discover if the contributors asserted the media-based attitude supplements their learning of academic English writing classes or not.Data recounted academic” insights toward using Skype as a sustaining implement for lessons releasing based on chosen variables: their occupation, year of education, and knowledge with Skype discovered that there were no important statistical differences in the use of Skype units because of medical academics major knowledge. There are statistically important differences in using Skype units. The findings also, disclosed that there are statistically significant differences in using Skype units due to the practice with Skype variable, in favors of academics with no Skype use practice. Skype instrument as an instructive media is a positive medium to be employed to supply academic medical writing data and assist education. Academics who do not have enough time to contribute in classes believe comfortable using the Skype-based attitude in scientific writing. They who took part in the course claimed that their approval of this media is due to learning academic innovative medical writing.
Cloud computing has sweeping impact on the human productivity. Today it’s used for Computing, Storage, Predictions and Intelligent Decision Making, among others. Intelligent Decision-Making using Machine Learning has pushed for the Cloud Services to be even more fast, robust and accurate. Security remains one of the major concerns which affect the cloud computing growth however there exist various research challenges in cloud computing adoption such as lack of well managed service level agreement (SLA), frequent disconnections, resource scarcity, interoperability, privacy, and reliability. Tremendous amount of work still needs to be done to explore the security challenges arising due to widespread usage of cloud deployment using Containers. We also discuss Impact of Cloud Computing and Cloud Standards. Hence in this research paper, a detailed survey of cloud computing, concepts, architectural principles, key services, and implementation, design and deployment challenges of cloud computing are discussed in detail and important future research directions in the era of Machine Learning and Data Science have been identified.
Notary is an official authorized to make an authentic deed regarding all deeds, agreements and stipulations required by a general rule. Activities carried out at the notary office such as recording client data and file data still use traditional systems that tend to be manual. The problem that occurs is the inefficiency in data processing and providing information to clients. Clients have difficulty getting information related to the progress of documents that are being taken care of at the notary's office. The client must take the time to arrive to the notary's office repeatedly to check the progress of the work of the document file. The purpose of this study is to facilitate clients in obtaining information about the progress of the work in progress, and make it easier for employees to process incoming documents by implementing an administrative system. This system was developed with the waterfall system development method and uses the Multi-Channel Access Technology integrated in the website to simplify the process of delivering information and requesting information from clients and to clients with Telegram and SMS Gateway. Clients will come to the office only when there is a notification from the system via Telegram or SMS notifying that the client must come directly to the notary's office, thus leading to an efficient time and avoiding excessive transportation costs. The overall functional system can function properly based on the results of alpha testing. The results of beta testing conducted by distributing the system feasibility test questionnaire to end users, get a percentage of 96% of users agree the system is feasible to be implemented.
In this work Tundra wolf algorithm (TWA) is proposed to solve the optimal reactive power problem. In the projected Tundra wolf algorithm (TWA) in order to avoid the searching agents from trapping into the local optimal the converging towards global optimal is divided based on two different conditions. In the proposed Tundra wolf algorithm (TWA) omega tundra wolf has been taken as searching agent as an alternative of indebted to pursue the first three most excellent candidates. Escalating the searching agents’ numbers will perk up the exploration capability of the Tundra wolf wolves in an extensive range. Proposed Tundra wolf algorithm (TWA) has been tested in standard IEEE 14, 30 bus test systems and simulation results show the proposed algorithm reduced the real power loss effectively.
In this work Predestination of Particles Wavering Search (PPS) algorithm has been applied to solve optimal reactive power problem. PPS algorithm has been modeled based on the motion of the particles in the exploration space. Normally the movement of the particle is based on gradient and swarming motion. Particles are permitted to progress in steady velocity in gradient-based progress, but when the outcome is poor when compared to previous upshot, immediately particle rapidity will be upturned with semi of the magnitude and it will help to reach local optimal solution and it is expressed as wavering movement. In standard IEEE 14, 30, 57,118,300 bus systems Proposed Predestination of Particles Wavering Search (PPS) algorithm is evaluated and simulation results show the PPS reduced the power loss efficiently.
In this paper, Mine Blast Algorithm (MBA) has been intermingled with Harmony Search (HS) algorithm for solving optimal reactive power dispatch problem. MBA is based on explosion of landmines and HS is based on Creativeness progression of musicians-both are hybridized to solve the problem. In MBA Initial distance of shrapnel pieces are reduced gradually to allow the mine bombs search the probable global minimum location in order to amplify the global explore capability. Harmony search (HS) imitates the music creativity process where the musicians supervise their instruments’ pitch by searching for a best state of harmony. Hybridization of Mine Blast Algorithm with Harmony Search algorithm (MH) improves the search effectively in the solution space. Mine blast algorithm improves the exploration and harmony search algorithm augments the exploitation. At first the proposed algorithm starts with exploration & gradually it moves to the phase of exploitation. Proposed Hybridized Mine Blast Algorithm with Harmony Search algorithm (MH) has been tested on standard IEEE 14, 300 bus test systems. Real power loss has been reduced considerably by the proposed algorithm. Then Hybridized Mine Blast Algorithm with Harmony Search algorithm (MH) tested in IEEE 30, bus system (with considering voltage stability index)- real power loss minimization, voltage deviation minimization, and voltage stability index enhancement has been attained.
Artificial Neural Networks have proved their efficiency in a large number of research domains. In this paper, we have applied Artificial Neural Networks on Arabic text to prove correct language modeling, text generation, and missing text prediction. In one hand, we have adapted Recurrent Neural Networks architectures to model Arabic language in order to generate correct Arabic sequences. In the other hand, Convolutional Neural Networks have been parameterized, basing on some specific features of Arabic, to predict missing text in Arabic documents. We have demonstrated the power of our adapted models in generating and predicting correct Arabic text comparing to the standard model. The model had been trained and tested on known free Arabic datasets. Results have been promising with sufficient accuracy.
In the present-day communications speech signals get contaminated due to
various sorts of noises that degrade the speech quality and adversely impacts
speech recognition performance. To overcome these issues, a novel approach
for speech enhancement using Modified Wiener filtering is developed and
power spectrum computation is applied for degraded signal to obtain the
noise characteristics from a noisy spectrum. In next phase, MMSE technique
is applied where Gaussian distribution of each signal i.e. original and noisy
signal is analyzed. The Gaussian distribution provides spectrum estimation
and spectral coefficient parameters which can be used for probabilistic model
formulation. Moreover, a-priori-SNR computation is also incorporated for
coefficient updation and noise presence estimation which operates similar to
the conventional VAD. However, conventional VAD scheme is based on the
hard threshold which is not capable to derive satisfactory performance and a
soft-decision based threshold is developed for improving the performance of
speech enhancement. An extensive simulation study is carried out using
MATLAB simulation tool on NOIZEUS speech database and a comparative
study is presented where proposed approach is proved better in comparison
with existing technique.
Previous research work has highlighted that neuro-signals of Alzheimer’s disease patients are least complex and have low synchronization as compared to that of healthy and normal subjects. The changes in EEG signals of Alzheimer’s subjects start at early stage but are not clinically observed and detected. To detect these abnormalities, three synchrony measures and wavelet-based features have been computed and studied on experimental database. After computing these synchrony measures and wavelet features, it is observed that Phase Synchrony and Coherence based features are able to distinguish between Alzheimer’s disease patients and healthy subjects. Support Vector Machine classifier is used for classification giving 94% accuracy on experimental database used. Combining, these synchrony features and other such relevant features can yield a reliable system for diagnosing the Alzheimer’s disease.
Attenuation correction designed for PET/MR hybrid imaging frameworks along with portion making arrangements used for MR-based radiation treatment remain testing because of lacking high-energy photon weakening data. We present a new method so as to uses the learned nonlinear neighborhood descriptors also highlight coordinating toward foresee pseudo-CT pictures starting T1w along with T2w MRI information. The nonlinear neighborhood descriptors are acquired through anticipating the direct descriptors interested in the nonlinear high-dimensional space utilizing an unequivocal constituent guide also low-position guess through regulated complex regularization. The nearby neighbors of every near descriptor inside the data MR pictures are looked during an obliged spatial extent of the MR pictures among the training dataset. By that point, the pseudo-CT patches are evaluated through k-closest neighbor relapse. The planned procedure designed for pseudo-CT forecast is quantitatively broke downward on top of a dataset comprising of coordinated mind MRI along with CT pictures on or after 13 subjects.
The cognitive radio prototype performance is to alleviate the scarcity of spectral resources for wireless communication through intelligent sensing and quick resource allocation techniques. Secondary users (SU’s) actively obtain the spectrum access opportunity by supporting primary users (PU’s) in cognitive radio networks (CRNs). In present generation, spectrum access is endowed through cooperative communication-based link-level frame-based cooperative (LLC) principle. In this SUs independently act as conveyors for PUs to achieve spectrum access opportunities. Unfortunately, this LLC approach cannot fully exploit spectrum access opportunities to enhance the throughput of CRNs and fails to motivate PUs to join the spectrum sharing processes. Therefore, to overcome this con, network level cooperative (NLC) principle was used, where SUs are integrated mutually to collaborate with PUs session by session, instead of frame based cooperation for spectrum access opportunities. NLC approach has justified the challenges facing in LLC approach. In this paper we make a survey of some models that have been proposed to tackle the problem of LLC. We show the relevant aspects of each model, in order to characterize the parameters that we should take in account to achieve a spectrum access opportunity.
In this paper, the author provides insights and lessons that can be learned from colleagues at American universities about their online education experiences. The literature review and previous studies of online educations gains are explored and summarized in this research. Emerging trends in online education are discussed in detail, and strategies to implement these trends are explained. The author provides several tools and strategies that enable universities to ensure the quality of online education. At the end of this research paper, the researcher provides examples from Arab universities who have successfully implemented online education and expanded their impact on the society. This research provides a strategy and a model that can be used by universities in the Middle East as a roadmap to implement online education in their regions.
What is an RPA CoE? Session 1 – CoE VisionDianaGray10
In the first session, we will review the organization's vision and how this has an impact on the COE Structure.
Topics covered:
• The role of a steering committee
• How do the organization’s priorities determine CoE Structure?
Speaker:
Chris Bolin, Senior Intelligent Automation Architect Anika Systems
What is an RPA CoE? Session 2 – CoE RolesDianaGray10
In this session, we will review the players involved in the CoE and how each role impacts opportunities.
Topics covered:
• What roles are essential?
• What place in the automation journey does each role play?
Speaker:
Chris Bolin, Senior Intelligent Automation Architect Anika Systems
The Microsoft 365 Migration Tutorial For Beginner.pptxoperationspcvita
This presentation will help you understand the power of Microsoft 365. However, we have mentioned every productivity app included in Office 365. Additionally, we have suggested the migration situation related to Office 365 and how we can help you.
You can also read: https://www.systoolsgroup.com/updates/office-365-tenant-to-tenant-migration-step-by-step-complete-guide/
QA or the Highway - Component Testing: Bridging the gap between frontend appl...zjhamm304
These are the slides for the presentation, "Component Testing: Bridging the gap between frontend applications" that was presented at QA or the Highway 2024 in Columbus, OH by Zachary Hamm.
Session 1 - Intro to Robotic Process Automation.pdfUiPathCommunity
👉 Check out our full 'Africa Series - Automation Student Developers (EN)' page to register for the full program:
https://bit.ly/Automation_Student_Kickstart
In this session, we shall introduce you to the world of automation, the UiPath Platform, and guide you on how to install and setup UiPath Studio on your Windows PC.
📕 Detailed agenda:
What is RPA? Benefits of RPA?
RPA Applications
The UiPath End-to-End Automation Platform
UiPath Studio CE Installation and Setup
💻 Extra training through UiPath Academy:
Introduction to Automation
UiPath Business Automation Platform
Explore automation development with UiPath Studio
👉 Register here for our upcoming Session 2 on June 20: Introduction to UiPath Studio Fundamentals: https://community.uipath.com/events/details/uipath-lagos-presents-session-2-introduction-to-uipath-studio-fundamentals/
In the realm of cybersecurity, offensive security practices act as a critical shield. By simulating real-world attacks in a controlled environment, these techniques expose vulnerabilities before malicious actors can exploit them. This proactive approach allows manufacturers to identify and fix weaknesses, significantly enhancing system security.
This presentation delves into the development of a system designed to mimic Galileo's Open Service signal using software-defined radio (SDR) technology. We'll begin with a foundational overview of both Global Navigation Satellite Systems (GNSS) and the intricacies of digital signal processing.
The presentation culminates in a live demonstration. We'll showcase the manipulation of Galileo's Open Service pilot signal, simulating an attack on various software and hardware systems. This practical demonstration serves to highlight the potential consequences of unaddressed vulnerabilities, emphasizing the importance of offensive security practices in safeguarding critical infrastructure.
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Keywords: AI, Containeres, Kubernetes, Cloud Native
Event Link: https://meine.doag.org/events/cloudland/2024/agenda/#agendaId.4211
AppSec PNW: Android and iOS Application Security with MobSFAjin Abraham
Mobile Security Framework - MobSF is a free and open source automated mobile application security testing environment designed to help security engineers, researchers, developers, and penetration testers to identify security vulnerabilities, malicious behaviours and privacy concerns in mobile applications using static and dynamic analysis. It supports all the popular mobile application binaries and source code formats built for Android and iOS devices. In addition to automated security assessment, it also offers an interactive testing environment to build and execute scenario based test/fuzz cases against the application.
This talk covers:
Using MobSF for static analysis of mobile applications.
Interactive dynamic security assessment of Android and iOS applications.
Solving Mobile app CTF challenges.
Reverse engineering and runtime analysis of Mobile malware.
How to shift left and integrate MobSF/mobsfscan SAST and DAST in your build pipeline.
From Natural Language to Structured Solr Queries using LLMsSease
This talk draws on experimentation to enable AI applications with Solr. One important use case is to use AI for better accessibility and discoverability of the data: while User eXperience techniques, lexical search improvements, and data harmonization can take organizations to a good level of accessibility, a structural (or “cognitive” gap) remains between the data user needs and the data producer constraints.
That is where AI – and most importantly, Natural Language Processing and Large Language Model techniques – could make a difference. This natural language, conversational engine could facilitate access and usage of the data leveraging the semantics of any data source.
The objective of the presentation is to propose a technical approach and a way forward to achieve this goal.
The key concept is to enable users to express their search queries in natural language, which the LLM then enriches, interprets, and translates into structured queries based on the Solr index’s metadata.
This approach leverages the LLM’s ability to understand the nuances of natural language and the structure of documents within Apache Solr.
The LLM acts as an intermediary agent, offering a transparent experience to users automatically and potentially uncovering relevant documents that conventional search methods might overlook. The presentation will include the results of this experimental work, lessons learned, best practices, and the scope of future work that should improve the approach and make it production-ready.
This talk will cover ScyllaDB Architecture from the cluster-level view and zoom in on data distribution and internal node architecture. In the process, we will learn the secret sauce used to get ScyllaDB's high availability and superior performance. We will also touch on the upcoming changes to ScyllaDB architecture, moving to strongly consistent metadata and tablets.
"Frontline Battles with DDoS: Best practices and Lessons Learned", Igor IvaniukFwdays
At this talk we will discuss DDoS protection tools and best practices, discuss network architectures and what AWS has to offer. Also, we will look into one of the largest DDoS attacks on Ukrainian infrastructure that happened in February 2022. We'll see, what techniques helped to keep the web resources available for Ukrainians and how AWS improved DDoS protection for all customers based on Ukraine experience
GlobalLogic Java Community Webinar #18 “How to Improve Web Application Perfor...GlobalLogic Ukraine
Під час доповіді відповімо на питання, навіщо потрібно підвищувати продуктивність аплікації і які є найефективніші способи для цього. А також поговоримо про те, що таке кеш, які його види бувають та, основне — як знайти performance bottleneck?
Відео та деталі заходу: https://bit.ly/45tILxj
"What does it really mean for your system to be available, or how to define w...Fwdays
We will talk about system monitoring from a few different angles. We will start by covering the basics, then discuss SLOs, how to define them, and why understanding the business well is crucial for success in this exercise.
"NATO Hackathon Winner: AI-Powered Drug Search", Taras KlobaFwdays
This is a session that details how PostgreSQL's features and Azure AI Services can be effectively used to significantly enhance the search functionality in any application.
In this session, we'll share insights on how we used PostgreSQL to facilitate precise searches across multiple fields in our mobile application. The techniques include using LIKE and ILIKE operators and integrating a trigram-based search to handle potential misspellings, thereby increasing the search accuracy.
We'll also discuss how the azure_ai extension on PostgreSQL databases in Azure and Azure AI Services were utilized to create vectors from user input, a feature beneficial when users wish to find specific items based on text prompts. While our application's case study involves a drug search, the techniques and principles shared in this session can be adapted to improve search functionality in a wide range of applications. Join us to learn how PostgreSQL and Azure AI can be harnessed to enhance your application's search capability.
2. ISSN: 2252-8776
IJ-ICT Vol. 7, No. 1, April 2018 : 1– 7
2
the error can be cut down drastically. The combination of cryptography and steganography can achieve a better
security for the data [10]. LSB methods is valuable for hiding the larger magnitude of data. But, Fridrich et al.
[11] found the weakness of LSB methods. In 2003, Wu and Tsai [12] suggested a unique method in the ground
of image steganography which is known as pixel value differencing (PVD). Here the difference between two
consecutive pixels is taken into account and a new difference value is found to concealing the secret data.
The amount of secret data will be hidden is depends upon the difference value between the consecutive pixel.
A larger difference value indicates a higher amount of secret data hidden in the image. The image can be
segregated into either smooth area or edge area. The edge areas can be utilized to hide more number of data
compared to smooth areas. A large variety of diversified techniques in combination with PVD and LSB has
been suggested in the literature [13-23]. Swain [24] given a method for inserting secret information by using
group of bits substitution (GBS). He suggested 1GBS and 2GBS techniques. The 1GBS technique hides 1 bit
and 2GBS hides 2 bits of secret data. A novel track in image steganography called LSB array has been
suggested in [25]. The above works have been further continued in [26].
2. EXISTING TECHNIQUE
Kumar and Chand [2] proposed a bit flipping method for concealing 1 bit of secret data in a pair of
pixel. A block of 2 pixels taken which hides single bit only. The last LSB bit has been exploited for concealing
the secret data at the first layer of embedding. In the existing work, the block of 2 pixels hides only 1 bit of
secret information. This motivates us for providing 2 variants of bit flipping which can conceal 2 and 3 bits of
secret data respectively in a segment or block of two pixels. The embedding and extraction process of the said
variants has been proposed below.
3. PROPOSED BIT FLIPPING TECHNIQUE
This technique divides the cover image into sections. Each section (S) consists of 2 pixels say, Sx
and Sx+1, for x=1 to N-1. Where ‘N’ is the total number of pixel elements of the image. The bit flipping
technique exists in two variants, (i) Bit flipping-1 and (ii) Bit flipping-2.
3.1 Bit Flipping-1:
In this, the 7th
and 8th
bits of the pixels are utilized for hiding the secret information. Each section (S)
hides 2 bit of secret data sequentially. The embedding and extraction procedures are outlined below.
3.1.1 Embedding Algorithm
Step-1: Change the data to be hidden into binary. The dimension of secret data is also changed to 18 bit.
This is placed at the top of the binary message. The message is now combination of both.
Step-2: Read the original image (Ix). Convert it to binary also read the last 2 bits i.e 7th
and 8th
bit to form the
location map from all the pixels of the original image Ix, x=1 to N, where each Ix is a pixel of 8-bit length.
Compress the location map and send it to the receiver.
Step-3: Read the secret data in binary. Divide the secret data into a block of three bits of length. So, the three
bits can range from 000 to 111.
Step-4: Let the block of secret data is ki where i = 1 to
𝑛
3
, where n is the length of secret message.
Step-5: For each section (S) of the original image (Ix), let Sx and Sx+1 be the two consecutive pixels of the
section. For each section (S) of original image (I),
If ki= 000, No change to any pixel of the section.
Else if ki = 001, Flip the 8th
LSB bit of Sxonly.
Else if ki = 010, Flip the 7th
LSB bit of Sxonly.
Else if ki = 011, Flip the 8th
LSB bit of Sx+1 only.
Else if ki = 100, Flip the 7th
LSB bit of Sx+1only.
Else if ki = 101, Flip the 7th
, 8th
LSB bit of Sxonly.
Else if ki = 110, Flip the 7th
, 8th
LSB bit of Sx+1only.
Else if ki = 111, Flip the 7th
, 8th
LSB bit of both the section.
Step-6: Transmit the obtained resulting image (G) along with the compressed location map to the receiver.
The embedding process is successful.
3.1.2 Extraction Algorithm
The extraction algorithm is opposite of embedding. The various steps for extracting the secret data
are as follows.
3. IJ-ICT ISSN: 2252-8776
Digital Image Steganography Using Bit Flipping (Aditya Kumar Sahu)
3
Step-1: Decompress the compressed location map and find the 7th
and 8th
bit of original image. Initialize Mi to
empty and initialize the counter, count=1.
Step-2: For each section (S) of the resulting image (G) repeat step-3.
Step-3: Compare 7th
and 8th
bit of each section (S) of resulting image with the location map.
If 7th
and 8th
bit of both pixels Sx and Sx+1 are same as corresponding bits of location map then extract 000 and
concatenate to Mi.
Else if only 8th
LSB bit of Sx has changed then extract 001 and concatenate to Mi.
Else if only 7th
LSB bit of Sx has changed then extract 010 and concatenate to Mi.
Else if only 8th
LSB bit of Sx+1 has changed then extract 011 and concatenate to Mi.
Else if only 7th
LSB bit of Sx+1 has changed then extract 100 and concatenate to Mi.
Else if only 7th
, 8th
LSB bit of Sx has changed then extract 101 and concatenate to Mi.
Else if only 7th
, 8th
LSB bit of Sx, Sx+1 changed then extract 110 and concatenate to Mi.
If 7th
and 8th
bit of both pixels Sx and Sx+1 have changed then extract 111 and concatenate to Mi.
Step4: Set count=count+3. If count < 18 then go to step3, otherwise go to step5.
Step-5: Convert the 18 bits in Mi to decimal and then multiply by 7, which is the length of the embedded
message in bits, let it be n.
Step-6: Reinitialize Mi to blank, and for i= 1 to
𝑛−18
3
repeat step3. Then we get Mi with n-18 bits length.
Step-7: Convert the bits of Mi to characters. The extraction is successful.
3.2 Bit Flipping-2:
The7th
and 8th
bits of the original image (Ix) is used to hide the secret data. Each section (S) hides 4
bit of secret data sequentially. The embedding and extraction procedures are as follows.
3.2.1 Embedding Algorithm
Step-1: Change the data to be hidden into binary. The dimension of secret data is also changed to 18 bit.
This is placed at the top of the binary message. The message is now combination of both.
Step-2: Read the original image (Ix). Convert it to binary. Where, x=1 to N, where each Ix is a pixel of 8 bit
length. Read the last 2 bits that are 7th
and 8th
bit from all the pixels of the original image (Ix) and form the
location map. Compress the location map and send it to the receiver.
Step-3: Read the secret data in binary. Convert it into blocks of four bits in length. The four bits can range
from 0000 to 1111.
Step-4: Let the block of secret data is ki where i = 1 to
𝑛
4
, where n is the length of secret message.
Step-5: For each section (S) of original image (I), let Sxand Sx+1 be the two consecutive pixels of the sections.
If ki = 0000, No change to any pixel of the section.
Else if ki= 0001, Flip the 8th
LSB bit of Sx+1 only.
Else if ki= 0010, Flip the 7th
LSB bit of Sx+1 only.
Else if ki= 0011, Flip the7th
, 8th
LSB bit of Sx+1 only.
Else if ki= 0100, Flip the 8th
LSB bit of Sxonly.
Else if ki= 0101, Flip the 8th
LSB bits of both Sx and Sx+1 .
Else if ki= 0110, Flip the 8th
LSB bit of both Sx and 7th
LSB bit of Sx+1.
Else if ki= 0111, Flip the 8th
bit of Sx and 7th
& 8th
LSB bits of Sx.and Sx+1.
Else if ki= 1000, Flip the 7th
LSB bit of Sx only.
Else if ki= 1001, Flip the 7th
LSB bit of Sxand 8th
LSB bit of Sx+1.
Else if ki= 1010, Flip the 7th
LSB bits of both Sx and Sx+1.
Else if ki= 1011, Flip the 7th
LSB bit of Sxand both 7th
& 8th
LSB bits of Sx+1.
Else if ki= 1100, Flip the 7th
, 8th
LSB bit of Sx only.
Else if ki= 1101, Flip the 7th
, 8th
LSB bits of Sx and 8th
LSB of Sx+1.
Else if ki= 1110, Flip both the 7th
& 8th
LSB bits of Sx and 7th
LSB bit of Sx+1.
Else if ki= 1111, Flip the 7th
and 8th
LSB bits of Sxand Sx+1 .
Step-6: Transmit the obtained resulting image (G) along with the compressed location map to the receiver.
The embedding process is successful.
3.2.2 Extraction Algorithm
The extraction algorithm is opposite of embedding process. The various steps of retrieving the secret
data are outlined below.
Step-1: Decompress the compressed location map and find the 7th
and 8th
bits of the original image. Initialize
Mi to empty and initialize the counter, count=1.
Step-2: For each section (S) of the resulting image (G), repeat the step3.
4. ISSN: 2252-8776
IJ-ICT Vol. 7, No. 1, April 2018 : 1– 7
4
Step-3: Compare each section (S) of resulting image with the location map.
If 7th
and 8th
bit of both pixels Sx and Sx+1 are same as corresponding bits of location map then extract 0000
and concatenate toMi.
Else if only 8th
LSB bit of Sx+1 has changed then extract 0001 and concatenate to Mi.
Else if only 7th
LSB bit of Sx+1 has changed then extract 0010 and concatenate to Mi.
Else if only 7th
, 8th
LSB bit of Sx+1 has changed then extract 0011 and concatenate to Mi.
Else if only 8th
LSB bit of Sxhas changed then extract 0100 and concatenate Mi.
Else if 8th
LSB bit of Sx, Sx+1 both have changed then extract 0101 and concatenate to Mi.
Else if 8th
LSB bit of Sx and 7th
LSB bit of Sx+1 both has changed then extract ki 0110 and concatenate to Mi.
Else if 8th
LSB bit of Sx and 7th
, 8th
LSB bit of Sx+1.both has changed then extract ki 0111 and
concatenate to Mi.
Else if only 7th
LSB bit of Sx has changed then extract 1000 and concatenate to Mi.
Else if 7th
LSB bit of Sx and 8th
LSB bit of Sx+1 has changed then extract 1001 and concatenate to Mi.
Else if 7th
LSB bit of Sx and Sx+1 both have changed then extract 1010 and concatenate to Mi.
Else if 7th
LSB bit of Sx and 7th
and 8th
LSB bit of Sx+1 both have changed then extract 1011 and
concatenate to Mi.
Else if 7th
, 8th
LSB bit LSB bit of Sx has changed then extract 1100 and concatenate to Mi.
Else if 7th
, 8th
LSB bit of Sxand 8th
LSB bit of Sx+1 both have changed then extract 1101 and concatenate to Mi.
Else if 7th
, 8th
LSB bit of Sxand 7th
LSB bit of Sx+1 both have changed then extract 1110 and concatenate toMi.
Else if 7th, 8th
LSB bit of Sxand Sx+1 both have changed then extract 1111 and concatenate toMi.
Step-4: Set count=count+4. If count ≤ 18 then go to step3, otherwise move to step5.
Step-5: Decimalize the 18 bits in Mi and multiply by 7, which is the magnitude of the total embedded message
in terms of bits, let it be n.
Step-6: Reinitialize ki to blank, and for i= 1 to
𝑛−18
4
repeat step-3. Then we get Mi with n-18 bits length.
Step-7: Convert the bits of Mi to characters. The extraction is successful.
4. RESULTS
The given method has been compared with the existing bit flipping method [2], in Table 1.
The parameters such as PSNR, hiding capacity, quality index (Q.I), and Bit rate (i.e. bits per pixel, BPP),
referred from [28, 29] has been considered for comparison. From Table 1, it is concluded that the capacity of
proposed bit flipping technique is more than that of existing technique. The capacity of Bit flipping-2 is 1.5
times larger compared to the existing method. The PSNR of the proposed techniques is acceptable i.e. more
than 40. If we compare among the three proposed techniques the bit flipping-2 is preferable for higher
hiding capacity.
The cover images are shown in Figure 1. (a)-(h) and the resulting images for bit flipping-1,
bit flipping-2 schemas respectively are shown in Figure 2. (a)- (h) and Figure 3. (a)- (h), with 2,45,000 bits of
data are concealed in each. It is a clear indication that the resulting images are indistinguishable and do not
show any identification areas.
(a) Lena (b) Baboon (c) Peppers (d) Boat
5. IJ-ICT ISSN: 2252-8776
Digital Image Steganography Using Bit Flipping (Aditya Kumar Sahu)
5
(e) House (f) Baby (g) Barbara (h) Bird
Figure 1. (a)-(h) Original Images
(a) Lena (b) Baboon (c) Peppers (d) Boat
(e) House (f) Baby (g) Barbara (h) Bird
Figure 2. (a)-(h) Resulting Images of Bit Flipping-1
(a) Lena (b) Baboon (c) Peppers (d) Boat
6. ISSN: 2252-8776
IJ-ICT Vol. 7, No. 1, April 2018 : 1– 7
6
(e) House (f) Baby (g) Barbara (h) Bird
Figure 3. (a)-(h) Resulting Images of Bit Flipping-2
Table 1. Results of Proposed Bit Flipping -1 and Bit Flipping-2 Schemes
Images
512×512
Existing Bit flipping technique [2] Proposed Bit flipping-1 technique Proposed Bit flipping-2 technique
PSNR Capacity Q.I BPP PSNR Capacity Q.I BPP PSNR Capacity Q.I BPP
Lena 51.27 262144 0.98 1 47.38 393216 0.97 1.5 47.31 524288 0.97 2.0
Baboon 51.27 262144 0.99 1 47.36 393216 0.99 1.5 47.33 524288 0.99 2.0
Peppers 51.28 262144 0.98 1 47.39 393216 0.97 1.5 47.32 524288 0.97 2.0
Boat 51.27 262144 0.99 1 47.20 393216 0.98 1.5 47.19 524288 0.98 2.0
House 51.28 262144 0.99 1 47.37 393216 0.98 1.5 47.30 524288 0.98 2.0
Baby 51.27 262144 0.97 1 47.36 393 16 0.94 1.5 47.31 524288 0.94 2.0
Barbara 51.27 262144 0.98 1 47.34 393216 0.96 1.5 47.30 524288 0.96 2.0
Bird 51.26 262144 0.89 1 47.80 393216 0.87 1.5 47.66 524288 0.88 2.0
Average 51.27 262144 0.97 1 47.40 393216 0.96 1.5 47.34 524288 0.96 2.0
5. CONCLUSION
This article proposes a modified bit flipping technique for hiding information in an image called as
bit flipping-1 and bit flipping-2. The proposed bit flipping-1 offers a capacity of 3 bits for a pair of pixels.
The bit flipping-2 offers a capacity of 4 bits for a pair of pixels. Thus the capacities of the proposed techniques
are improved. Furthermore, it is quite clear from the resulting images that it is not susceptible to the invader.
REFERENCES
[1] Johnson, N. F., Jajodia, S. “Exploring steganography: seeing the unseen”. IEEE Computer, 1998; 31(2): 26–34.
[2] Kumar, R., Chand, S. “A reversible data hiding scheme using bit flipping strategy”. Journal of Discrete Mathematical
Sciences and Cryptography, 2016; 19(2): 331-345.
[3] Pradhan, A., Sahu, A.K., Swain, G., & Sekhar, K.R. Performance evaluation parameters of image steganography
techniques. International Conference on Research Advances in Integrated Navigation Systems, 2016, DOI:
10.1109/RAINS.2016.7764399.
[4] Swain, G., Lenka, S. K. “Classification of Image Steganography Techniques in Spatial Domain : A Study”.
International Journal of Computer Science & Engineering Technology, 2014; 5(3): 219–232.
[5] Sahu, A. K., Swain, G. A. “Review on LSB substitution and PVD based image steganography techniques”. Indonesian
Journal of Electrical Engineering and Computer Science, 2016; 2(3): 712-719.
[6] Sahu, A. K, Sahu M. “Digital image steganography techniques in spatial domain: a study”, International Journal of
Pharmacy & Technology, 2016; 8(4): 5205- 5217.
[7] Wang, R., Lin, C., Lin, J. “Hiding data in images by optimal moderately-significant-bit replacement”. Electronics
Letters, 2000; 36(25): 2069–2070.
[8] Wang, R. Z., Lin, C. F., Lin, J. C. “Image hiding by optimal LSB substitution and genetic algorithm”. Pattern
Recognition, 2001; 34(3): 671–683.
[9] Chan, C. K., Cheng, L. M. “Hiding data in images by simple LSB substitution”. Pattern Recognition, 2004; 37(3):
469–474.
[10] Swain, G., Lenka, S. K. “A technique for secret communication using a new block cipher with dynamic
steganography”. International Journal of Security and Its Applications, 2012; 6(4): 13–24.
[11] Fridrich, J., Goljan, M., Du, R. “Reliable detection of LSB steganography in grayscale and color images”. ACM
Workshop on Multimedia and Security, 2001, 27–30. http://doi.org/10.1145/1232454.1232466.
[12] Wu, D. C., Tsai, W. H. “A steganographic method for images by pixel-value differencing”. Pattern Recognition
Letters, 2003; 24(9–10): 1613–1626.
[13] Yang, C. H., Weng, C. Y., Wang, S. J., Sun, H. M. “Adaptive data hiding in edge areas of images with spatial LSB
domain systems”. IEEE Transactions on Information Forensics and Security, 2008; 3(3): 488–497.
[14] Wu, H.C., Wu, N.I. Tsai, C.S., Hwang, M.S. “An image steganographic scheme based on pixel-value differencing and
LSB replacement methods”. IEE Proceedings- Vision Image Signal Processing, 2005; 152(5): 611–615.
7. IJ-ICT ISSN: 2252-8776
Digital Image Steganography Using Bit Flipping (Aditya Kumar Sahu)
7
[15] Yang, C. H., Weng, C. Y., Wang, S. J., Sun, H. M. “Varied PVD + LSB evading detection programs to spatial domain
in data embedding systems”. Journal of Systems and Software, 2010; 83(10): 1635–1643.
[16] Wang, C.M., Wu, N.I., Tsai, C.S., Hwang, M.S. “A high quality steganographic method with pixel-value differencing
and modulus function”. The journal of system and software, 2008; 81: 150–158.
[17] Liao, X., Wen, Q. Y., Zhang, J. “A steganographic method for digital images with four-pixel differencing and modified
LSB substitution”. Journal of Visual Communication and Image Representation, 2011, 22(1), 1–8.
[18] Swain, G. “Digital image steganography using nine-pixel differencing and modified LSB substitution”. Indian Journal
of Science and Technology, 2014; 7(9): 1444–1450.
[19] Malik, A., Sikka, G., Verma, H. K. “A modified pixel-value differencing image steganographic scheme with least
significant bit substitution method”. International Journal of Image, Graphics and Signal Processing. 2015; 4:
68–74.
[20] Pradhan, A., Sekhar K. R., Swain G. “Digital image steganography based on seven way pixel value differencing”.
Indian Journal of Science &Technology,2016,9(37),pp.1-11, doi: 10.17485/ijst/2016/v9i37/88557.
[21] Pradhan, A., Sekhar K. R., Swain G. Digital image steganography combining LSB substitution with five way PVD in
2×3 pixel blocks, International Journal of Pharmacy and Technology, 2016; 8(4): 22051-22061
[22] Swain G. “A steganographic method combining LSB substitution and PVD in a block”. Procedia Computer
Science, 2016; 85: 39-44.
[23] Swain G. “Adaptive pixel value differencing steganography using both vertical and horizontal edges”. Multimedia
Tools and Applications, 2016; 75(21): 13541-13556
[24] Swain, G. “Digital image steganography using variable length group of bits substitution”. Procedia Computer Science,
2016; 85: 31–38.
[25] Juneja, M., Sandhu, P. S. “Designing of robust image steganography technique based on LSB insertion and
encryption”. International Conference on Advances in Recent Technologies in Communication and Computing, 2009:
302–305.
[26] Swain, G., Lenka, S. K. “LSB array based image steganography technique by exploring the four least significant bits”.
Global Trends in Information Systems and Software Applications. 2012. CCIS, 479-488.
[27] Swain, G., Lenka, S. K. “A novel steganography technique by mapping words with LSB array”. International Journal
of Signal and Imaging Systems Engineering, 2015; 8(1): 115–122.
[28] Wang, Z., Bovik, A. “A universal image quality index”. IEEE Signal Processing Letters, 2002; 9(3): 81–84.
[29] Sahu, A.K., Swain, G. “Information Hiding Using Group of Bits Substitution”. International Journal on
Communication Antenna and Propagation.2017. https://doi.org/10.15866/irecap.v7i2.11675.