The segmentation of aerial images using different clustering techniques offers valuable insights into interpreting and analyzing such images. By partitioning the images into meaningful regions, clustering techniques help identify and differentiate various objects and areas of interest, facilitating various applications, including urban planning, environmental monitoring, and disaster management. This paper aims to segment color aerial images to provide a means of organizing and understanding the visual information contained within the image for various applications and research purposes. It is also important to look into and compare the basic workings of three popular clustering algorithms: K-Medoids, Fuzzy C-Mean (FCM), and Gaussian Mixture Model (GMM). This will help find the best way to separate colors in aerial images. According to a thorough comparative study, PSNR and correlation metrics show that K-Medoids outperform other clustering techniques in terms of segmentation quality. Also, the effect of changing the number of clusters on the image quality was studied; when the number of clusters increases, the image quality increases. It was found that when K-Medoids were used, the PSNR and correlation were 35.57 and 0.99, respectively. When FCM and GMM were used, they were 35.54, 0.99, 31.67, and 0.97, respectively, when the number of clusters was 12.
Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima
... Show MoreIn this paper, the generation of a chaotic carrier by Lorenz model
is theoretically studied. The encoding techniques has been used is
chaos masking of sinusoidal signal (massage), an optical chaotic
communications system for different receiver configurations is
evaluated. It is proved that chaotic carriers allow the successful
encoding and decoding of messages. Focusing on the effect of
changing the initial conditions of the states of our dynamical system
e.i changing the values (x, y, z, x1, y1, and z1).
To maintain the security and integrity of data, with the growth of the Internet and the increasing prevalence of transmission channels, it is necessary to strengthen security and develop several algorithms. The substitution scheme is the Playfair cipher. The traditional Playfair scheme uses a small 5*5 matrix containing only uppercase letters, making it vulnerable to hackers and cryptanalysis. In this study, a new encryption and decryption approach is proposed to enhance the resistance of the Playfair cipher. For this purpose, the development of symmetric cryptography based on shared secrets is desired. The proposed Playfair method uses a 5*5 keyword matrix for English and a 6*6 keyword matrix for Arabic to encrypt the alphabets of
... Show MoreIn this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consists of ten BMP 24-bit true color images, building an application by using visual basic 6.0 to show the size after and before compression process and computing the compression ratio for RLE and for the enhanced RLE algorithm.