Digital Image Processing

Heba M. El-Hoseny ¹, Hossam E. H. Ahmed ², Hassan B. Kazemian ³, Fathi E. Abd El-Samie ²

Affiliations
1 Department of Electronics and Electrical Communications, Menoufia University, EG
2 Department of Electronics and Electrical Communications, Menoufia University, Menouf, EG
3 London Metropolitain University, London, GB

Abstract

In this paper an efficient approach for image encryption is presented based on feedback stream cipher using a developed chaotic maps. It consists of two modules; first the encryption module which encrypts the plain image pixel-by-pixel by using external secret key 256-bit, taking into consideration the previous values of the encrypted pixels obtained in each iteration. The second module is decryption module which decrypts the cipher image pixel by pixel to retrieve the plain image using the same key which is used in encryption. Decryption module is typical to the encryption module except the pad (session key) in this case is unmerged. The proposed algorithm can be performed using many logistic maps. We here use 1D maps such as Bernoulli map, Logistic map, and other three developed maps. The proposed algorithm using developed Bernoulli map has achieved the best results among all other maps used in the proposed algorithm. It has many useful advantages as the range of the variable r is increased, and the feedback property. Several encryption metrics is applied to judge the proposed algorithm such as statistical analysis, differential analysis, and key sensitivity tests. The proposed algorithm is compared with RC6 algorithm. Experiments and results verify and prove that the proposed algorithm using the developed Bernoulli map is highly secure from the cryptographic viewpoint, more immune to noise, has higher entropy, and has higher sensitivity. The results of security analysis show that the proposed algorithm is secure and efficient in real-time image applications. 

Keywords

Cryptography, Chaos, Image Cryptosystem, Stream Cipher, Logistic Map, Bernoulli Map, Security Analysis.

Full Text

     

Abdelrahman Selim ¹, Moawad I. Dessouky ², Mohiy M. Hadhoud ², Fathi E. Abd El-Samie

Affiliations
1 Menoufia University, Menouf, EG
2 Menoufia University, EG

Abstract

In this paper, we study the affect of using the spiral architecture instead of the square block decomposition in fractal compression. Comparisons with other systems like the conventional square and the simplified fractal compression systems are presented. A comparison with standard JPEG system is also introduced. We apply these types of fractal compression on a video sequence. We have found that in the case of using the spiral architecture in fractal compression, the produced or decoded image or video has a better visual quality than that produced with the conventional square system and the previously presented simplified system. We found also that all types of fractal compression are better than the JPEG standard.

Keywords

Image Compression, Fractal, Decomposition, Spiral.

Full Text

     

Zeinab F. Elsharkawy ¹, Safey A. Abdelwahab ¹, Moawad I. Dessouky ², Sayed M. Elaraby ³, Fathi E. Abd El-Samie ²

Affiliations
1 Engineering Department, Nuclear Research Center, Atomic Energy Authority, Cairo, EG
2 Department of Electronics and Electrical Communications, Menoufia University, Menouf, EG
3 Engineering Department, Nuclear Research Center, Atomic Energy Authority, Cairo, IN

Abstract

Scanner identification is the ability to discern the devices by which an image was scanned. In this paper, a new and robustness individual source scanner identification scheme is proposed. This scheme formulates a unique fingerprint for each scanner using traces of dust, dirt, scratches, and source imperfection pattern over scanner platen on scanned images. A single Support Vector machine (SVM) classifier is implemented and trained using correlation features of scanned images to classify different scanners brands and different models for the same scanner brand, and a 99.79% detection accuracy is obtained. In addition, the robustness of the used individual source scanner identification scheme on resized different resolutions is experimentally tested. The aging effect is also experimentally tested by re-applying the proposed algorithm on the scanned images after a continuous usage of the scanners under test for certain long periods. The experimental results using the proposed classifier for different scanner brands and different models for the same scanner brand approved the validity, efficiency, and robustness of the proposed scheme to match the scanned image to its unique source.

Keywords

Image Classification, Digital Image Forensics, Support Vector Machine.

Full Text

     

Mohammed Y. Abbass ¹, Safey A. Abdelwahab ¹, Salah M. Diab ², Bassiony M. Salam ², El-Sayed M. El-Rabaie ², Fathi E. Abd El-Samie ², Said S. Haggag ³

Affiliations
1 Engineering Department, Nuclear Research Center, Atomic Energy Authority, EG
2 Department of Electronics and Electrical Communications, Menoufia University, Menouf, EG
3 Nuclear Research Center, Atomic Energy Authority, EG

Abstract

This paper deals with the problem of blind separation of digital images from mixtures. A method to solve this problem is blind source separation (BSS) using independent component analysis (ICA). It proposes a wavelet based ICA method using Kurtosis for blind image source separation. In this method, the observations are transformed into an adequate representation using wavelet packets decomposition and Kurtosis criterion. The simulation results of performance measures show a considerable improvement when compared to FastICA. The Peak Signal-to-Noise Ratio (PSNR), Signal-to-Noise Ratio (SNR), Root Mean Square Error (RMSE) and and Segmental Signal-to-Noise Ratio (SNRseg) are used to evaluate the quality of the separated images.

Keywords

Blind Source Separation (BSS), ICA, Kurtosis.

Full Text

     

Amany F. Eldaoshy ¹, Moawad I. Dessouky ², Al-Dalil Sami ³, Fathi E. Abd El-Samie ²

Affiliations
1 Department of Electronics and Electrical Communications, Menoufia University, Menouf-32952, EG
2 Department of Electronics and Electrical Communications, Menoufia University, Menouf 32952, EG
3 Department of Electronics and Electrical Communications, Menoufia University, Menouf 32952, EG

Abstract

This paper presents a block-by-block SVD watermarking algorithm with variable block sizes. The paper makes a comparison between the traditional method of Liu and the proposed method. In the proposed approach, the original image is divided into blocks, and then the watermark is embedded in the singular values (SVs) of each block, separately. This segmentation and watermarking on a block-by-block basis makes the watermark more robust to the attacks such as noise, compression, cropping and other attacks as the results reveal. Watermark detection is implemented by extracting the watermark from the SVs of the watermarked blocks.  Extracting the watermark from one block at least is enough to ensure the existence of the watermark. Experimental results show that the proposed method with different block sizes is superior to the traditional method of Liu for embedding unencrypted watermarks.

Keywords

Image Processing, Cryptography, Watermarking, Singular Value Decomposition.

Full Text