In this document, we propose a simple algorithm for the encryption of gray-scale images, although the scheme is perfectly usable in color images. Prior to encryption, the proposed algorithm includes a pair of permutation processes, inspired by the Bernoulli mapping. The permutation disperses the image information to hinder the unauthorized recovery of the original image. The image is encrypted using the XOR function between a sequence generated from the same Bernoulli mapping and the image data, obtained after two permutation processes. Finally, for the verification of the algorithm, the gray-scale Lena pattern image was used; calculating histograms for each stage alongside of the encryption process. The histograms prove dispersion evolution for pattern image during whole algorithm.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The
ergodicity property of chaotic system is utilized to perform the permutation process; a substitution
operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix
is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid
chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are
then applied to perform the permutation process. The encryption’s key streams not only depend on the
cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by
another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by
bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption
rate. The security and performance analysis have been performed, including key space analysis, histogram
analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis
etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its
large key space and efficient permutation-substitution operation, and therefore it is suitable for practical
image and video encryption
Image confusion and diffusion based on multi-chaotic system and mix-columnjournalBEEI
In this paper, a new image encryption algorithm based on chaotic cryptography was proposed. The proposed scheme was based on multiple stages of confusion and diffusion. The diffusion process was implemented twice, first, by permuting the pixels of the plain image by using an Arnold cat map and, the second time by permuting the plain image pixels via the proposed permutation algorithm. The confusion process was performed many times, by performing the XOR operation between the two resulted from permuted images, subtracted a random value from all pixels of the image, as well as by implementing the mix column on the resulted image, and by used the Lorenz key to obtain the encrypted image. The security analysis tests that used to exam the results of this encryption method were information entropy, key space analysis, correlation, histogram analysis UACI, and NPCR have shown that the suggested algorithm has been resistant against different types of attacks.
Segmentation by Fusion of Self-Adaptive SFCM Cluster in Multi-Color Space Com...CSCJournals
This paper proposes a new, simple, and efficient segmentation approach that could find diverse applications in pattern recognition as well as in computer vision, particularly in color image segmentation. First, we choose the best segmentation components among six different color spaces. Then, Histogram and SFCM techniques are applied for initialization of segmentation. Finally, we fuse the segmentation results and merge similar regions. Extensive experiments have been taken on Berkeley image database by using the proposed algorithm. The results show that, compared with some classical segmentation algorithms, such as Mean-Shift, FCR and CTM, etc, our method could yield reasonably good or better image partitioning, which illustrates practical value of the method.
A new block cipher for image encryption based on multi chaotic systemsTELKOMNIKA JOURNAL
In this paper, a new algorithm for image encryption is proposed based on three chaotic systems which are Chen system,logistic map and two-dimensional (2D) Arnold cat map. First, a permutation scheme is applied to the image, and then shuffled image is partitioned into blocks of pixels. For each block, Chen system is employed for confusion and then logistic map is employed for generating subsititution-box (S-box) to substitute image blocks. The S-box is dynamic, where it is shuffled for each image block using permutation operation. Then, 2D Arnold cat map is used for providing diffusion, after that XORing the result using Chen system to obtain the encrypted image.The high security of proposed algorithm is experimented using histograms, unified average changing intensity (UACI), number of pixels change rate (NPCR), entropy, correlation and keyspace analyses.
The compression is a process of Image Processing which interested to change the information representation in order to reduce the stockage capacity and transmission time. In this work we propose a new image compression algorithm based on Haar wavelets by introducing a compression coefficient that controls the compression levels. This method reduces the complexity in obtaining the desired level of compression from the original image only and without using intermediate levels.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The
ergodicity property of chaotic system is utilized to perform the permutation process; a substitution
operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix
is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid
chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are
then applied to perform the permutation process. The encryption’s key streams not only depend on the
cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by
another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by
bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption
rate. The security and performance analysis have been performed, including key space analysis, histogram
analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis
etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its
large key space and efficient permutation-substitution operation, and therefore it is suitable for practical
image and video encryption
Image confusion and diffusion based on multi-chaotic system and mix-columnjournalBEEI
In this paper, a new image encryption algorithm based on chaotic cryptography was proposed. The proposed scheme was based on multiple stages of confusion and diffusion. The diffusion process was implemented twice, first, by permuting the pixels of the plain image by using an Arnold cat map and, the second time by permuting the plain image pixels via the proposed permutation algorithm. The confusion process was performed many times, by performing the XOR operation between the two resulted from permuted images, subtracted a random value from all pixels of the image, as well as by implementing the mix column on the resulted image, and by used the Lorenz key to obtain the encrypted image. The security analysis tests that used to exam the results of this encryption method were information entropy, key space analysis, correlation, histogram analysis UACI, and NPCR have shown that the suggested algorithm has been resistant against different types of attacks.
Segmentation by Fusion of Self-Adaptive SFCM Cluster in Multi-Color Space Com...CSCJournals
This paper proposes a new, simple, and efficient segmentation approach that could find diverse applications in pattern recognition as well as in computer vision, particularly in color image segmentation. First, we choose the best segmentation components among six different color spaces. Then, Histogram and SFCM techniques are applied for initialization of segmentation. Finally, we fuse the segmentation results and merge similar regions. Extensive experiments have been taken on Berkeley image database by using the proposed algorithm. The results show that, compared with some classical segmentation algorithms, such as Mean-Shift, FCR and CTM, etc, our method could yield reasonably good or better image partitioning, which illustrates practical value of the method.
A new block cipher for image encryption based on multi chaotic systemsTELKOMNIKA JOURNAL
In this paper, a new algorithm for image encryption is proposed based on three chaotic systems which are Chen system,logistic map and two-dimensional (2D) Arnold cat map. First, a permutation scheme is applied to the image, and then shuffled image is partitioned into blocks of pixels. For each block, Chen system is employed for confusion and then logistic map is employed for generating subsititution-box (S-box) to substitute image blocks. The S-box is dynamic, where it is shuffled for each image block using permutation operation. Then, 2D Arnold cat map is used for providing diffusion, after that XORing the result using Chen system to obtain the encrypted image.The high security of proposed algorithm is experimented using histograms, unified average changing intensity (UACI), number of pixels change rate (NPCR), entropy, correlation and keyspace analyses.
The compression is a process of Image Processing which interested to change the information representation in order to reduce the stockage capacity and transmission time. In this work we propose a new image compression algorithm based on Haar wavelets by introducing a compression coefficient that controls the compression levels. This method reduces the complexity in obtaining the desired level of compression from the original image only and without using intermediate levels.
5/3 Lifting Scheme Approach for Image InterpolationIOSRJECE
In this paper we proposed fast and accurate interpolation and resizing of images using lifting scheme approach. 5/3 lifting scheme is an accurate and computationally inexpensive interpolation technique for image resizing. We compared the bilinear interpolation, Haar lifting scheme and 5/3 lifting scheme in this paper. The lifting scheme algorithm is applied for image interpolation to resize the image. In case of reduction in size, the image components are reduced and the reconstruction will be carried out to the original image. The reconstruction results are better by using Mean Squared Error (MSE) and Peak Signal to Noise Ratio (PSNR) with other techniques like bilinear interpolation and Haar lifting schemes. The interpolation and reconstruction is executed in much less time with better MSE and PSNR as compared to Bilinear and Haar lifting schemes.
Hand gesture recognition using discrete wavelet transform and hidden Markov m...TELKOMNIKA JOURNAL
Gesture recognition based on computer-vision is an important part of human-computer interaction. But it lacks in several points, that was image brightness, recognition time, and accuracy. Because of that goal of this research was to create a hand gesture recognition system that had good performances using discrete wavelet transform and hidden Markov models. The first process was pre-processing, which done by resizing the image to 128x128 pixels and then segmented the skin color. The second process was feature extraction using the discrete wavelet transform. The result was the feature value in the form of a feature vector from the image. The last process was gesture classification using hidden Markov models to calculate the highest probability of feature matrix which had obtained from the feature extraction process. The result of the system had 72% of accuracy using 150 training and 100 test data images that consist five gestures. The newness thing found in this experiment were the effect of acquisition and pre-processing. The accuracy had been escalated by 14% compared to Sebastien’s dataset at 58%. The increment effect propped by brightness and contrast value.
This new algorithm mixes two or more images of different types and sizes by employing a shuffling
procedure combined with S-box substitution to perform lossless image encryption. This combines stream
cipher with block cipher, on the byte level, in mixing the images. When this algorithm was implemented,
empirical analysis using test images of different types and sizes showed that it is effective and resistant to
attacks.
STATE SPACE GENERATION FRAMEWORK BASED ON BINARY DECISION DIAGRAM FOR DISTRIB...csandit
This paper proposes a new framework based on Binary Decision Diagrams (BDD) for the graph distribution problem in the context of explicit model checking. The BDD are yet used to represent the state space for a symbolic verification model checking. Thus, we took advantage of high compression ratio of BDD to encode not only the state space, but also the place where each state will be put. So, a fitness function that allows a good balance load of states over the nodes of an homogeneous network is used. Furthermore, a detailed explanation of how to
calculate the inter-site edges between different nodes based on the adapted data structure is presented
IMAGE ENCRYPTION BASED ON DIFFUSION AND MULTIPLE CHAOTIC MAPSIJNSA Journal
In the recent world, security is a prime important issue, and encryption is one of the best alternative way to ensure security. More over, there are many image encryption schemes have been proposed, each one of them has its own strength and weakness. This paper presents a new algorithm for the image encryption/decryption scheme. This paper is devoted to provide a secured image encryption technique using multiple chaotic based circular mapping. In this paper, first, a pair of sub keys is given by using chaotic logistic maps. Second, the image is encrypted using logistic map sub key and in its transformation leads to diffusion process. Third, sub keys are generated by four different chaotic maps. Based on the initial conditions, each map may produce various random numbers from various orbits of the maps.
Among those random numbers, a particular number and from a particular orbit are selected as a key for the encryption algorithm. Based on the key, a binary sequence is generated to control the encryption algorithm. The input image of 2-D is transformed into a 1- D array by using two different scanning pattern (raster and Zigzag ) and then divided into various sub blocks. Then the position permutation and value permutation is applied to each binary matrix based on multiple chaos maps. Finally the receiver uses the same sub keys to decrypt the encrypted images. The salient features of the proposed image encryption method are loss-less, good peak signal –to noise ratio (PSNR), Symmetric key encryption, less cross correlation, very large number of secret keys, and key-dependent pixel value replacement.
A tutorial on applying artificial neural networks and geometric brownian moti...eSAT Journals
Abstract Several challenges in the engineering or financial world can be resolved with a proper handle on data. Amongst other applications in engineering, system identification and parameter estimation are widely used in developing control strategies for automation. In this domain, there would be requirements to design an adaptive control system. In order to design an adaptive control system, an adaptive model needs to be estimated or identified. This is generally done by studying the data and creating a transfer function. In the process, regression, artificial neural networks (ANN), random walk theory and Markov chain estimates are used to understand a time series and create a model. While some of these processes are stationary, some are non-stationary. These methods are chosen based on the nature and availability of historical data. One of the issues that always remain is which method is appropriate for a certain application. The objective of this tutorial is to illustrate how artificial neural network and Geometric Brownian motion can be used in this regard. An attempt is made to predict the future price of a stock of a corporation. Stock prices are an example for a stochastic time series. Initially, an artificial neural network is used to predict the stock price. The network is designed as a Multi layer Back propagation type network. Profit over earnings and S&P are used as inputs. Thereafter, Geometric Brownian motion is explained and used on the same dataset to come up with its predictions. The results from both neural network and geometric Brownian motion are compared. Key Words: Artificial Neural Network, Geometric Brownian Motion, Stochastic time series, and stock price prediction
Performance Improvement of Vector Quantization with Bit-parallelism HardwareCSCJournals
Vector quantization is an elementary technique for image compression; however, searching for the nearest codeword in a codebook is time-consuming. In this work, we propose a hardware-based scheme by adopting bit-parallelism to prune unnecessary codewords. The new scheme uses a “Bit-mapped Look-up Table” to represent the positional information of the codewords. The lookup procedure can simply refer to the bitmaps to find the candidate codewords. Our simulation results further confirm the effectiveness of the proposed scheme.
MULTIPLE REGION OF INTEREST TRACKING OF NON-RIGID OBJECTS USING DEMON'S ALGOR...cscpconf
In this paper we propose an algorithm for tracking multiple ROI (region of interest) undergoing non-rigid transformations. Demon's algorithm based on the idea of Maxwell's demon, has been applied here to estimate the displacement field for tracking of multiple ROI. This algorithm works on pixel intensities of the sequence of images thus making it suitable for tracking objects/regions undergoing non-rigid transformations. We have incorporated a pyramid-based approach for demon's algorithm computations of displacement field, which leads to significant reduction in the convergence speed and improvement in the accuracy. This algorithm is applied for tracking non-rigid objects in laproscopy videos which would aid surgeons in Minimal Invasive Surgery (MIS).
Multiple region of interest tracking of non rigid objects using demon's algor...csandit
In this paper we propose an algorithm for tracking multiple ROI (region of interest) undergoing
non-rigid transformations. Demon's algorithm based on the idea of Maxwell's demon, has been
applied here to estimate the displacement field for tracking of multiple ROI. This algorithm
works on pixel intensities of the sequence of images thus making it suitable for tracking
objects/regions undergoing non-rigid transformations. We have incorporated a pyramid-based
approach for demon's algorithm computations of displacement field, which leads to significant
reduction in the convergence speed and improvement in the accuracy. This algorithm is applied
for tracking non-rigid objects in laproscopy videos which would aid surgeons in Minimal
Invasive Surgery (MIS).
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The ergodicity property of chaotic system is utilized to perform the permutation process; a substitution operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are then applied to perform the permutation process. The encryption’s key streams not only depend on the cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by
another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption rate. The security and performance analysis have been performed, including key space analysis, histogram analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis
etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its
large key space and efficient permutation-substitution operation, and therefore it is suitable for practical image and video encryption.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The ergodicity property of chaotic system is utilized to perform the permutation process; a substitution
operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix
is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are then applied to perform the permutation process. The encryption’s key streams not only depend on the
cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption rate. The security and performance analysis have been performed, including key space analysis, histogram analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its large key space and efficient permutation-substitution operation, and therefore it is suitable for practical image and video encryption.
5/3 Lifting Scheme Approach for Image InterpolationIOSRJECE
In this paper we proposed fast and accurate interpolation and resizing of images using lifting scheme approach. 5/3 lifting scheme is an accurate and computationally inexpensive interpolation technique for image resizing. We compared the bilinear interpolation, Haar lifting scheme and 5/3 lifting scheme in this paper. The lifting scheme algorithm is applied for image interpolation to resize the image. In case of reduction in size, the image components are reduced and the reconstruction will be carried out to the original image. The reconstruction results are better by using Mean Squared Error (MSE) and Peak Signal to Noise Ratio (PSNR) with other techniques like bilinear interpolation and Haar lifting schemes. The interpolation and reconstruction is executed in much less time with better MSE and PSNR as compared to Bilinear and Haar lifting schemes.
Hand gesture recognition using discrete wavelet transform and hidden Markov m...TELKOMNIKA JOURNAL
Gesture recognition based on computer-vision is an important part of human-computer interaction. But it lacks in several points, that was image brightness, recognition time, and accuracy. Because of that goal of this research was to create a hand gesture recognition system that had good performances using discrete wavelet transform and hidden Markov models. The first process was pre-processing, which done by resizing the image to 128x128 pixels and then segmented the skin color. The second process was feature extraction using the discrete wavelet transform. The result was the feature value in the form of a feature vector from the image. The last process was gesture classification using hidden Markov models to calculate the highest probability of feature matrix which had obtained from the feature extraction process. The result of the system had 72% of accuracy using 150 training and 100 test data images that consist five gestures. The newness thing found in this experiment were the effect of acquisition and pre-processing. The accuracy had been escalated by 14% compared to Sebastien’s dataset at 58%. The increment effect propped by brightness and contrast value.
This new algorithm mixes two or more images of different types and sizes by employing a shuffling
procedure combined with S-box substitution to perform lossless image encryption. This combines stream
cipher with block cipher, on the byte level, in mixing the images. When this algorithm was implemented,
empirical analysis using test images of different types and sizes showed that it is effective and resistant to
attacks.
STATE SPACE GENERATION FRAMEWORK BASED ON BINARY DECISION DIAGRAM FOR DISTRIB...csandit
This paper proposes a new framework based on Binary Decision Diagrams (BDD) for the graph distribution problem in the context of explicit model checking. The BDD are yet used to represent the state space for a symbolic verification model checking. Thus, we took advantage of high compression ratio of BDD to encode not only the state space, but also the place where each state will be put. So, a fitness function that allows a good balance load of states over the nodes of an homogeneous network is used. Furthermore, a detailed explanation of how to
calculate the inter-site edges between different nodes based on the adapted data structure is presented
IMAGE ENCRYPTION BASED ON DIFFUSION AND MULTIPLE CHAOTIC MAPSIJNSA Journal
In the recent world, security is a prime important issue, and encryption is one of the best alternative way to ensure security. More over, there are many image encryption schemes have been proposed, each one of them has its own strength and weakness. This paper presents a new algorithm for the image encryption/decryption scheme. This paper is devoted to provide a secured image encryption technique using multiple chaotic based circular mapping. In this paper, first, a pair of sub keys is given by using chaotic logistic maps. Second, the image is encrypted using logistic map sub key and in its transformation leads to diffusion process. Third, sub keys are generated by four different chaotic maps. Based on the initial conditions, each map may produce various random numbers from various orbits of the maps.
Among those random numbers, a particular number and from a particular orbit are selected as a key for the encryption algorithm. Based on the key, a binary sequence is generated to control the encryption algorithm. The input image of 2-D is transformed into a 1- D array by using two different scanning pattern (raster and Zigzag ) and then divided into various sub blocks. Then the position permutation and value permutation is applied to each binary matrix based on multiple chaos maps. Finally the receiver uses the same sub keys to decrypt the encrypted images. The salient features of the proposed image encryption method are loss-less, good peak signal –to noise ratio (PSNR), Symmetric key encryption, less cross correlation, very large number of secret keys, and key-dependent pixel value replacement.
A tutorial on applying artificial neural networks and geometric brownian moti...eSAT Journals
Abstract Several challenges in the engineering or financial world can be resolved with a proper handle on data. Amongst other applications in engineering, system identification and parameter estimation are widely used in developing control strategies for automation. In this domain, there would be requirements to design an adaptive control system. In order to design an adaptive control system, an adaptive model needs to be estimated or identified. This is generally done by studying the data and creating a transfer function. In the process, regression, artificial neural networks (ANN), random walk theory and Markov chain estimates are used to understand a time series and create a model. While some of these processes are stationary, some are non-stationary. These methods are chosen based on the nature and availability of historical data. One of the issues that always remain is which method is appropriate for a certain application. The objective of this tutorial is to illustrate how artificial neural network and Geometric Brownian motion can be used in this regard. An attempt is made to predict the future price of a stock of a corporation. Stock prices are an example for a stochastic time series. Initially, an artificial neural network is used to predict the stock price. The network is designed as a Multi layer Back propagation type network. Profit over earnings and S&P are used as inputs. Thereafter, Geometric Brownian motion is explained and used on the same dataset to come up with its predictions. The results from both neural network and geometric Brownian motion are compared. Key Words: Artificial Neural Network, Geometric Brownian Motion, Stochastic time series, and stock price prediction
Performance Improvement of Vector Quantization with Bit-parallelism HardwareCSCJournals
Vector quantization is an elementary technique for image compression; however, searching for the nearest codeword in a codebook is time-consuming. In this work, we propose a hardware-based scheme by adopting bit-parallelism to prune unnecessary codewords. The new scheme uses a “Bit-mapped Look-up Table” to represent the positional information of the codewords. The lookup procedure can simply refer to the bitmaps to find the candidate codewords. Our simulation results further confirm the effectiveness of the proposed scheme.
MULTIPLE REGION OF INTEREST TRACKING OF NON-RIGID OBJECTS USING DEMON'S ALGOR...cscpconf
In this paper we propose an algorithm for tracking multiple ROI (region of interest) undergoing non-rigid transformations. Demon's algorithm based on the idea of Maxwell's demon, has been applied here to estimate the displacement field for tracking of multiple ROI. This algorithm works on pixel intensities of the sequence of images thus making it suitable for tracking objects/regions undergoing non-rigid transformations. We have incorporated a pyramid-based approach for demon's algorithm computations of displacement field, which leads to significant reduction in the convergence speed and improvement in the accuracy. This algorithm is applied for tracking non-rigid objects in laproscopy videos which would aid surgeons in Minimal Invasive Surgery (MIS).
Multiple region of interest tracking of non rigid objects using demon's algor...csandit
In this paper we propose an algorithm for tracking multiple ROI (region of interest) undergoing
non-rigid transformations. Demon's algorithm based on the idea of Maxwell's demon, has been
applied here to estimate the displacement field for tracking of multiple ROI. This algorithm
works on pixel intensities of the sequence of images thus making it suitable for tracking
objects/regions undergoing non-rigid transformations. We have incorporated a pyramid-based
approach for demon's algorithm computations of displacement field, which leads to significant
reduction in the convergence speed and improvement in the accuracy. This algorithm is applied
for tracking non-rigid objects in laproscopy videos which would aid surgeons in Minimal
Invasive Surgery (MIS).
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The ergodicity property of chaotic system is utilized to perform the permutation process; a substitution operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are then applied to perform the permutation process. The encryption’s key streams not only depend on the cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by
another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption rate. The security and performance analysis have been performed, including key space analysis, histogram analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis
etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its
large key space and efficient permutation-substitution operation, and therefore it is suitable for practical image and video encryption.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The ergodicity property of chaotic system is utilized to perform the permutation process; a substitution
operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix
is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are then applied to perform the permutation process. The encryption’s key streams not only depend on the
cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption rate. The security and performance analysis have been performed, including key space analysis, histogram analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its large key space and efficient permutation-substitution operation, and therefore it is suitable for practical image and video encryption.
A digital image forensic approach to detect whether
an image has been seam carved or not is investigated herein.
Seam carving is a content-aware image retargeting technique
which preserves the semantically important content of an image
while resizing it. The same technique, however, can be used
for malicious tampering of an image. 18 energy, seam, and
noise related features defined by Ryu [1] are produced using
Sobel’s [2] gradient filter and Rubinstein’s [3] forward energy
criterion enhanced with image gradients. An extreme gradient
boosting classifier [4] is trained to make the final decision.
Experimental results show that the proposed approach improves
the detection accuracy from 5 to 10% for seam carved images
with different scaling ratios when compared with other state-ofthe-
art methods.
Fast Segmentation of Sub-cellular OrganellesCSCJournals
Segmentation and counting sub-cellular structure is a very challenging problem even for medical experts. A fast and efficient method for segmentation and counting of sub-cellular structure is proposed. The proposed method uses a hybrid combination of several image processing techniques and is effective in segmenting the sub-cellular structures in a fast and effective manner.
Development of stereo matching algorithm based on sum of absolute RGB color d...IJECEIAES
This article presents local-based stereo matching algorithm which comprises a devel- opment of an algorithm using block matching and two edge preserving filters in the framework. Fundamentally, the matching process consists of several stages which will produce the disparity or depth map. The problem and most challenging work for matching process is to get an accurate corresponding point between two images. Hence, this article proposes an algorithm for stereo matching using improved Sum of Absolute RGB Differences (SAD), gradient matching and edge preserving filters. It is Bilateral Filter (BF) to surge up the accuracy. The SAD and gradient matching will be implemented at the first stage to get the preliminary corresponding result, then the BF works as an edge-preserving filter to remove the noise from the first stage. The second BF is used at the last stage to improve final disparity map and increase the object boundaries. The experimental analysis and validation are using the Middlebury standard benchmarking evaluation system. Based on the results, the proposed work is capable to increase the accuracy and to preserve the object edges. To make the proposed work more reliable with current available methods, the quantitative measurement has been made to compare with other existing methods and it shows the proposed work in this article perform much better.
Wavelet-Based Warping Technique for Mobile Devicescsandit
The role of digital images is increasing rapidly in
mobile devices. They are used in many
applications including virtual tours, virtual reali
ty, e-commerce etc. Such applications
synthesize realistic looking novel views of the ref
erence images on mobile devices using the
techniques like image-based rendering (IBR). Howeve
r, with this increasing role of digital
images comes the serious issue of processing large
images which requires considerable time.
Hence, methods to compress these large images are v
ery important. Wavelets are excellent data
compression tools that can be used with IBR algorit
hms to generate the novel views of
compressed image data. This paper proposes a framew
ork that uses wavelet-based warping
technique to render novel views of compressed image
s on mobile/ handheld devices. The
experiments are performed using Android Development
Tools (ADT) which shows the proposed
framework gives better results for large images in
terms of rendering time.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
FORGERY (COPY-MOVE) DETECTION IN DIGITAL IMAGES USING BLOCK METHODeditorijcres
AKHILESH KUMAR YADAV, DEENBANDHU SINGH, VIVEK KUMAR
Department of Computer Science and Engineering
Babu Banarasi Das University, Lucknow
akhi2232232@gmail.com, deenbandhusingh85@gmail.com, vivek.kumar0091@gmail.com
ABSTRACT- Digital images can be easily modified using powerful image editing software. Determining whether a manipulation is innocent of sharpening from those which are malicious, such as removing or adding parts to an image is the topic of this paper. In this paper we focus on detection of a special type of forgery-the Copy-Move forgery, in this part of the original image is copied moved to desired location in the same image and pasted. The proposed method compress images using DWT (discrete wavelet transform) and divided into blocks and choose blocks than perform feature vector calculation and lexicographical sorting and duplicated blocks are identified after sorting. This method is good at some manipulation/attack likes scaling, rotation, Gaussian noise, smoothing, JPEG compression etc.
INDEX TERMS- Copy-Move forgery, Wavelet Transform, Lexicographical Sorting, Region Duplication Detection.
The Effectiveness and Efficiency of Medical Images after Special Filtration f...Editor IJCATR
There are many factors which have influences on the quality of medical images, so this paper gives a brief narration on the important techniques that produce acceptable quality to medical images. To ensure the validity of this techniques towards medical images, a questionnaire was designed and distributed to a number of doctors and professionals. The survey aims to assess the medical image specialists by regarding their point of views towards the impact of filtering medical images after processing using these techniques. MatLab package used to apply the techniques.
WAVELET BASED AUTHENTICATION/SECRET TRANSMISSION THROUGH IMAGE RESIZING (WA...sipij
The paper is aimed for a wavelet based steganographic/watermarking technique in frequency domain
termed as WASTIR for secret message/image transmission or image authentication. Number system
conversion of the secret image by changing radix form decimal to quaternary is the pre-processing of the
technique. Cover image scaling through inverse discrete wavelet transformation with false Horizontal and
vertical coefficients are embedded with quaternary digits through hash function and a secret key.
Experimental results are computed and compared with the existing steganographic techniques like WTSIC,
Yuancheng Li’s Method and Region-Based in terms of Mean Square Error (MSE), Peak Signal to Noise
Ratio (PSNR) and Image Fidelity (IF) which show better performances in WASTIR.
Adaptive lifting based image compression scheme using interactive artificial ...csandit
This paper presents image compression method using Interactive Artificial Bee Colony (IABC) optimization algorithm. The proposed method reduces storage and facilitates data transmission by reducing transmission costs. To get the finest quality of compressed image, utilizing local search, IABC determines different update coefficient, and the best update coefficient is chosen
optimally. By using local search in the update step, we alter the center pixels with the coefficient in 8-different directions with a considerable window size, to produce the compressed image, expressed in terms of both PSNR and compression ratio. The IABC brings in the idea of
universal gravitation into the consideration of the affection between onlooker bees and the employed bees. By passing on different values of the control parameter, the universal gravitation involved in the IABC has various quantities of the single onlooker bee and employed bees. As a result when compared to existing methods, the proposed work gives better PSNR.
Similar to Method for a Simple Encryption of Images Based on the Chaotic Map of Bernoulli (20)
In the era of data-driven warfare, the integration of big data and machine learning (ML) techniques has
become paramount for enhancing defence capabilities. This research report delves into the applications of
big data and ML in the defence sector, exploring their potential to revolutionize intelligence gathering,
strategic decision-making, and operational efficiency. By leveraging vast amounts of data and advanced
algorithms, these technologies offer unprecedented opportunities for threat detection, predictive analysis,
and optimized resource allocation. However, their adoption also raises critical concerns regarding data
privacy, ethical implications, and the potential for misuse. This report aims to provide a comprehensive
understanding of the current state of big data and ML in defence, while examining the challenges and
ethical considerations that must be addressed to ensure responsible and effective implementation.
Cloud Computing, being one of the most recent innovative developments of the IT world, has been
instrumental not just to the success of SMEs but, through their productivity and innovative contribution to
the economy, has even made a remarkable contribution to the economic growth of the United States. To
this end, the study focuses on how cloud computing technology has impacted economic growth through
SMEs in the United States. Relevant literature connected to the variables of interest in this study was
reviewed, and secondary data was generated and utilized in the analysis section of this paper. The findings
of this paper revealed that there have been meaningful contributions that the usage of virtualization has
made in the commercial dealings of small firms in the United States, and this has also been reflected in the
economic growth of the country. This paper further revealed that as important as cloud-based software is,
some SMEs are still skeptical about how it can help improve their business and increase their bottom line
and hence have failed to adopt it. Apart from the SMEs, some notable large firms in different industries,
including information and educational services, have adopted cloud computing technology and hence
contributed to the economic growth of the United States. Lastly, findings from our inferential statistics
revealed that no discernible change has occurred in innovation between small and big businesses in the
adoption of cloud computing. Both categories of businesses adopt cloud computing in the same way, and
their contribution to the American economy has no significant difference in the usage of virtualization.
Energy-constrained Wireless Sensor Networks (WSNs) have garnered significant research interest in
recent years. Multiple-Input Multiple-Output (MIMO), or Cooperative MIMO, represents a specialized
application of MIMO technology within WSNs. This approach operates effectively, especially in
challenging and resource-constrained environments. By facilitating collaboration among sensor nodes,
Cooperative MIMO enhances reliability, coverage, and energy efficiency in WSN deployments.
Consequently, MIMO finds application in diverse WSN scenarios, spanning environmental monitoring,
industrial automation, and healthcare applications.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication. IJCSIT publishes original research papers and review papers, as well as auxiliary material such as: research papers, case studies, technical reports etc.
With growing, Car parking increases with the number of car users. With the increased use of smartphones
and their applications, users prefer mobile phone-based solutions. This paper proposes the Smart Parking
Management System (SPMS) that depends on Arduino parts, Android applications, and based on IoT. This
gave the client the ability to check available parking spaces and reserve a parking spot. IR sensors are
utilized to know if a car park space is allowed. Its area data are transmitted using the WI-FI module to the
server and are recovered by the mobile application which offers many options attractively and with no cost
to users and lets the user check reservation details. With IoT technology, the smart parking system can be
connected wirelessly to easily track available locations.
Welcome to AIRCC's International Journal of Computer Science and Information Technology (IJCSIT), your gateway to the latest advancements in the dynamic fields of Computer Science and Information Systems.
Computer-Assisted Language Learning (CALL) are computer-based tutoring systems that deal with
linguistic skills. Adding intelligence in such systems is mainly based on using Natural Language
Processing (NLP) tools to diagnose student errors, especially in language grammar. However, most such
systems do not consider the modeling of student competence in linguistic skills, especially for the Arabic
language. In this paper, we will deal with basic grammar concepts of the Arabic language taught for the
fourth grade of the elementary school in Egypt. This is through Arabic Grammar Trainer (AGTrainer)
which is an Intelligent CALL. The implemented system (AGTrainer) trains the students through different
questions that deal with the different concepts and have different difficulty levels. Constraint-based student
modeling (CBSM) technique is used as a short-term student model. CBSM is used to define in small grain
level the different grammar skills through the defined skill structures. The main contribution of this paper
is the hierarchal representation of the system's basic grammar skills as domain knowledge. That
representation is used as a mechanism for efficiently checking constraints to model the student knowledge
and diagnose the student errors and identify their cause. In addition, satisfying constraints and the number
of trails the student takes for answering each question and fuzzy logic decision system are used to
determine the student learning level for each lesson as a long-term model. The results of the evaluation
showed the system's effectiveness in learning in addition to the satisfaction of students and teachers with its
features and abilities.
In the realm of computer security, the importance of efficient and reliable user authentication methods has
become increasingly critical. This paper examines the potential of mouse movement dynamics as a
consistent metric for continuous authentication. By analysing user mouse movement patterns in two
contrasting gaming scenarios, "Team Fortress" and "Poly Bridge," we investigate the distinctive
behavioral patterns inherent in high-intensity and low-intensity UI interactions. The study extends beyond
conventional methodologies by employing a range of machine learning models. These models are carefully
selected to assess their effectiveness in capturing and interpreting the subtleties of user behavior as
reflected in their mouse movements. This multifaceted approach allows for a more nuanced and
comprehensive understanding of user interaction patterns. Our findings reveal that mouse movement
dynamics can serve as a reliable indicator for continuous user authentication. The diverse machine
learning models employed in this study demonstrate competent performance in user verification, marking
an improvement over previous methods used in this field. This research contributes to the ongoing efforts to
enhance computer security and highlights the potential of leveraging user behavior, specifically mouse
dynamics, in developing robust authentication systems.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
Image segmentation and classification tasks in computer vision have proven to be highly effective using neural networks, specifically Convolutional Neural Networks (CNNs). These tasks have numerous
practical applications, such as in medical imaging, autonomous driving, and surveillance. CNNs are capable
of learning complex features directly from images and achieving outstanding performance across several
datasets. In this work, we have utilized three different datasets to investigate the efficacy of various preprocessing and classification techniques in accurssedately segmenting and classifying different structures
within the MRI and natural images. We have utilized both sample gradient and Canny Edge Detection
methods for pre-processing, and K-means clustering have been applied to segment the images. Image
augmentation improves the size and diversity of datasets for training the models for image classification
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
This research aims to further understanding in the field of continuous authentication using behavioural
biometrics. We are contributing a novel dataset that encompasses the gesture data of 15 users playing
Minecraft with a Samsung Tablet, each for a duration of 15 minutes. Utilizing this dataset, we employed
machine learning (ML) binary classifiers, being Random Forest (RF), K-Nearest Neighbors (KNN), and
Support Vector Classifier (SVC), to determine the authenticity of specific user actions. Our most robust
model was SVC, which achieved an average accuracy of approximately 90%, demonstrating that touch
dynamics can effectively distinguish users. However, further studies are needed to make it viable option
for authentication systems. You can access our dataset at the following
link:https://github.com/AuthenTech2023/authentech-repo
This paper discusses the capabilities and limitations of GPT-3 (0), a state-of-the-art language model, in the
context of text understanding. We begin by describing the architecture and training process of GPT-3, and
provide an overview of its impressive performance across a wide range of natural language processing
tasks, such as language translation, question-answering, and text completion. Throughout this research
project, a summarizing tool was also created to help us retrieve content from any types of document,
specifically IELTS (0) Reading Test data in this project. We also aimed to improve the accuracy of the
summarizing, as well as question-answering capabilities of GPT-3 (0) via long text
In the realm of computer security, the importance of efficient and reliable user authentication methods has
become increasingly critical. This paper examines the potential of mouse movement dynamics as a
consistent metric for continuous authentication. By analysing user mouse movement patterns in two
contrasting gaming scenarios, "Team Fortress" and "Poly Bridge," we investigate the distinctive
behavioral patterns inherent in high-intensity and low-intensity UI interactions. The study extends beyond
conventional methodologies by employing a range of machine learning models. These models are carefully
selected to assess their effectiveness in capturing and interpreting the subtleties of user behavior as
reflected in their mouse movements. This multifaceted approach allows for a more nuanced and
comprehensive understanding of user interaction patterns. Our findings reveal that mouse movement
dynamics can serve as a reliable indicator for continuous user authentication. The diverse machine
learning models employed in this study demonstrate competent performance in user verification, marking
an improvement over previous methods used in this field. This research contributes to the ongoing efforts to
enhance computer security and highlights the potential of leveraging user behavior, specifically mouse
dynamics, in developing robust authentication systems.
Image segmentation and classification tasks in computer vision have proven to be highly effective using neural networks, specifically Convolutional Neural Networks (CNNs). These tasks have numerous
practical applications, such as in medical imaging, autonomous driving, and surveillance. CNNs are capable
of learning complex features directly from images and achieving outstanding performance across several
datasets. In this work, we have utilized three different datasets to investigate the efficacy of various preprocessing and classification techniques in accurssedately segmenting and classifying different structures
within the MRI and natural images. We have utilized both sample gradient and Canny Edge Detection
methods for pre-processing, and K-means clustering have been applied to segment the images. Image
augmentation improves the size and diversity of datasets for training the models for image classification.
This work highlights transfer learning’s effectiveness in image classification using CNNs and VGG 16 that
provides insights into the selection of pre-trained models and hyper parameters for optimal performance.
We have proposed a comprehensive approach for image segmentation and classification, incorporating preprocessing techniques, the K-means algorithm for segmentation, and employing deep learning models such
as CNN and VGG 16 for classification.
The security of Electric Vehicle (EV) charging has gained momentum after the increase in the EV adoption
in the past few years. Mobile applications have been integrated into EV charging systems that mainly use a
cloud-based platform to host their services and data. Like many complex systems, cloud systems are
susceptible to cyberattacks if proper measures are not taken by the organization to secure them. In this
paper, we explore the security of key components in the EV charging infrastructure, including the mobile
application and its cloud service. We conducted an experiment that initiated a Man in the Middle attack
between an EV app and its cloud services. Our results showed that it is possible to launch attacks against
the connected infrastructure by taking advantage of vulnerabilities that may have substantial economic and
operational ramifications on the EV charging ecosystem. We conclude by providing mitigation suggestions
and future research directions.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
This paper describes the outcome of an attempt to implement the same transitive closure (TC) algorithm
for Apache MapReduce running on different Apache Hadoop distributions. Apache MapReduce is a
software framework used with Apache Hadoop, which has become the de facto standard platform for
processing and storing large amounts of data in a distributed computing environment. The research
presented here focuses on the variations observed among the results of an efficient iterative transitive
closure algorithm when run against different distributed environments. The results from these comparisons
were validated against the benchmark results from OYSTER, an open source Entity Resolution system. The
experiment results highlighted the inconsistencies that can occur when using the same codebase with
different implementations of Map Reduce.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Automobile Management System Project Report.pdfKamal Acharya
The proposed project is developed to manage the automobile in the automobile dealer company. The main module in this project is login, automobile management, customer management, sales, complaints and reports. The first module is the login. The automobile showroom owner should login to the project for usage. The username and password are verified and if it is correct, next form opens. If the username and password are not correct, it shows the error message.
When a customer search for a automobile, if the automobile is available, they will be taken to a page that shows the details of the automobile including automobile name, automobile ID, quantity, price etc. “Automobile Management System” is useful for maintaining automobiles, customers effectively and hence helps for establishing good relation between customer and automobile organization. It contains various customized modules for effectively maintaining automobiles and stock information accurately and safely.
When the automobile is sold to the customer, stock will be reduced automatically. When a new purchase is made, stock will be increased automatically. While selecting automobiles for sale, the proposed software will automatically check for total number of available stock of that particular item, if the total stock of that particular item is less than 5, software will notify the user to purchase the particular item.
Also when the user tries to sale items which are not in stock, the system will prompt the user that the stock is not enough. Customers of this system can search for a automobile; can purchase a automobile easily by selecting fast. On the other hand the stock of automobiles can be maintained perfectly by the automobile shop manager overcoming the drawbacks of existing system.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
Vaccine management system project report documentation..pdfKamal Acharya
The Division of Vaccine and Immunization is facing increasing difficulty monitoring vaccines and other commodities distribution once they have been distributed from the national stores. With the introduction of new vaccines, more challenges have been anticipated with this additions posing serious threat to the already over strained vaccine supply chain system in Kenya.
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
Event Management System Vb Net Project Report.pdfKamal Acharya
In present era, the scopes of information technology growing with a very fast .We do not see any are untouched from this industry. The scope of information technology has become wider includes: Business and industry. Household Business, Communication, Education, Entertainment, Science, Medicine, Engineering, Distance Learning, Weather Forecasting. Carrier Searching and so on.
My project named “Event Management System” is software that store and maintained all events coordinated in college. It also helpful to print related reports. My project will help to record the events coordinated by faculties with their Name, Event subject, date & details in an efficient & effective ways.
In my system we have to make a system by which a user can record all events coordinated by a particular faculty. In our proposed system some more featured are added which differs it from the existing system such as security.
Gen AI Study Jams _ For the GDSC Leads in India.pdf
Method for a Simple Encryption of Images Based on the Chaotic Map of Bernoulli
1. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
DOI:10.5121/ijcsit.2017.9604 43
METHOD FOR A SIMPLE ENCRYPTION OF IMAGES
BASED ON THE CHAOTIC MAP OF BERNOULLI
Luis Alfredo Crisanto Baez, Ricardo Francisco Martinez Gonzalez,
Yesenia Isabel Moreno Pavan and Marcos Alonso Mendez Gamboa
Department of Electric-Electronic Engineering, TecNM - Instituto Tecnologico de
Veracruz, Veracruz, Mexico
ABSTRACT
In this document, we propose a simple algorithm for the encryption of gray-scale images, although the
scheme is perfectly usable in color images. Prior to encryption, the proposed algorithm includes a pair of
permutation processes, inspired by the Bernoulli mapping. The permutation disperses the image
information to hinder the unauthorized recovery of the original image. The image is encrypted using the
XOR function between a sequence generated from the same Bernoulli mapping and the image data,
obtained after two permutation processes. Finally, for the verification of the algorithm, the gray-scale Lena
pattern image was used; calculating histograms for each stage alongside of the encryption process. The
histograms prove dispersion evolution for pattern image during whole algorithm.
KEYWORDS
Algorithm of image encryption; Bernoulli mapping; Permutation.
1. INTRODUCTION
In the last decades, the transmission of information through the internet has increased [1]. This
fact is due to the technological advance in hardware and software, which has caused that
nowadays it is possible to carry out data transfers at high speed and in high definition. To be able
to perform this type of transmissions, a large volume of data must be moved; the fact is
considered trivial by users [2]. However, it presents a latent risk of attacks by third parties; who
want to obtain information about a specific user [3]. Therefore, it is necessary to implement
methods capable of offering certain levels of information security; being encryption the most
common way [4]. Encryption needs to be fast, efficient and easy to implement, to prevent
bottlenecks in the transfer of information [5], and to reduce affectations to the end user.
A good part of the traffic circulating on the network are images [6]; unfortunately, they can be
observed by individuals who can misuse them. The purpose of this algorithm is to use pseudo-
random sequences to control the different processes for encrypting the input image. There are
multiple ways to generate pseudo-randomness, but in [7], the use of chaos is justified for
encryption applications; it is mainly due to the great compatibility between the chaotic properties
with the desired characteristics in the ciphers.
2. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
44
As part of the present work, a method is proposed that not only encrypts the image based on a
chaotic one-dimensional mapping but also it includes permutations controlled by the same
mapping. These permutations will not change the statistics of the image; however, they will alter
the image perception, increasing the difficulty to recognize it [8]. To complete the process, the
image is encrypted using a sequence generated by the same mapping. As part of this manuscript;
in the second section, some details of the Bernoulli mapping will be announced. In the next
section, we will detail the used encryption scheme, as well as the logic behind image
permutations. Later, the results obtained with the present work will be reported in the fourth
section. Finally, the conclusions obtained after the realization of the proposal are narrated on the
last section.
2. MATHEMATICAL MODEL OF BERNOULLI
The Bernoulli mapping is also known as the dyadic transformation [9]. This mapping is usually
used in a recursive way, and it can be defined as a piece-wise linear function [10], which is shown
in Eq. 1.
=
2 0 ≤ < 0.5
2 − 10.5 ≤ < 1
(1)
Where xn is the iteration value at the present time, while xn+1 is the iteration value at the next time.
The value range for x is (0, 1). On the other hand, the variable µ represents the feedback factor
and its range is (0, 1).
As it can be seen on the Eq. 1, the domain of the Bernoulli mapping is (0,1); therefore, such
interval is converted to a floating-point representation. Which is, accordingly to [11], the only
way to effectively represent the decimal values that were established in the mapping domain.
On the other hand, when the mapping is used to process files whose coding is in fixed-point
representation, as is the case of the image files, it must be modified to fit within the range of the
file. For this reason, the mapping should have a small adjustment, which is shown on next
{ } = { } ∗ 2 ( 2)
Where {X} is the output set produced by the mapping represented by Eq. 1; {Y} is the set of the
scaled and truncated values obtained from {X}; while bitsis the number of bits that are intended to
represent the binary data.
The function floor truncates the {X} data after being scaled to the range (0, 2bits
); it takes the input
data and removes the decimal part, retaining the entire part. As it was mentioned, the present
proposal aims at image encryption. Typically, in an image file, eight bits are used to represent
pixel depth; so that value will be the number of bits used in this work.
At Figure 1 there is a flow diagram for encrypting data generation. It begins with the definition of
the feedback factor (µ) and initial value x[0] for the mapping; additionally, the total number of
iterations need to encrypt image.
After basic parameters were defined, a loop starts; it iteratively obtains necessary data to encrypt
image. Inside the loop, there is a decision to evaluate if previous outcome iteration is lower or
3. International Journal of Computer Science &
higher than 0.5. The evaluation result is used to assign which segment of the mathematical
description will be taken for obtaining
stop condition is reached, the loop is broken and total data is scaled using definition shown in Eq.
2.
Figure 1. Flow diagram of the implementation of Eq. 1 and its subsequent adaptation for eight
The graphical tool known as the bifurcation diagram is used
described generator mapping [12].
2.1 Bifurcation diagram
It is a tool that indicates the values that a mapping can take, depending on the feedback factor (
The algorithm for obtaining it is quite simple, and is shown
• Define the range of the feedback factor,
that will be in it; create a vector of feedback factors.
• Select the total number of iterations that will have the sequence to be used to generate the
diagram. The number of iterations must be higher than 300, nevertheless, it is important
to remark that the higher this number the denser diagram will look, but the computational
time will be longer.
• Choose an initial value (
factors and use the mapping described in Eq. 1 to calculate the
feedback factor. This point must be repeated for all values of the vector; therefore, they
will have step {X} sets.
• Scale the {X} sets using Eq. 2, obtaining the same number of
graph the values of the sequences obtained in the corresponding space of the feedback
International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
higher than 0.5. The evaluation result is used to assign which segment of the mathematical
description will be taken for obtaining x[n]; then loop control variable is increased. When the
he loop is broken and total data is scaled using definition shown in Eq.
Figure 1. Flow diagram of the implementation of Eq. 1 and its subsequent adaptation for eight
resolution files.
The graphical tool known as the bifurcation diagram is used to observe the behavior of the
described generator mapping [12].
It is a tool that indicates the values that a mapping can take, depending on the feedback factor (
The algorithm for obtaining it is quite simple, and is shown below [13]:
Define the range of the feedback factor, µi, and µf, as well as the number of values (
that will be in it; create a vector of feedback factors.
Select the total number of iterations that will have the sequence to be used to generate the
diagram. The number of iterations must be higher than 300, nevertheless, it is important
to remark that the higher this number the denser diagram will look, but the computational
Choose an initial value (x0) arbitrarily. Take the first value of the vector of feedback
factors and use the mapping described in Eq. 1 to calculate the {X} set for the taken
feedback factor. This point must be repeated for all values of the vector; therefore, they
sets.
ing Eq. 2, obtaining the same number of {Y} sets. With the sets,
graph the values of the sequences obtained in the corresponding space of the feedback
Information Technology (IJCSIT) Vol 9, No 6, December 2017
45
higher than 0.5. The evaluation result is used to assign which segment of the mathematical
; then loop control variable is increased. When the
he loop is broken and total data is scaled using definition shown in Eq.
Figure 1. Flow diagram of the implementation of Eq. 1 and its subsequent adaptation for eight-bit
to observe the behavior of the
It is a tool that indicates the values that a mapping can take, depending on the feedback factor (µ).
, as well as the number of values (step)
Select the total number of iterations that will have the sequence to be used to generate the
diagram. The number of iterations must be higher than 300, nevertheless, it is important
to remark that the higher this number the denser diagram will look, but the computational
value of the vector of feedback
set for the taken
feedback factor. This point must be repeated for all values of the vector; therefore, they
sets. With the sets,
graph the values of the sequences obtained in the corresponding space of the feedback
4. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
46
factor used for its generation; producing a sweep of all the output values for the mapping
for each µ used.
Figure 2. Bifurcation diagrams for {X} set (right) and {Y} (left)
The main difference of the {X} and {Y} sets diagrams is their intervals. The diagram for the {X}
set is in (0, 1), while the one for the {Y} set is in (0, 2bits
). According to some investigations, the
truncation process degenerates the pseudo-random behavior of the mapping; which could be
manifesting in the form of the lines present in the bifurcation diagram of the {Y} set. Thanks to
the bifurcation diagram, the presence of such detail can be observed.
3. DESCRIPTION OF THE PROPOSED ALGORITHM
The proposed algorithm considers loading a gray-scale image (img), it has a single layer image
and extending it into a vector (bitplane) that has a length obtained to multiply the length (m) and
width (n) of the loaded image. This vector is permuted following a criterion established in Eq. 3.
This permutation was inspired by the Bernoulli mapping, and it can be seen below:
!"# $%&' = (
!"# $%&)' ≤
*∙
)
!"# $%&)', *∙ >
*∙
)
(3)
Where pbitplane is the vector obtained after the permutation criterion. bitplane was previously
mentioned that are the values of the img image in a vector form. l is a consecutive number that
must cover all the cells of the bitplane vector. And finally, m and n are the dimensions of the
loaded image.
According to the flow diagram in Figure 3, the permutation process is the second step in the
proposed algorithm. Following the same diagram, it is observed that the next step is the
transposition of pbitplane. The transposition process starts with the reconstruction in two
dimensions from the pbitplane vector; for such reason, the vector is chunk in n pieces, where each
piece is a row in the reconstructed matrix.
5. International Journal of Computer Science &
With the information in the form of a matrix, called
using function available in Matlab for such purpose. The function exchanges the matrix values
from horizontal to vertical and viceversa, obtaining the transposed matrix,
Figure 3. Flow diagram for the algorithm proposed in the present
After transposition, the matrix
process of permutation is concluded following the mathematical definition described in Eq. 3,
whereby pbitplane2 is obtained. To explain the permuta
representation was created that can be seen in Figure 4.
The permutation process seeks to distribute image information contained in the matrix, in such a
way that the information of each pixel is as separate as poss
This process will make it difficult to reconstruct the original image by not presenting a reference
point of where the information came from.
Although the process of permutation produces a dispersion of the image
to have an adequate level of security. A disadvantage of any permutation process is that the
permuted matrix statistics remains the same as the original matrix [15]. For this reason, the last
process is required; it is the data enc
International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
With the information in the form of a matrix, called imgp1, next step is to transpose the matri
using function available in Matlab for such purpose. The function exchanges the matrix values
from horizontal to vertical and viceversa, obtaining the transposed matrix, imgt1.
Figure 3. Flow diagram for the algorithm proposed in the present manuscript
After transposition, the matrix imgt1 is again transformed into a vector, called
process of permutation is concluded following the mathematical definition described in Eq. 3,
is obtained. To explain the permutation process described above, a graphic
representation was created that can be seen in Figure 4.
The permutation process seeks to distribute image information contained in the matrix, in such a
way that the information of each pixel is as separate as possible from its original position [14].
This process will make it difficult to reconstruct the original image by not presenting a reference
point of where the information came from.
Although the process of permutation produces a dispersion of the image data, this is not enough
to have an adequate level of security. A disadvantage of any permutation process is that the
permuted matrix statistics remains the same as the original matrix [15]. For this reason, the last
process is required; it is the data encryption in itself, which is performed twice.
Information Technology (IJCSIT) Vol 9, No 6, December 2017
47
, next step is to transpose the matrix
using function available in Matlab for such purpose. The function exchanges the matrix values
manuscript
is again transformed into a vector, called bitplane2. The
process of permutation is concluded following the mathematical definition described in Eq. 3,
tion process described above, a graphic
The permutation process seeks to distribute image information contained in the matrix, in such a
ible from its original position [14].
This process will make it difficult to reconstruct the original image by not presenting a reference
data, this is not enough
to have an adequate level of security. A disadvantage of any permutation process is that the
permuted matrix statistics remains the same as the original matrix [15]. For this reason, the last
6. International Journal of Computer Science &
Figure 4. Graphical description of the permutation process.
To begin the encryption process, a sequence is generated using the Bernoulli mapping. As a
parameter for the mapping, a feedback factor greater tha
because according to the diagram in Figure 2, it guarantees that the data obtained have a pseudo
random behavior. By using a sequence similar to the random, the encrypted data will have a good
level of security; preventing that someone wants to break into them [16].
The encryption process is simple, it starts by defining the feedback parameter and initial
condition; and then, to generate the sequence using Eq. 1. It is important to take into account that
the length of the generated sequence must be equal to the vectorized image to be encrypted. After
obtaining it, the generated sequence is scaled using Eq. 2, with a representation of eight bits. Such
length was chosen because the image data have it the same length. Each
generated from Eq. 2 is input along with the data from the
function [17].
It should be noted that the encryption process takes only one of the data from each source at a
time, and it outputs a single data of eight bits at a time. The process continues until the data of
both input vectors, pbitplane2
4. RESULTS
The first result presented is that corresponding to the histograms
the different stages of the proposed algorithm. As can be seen in Figure 5, the permutation
processes do not alter the data, only its location; so their respective histograms are the same.
According to the presented histogr
with the eight-bit range that was established for the algorithm. With respect to the data incidence,
its maximum value is 2500; and this incidence is reached for a value close to 160.
The encrypted image histogram changes significantly, and this is because the encryption process
takes data and replaces it with a new one; and not only exchanges it as in the case of the
International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
Figure 4. Graphical description of the permutation process.
To begin the encryption process, a sequence is generated using the Bernoulli mapping. As a
parameter for the mapping, a feedback factor greater than 0.75 is used; such value is agreed
because according to the diagram in Figure 2, it guarantees that the data obtained have a pseudo
random behavior. By using a sequence similar to the random, the encrypted data will have a good
ing that someone wants to break into them [16].
The encryption process is simple, it starts by defining the feedback parameter and initial
condition; and then, to generate the sequence using Eq. 1. It is important to take into account that
he generated sequence must be equal to the vectorized image to be encrypted. After
obtaining it, the generated sequence is scaled using Eq. 2, with a representation of eight bits. Such
length was chosen because the image data have it the same length. Each of the sequence data
generated from Eq. 2 is input along with the data from the pbitplane2 vector into a XORbitwise
It should be noted that the encryption process takes only one of the data from each source at a
single data of eight bits at a time. The process continues until the data of
vector and the pseudo-random sequence vector, are exhausted [18].
The first result presented is that corresponding to the histograms obtained from the output data of
the different stages of the proposed algorithm. As can be seen in Figure 5, the permutation
processes do not alter the data, only its location; so their respective histograms are the same.
According to the presented histograms, the data starts at 0 and ends at 255; which is consistent
bit range that was established for the algorithm. With respect to the data incidence,
its maximum value is 2500; and this incidence is reached for a value close to 160.
ypted image histogram changes significantly, and this is because the encryption process
takes data and replaces it with a new one; and not only exchanges it as in the case of the
Information Technology (IJCSIT) Vol 9, No 6, December 2017
48
To begin the encryption process, a sequence is generated using the Bernoulli mapping. As a
n 0.75 is used; such value is agreed
because according to the diagram in Figure 2, it guarantees that the data obtained have a pseudo-
random behavior. By using a sequence similar to the random, the encrypted data will have a good
The encryption process is simple, it starts by defining the feedback parameter and initial
condition; and then, to generate the sequence using Eq. 1. It is important to take into account that
he generated sequence must be equal to the vectorized image to be encrypted. After
obtaining it, the generated sequence is scaled using Eq. 2, with a representation of eight bits. Such
of the sequence data
vector into a XORbitwise
It should be noted that the encryption process takes only one of the data from each source at a
single data of eight bits at a time. The process continues until the data of
random sequence vector, are exhausted [18].
obtained from the output data of
the different stages of the proposed algorithm. As can be seen in Figure 5, the permutation
processes do not alter the data, only its location; so their respective histograms are the same.
ams, the data starts at 0 and ends at 255; which is consistent
bit range that was established for the algorithm. With respect to the data incidence,
ypted image histogram changes significantly, and this is because the encryption process
takes data and replaces it with a new one; and not only exchanges it as in the case of the
7. International Journal of Computer Science &
permutation. This fact drastically alters the data statistics, which is refle
presented in figure 5 for the encrypted image
The histogram of the encrypted image should be ideally uniform [15]; in other words, completely
flat, with all its equal incidences for all values from 0 to 255. In practice, this is extremely
difficult to achieve, so the result presented, where the data a
the same incidence, can be taken as a good result, due its entropy is 7.9963. The entropy was
calculated using the Matlab function, which calculates it with next expression,
. = − ∑0 ∙
where s is the entropy value, and
Figure 5. Histograms of the output data of the different stages of the proposed algorithm
For the present work, it was decided to start with the histograms obtained
delivered after each permutation and encrypted images, they are found in Figure 6.
The input image for the proof was the gray
distorted but the image of Lena is still
process of transposition; using it, the image is rotated and then the second permutation process is
performed; resulting in a much less recognizable image. Finally, the encryption alters either the
statistics of the image or aspect, which at first glance seems like noise.
International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
permutation. This fact drastically alters the data statistics, which is reflected in the histogram
presented in figure 5 for the encrypted image
The histogram of the encrypted image should be ideally uniform [15]; in other words, completely
flat, with all its equal incidences for all values from 0 to 255. In practice, this is extremely
difficult to achieve, so the result presented, where the data are much more dispersed and almost
the same incidence, can be taken as a good result, due its entropy is 7.9963. The entropy was
calculated using the Matlab function, which calculates it with next expression,
0 ∙ 1) 2 (4)
is the entropy value, and p is the incidence of every pixel in 256 bins of gray
Figure 5. Histograms of the output data of the different stages of the proposed algorithm
For the present work, it was decided to start with the histograms obtained from the input, those
delivered after each permutation and encrypted images, they are found in Figure 6.
The input image for the proof was the gray-scale Lena. After the first permutation, the image is
distorted but the image of Lena is still recognizable. Between the two permutations there is a
process of transposition; using it, the image is rotated and then the second permutation process is
performed; resulting in a much less recognizable image. Finally, the encryption alters either the
istics of the image or aspect, which at first glance seems like noise.
Information Technology (IJCSIT) Vol 9, No 6, December 2017
49
cted in the histogram
The histogram of the encrypted image should be ideally uniform [15]; in other words, completely
flat, with all its equal incidences for all values from 0 to 255. In practice, this is extremely
re much more dispersed and almost
the same incidence, can be taken as a good result, due its entropy is 7.9963. The entropy was
is the incidence of every pixel in 256 bins of gray-scale.
Figure 5. Histograms of the output data of the different stages of the proposed algorithm
from the input, those
delivered after each permutation and encrypted images, they are found in Figure 6.
scale Lena. After the first permutation, the image is
recognizable. Between the two permutations there is a
process of transposition; using it, the image is rotated and then the second permutation process is
performed; resulting in a much less recognizable image. Finally, the encryption alters either the
8. International Journal of Computer Science &
Figure 6. Input image (top left), obtained after the first permutation (top right), second permutation (bottom
left) and the final cipher image (bottom right).
5. CONCLUSIONS
With the images of Figure 6 and the histograms previously presented, it is possible to conclude
that the Bernoulli mapping can serve as a basis for pixel permutation processes; thus, to generate
pseudo-random sequences, that can be used for image encrypting.
Additionally, the present algorithm is simple not only to perform but to understand in its
operation; so it can be taken as a frame of reference for future developers of image encryption
schemes. So, a double objective is achieved, the realization of a simp
encryption and a guide for future work in this area.
International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
Figure 6. Input image (top left), obtained after the first permutation (top right), second permutation (bottom
left) and the final cipher image (bottom right).
the images of Figure 6 and the histograms previously presented, it is possible to conclude
that the Bernoulli mapping can serve as a basis for pixel permutation processes; thus, to generate
random sequences, that can be used for image encrypting.
dditionally, the present algorithm is simple not only to perform but to understand in its
operation; so it can be taken as a frame of reference for future developers of image encryption
schemes. So, a double objective is achieved, the realization of a simple method for image
encryption and a guide for future work in this area.
Information Technology (IJCSIT) Vol 9, No 6, December 2017
50
Figure 6. Input image (top left), obtained after the first permutation (top right), second permutation (bottom
the images of Figure 6 and the histograms previously presented, it is possible to conclude
that the Bernoulli mapping can serve as a basis for pixel permutation processes; thus, to generate
dditionally, the present algorithm is simple not only to perform but to understand in its
operation; so it can be taken as a frame of reference for future developers of image encryption
le method for image
9. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 6, December 2017
51
REFERENCES
[1] Lagarde, K. C., & Rogers, R. M. (1998). U.S. Patent No. 5,721,908. Washington, Dc: U.S. Patent And
Trademark Office.
[2] Jorquera, D. M., Iglesias, V. G., Gimeno, F. J. M., & Pérez, F. M. Mecanismos De
Difusiónmasivaenaplicacionesdistribuidas.
[3] Tsai, C. L., & Lin, U. C. (2011). Information Security Of Cloud Computing For Enterprises. Advances
In Information Sciences And Service Sciences, 3(1), 132.
[4] Dutta, S., Das, T., Jash, S., Patra, D., & Paul, P. (2014). A Cryptography Algorithm Using The
Operations Of Genetic Algorithm & Pseudo Random Sequence Generating Functions. International
Journal, 3(5).
[5] Melander, B., Björkman, M., &Gunningberg, P. (2000). A New End-To-End Probing And Analysis
Method For Estimating Bandwidth Bottlenecks. In Global Telecommunications Conference, 2000.
Globecom'00. Ieee (Vol. 1, Pp. 415-420). Ieee.
[6] Ammar, A., El-Kabbany, A. S. S., Youssef, M. I., &Emam, A. A Novel Secure Image Ciphering
Technique Based On Chaos. In 4th Wseas Int. Conf. On Information Science, Communications, And
Applications (Pp. 21-23).
[7] Alvarez, G., & Li, S. (2006). Some Basic Cryptographic Requirements For Chaos-Based
Cryptosystems. International Journal Of Bifurcation And Chaos, 16(08), 2129-2151.
[8] Nasri, M., Helali, A., Sghaier, H., &Maaref, H. (2010, March). Adaptive Image Transfer For Wireless
Sensor Networks (Wsns). In Design And Technology Of Integrated Systems In Nanoscale Era (Dtis),
2010 5th International Conference On (Pp. 1-7). Ieee.
[9] Saleski, A. (1973). On Induced Transformations Of Bernoulli Shifts. Theory Of Computing Systems,
7(1), 83-96.
[10]Li, S., Chen, G., &Mou, X. (2005). On The Dynamical Degradation Of Digital Piecewise Linear
Chaotic Maps. International Journal Of Bifurcation And Chaos, 15(10), 3119-3151.
[11]Biswas, H. R. (2013). One Dimensional Chaotic Dynamical Systems. Journal Of Pure And Applied
Mathematics: Advances And Applications, 10(1), 69-101.
[12]Persohn, K. J., &Povinelli, R. J. (2012). Analyzing Logistic Map Pseudorandom Number Generators
For Periodicity Induced By Finite Precision Floating-Point Representation. Chaos, Solitons & Fractals,
45(3), 238-245.
[13]Agiza, H. N. (1999). On The Analysis Of Stability, Bifurcation, Chaos And Chaos Control Of Kopel
Map. Chaos, Solitons & Fractals, 10(11), 1909-1916.
[14]Fu, C., Lin, B. B., Miao, Y. S., Liu, X., & Chen, J. J. (2011). A Novel Chaos-Based Bit-Level
Permutation Scheme For Digital Image Encryption. Optics Communications, 284(23), 5415-5423.
[15]Abarbanel, H. (2012). Analysis Of Observed Chaotic Data. Springer Science & Business Media.
[16]Ahmed, H. E. D. H., Kalash, H. M., & Allah, O. S. F. (2007). An Efficient Chaos-Based Feedback
Stream Cipher (Ecbfsc) For Image Encryption And Decryption. Informatica, 31(1).
[17]Behnia, S., Akhshani, A., Mahmodi, H., &Akhavan, A. (2008). A Novel Algorithm For Image
Encryption Based On Mixture Of Chaotic Maps. Chaos, Solitons & Fractals, 35(2), 408-419.
[18]Wong, K. W., Kwok, B. S. H., & Law, W. S. (2008). A Fast Image Encryption Scheme Based On
Chaotic Standard Map. Physics Letters A, 372(15), 2645-2652.