When images are customized to identify changes that have occurred using techniques such as spectral signature, which can be used to extract features, they can be of great value. In this paper, it was proposed to use the spectral signature to extract information from satellite images and then classify them into four categories. Here it is based on a set of data from the Kaggle satellite imagery website that represents different categories such as clouds, deserts, water, and green areas. After preprocessing these images, the data is transformed into a spectral signature using the Fast Fourier Transform (FFT) algorithm. Then the data of each image is reduced by selecting the top 20 features and transforming them from a two-dimensional matrix to a one-dimensional vector matrix using the Vector Quantization (VQ) algorithm. The data is divided into training and testing. Then it is fed into 23 layers of deep neural networks (DNN) that classify satellite images. The result is 2,145,020 parameters, and the evaluation of performance measures was accuracy = 100%, loopback = 100%, and the result F1 = 100 %.
It is known that images differ from texts in many aspects, such as high repetition and correlation, local structure, capacitance characteristics and frequency. As a result, traditional encryption methods can not be applied to images. In this paper we present a method for designing a simple and efficient messy system using a difference in the output sequence. To meet the requirements of image encryption, we create a new coding system for linear and nonlinear structures based on the generation of a new key based on chaotic maps.
The design uses a kind of chaotic maps including the Chebyshev 1D map, depending on the parameters, for a good random appearance. The output is a test in several measurements, including the complexity of th
... Show MoreThe aim of this paper is to introduce and study the concept of SN-spaces via the notation of simply-open sets as well as to investigate their relationship to other topological spaces and give some of its properties.
This paper presents a numerical scheme for solving nonlinear time-fractional differential equations in the sense of Caputo. This method relies on the Laplace transform together with the modified Adomian method (LMADM), compared with the Laplace transform combined with the standard Adomian Method (LADM). Furthermore, for the comparison purpose, we applied LMADM and LADM for solving nonlinear time-fractional differential equations to identify the differences and similarities. Finally, we provided two examples regarding the nonlinear time-fractional differential equations, which showed that the convergence of the current scheme results in high accuracy and small frequency to solve this type of equations.
Data compression offers an attractive approach to reducing communication costs using available bandwidth effectively. It makes sense to pursue research on developing algorithms that can most effectively use available network. It is also important to consider the security aspect of the data being transmitted is vulnerable to attacks. The basic aim of this work is to develop a module for combining the operation of compression and encryption on the same set of data to perform these two operations simultaneously. This is achieved through embedding encryption into compression algorithms since both cryptographic ciphers and entropy coders bear certain resemblance in the sense of secrecy. First in the secure compression module, the given text is p
... Show MoreToday, the prediction system and survival rate became an important request. A previous paper constructed a scoring system to predict breast cancer mortality at 5 to 10 years by using age, personal history of breast cancer, grade, TNM stage and multicentricity as prognostic factors in Spain population. This paper highlights the improvement of survival prediction by using fuzzy logic, through upgrading the scoring system to make it more accurate and efficient in cases of unknown factors, age groups, and in the way of how to calculate the final score. By using Matlab as a simulator, the result shows a wide variation in the possibility of values for calculating the risk percentage instead of only 16. Additionally, the accuracy will be calculate
... Show MoreIn this paper, we introduce the bi-normality set, denoted by , which is an extension of the normality set, denoted by for any operators in the Banach algebra . Furthermore, we show some interesting properties and remarkable results. Finally, we prove that it is not invariant via some transpose linear operators.
In this article, an attempt has been made to introduce the concept of Neutrosophic d-Filter and Neutrosophic Prime d-Filter of d-Algebra by generalizing the notion of Intuitionistic Fuzzy d-Filter of d-Algebra. Besides, we establish different properties of them. Further, we study several relations on this notion from the point of view of Neutrosophic d-Algebra.
Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the cont
... Show Morewe applied the direct product concept on the notation of intuitionistic fuzzy semi d-ideals of d-algebra with investigation some theorems, and also, we study the notation of direct product of intuitionistic fuzzy topological d-algebra.
In this article, we introduce a new type of soft spaces namely, soft spaces as a generalization of soft paces. Also, we study the weak forms of soft spaces, namely, soft spaces, soft spaces, soft space, and soft spaces. The characterizations and fundamental properties related to these types of soft spaces and the relationships among them are also discussed.