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.
Colour Image Steganography Based on Pixel Value Differencing in Spatial Domainijistjournal
In a color image every pixel value composed of red, green and blue component and each of which ranges from 0 to 255 in case of 8-bit representation. In this paper, we have used pixel value differencing (PVD) method for secret data embedding in each of the component of a pixel in a color image. But when we use pixel-value differencing (PVD) method as image steganographic scheme, the pixel values in the stegoimage may exceed the range 0~255. We have eliminated this overflow problem of each component pixel. Furthermore for providing more security, we have used different number of bits in different pixel components. It would be very difficult to trace how many bits are embedded in a pixel of the stego image. From the experiments it is seen that the results obtained in proposed method provides better visual quality of stego-image compared to the PVD method.
This paper presents embedding of data in an image using pixel-value differencing technique. This scheme is used to embed large amount of data by changing the difference between two pixels so that we are able to increase the embedding capacity. There is another technique that is pixel value shifting which also increase the embedding capacity but according to this scheme capacity will increase at edge areas of image.
METHOD FOR A SIMPLE ENCRYPTION OF IMAGES BASED ON THE CHAOTIC MAP OF BERNOULLIijcsit
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.
Symmetric Image Encryption Algorithm Using 3D Rossler System........................................................1
Vishnu G. Kamat and Madhu Sharma
Node Monitoring with Fellowship Model against Black Hole Attacks in MANET.................................... 14
Rutuja Shah, M.Tech (I.T.-Networking), Lakshmi Rani, M.Tech (I.T.-Networking) and S. Sumathy, AP [SG]
Load Balancing using Peers in an E-Learning Environment ...................................................................... 22
Maria Dominic and Sagayaraj Francis
E-Transparency and Information Sharing in the Public Sector ................................................................ 30
Edison Lubua (PhD)
A Survey of Frequent Subgraphs and Subtree Mining Methods ............................................................. 39
Hamed Dinari and Hassan Naderi
A Model for Implementation of IT Service Management in Zimbabwean State Universities ................ 58
Munyaradzi Zhou, Caroline Ruvinga, Samuel Musungwini and Tinashe Gwendolyn Zhou
Present a Way to Find Frequent Tree Patterns using Inverted Index ..................................................... 66
Saeid Tajedi and Hasan Naderi
An Approach for Customer Satisfaction: Evaluation and Validation ....................................................... 79
Amina El Kebbaj and A. Namir
Spam Detection in Twitter – A Review...................................................................................................... 92
C. Divya Gowri and Professor V. Mohanraj
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.
Fixed-Point Code Synthesis for Neural Networksgerogepatton
Over the last few years, neural networks have started penetrating safety critical systems to take decisions in robots, rockets, autonomous driving car, etc. A problem is that these critical systems often have limited computing resources. Often, they use the fixed-point arithmetic for its many advantages (rapidity, compatibility with small memory devices.) In this article, a new technique is introduced to tune the formats (precision) of already trained neural networks using fixed-point arithmetic, which can be implemented using integer operations only. The new optimized neural network computes the output with fixed-point numbers without modifying the accuracy up to a threshold fixed by the user. A fixed-point code is synthesized for the new optimized neural network ensuring the respect of the threshold for any input vector belonging the range [xmin, xmax] determined during the analysis. From a technical point of view, we do a preliminary analysis of our floating neural network to determine the worst cases, then we generate a system of linear constraints among integer variables that we can solve by linear programming. The solution of this system is the new fixed-point format of each neuron. The experimental results obtained show the efficiency of our method which can ensure that the new fixed-point neural network has the same behavior as the initial floating-point neural network.
An Efficient Multiplierless Transform algorithm for Video CodingCSCJournals
This paper presents an efficient algorithm to accelerate software video encoders/decoders by reducing the number of arithmetic operations for Discrete Cosine Transform (DCT). A multiplierless Ramanujan Ordered Number DCT (RDCT) is presented which computes the coefficients using shifts and addition operations only. The reduction in computational complexity has improved the performance of the video codec by almost 58% compared with the commonly used integer DCT. The results show that significant computation reduction can be achieved with negligible average peak signal-to-noise ratio (PSNR) degradation. The average structural similarity index matrix (SSIM) also ensures that the degradation due to the approximation is minimal.
New Chaotic Substation and Permutation Method for Image Encryptiontayseer Karam alshekly
New Chaotic Substation and Permutation Method for Image Encryption is introduced based on combination between Block Cipher and chaotic map. The new algorithm encrypts and decrypts a block of 500 byte. Each block is firstly permuted by using the hyper-chaotic map and then the result is substituted using 1D Bernoulli map. Finally the resulted block is XORed with the key block. The proposed cipher image subjected to number of tests which are the security analysis (key space analysis and key sensitivity analysis) and statistical attack analysis (histogram, correlation, and differential attack and information entropy) and all results show that the proposed encryption scheme is secure because of its large key space; it’s highly sensitivity to the cipher keys and plain-images.
Colour Image Steganography Based on Pixel Value Differencing in Spatial Domainijistjournal
In a color image every pixel value composed of red, green and blue component and each of which ranges from 0 to 255 in case of 8-bit representation. In this paper, we have used pixel value differencing (PVD) method for secret data embedding in each of the component of a pixel in a color image. But when we use pixel-value differencing (PVD) method as image steganographic scheme, the pixel values in the stegoimage may exceed the range 0~255. We have eliminated this overflow problem of each component pixel. Furthermore for providing more security, we have used different number of bits in different pixel components. It would be very difficult to trace how many bits are embedded in a pixel of the stego image. From the experiments it is seen that the results obtained in proposed method provides better visual quality of stego-image compared to the PVD method.
This paper presents embedding of data in an image using pixel-value differencing technique. This scheme is used to embed large amount of data by changing the difference between two pixels so that we are able to increase the embedding capacity. There is another technique that is pixel value shifting which also increase the embedding capacity but according to this scheme capacity will increase at edge areas of image.
METHOD FOR A SIMPLE ENCRYPTION OF IMAGES BASED ON THE CHAOTIC MAP OF BERNOULLIijcsit
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.
Symmetric Image Encryption Algorithm Using 3D Rossler System........................................................1
Vishnu G. Kamat and Madhu Sharma
Node Monitoring with Fellowship Model against Black Hole Attacks in MANET.................................... 14
Rutuja Shah, M.Tech (I.T.-Networking), Lakshmi Rani, M.Tech (I.T.-Networking) and S. Sumathy, AP [SG]
Load Balancing using Peers in an E-Learning Environment ...................................................................... 22
Maria Dominic and Sagayaraj Francis
E-Transparency and Information Sharing in the Public Sector ................................................................ 30
Edison Lubua (PhD)
A Survey of Frequent Subgraphs and Subtree Mining Methods ............................................................. 39
Hamed Dinari and Hassan Naderi
A Model for Implementation of IT Service Management in Zimbabwean State Universities ................ 58
Munyaradzi Zhou, Caroline Ruvinga, Samuel Musungwini and Tinashe Gwendolyn Zhou
Present a Way to Find Frequent Tree Patterns using Inverted Index ..................................................... 66
Saeid Tajedi and Hasan Naderi
An Approach for Customer Satisfaction: Evaluation and Validation ....................................................... 79
Amina El Kebbaj and A. Namir
Spam Detection in Twitter – A Review...................................................................................................... 92
C. Divya Gowri and Professor V. Mohanraj
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.
Fixed-Point Code Synthesis for Neural Networksgerogepatton
Over the last few years, neural networks have started penetrating safety critical systems to take decisions in robots, rockets, autonomous driving car, etc. A problem is that these critical systems often have limited computing resources. Often, they use the fixed-point arithmetic for its many advantages (rapidity, compatibility with small memory devices.) In this article, a new technique is introduced to tune the formats (precision) of already trained neural networks using fixed-point arithmetic, which can be implemented using integer operations only. The new optimized neural network computes the output with fixed-point numbers without modifying the accuracy up to a threshold fixed by the user. A fixed-point code is synthesized for the new optimized neural network ensuring the respect of the threshold for any input vector belonging the range [xmin, xmax] determined during the analysis. From a technical point of view, we do a preliminary analysis of our floating neural network to determine the worst cases, then we generate a system of linear constraints among integer variables that we can solve by linear programming. The solution of this system is the new fixed-point format of each neuron. The experimental results obtained show the efficiency of our method which can ensure that the new fixed-point neural network has the same behavior as the initial floating-point neural network.
An Efficient Multiplierless Transform algorithm for Video CodingCSCJournals
This paper presents an efficient algorithm to accelerate software video encoders/decoders by reducing the number of arithmetic operations for Discrete Cosine Transform (DCT). A multiplierless Ramanujan Ordered Number DCT (RDCT) is presented which computes the coefficients using shifts and addition operations only. The reduction in computational complexity has improved the performance of the video codec by almost 58% compared with the commonly used integer DCT. The results show that significant computation reduction can be achieved with negligible average peak signal-to-noise ratio (PSNR) degradation. The average structural similarity index matrix (SSIM) also ensures that the degradation due to the approximation is minimal.
New Chaotic Substation and Permutation Method for Image Encryptiontayseer Karam alshekly
New Chaotic Substation and Permutation Method for Image Encryption is introduced based on combination between Block Cipher and chaotic map. The new algorithm encrypts and decrypts a block of 500 byte. Each block is firstly permuted by using the hyper-chaotic map and then the result is substituted using 1D Bernoulli map. Finally the resulted block is XORed with the key block. The proposed cipher image subjected to number of tests which are the security analysis (key space analysis and key sensitivity analysis) and statistical attack analysis (histogram, correlation, and differential attack and information entropy) and all results show that the proposed encryption scheme is secure because of its large key space; it’s highly sensitivity to the cipher keys and plain-images.
Image Retrieval Using VLAD with Multiple Featurescsandit
The objective of this paper is to propose a combinatorial encoding method based on VLAD to
facilitate the promotion of accuracy for large scale image retrieval. Unlike using a single
feature in VLAD, the proposed method applies multiple heterogeneous types of features, such as
SIFT, SURF, DAISY, and HOG, to form an integrated encoding vector for an image
representation. The experimental results show that combining complementary types of features
and increasing codebook size yield high precision for retrieval.
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.
A Novel Method for Image Watermarking Using Luminance Based Block Selection a...IJERA Editor
A robust watermark scheme for copyright protection is proposed in the present paper. The present method selects the pixel locations to insert the watermark by checking luminance [1] values of blocks. The watermark is embedded in the selected pixel blocks by using local area pixel value difference method. The proposed approach overcomes the weak robustness problem of embedding the watermark in the spatial domain and also in pixel value difference method. Further the watermark extraction does not require the original image as in the case of many digital watermarking methods. The experimental results indicate the high image quality and robustness against various attacks when compared to several approaches.
A (2, N) VISUAL CRYPTOGRAPHIC TECHNIQUE FOR BANKING APPLICATIONSIJNSA Journal
In this paper a novel (2, n) visual cryptographic scheme has been proposed which may be useful in banking operations in the “either or survivor” mode where n is the number of generated shares, from which n-1 is the number of account holders in an account and one share should be kept to the bank authority. In this technique one account holder should stack his/her share with the share of the bank authority and the secret image for user authentication will be revealed. In this technique two consecutive pixels are taken as the one time input for the share generation process. This technique generates shares with less space overhead compared to existing techniques and may provide better security. It is also easy to implement like other techniques of visual cryptography.
Qubit models and methods for improving the performance of software and hardware for
analyzing digital devices through increasing the dimension of the data structures and memory
are proposed. The basic concepts, terminology and definitions necessary for the implementation
of quantum computing when analyzing virtual computers are introduced. The investigation results concerning design and modeling computer systems in a cyberspace based on the use of two-component structure <memory> are presented.
Introducing the Concept of Back-Inking as an Efficient Model for Document Ret...IJITCA Journal
Today, many institutions and organizations are facing serious problem due to the tremendously increasing
size of documents, and this problem is further triggering the storage and retrieval problems due to the
continuously growing space and efficiency requirements. This problem is becoming more complex with
time and the increase in the size and number of documents in an organization. Therefore, there is a
growing demand to address this problem. This demand and challenge can be met by developing a
technique to enable specialized document imaging people to use when there is a need for storing
documents images. Thus, we need special and efficient storage techniques for this type of information
storage (IS) systems.
In this paper, we present an efficient storage technique for electronic documents. The proposed technique
uses the Information Pixels concept to make the technique more efficient for certain image formats. In
addition, we shall see how Storing Information Pixels Addresses ( SIPA ) method is an efficient method for
document storage and as a result makes the document image storage relatively efficient for most image
formats.
Steganography Using Adaptive Pixel Value Differencing(APVD) of Gray Images Th...cscpconf
In a gray scale image the pixel value ranges from 0 to 255. But when we use pixel-value
differencing (pvd) method as image steganographic scheme, the pixel values in the stego-image
may exceed gray scale range. An adaptive steganography based on modified pixel-value
differencing through management of pixel values within the range of gray scale has been
proposed in this paper. PVD method is used and check whether the pixel value exceeds the
range on embedding. Positions where the pixel exceeds boundary has been marked and a delicate handle is used to keep the value within the range. From the experimental it is seen that the results obtained in proposed method provides with identical payload and visual fidelity of stego-image compared to the pvd method
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
Substitution-diffusion based Image CipherIJNSA Journal
In this paper, a new image encryption scheme using a secret key of 128-bit size is proposed. In the algorithm, image is partitioned into several key based dynamic blocks and further, each block passes through the eight rounds of diffusion as well as substitution process. In diffusion process, sequences of block pixels are rearranged within the block by a zigzag approach whereas block pixels are replaced with another by using difference calculation of row and column in substitution process. Due to high order of substitution and diffusion, common attacks like linear and differential cryptanalysis are infeasible. The experimental results show that the proposed technique is efficient and has high security features.
High Efficiency Video Coding (HEVC) has achieved significant coding efficiency improvement beyond
existing video coding standard by employing several new coding tools. Deblocking Filter, Sample Adaptive
Offset (SAO) and Adaptive Loop Filter (ALF) for in-loop filtering are currently introduced for the HEVC
standard. However, these filters are implemented in spatial domain despite the fact of temporal correlation
within video sequences. To reduce the artifacts and better align object boundaries in video, a proposed
algorithm in in-loop filtering is proposed. The proposed algorithm is implemented in HM-11.0 software.
This proposed algorithm allows an average bitrate reduction of about 0.7% and improves the PSNR of the
decoded frame by 0.05%, 0.30% and 0.35% in luminance and chroma.
An optimized framework for detection and tracking of video objects in challen...ijma
Segmentation and tracking are two important aspects in visual surveillance systems. Many barriers such as
cluttered background, camera movements, and occlusion make the robust detection and tracking a difficult
problem, especially in case of multiple moving objects. Object detection in the presence of camera noise
and with variable or unfavourable luminance conditions is still an active area of research. This paper
propose a framework which can effectively detect the moving objects and track them despite of occlusion
and a priori knowledge of objects in the scene. The segmentation step uses a robust threshold decision
algorithm which uses a multi-background model. The video object tracking is able to track multiple objects
along with their trajectories based on Continuous Energy Minimization. In this work, an effective
formulation of multi-target tracking as minimization of a continuous energy is combined with multibackground
registration. Apart from the recent approaches, it focus on making use of an energy that
corresponds to a more complete representation of the problem, rather than one that is amenable to global
optimization. Besides the image evidence, the energy function considers physical constraints, such as target
dynamics, mutual exclusion, and track persistence. The proposed tracking framework is able to track
multiple objects despite of occlusions under dynamic background conditions.
The kusc classical music dataset for audio key findingijma
In this paper, we present a benchmark dataset based on the KUSC classical music collection and provide
baseline key-finding comparison results. Audio key finding is a basic music information retrieval task; it
forms an essential component of systems for music segmentation, similarity assessment, and mood
detection. Due to copyright restrictions and a labor-intensive annotation process, audio key finding
algorithms have only been evaluated using small proprietary datasets to date. To create a common base for
systematic comparisons, we have constructed a dataset comprising of more than 3,000 excerpts of classical
music. The excerpts are made publicly accessible via commonly used acoustic features such as pitch-based
spectrograms and chromagrams. We introduce a hybrid annotation scheme that combines the use of title
keys with expert validation and correction of only the challenging cases. The expert musicians also provide
ratings of key recognition difficulty. Other meta-data include instrumentation. As demonstration of use of
the dataset, and to provide initial benchmark comparisons for evaluating new algorithms, we conduct a
series of experiments reporting key determination accuracy of four state-of-the-art algorithms. We further
show the importance of considering factors such as estimated tuning frequency, key strength or confidence
value, and key recognition difficulty in key finding. In the future, we plan to expand the dataset to include
meta-data for other music information retrieval tasks.
Reversible Data Hiding in Encrypted Image: A ReviewEditor IJMTER
Recently, more and more attention is paid to reversible data hiding (RDH) in encrypted
images, since it maintains the excellent property that the original cover can be losslessly recovered
after embedded data is extracted while protecting the image content’s confidentiality. All previous
methods embed data by reversibly vacating room from the encrypted images, which may be subject
to some errors on data extraction and/or image restoration. In this survey paper, we discuss about
various methods and algorithms which were used for reversible data hiding (RDH) in encrypted
image to make data hiding process effortless. We also use visual cryptographic approach for
encryption which helps to protect the image during transmission. The scheme is suitable for
authentication based application where collective acceptance and decision making plays an important
role. The main goal is to retrieve the original image with lossless process and minimum computation
during image encryption /decryption by using keyless approach.
Image Retrieval Using VLAD with Multiple Featurescsandit
The objective of this paper is to propose a combinatorial encoding method based on VLAD to
facilitate the promotion of accuracy for large scale image retrieval. Unlike using a single
feature in VLAD, the proposed method applies multiple heterogeneous types of features, such as
SIFT, SURF, DAISY, and HOG, to form an integrated encoding vector for an image
representation. The experimental results show that combining complementary types of features
and increasing codebook size yield high precision for retrieval.
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.
A Novel Method for Image Watermarking Using Luminance Based Block Selection a...IJERA Editor
A robust watermark scheme for copyright protection is proposed in the present paper. The present method selects the pixel locations to insert the watermark by checking luminance [1] values of blocks. The watermark is embedded in the selected pixel blocks by using local area pixel value difference method. The proposed approach overcomes the weak robustness problem of embedding the watermark in the spatial domain and also in pixel value difference method. Further the watermark extraction does not require the original image as in the case of many digital watermarking methods. The experimental results indicate the high image quality and robustness against various attacks when compared to several approaches.
A (2, N) VISUAL CRYPTOGRAPHIC TECHNIQUE FOR BANKING APPLICATIONSIJNSA Journal
In this paper a novel (2, n) visual cryptographic scheme has been proposed which may be useful in banking operations in the “either or survivor” mode where n is the number of generated shares, from which n-1 is the number of account holders in an account and one share should be kept to the bank authority. In this technique one account holder should stack his/her share with the share of the bank authority and the secret image for user authentication will be revealed. In this technique two consecutive pixels are taken as the one time input for the share generation process. This technique generates shares with less space overhead compared to existing techniques and may provide better security. It is also easy to implement like other techniques of visual cryptography.
Qubit models and methods for improving the performance of software and hardware for
analyzing digital devices through increasing the dimension of the data structures and memory
are proposed. The basic concepts, terminology and definitions necessary for the implementation
of quantum computing when analyzing virtual computers are introduced. The investigation results concerning design and modeling computer systems in a cyberspace based on the use of two-component structure <memory> are presented.
Introducing the Concept of Back-Inking as an Efficient Model for Document Ret...IJITCA Journal
Today, many institutions and organizations are facing serious problem due to the tremendously increasing
size of documents, and this problem is further triggering the storage and retrieval problems due to the
continuously growing space and efficiency requirements. This problem is becoming more complex with
time and the increase in the size and number of documents in an organization. Therefore, there is a
growing demand to address this problem. This demand and challenge can be met by developing a
technique to enable specialized document imaging people to use when there is a need for storing
documents images. Thus, we need special and efficient storage techniques for this type of information
storage (IS) systems.
In this paper, we present an efficient storage technique for electronic documents. The proposed technique
uses the Information Pixels concept to make the technique more efficient for certain image formats. In
addition, we shall see how Storing Information Pixels Addresses ( SIPA ) method is an efficient method for
document storage and as a result makes the document image storage relatively efficient for most image
formats.
Steganography Using Adaptive Pixel Value Differencing(APVD) of Gray Images Th...cscpconf
In a gray scale image the pixel value ranges from 0 to 255. But when we use pixel-value
differencing (pvd) method as image steganographic scheme, the pixel values in the stego-image
may exceed gray scale range. An adaptive steganography based on modified pixel-value
differencing through management of pixel values within the range of gray scale has been
proposed in this paper. PVD method is used and check whether the pixel value exceeds the
range on embedding. Positions where the pixel exceeds boundary has been marked and a delicate handle is used to keep the value within the range. From the experimental it is seen that the results obtained in proposed method provides with identical payload and visual fidelity of stego-image compared to the pvd method
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
Substitution-diffusion based Image CipherIJNSA Journal
In this paper, a new image encryption scheme using a secret key of 128-bit size is proposed. In the algorithm, image is partitioned into several key based dynamic blocks and further, each block passes through the eight rounds of diffusion as well as substitution process. In diffusion process, sequences of block pixels are rearranged within the block by a zigzag approach whereas block pixels are replaced with another by using difference calculation of row and column in substitution process. Due to high order of substitution and diffusion, common attacks like linear and differential cryptanalysis are infeasible. The experimental results show that the proposed technique is efficient and has high security features.
High Efficiency Video Coding (HEVC) has achieved significant coding efficiency improvement beyond
existing video coding standard by employing several new coding tools. Deblocking Filter, Sample Adaptive
Offset (SAO) and Adaptive Loop Filter (ALF) for in-loop filtering are currently introduced for the HEVC
standard. However, these filters are implemented in spatial domain despite the fact of temporal correlation
within video sequences. To reduce the artifacts and better align object boundaries in video, a proposed
algorithm in in-loop filtering is proposed. The proposed algorithm is implemented in HM-11.0 software.
This proposed algorithm allows an average bitrate reduction of about 0.7% and improves the PSNR of the
decoded frame by 0.05%, 0.30% and 0.35% in luminance and chroma.
An optimized framework for detection and tracking of video objects in challen...ijma
Segmentation and tracking are two important aspects in visual surveillance systems. Many barriers such as
cluttered background, camera movements, and occlusion make the robust detection and tracking a difficult
problem, especially in case of multiple moving objects. Object detection in the presence of camera noise
and with variable or unfavourable luminance conditions is still an active area of research. This paper
propose a framework which can effectively detect the moving objects and track them despite of occlusion
and a priori knowledge of objects in the scene. The segmentation step uses a robust threshold decision
algorithm which uses a multi-background model. The video object tracking is able to track multiple objects
along with their trajectories based on Continuous Energy Minimization. In this work, an effective
formulation of multi-target tracking as minimization of a continuous energy is combined with multibackground
registration. Apart from the recent approaches, it focus on making use of an energy that
corresponds to a more complete representation of the problem, rather than one that is amenable to global
optimization. Besides the image evidence, the energy function considers physical constraints, such as target
dynamics, mutual exclusion, and track persistence. The proposed tracking framework is able to track
multiple objects despite of occlusions under dynamic background conditions.
The kusc classical music dataset for audio key findingijma
In this paper, we present a benchmark dataset based on the KUSC classical music collection and provide
baseline key-finding comparison results. Audio key finding is a basic music information retrieval task; it
forms an essential component of systems for music segmentation, similarity assessment, and mood
detection. Due to copyright restrictions and a labor-intensive annotation process, audio key finding
algorithms have only been evaluated using small proprietary datasets to date. To create a common base for
systematic comparisons, we have constructed a dataset comprising of more than 3,000 excerpts of classical
music. The excerpts are made publicly accessible via commonly used acoustic features such as pitch-based
spectrograms and chromagrams. We introduce a hybrid annotation scheme that combines the use of title
keys with expert validation and correction of only the challenging cases. The expert musicians also provide
ratings of key recognition difficulty. Other meta-data include instrumentation. As demonstration of use of
the dataset, and to provide initial benchmark comparisons for evaluating new algorithms, we conduct a
series of experiments reporting key determination accuracy of four state-of-the-art algorithms. We further
show the importance of considering factors such as estimated tuning frequency, key strength or confidence
value, and key recognition difficulty in key finding. In the future, we plan to expand the dataset to include
meta-data for other music information retrieval tasks.
Reversible Data Hiding in Encrypted Image: A ReviewEditor IJMTER
Recently, more and more attention is paid to reversible data hiding (RDH) in encrypted
images, since it maintains the excellent property that the original cover can be losslessly recovered
after embedded data is extracted while protecting the image content’s confidentiality. All previous
methods embed data by reversibly vacating room from the encrypted images, which may be subject
to some errors on data extraction and/or image restoration. In this survey paper, we discuss about
various methods and algorithms which were used for reversible data hiding (RDH) in encrypted
image to make data hiding process effortless. We also use visual cryptographic approach for
encryption which helps to protect the image during transmission. The scheme is suitable for
authentication based application where collective acceptance and decision making plays an important
role. The main goal is to retrieve the original image with lossless process and minimum computation
during image encryption /decryption by using keyless approach.
Column store decision tree classification of unseen attribute setijma
A decision tree can be used for clustering of frequently used attributes to improve tuple reconstruction time
in column-stores databases. Due to ad-hoc nature of queries, strongly correlative attributes are grouped
together using a decision tree to share a common minimum support probability distribution. At the same
time in order to predict the cluster for unseen attribute set, the decision tree may work as a classifier. In
this paper we propose classification and clustering of unseen attribute set using decision tree to improve
tuple reconstruction time.
Mining in Ontology with Multi Agent System in Semantic Web : A Novel Approachijma
A large amount of data is present on the web. It contains huge number of web pages and to find suitable
information from them is very cumbersome task. There is need to organize data in formal manner so that
user can easily access and use them. To retrieve information from documents, there are many Information
Retrieval (IR) techniques. Current IR techniques are not so advanced that they can be able to exploit
semantic knowledge within documents and give precise results. IR technology is major factor responsible
for handling annotations in Semantic Web (SW) languages. With the rate of growth of web and huge
amount of information available on the web which may be in unstructured, semi structured or structured
form, it has become increasingly difficult to identify the relevant pieces of information on the internet. IR
technology is major factor responsible for handling annotations in Semantic Web (SW) languages.
Knowledgeable representation languages are used for retrieving information. So, there is need to build an
ontology that uses well defined methodology and process of developing ontology is called Ontology
Development. Secondly, Cloud computing and data mining have become famous phenomena in the current
application of information technology. With the changing trends and emerging of the new concept in the
information technology sector, data mining and knowledge discovery have proved to be of significant
importance. Data mining can be defined as the process of extracting data or information from a database
which is not explicitly defined by the database and can be used to come up with generalized conclusions
based on the trends obtained from the data. A database may be described as a collection of formerly
structured data. Multi agents data mining may be defined as the use of various agents cooperatively
interact with the environment to achieve a specified objective. Multi agents will always act on behalf of
users and will coordinate, cooperate, negotiate and exchange data with each other. An agent would
basically refer to a software agent, a robot or a human being Knowledge discovery can be defined as the
process of critically searching large collections of data with the aim of coming up with patterns that can be
used to make generalized conclusions. These patterns are sometimes referred to as knowledge about the
data. Cloud computing can be defined as the delivery of computing services in which shared resources,
information and software’s are provided over a network, for example, the information super highway.
Cloud computing is normally provided over a web based service which hosts all the resources required. As,
the knowledge mining is used in many fields of study such as in science and medicine, finance, education,
manufacturing and commerce. In this paper, the Semantic Web addresses the first part of this challenge by
trying to make the data also machine understandable in the form of Ontology, while Multi-Agen
System analysis and design for multimedia retrieval systemsijma
Due to the extensive use of information technology and the recent developments in multimedia systems, the
amount of multimedia data available to users has increased exponentially. Video is an example of
multimedia data as it contains several kinds of data such as text, image, meta-data, visual and audio.
Content based video retrieval is an approach for facilitating the searching and browsing of large
multimedia collections over WWW. In order to create an effective video retrieval system, visual perception
must be taken into account. We conjectured that a technique which employs multiple features for indexing
and retrieval would be more effective in the discrimination and search tasks of videos. In order to validate
this, content based indexing and retrieval systems were implemented using color histogram, Texture feature
(GLCM), edge density and motion..
On deferred constraints in distributed database systemsijma
An atomic commit protocol (ACP) is a distributed algorithm used to ensure the atomicity property of
transactions in distributed database systems. Although ACPs are designed to guarantee atomicity, they add
a significant extra cost to each transaction execution time. This added cost is due to the overhead of the
required coordination messages and log writes at each involved database site to achieve atomicity. For this
reason, the continuing research efforts led to a number of optimizations that reduce the aforementioned
cost. The most commonly adopted optimizations in the database standards and commercial database
management systems are those designed around the early release of read locks of transactions. In this type
of optimizations, certain participating sites may start releasing the read locks held by transactions before
they are fully terminated across all participants. Hence, greatly enhancing concurrency among executing
transactions and, consequently, the overall system performance. However, this type of optimizations
introduces possible “execution infections” in the presence of deferred consistency constraints; a
devastating complication that may lead to non-serializable executions of transactions. Thus, this type of
optimizations could be considered useless, given the importance of preserving the consistency of the
database in presence of deferred constraints, unless this complication is resolved in a practical and
efficient manner. This is the essence of the “unsolicited deferred consistency constraints validation”
mechanism presented in this paper.
Integrated system for monitoring and recognizing students during class sessionijma
In this paper we propose a new student attendance system based on biometric authentication protocol. This
system is basically using the face detection and the recognition protocols to facilitate checking students’
attendance in the classroom. In the proposed system, the classroom’s camera is capturing the students’
photo, directly the face detection and recognition processes will be implemented to produce the instructor
attendance report. Actually, this system is more efficient than others student attendance methods since the
detection and the recognition are considered to be the best and fastest method for biometric attendance
system. Regarding to the students and instructor sides, the system is working without any preparation and
with no more effort.
A new keyphrases extraction method based on suffix tree data structure for ar...ijma
Document Clustering is a branch of a larger area of scientific study known as data mining .which is an
unsupervised classification using to find a structure in a collection of unlabeled data. The useful
information in the documents can be accompanied by a large amount of noise words when using Full Text
Representation, and therefore will affect negatively the result of the clustering process. So it is with great
need to eliminate the noise words and keeping just the useful information in order to enhance the quality of
the clustering results. This problem occurs with different degree for any language such as English,
European, Hindi, Chinese, and Arabic Language. To overcome this problem, in this paper, we propose a
new and efficient Keyphrases extraction method based on the Suffix Tree data structure (KpST), the
extracted Keyphrases are then used in the clustering process instead of Full Text Representation. The
proposed method for Keyphrases extraction is language independent and therefore it may be applied to any
language. In this investigation, we are interested to deal with the Arabic language which is one of the most
complex languages. To evaluate our method, we conduct an experimental study on Arabic Documents
using the most popular Clustering approach of Hierarchical algorithms: Agglomerative Hierarchical
algorithm with seven linkage techniques and a variety of distance functions and similarity measures to
perform Arabic Document Clustering task. The obtained results show that our method for extracting
Keyphrases increases the quality of the clustering results. We propose also to study the effect of using the
stemming for the testing dataset to cluster it with the same documents clustering techniques and
similarity/distance measures.
The application of computer aided learning to learn basic concepts of branchi...ijma
This paper reviews how to create an application based on Computer Aided Learning (CAL), which is the
use of computers to deliver instructional materials and involve students / learners are active. This CAL
application consists of 5 multimedia modules. Module 1 contains the basic concepts of data processing.
Module 2 discusses the concept of flowcharts. Module 3 contains the testing applications using a flowchart.
Module 4 contains the concept of nested selection. While the tutorial module 5 contains the concept of
arrays and study case practice . To support this, CAL application is made as attractive as possible, by
combining multimedia files, such as image files, sound files, and video files. With the CAL is equipped with
modules of algorithms, students are expected to take computer courses, especially in STMIK STIKOM
Surabaya can improve learning outcomes at the course logic algorithms.
A survey on components of virtual 'umrah applicationijma
This paper attempts to present insight of component
s in Virtual ‘Umrah application. This interactive
application consists of five components namely cont
ent, virtual reality (VR) technology, multimedia
elements, user profile and usability evaluation. Vi
rtual reality technique in this application enables
to
provide a realistic experience for the users in per
forming ‘Umrah. The methodology that has been adopt
ed
to develop this application is User-Centered design
model (UCD) that focuses on involvement of users i
n
every phase. These components are hopefully can be
implemented as guidelines to the others to develop
a
virtual environment.
Real time realistic illumination and rendering of cumulus cloudsijma
Realistic simulation of natural phenomena such as c
louds is one of the most challenging problems facin
g
computer graphics. The complexity of cloud formatio
n, dynamics and light interaction makes real time
cloud rendering a difficult task. In addition, trad
itional computer graphics methods involve high amou
nts
of memory and computing resources, which currently
limits their realism and speed.
We propose an efficient and computationally inexpen
sive phenomenological approach for modelling and
rendering cumulus clouds, by drawing on several app
roaches that we combine and extend.
This paper focuses
on the modelling of the cloud’s shape, rendering an
d sky model but is does not deal with
the animation of the cloud.
A robust audio watermarking in cepstrum domain composed of sample's relation ...ijma
Watermark bits embedded in audio signals considering the sample’s relative state in a frame may
strengthen the attack-invariant features of audio watermarking algorithm. In this work, we propose to
embed watermarks in an audio signal considering the relation between the mean values of consecutive
groups of samples which shows robustness by overcoming common watermarking challenges. Here, we
divide the host audio signal into equal-sized non-overlapping frames which in turn is split into four equalsized
non-overlapping sub-frames. After, transforming these sub-frames in cepstrum domain we finally use
the relation between the differences of first two sub-frames and last two sub-frames to embed watermarks.
Depending on the watermark bit (either 0 or 1) to be embed, our embedding technique either interchange
or update the differences between these groups of samples by distorting the sample values in sub-frames
selectively. Thus, watermarks are embedded by making a little or no distortion of the sub-frames which
helps our scheme to be imperceptible in nature. Moreover, use of such embedding technique lead our
watermarking scheme to a computationally less complex extraction method. Simulation results also justify
our claim of the proposed scheme to be both robust and imperceptible.
Image Denoising is an important part of diverse image processing and computer vision problems. The
important property of a good image denoising model is that it should completely remove noise as far as
possible as well as preserve edges. One of the most powerful and perspective approaches in this area is
image denoising using discrete wavelet transform (DWT). In this paper, comparison of various Wavelets at
different decomposition levels has been done. As number of levels increased, Peak Signal to Noise Ratio
(PSNR) of image gets decreased whereas Mean Absolute Error (MAE) and Mean Square Error (MSE) get
increased . A comparison of filters and various wavelet based methods has also been carried out to denoise
the image. The simulation results reveal that wavelet based Bayes shrinkage method outperforms other
methods.
AN ENHANCED SEPARABLE REVERSIBLE DATA HIDING IN ENCRYPTED IMAGES USING SIDE M...Editor IJMTER
This paper proposes a scheme for Enhanced Separable Reversible Data Hiding in
Encrypted images Using Side Match. In the first step the original image is encrypted using an
encryption key. Then additional data is embedded into the image by modifying a small portion of the
encrypted image using a data hiding key. With an encrypted image containing additional data, if a
receiver has the data hiding key, he can extract the additional data. If the receiver has the encryption
key, he can decrypt the image, but cannot extract the additional data. If the receiver has both the data
hiding key and encryption key, he can extract the additional data and recover the original content by
exploiting the spatial correlation in natural images. The accuracy of data extraction is improved by
using a better scheme for measuring the smoothness of the received image, and uses the Side Match
scheme to further decrease the error rate of extracted bits.
In this document, we propose a simple algorithm for the encryption of gray-scale images, although thescheme 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.
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.
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.
Encryption Quality Analysis and Security Evaluation of CAST-128 Algorithm and...IJNSA Journal
This paper demonstrates analysis of well known block cipher CAST-128 and its modified version using avalanche criterion and other tests namely encryption quality, correlation coefficient, histogram analysis and key sensitivity
tests.
Performance analysis of transformation and bogdonov chaotic substitution base...IJECEIAES
In this article, a combined Pseudo Hadamard transformation and modified Bogdonav chaotic generator based image encryption technique is proposed. Pixel position transformation is performed using Pseudo Hadamard transformation and pixel value variation is made using Bogdonav chaotic substitution. Bogdonav chaotic generator produces random sequences and it is observed that very less correlation between the adjacent elements in the sequence. The cipher image obtained from the transformation stage is subjected for substitution using Bogdonav chaotic sequence to break correlation between adjacent pixels. The cipher image is subjected for various security tests under noisy conditions and very high degree of similarity is observed after deciphering process between original and decrypted images.
Image steganography techniques can be classified into two major categories such as spatial domain techniques and frequency domain techniques.
In spatial domain techniques the secret message is hidden inside the image by applying some manipulation over the different pixels of the image.
In frequency domain techniques the image is transformed to another form by applying a transformation like discrete wavelet transform and then the message is hidden by applying any of the usual embedding techniques.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Quality Measurements of Lossy Image Steganography Based on H-AMBTC Technique ...AM Publications,India
Steganography is a type of image information concealing technique which hides a secret message in a different media such as image, video and audio etc, called cover file. The main idea of steganography is to provide security to private or public data. In this paper we combined among Hadamard transformation and Absolute Moment Block Truncation Coding to make a new concept called (H-AMBTC), this concept used for compressing the cover file and conceal the secret data into the cover file. The H-AMBTC compression is not only image compression, but it is more than the AMBTC technique as only half of the number of pixels in the binary converted image are transmitted. In this paper, the comparison process of the H-AMBTC technique is done for 2x2, 4x4, 8x8 and 16x16 block sizes. H-AMBTC is a lossy technique as the cover image and the secret image can be recovered completely.
This article proposes bit flipping method to conceal secret data in the original image. Here a section consists of 2 pixels and there by flipping one or two LSBs of the pixels to hide secret information in it. It exists in 2 variants. The variant-1 and variant-2 both use 7th and 8th bit to conceal the secret data. Variant-1 hides 3 bits per a pair of pixels and the variant-2 hides 4 bits per a pair of pixels. Our proposed method notably raises the capacity as well as bits per pixel that can be hidden in the image compared to existing bit flipping method. The image steganographic parameters such as, peak signal to noise ratio (PSNR), hiding capacity, and the quality index of the proposed techniques has been compared with the existing bit flipping technique.
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.
Colour Image Steganography Based on Pixel Value Differencing in Spatial Domainijistjournal
In a color image every pixel value composed of red, green and blue component and each of which ranges from 0 to 255 in case of 8-bit representation. In this paper, we have used pixel value differencing (PVD) method for secret data embedding in each of the component of a pixel in a color image. But when we use pixel-value differencing (PVD) method as image steganographic scheme, the pixel values in the stegoimage may exceed the range 0~255. We have eliminated this overflow problem of each component pixel. Furthermore for providing more security, we have used different number of bits in different pixel components. It would be very difficult to trace how many bits are embedded in a pixel of the stego image. From the experiments it is seen that the results obtained in proposed method provides better visual quality of stego-image compared to the PVD method.
Similar to ALGORITHM FOR IMAGE MIXING AND ENCRYPTION (20)
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™UiPathCommunity
In questo evento online gratuito, organizzato dalla Community Italiana di UiPath, potrai esplorare le nuove funzionalità di Autopilot, il tool che integra l'Intelligenza Artificiale nei processi di sviluppo e utilizzo delle Automazioni.
📕 Vedremo insieme alcuni esempi dell'utilizzo di Autopilot in diversi tool della Suite UiPath:
Autopilot per Studio Web
Autopilot per Studio
Autopilot per Apps
Clipboard AI
GenAI applicata alla Document Understanding
👨🏫👨💻 Speakers:
Stefano Negro, UiPath MVPx3, RPA Tech Lead @ BSP Consultant
Flavio Martinelli, UiPath MVP 2023, Technical Account Manager @UiPath
Andrei Tasca, RPA Solutions Team Lead @NTT Data
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdfPeter Spielvogel
Building better applications for business users with SAP Fiori.
• What is SAP Fiori and why it matters to you
• How a better user experience drives measurable business benefits
• How to get started with SAP Fiori today
• How SAP Fiori elements accelerates application development
• How SAP Build Code includes SAP Fiori tools and other generative artificial intelligence capabilities
• How SAP Fiori paves the way for using AI in SAP apps
Assure Contact Center Experiences for Your Customers With ThousandEyes
ALGORITHM FOR IMAGE MIXING AND ENCRYPTION
1. The International Journal of Multimedia & Its Applications (IJMA) Vol.5, No.2, April 2013
DOI : 10.5121/ijma.2013.5202 15
ALGORITHM FOR IMAGE MIXING AND ENCRYPTION
Ayman M. Abdalla1
and Abdelfatah A. Tamimi2
1
Dept. of Multimedia Systems, Al-Zaytoonah University, Amman, Jordan
ayman@zuj.edu.jo
2
Dept. of Computer Science, Al-Zaytoonah University, Amman, Jordan
drtamimi@zuj.edu.jo
ABSTRACT
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.
KEYWORDS
Cryptography, Stream Cipher, Block Cipher, S-box
1. INTRODUCTION
Algorithms applying different encryption techniques with shuffling were presented in previous
work [1, 2, 3, 4, 5, 6, 7]. Examples on applying the four steps of the Advanced Encryption
Standard (AES) including the use of S-box substitution are available [8]. Many encryption
algorithms based on AES were also developed [9, 10, 11, 12, 13]. However, AES has limitations
on some multimedia specific requirements [7, 14], so other encryption algorithms need to be
developed.
A new algorithm is presented, which concatenates two or more images of different types and
sizes and performs lossless mixing and encryption in three steps. These steps include a shuffling
step and a substitution step, combining stream cipher with block cipher. The algorithm was
implemented and tested. Analysis showed effectiveness of the cipher and its resistance to attacks.
Figure 1. Diagram showing the main steps of the algorithm
2. THE NEW ALGORITHM
This algorithm takes two or more images and a private key as input, and it works as follows. It
starts with concatenating the input images. Then, it performs byte shuffling of the combined
result. Finally, it applies byte substitution using a lookup table called S-box. The main encryption
2. The International Journal of Multimedia & Its Applications (IJMA) Vol.5, No.2, April 2013
16
and decryption steps of the algorithm are illustrated in Figure 1, where the decryption performs
the inverse of the encryption steps in reverse order. The details of the encryption steps are
outlined in Figure 2.
The first step of the encryption algorithm transforms the input images into one-dimensional (1D)
arrays and concatenates them. This allows combining images of different sizes and types,
including the combination of color images with grayscale images.
In the second step of the algorithm, the concatenated images are regarded as one stream of bytes,
and the encryption performed is both key dependent and data dependent. A single bit, call it
fixBit, is chosen by a function based on the key. In this paper, this function adds some digits of
the key and takes the remainder of dividing this sum by 8. A shuffle vector is constructed by
listing the numbers of bytes which have the value of bit number fixBit equal to zero, followed by
the numbers of bytes which have the value of bit number fixBit equal to one. This vector gives a
mapping that specifies the new location of each byte in the array. This step is repeated for several
iterations. Each iteration uses a different fixBit and applies the same steps to the new array that
resulted from the preceding iteration. The number of iterations, k, is a small number chosen by a
key-dependent function.
The third and final step uses a substitution table, known as S-box, constructed to perform two
transformations: multiplicative inverse and affine transformation. This nonlinear key-dependent
substitution was presented as a step in each iteration of the AES algorithm [8]. In the new
algorithm presented here, however, this substitution is performed only once.
Consider this simple example that shows how the encryption is applied. First, let the input be the
two vectors (245, 45) and (163, 140). The binary representation of the combined input is: ImageV
= (11110101 00101101 10100011 10001100). The shuffle step is applied as follows. Let the
number of iterations be k. In the first iteration, let fixBit = 3 and this bit is underlined in the binary
representation above. Based on the values of this fixBit, S0 = (1, 3) and S1 = (2, 4), which make
the shuffle vector (1, 3, 2, 4). Then, the input after the shuffle substitution will be ImageV =
(11110101 10100011 00101101 10001100). This process is repeated for all k iterations. After
that, the S-box is generated to perform two transformations: multiplicative inverse and affine
transformation. S-box substitution is finally applied where each of the byte values of the last
ImageV vector is replaced with its lookup value indicated by the S-box table.
ImageV = Concatenation of input images into a single one-dimensional vector
key2 = vector initialized with each value key2[j] is the jth
byte of the original key
For i = 1 to k
keySum = the sum of the first (i) elements of key2
fixBit = keySum MOD 8
D = vector where D[j] is the value of bit (fixBit) of the jth
byte of ImageV
S0 = vector containing numbers of ImageV bytes (j) that have (D[j] == 0)
S1 = vector containing numbers of ImageV bytes (j) that have (D[j] == 1)
Shuffle = concatenation of S0 with S1
Substitute the bytes of ImageV so that the new location of byte (j) is byte (Shuffle[j])
End For
Generate S-box table
Substitute the bytes of ImageV based on the S-box table
Figure 1. The Encryption Algorithm
3. The International Journal of Multimedia & Its Applications (IJMA) Vol.5, No.2, April 2013
17
As seen in Figure 3, the decryption algorithm is similar to the encryption algorithm, where each
of the above steps can be easily inverted. This decryption restores the original images without any
loss.
The algorithm is intended to be used for encrypting two or more images, but it can be also used
for encrypting files other than images. Therefore, information about the encrypted images, such
as their dimensions, may be stored in a file and encrypted with the images. The size of this
information file may be fixed as a constant, or it may be of variable size where its size is
appended to the original private key.
3. IMPLEMENTATION AND ANALYSIS
The security of the new algorithm comes from mixing any number of images of different types
and sizes, on the byte level, using the shuffle operation and the S-box byte substitution. If one or
more bits in the key are changed, a different shuffle bit is chosen in the Stream Shuffle step and
the substitution is changed. For the Stream Shuffle step, there are k×2b
different possible shuffle
vectors for an input of size b bytes encrypted in k iterations. In addition, let an S-box of size
16×16 bytes be used in the S-box substitution step. This S-box has 2,048 different entries where
each of these entries consists of 8 bits. This makes the total number of permutations for this step
equal to 211
. Consequently, for an input with a size of ten or more kilobytes, a brute-force attack
is impossible.
The algorithm was applied to all 780 possible combination pairs of 40 different images of various
types, with sizes ranging from 10 to 2000 kilobytes (kB). When different keys were used with the
same image pair, they produced different encrypted images. In addition, analysis using
histograms, correlation and peak signal to noise ratio (PSNR) showed properties of the algorithm
that strongly resist statistical attacks. These statistics were computed by considering the original
concatenated pair of images as one original image, and the encrypted mixed image as the result.
After decryption, all original images were recovered without any loss.
Generate Inverse S-box table
Substitute the bytes of ImageV based on the Inverse S-box table
key2 = vector initialized with each value key2[j] is the jth
byte of the original key
For i = k to 1 step -1
keySum = the sum of the first (i) elements of key2
fixBit = keySum MOD 8
D = vector where D[j] is the value of bit (fixBit) of the jth
byte of ImageV
S0 = vector containing numbers of ImageV bytes (j) that have (D[j] == 0)
S1 = vector containing numbers of ImageV bytes (j) that have (D[j] == 1)
Shuffle = concatenation of S0 with S1
Substitute the bytes of ImageV so that the new location of byte (Shuffle[j]) is byte (j)
End For
Separate ImageV into the original images and change them back into proper dimensions
Figure 2. The Decryption Algorithm
4. The International Journal of Multimedia & Its Applications (IJMA) Vol.5, No.2, April 2013
18
The dimensions of each image 2D-matrix are given by its length and width (in pixels), where
color images use a third dimension to let each primary color have its own 2D-matrix. The
combined image pair is a 1D-matrix which includes all pixel data of both images. After Stream
Shuffle is applied to this original combined image, the resulting stream is treated as a 2D-matrix
during S-box substitution. The final encrypted result is one 2D-matrix.
The algorithm was tested with the sample image pair shown in Figure 4 (a) and (c) to demonstrate
its results visually. The histograms of these two images are shown in Figure 4 (b) and (d), where
the histogram of their combined image (before encryption) is shown in Figure 5. These two input
images have different dimensions and sizes. The Zaid image is 652×752 pixels with a size of
1,437 kB. The Ghaith image is 648×518 pixels with a size of 984 kB. These two images were
combined, mixed and encrypted together. The image resulting from the encryption is shown with
its histogram in Figure 6. As seen in the figure, the encrypted image appears as simple noise and
has no recognizable parts. In addition, the histogram of the encrypted image appears relatively
uniform and has no resemblance to the histograms of the original images shown in Figure 4 (b)
and (d) nor to their combined histogram shown in Figure 5.
(a) Original Zaid image (b) Histogram of original Zaid image
(d) Histogram of original Ghaith image(c) Original Ghaith image
Figure 3. Original sample images and their histograms
5. The International Journal of Multimedia & Its Applications (IJMA) Vol.5, No.2, April 2013
19
The histograms of the 780 combinations of images encrypted with the new algorithm were
uniform and visibly different from the histograms of the original individual images and combined
original image pairs. They gave no indication that may help statistical attacks.
The mean squared error for two images, stored in matrices A and B, is computed as follows:
∑∑= =
−=
m
i
n
j
jiBjiAMSE
mn 1 1
2
)( ],[],[
1
(1)
PSNR is computed as:
ܴܲܵܰ = 10 logଵ ቀ
ெ
ெௌா
ଶ
ቁ (2)
where MAX is the maximum pixel value of the image; usually 255. The PSNR for the encrypted
sample pair (Zaid and Ghaith) was 8.422. The average PSNR computed for all encrypted pairs of
images was 7.331. This low value is desired for encrypted images since it indicates more noise
and, therefore, more resistance to attacks.
The correlation, r, between two images stored in matrices A and B is computed as follows, where
Aand B are mean values for matrices A and B, respectively:
Figure 5. Histogram of image combined from original Zaid and Ghaith images
(a) Combined image after encryption (b) Histogram of encrypted combined image
Figure 4. Encrypted combined image and its histogram
6. The International Journal of Multimedia & Its Applications (IJMA) Vol.5, No.2, April 2013
20
∑∑∑∑
∑∑
= == =
= =
−−
−−
=
m
i
n
j
m
i
n
j
m
i
n
j
BjiBAjiA
BjiBAjiA
r
1 1
2
1 1
2
1 1
)()( )],[()],[(
)],[)(],[(
(3)
The correlation between the combined sample pair (Zaid and Ghaith) and its encrypted image was
0.004. The average correlation value, taken for the absolute values of correlation for the sample
image pairs, was 0.007. This low correlation value between the original images and their
encryption indicates less resemblance between them, which provides more resistance to attacks.
4. CONCLUSIONS
A new encryption algorithm was presented. The new algorithm combines two or more images of
different types and sizes, and it performs encryption using a shuffling procedure and an S-box
substitution. These encryption procedures combine stream cipher with block cipher, and they are
both private-key dependent and data dependent. Statistical analysis using histograms, PSNR and
correlation showed the algorithm is not vulnerable to statistical attacks. When the algorithm was
implemented and tested, the PSNR values of encrypted images and the correlations between
images and their encryption were low, which indicates more noise and less resemblance between
the images and their encryptions. In addition, the huge number of possible keys and possible
permutations from shuffling and substitution make a brute-force attack on the algorithm
impossible.
REFERENCES
[1] Arroyo, D., C. Li, S. Li, G. Alvarez & W.A. Halang, (2009) “Cryptanalysis of an image encryption
scheme based on a new total shuffling algorithm”; Chaos, Solitons & Fractals, Vol. 41, No. 5,
pp2613−2616. DOI: 10.1016/j.chaos.2008.09.051
[2] Bani Younes, M.A. & A. Jantan, (2008) “An image encryption approach using a combination of
permutation technique followed by encryption”; Int. J. Comp. Sci. Net. Sec., Vol. 8, No. 4,
pp191−197.
[3] Gao, T. & Z. Chen, (2008) “A new image encryption algorithm based on hyper-chaos”; Physics
Letters A, Vol. 372, pp394-400.
[4] Sasidharan, S. & D.S. Philip, (2011) “A fast partial image encryption scheme with wavelet transform
and RC4”; Int. J. Advances Eng. & Tech, Vol. 1, No. 4, pp322-331.
[5] Yahya, A. & A. Abdalla, (2008) “A shuffle encryption algorithm using S-box”; J. Comp. Sci. (Science
Publications), Vol. 4, No. 12, pp999-1002.
[6] Yahya, A. & A. Abdalla, (2009) “An AES-based encryption algorithm with shuffling”; Proc. 2009 Int.
Conf. Security & Management (SAM '09), Las Vegas, NV, USA. 13-16 July.
[7] Yoon, J.W. & H. Kim, (2010) “An image encryption scheme with a pseudorandom permutation based
on chaotic maps”; Commun. Nonlinear Sci. Numer. Simulat. DOI: 10.1016/j.cnsns.2010.01.041
[8] Federal Information Processing Standards (FIPS 197). The Advanced Encryption Standard, 2001.
http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf
[9] Benabdellah, M., M.M. Himmi, N. Zahid, F. Regragui & E.H. Bouyakhf, (2007) “Encryption-
compression of images based on FMT and AES algorithm”; Appl. Math. Sci. (Hikari Ltd.), Vol. 1,
No. 45, pp2203–2219.
[10] Duc, D.A., T.M. Triet & L.H. Co, (2002) “The extended Rijndael-like block ciphers”; Proc. Int. Conf.
Info. Tech.: Coding and Computing, pp183−188. DOI: 10.1109/ITCC.2002.1000384
[11] El-Fishawy, N. & O.M. Abu Zaid, (2007) “Quality of encryption measurement of bitmap images with
RC6, MRC6, and Rijndael block cipher algorithms”; Int. J. Net. Sec. (Femto Technique Co.), Vol. 5,
No. 3, pp241–251.
7. The International Journal of Multimedia & Its Applications (IJMA) Vol.5, No.2, April 2013
21
[12] Zeghid, M., M. Machhout, L. Khriji, A. Baganne & R. Tourki, (2007) “A modified AES based algorithm
for image encryption”; Int. J. Comp. Sci. & Eng. (World Academy of Science, Engineering &
Technology), Vol. 1, No. 1, pp70-75.
[13] Zeghid, M., M. Machhout, L. Khriji, A. Baganne & R. Tourki, (2007) “A modified AES based algorithm
for image encryption”; Enformatika (World Enformatika Society), Vol. 21, pp206-211.
[14] Socek D., S. Magliveras, D. C’ulibrk, O. Marques, H. Kalva & B. Furht, (2007) “Digital video
encryption algorithms based on correlation-preserving permutations”; EURASIP J Inform. Security.
Authors
Dr. Ayman M. Abdalla has been a member of the Faculty of Science and
Information Technology at Al-Zaytoonah University since 2001, where he held
different positions including the Chair of the Department of Multimedia Systems.
He received his Ph.D. in computer science from the University of Central Florida,
FL, USA; and his Master’s and Bachelor’s degrees in computer science from
Montclair State University, NJ, USA. He has experience in research and teaching
in the United States and Jordan in addition to working in software development in
a company in the United States.
Dr. Abdelfatah A. Tamimi has been a member of the Faculty of Science and
Information Technology at Al-Zaytoonah University since 1996, where he held
different positions including the Dean of the Faculty and the Chair of the
Department of Computer Science. He received his Ph.D. in computer science from
the City University of New York, NY, USA; his Master’s degree in computer
science from Montclair State University, NJ, USA; and his Bachelor’s degree in
mathematics from Jordan University, Amman, Jordan. In addition to his research
and teaching experience, he has a 13 year experience in information technology
design, development and implementation in United States companies.