scholarly journals DWT versus WP Based Optical Color Image Encryption Robust to Composite Attacks

2017 ◽  
Vol 2017 ◽  
pp. 1-15 ◽  
Author(s):  
M. A. Mohamed ◽  
Ahmed Shaaban Samrah ◽  
Mohamed Ismail Fath Allah
Keyword(s):  
Color Image ◽  
Wavelet Packet ◽  
Chaotic Map ◽  
Vital Role ◽  
Discrete Wavelet ◽  
Optical Encryption ◽  
Random Keys ◽  
Encryption Schemes ◽  
Novel Algorithms ◽  
Optical Color

Intensive studies have been done to get robust encryption algorithms. Due to the importance of image information, optical encryption has played a vital role in information security. Many optical encryption schemes have been proposed but most of them suffer from poor robustness. In this paper six proposed algorithms will be presented for optical encryption to be robust to severe attacks: composite attack. Three of these approaches are based on one level Discrete Wavelet Transform (DWT) and the others are based on Wavelet Packet (WP). Not only will new techniques be presented but also a new proposed chaotic map has been developed as random keys for all algorithms. After extensive comparative study with some traditional techniques, it has been found that the novel algorithms have achieved better performance versus conventional ones. Also it has been found that WP based algorithms have achieved better performance than DWT based ones against severe composite attacks.

scholarly journals A Simple Chaotic Map-Based Image Encryption System Using Both Plaintext Related Permutation and Diffusion

Entropy ◽  
2018 ◽  
Vol 20 (7) ◽  
pp. 535 ◽  
Author(s):  
Linqing Huang ◽  
Shuting Cai ◽  
Mingqing Xiao ◽  
Xiaoming Xiong
Keyword(s):  
Image Encryption ◽  
High Efficiency ◽  
Color Image ◽  
Chaotic Map ◽  
Original Image ◽  
Diffusion Structure ◽  
High Security ◽  
Encryption Schemes ◽  
Differential Attacks ◽  
And Diffusion

Recently, to conquer most non-plain related chaos-based image cryptosystems’ security flaws that cannot resist the powerful chosen/knownn plain-text attacks or differential attacks efficiently for less plaintext sensitivity, many plain related chaos-based image cryptosystems have been developed. Most cryptosystems that have adopted the traditional permutation–diffusion structure still have some drawbacks and security flaws: (1) most plaintext related image encryption schemes using only plaintext related confusion operation or only plaintext related diffusion operation relate to plaintext inadequately that cannot achieve high plaintext sensitivity; (2) in some algorithms, the generation of security key that needs to be sent to the receiver is determined by the original image, so these algorithms may not applicable to real-time image encryption; (3) most plaintext related image encryption schemes have less efficiency because more than one round permutation–diffusion operation is required to achieve high security. To obtain high security and efficiency, a simple chaotic based color image encryption system by using both plaintext related permutation and diffusion is presented in this paper. In our cryptosystem, the values of the parameters of cat map used in permutation stage are related to plain image and the parameters of cat map are also influenced by the diffusion operation. Thus, both the permutation stage and diffusion stage are related to plain images, which can obtain high key sensitivity and plaintext sensitivity to resist chosen/known plaintext attacks or differential attacks efficiently. Furthermore, only one round of plaintext related permutation and diffusion operation is performed to process the original image to obtain cipher image. Thus, the proposed scheme has high efficiency. Complete simulations are given and the simulation results prove the excellent security and efficiency of the proposed scheme.

scholarly journals Non-Linear Hopped Chaos Parameters-Based Image Encryption Algorithm Using Histogram Equalization

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 535
Author(s):  
Karim H. Moussa ◽  
Ahmed I. El Naggary ◽  
Heba G. Mohamed
Keyword(s):  
Image Encryption ◽  
Initial Conditions ◽  
Signal To Noise Ratio ◽  
Chaotic Map ◽  
Histogram Equalization ◽  
Encryption Algorithm ◽  
Multimedia Contents ◽  
Encryption Schemes ◽  
Change Intensity ◽  
Increasing Demand

Multimedia wireless communications have rapidly developed over the years. Accordingly, an increasing demand for more secured media transmission is required to protect multimedia contents. Image encryption schemes have been proposed over the years, but the most secure and reliable schemes are those based on chaotic maps, due to the intrinsic features in such kinds of multimedia contents regarding the pixels’ high correlation and data handling capabilities. The novel proposed encryption algorithm introduced in this article is based on a 3D hopping chaotic map instead of fixed chaotic logistic maps. The non-linearity behavior of the proposed algorithm, in terms of both position permutation and value transformation, results in a more secured encryption algorithm due to its non-convergence, non-periodicity, and sensitivity to the applied initial conditions. Several statistical and analytical tests such as entropy, correlation, key sensitivity, key space, peak signal-to-noise ratio, noise attacks, number of pixels changing rate (NPCR), unified average change intensity randomness (UACI), and others tests were applied to measure the strength of the proposed encryption scheme. The obtained results prove that the proposed scheme is very robust against different cryptography attacks compared to similar encryption schemes.

FUSION OF SURVEILLANCE IMAGES IN INFRARED AND VISIBLE BAND USING CURVELET, WAVELET AND WAVELET PACKET TRANSFORM

2010 ◽  
Vol 08 (02) ◽  
pp. 271-292 ◽  
Author(s):  
PARUL SHAH ◽  
S. N. MERCHANT ◽  
U. B. DESAI
Keyword(s):  
Wavelet Packet ◽  
Curvelet Transform ◽  
Visual Quality ◽  
Wavelet Packet Transform ◽  
Discrete Wavelet ◽  
Discrete Wavelet Packet Transform ◽  
Fused Image ◽  
Fusion Methods ◽  
Visible Images

This paper presents two methods for fusion of infrared (IR) and visible surveillance images. The first method combines Curvelet Transform (CT) with Discrete Wavelet Transform (DWT). As wavelets do not represent long edges well while curvelets are challenged with small features, our objective is to combine both to achieve better performance. The second approach uses Discrete Wavelet Packet Transform (DWPT), which provides multiresolution in high frequency band as well and hence helps in handling edges better. The performance of the proposed methods have been extensively tested for a number of multimodal surveillance images and compared with various existing transform domain fusion methods. Experimental results show that evaluation based on entropy, gradient, contrast etc., the criteria normally used, are not enough, as in some cases, these criteria are not consistent with the visual quality. It also demonstrates that the Petrovic and Xydeas image fusion metric is a more appropriate criterion for fusion of IR and visible images, as in all the tested fused images, visual quality agrees with the Petrovic and Xydeas metric evaluation. The analysis shows that there is significant increase in the quality of fused image, both visually and quantitatively. The major achievement of the proposed fusion methods is its reduced artifacts, one of the most desired feature for fusion used in surveillance applications.

Facial expression recognition using best tree RD-LGP encoded features and HMM

2018 ◽  
Vol 16 (06) ◽  
pp. 1850047 ◽  
Author(s):  
Ahmed A. Nashat
Keyword(s):  
Facial Expression ◽  
Wavelet Packet ◽  
Recognition Rate ◽  
Noise Removal ◽  
Discrete Wavelet ◽  
Ratio Test ◽  
Expression Recognition ◽  
Daily Lives ◽  
Face Expression ◽  
Bayesian Test

Hand and face gestures enable deaf people to communicate in their daily lives rather than speaking. This paper describes a hidden Markov model (HMM)-based framework for face sign recognition and detection. The observation vectors used to characterize the states of the HMM are obtained using the best tree local gradient pattern (LGP) encoded features. Each face gesture is modeled as a five-state HMM. The problem of facial expression classification is posed as a composite seven-classes multi-hypothesis Bayesian test. The likelihood ratio test showed that the overall recognition rate for the proposed model is higher than the HMM-local binary pattern descriptor by 6.4%. The overall recognition rate is enhanced by 8.6% using the discrete wavelet packet best tree decomposition filter as a pre-processing noise removal tool. In addition, the overall recognition rate ranges from 84.3%, for the seven classes Bayesian test, to 100%, for lower number of classes depending upon the type of the face gesture. The proposed face expression algorithm reduces significantly the computational complexity of previous HMM-based face expression recognition systems, and still preserve the recognition rate.

scholarly journals Image Hiding Using QR Factorization And Discrete Wavelet Transform Techniques

2021 ◽  
Vol 6 (2) ◽  
pp. 72-81
Author(s):  
Reham Ahmed El-Shahed ◽  
◽  
Maryam Al-Berry ◽  
Hala Ebied ◽  
Howida A. Shedeed ◽  
...  
Keyword(s):  
Data Security ◽  
Color Image ◽  
Simple Algorithm ◽  
Qr Factorization ◽  
Discrete Wavelet ◽  
Huge Amount ◽  
Image Hiding ◽  
Media Applications ◽  
Very High ◽  
Better Than

Steganography is one of the most important tools in the data security field as there is a huge amount of data transferred each moment over the internet. Hiding secret messages in an image has been widely used because the images are mostly used in social media applications. The proposed algorithm is a simple algorithm for hiding an image in another image. The proposed technique uses QR factorization to conceal the secret image. The technique successfully hid a gray and color image in another one and the performance of the algorithm was measured by PSNR, SSIM and NCC. The PSNR for the cover image was in the range of 41 to 51 dB. DWT was added to increase the security of the method and this enhanced technique increased the cover PSNR to 48 t0 56 dB. The SSIM is 100% and the NCC is 1 for both implementations. Which improves that the imperceptibility of the algorithm is very high. The comparative analysis showed that the performance of the algorithm is better than other state-of-the-art algorithms

Sign in / Sign up

Export Citation Format

Share Document