One-dimensional vs. two-dimensional based features: Plant identification approach

The number of endangered species has been increased due to shifts in the agricultural production, climate change, and poor urban planning. This has led to investigating new methods to address the problem of plant species identification/classification. In this paper, a plant identification approach using 2D digital leaves images was proposed. The approach used two features extraction methods based on one-dimensional (1D) and two-dimensional (2D) and the Bagging classifier. For the 1D-based methods, Principal Component Analysis (PCA), Direct Linear Discriminant Analysis (DLDA), and PCA + LDA techniques were applied, while 2DPCA and 2DLDA algorithms were used for the 2D-based method. To classify the extracted features in both methods, the Bagging classifier, with the decision tree as a weak learner was used. The five variants, i.e. PCA, PCA + LDA, DLDA, 2DPCA, and 2DLDA, of the approach were tested using the Flavia public dataset which consists of 1907 colored leaves images. The accuracy of these variants was evaluated and the results showed that the 2DPCA and 2DLDA methods were much better than using the PCA, PCA + LDA, and DLDA. Furthermore, it was found that the 2DLDA method was the best one and the increase of the weak learners of the Bagging classifier yielded a better classification accuracy. Also, a comparison with the most related work showed that our approach achieved better accuracy under the same dataset and same experimental setup

One-dimensional vs. two-dimensional based features: Plant identification approach

The number of endangered species has been increased due to shifts in the agricultural production, climate change, and poor urban planning. This has led to investigating new methods to address the problem of plant species identification/classification. In this paper, a plant identification approach using 2D digital leaves images was proposed. The approach used two features extraction methods based on one-dimensional (1D) and two-dimensional (2D) and the Bagging classifier. For the 1D-based methods, Principal Component Analysis (PCA), Direct Linear Discriminant Analysis (DLDA), and PCA + LDA techniques were applied, while 2DPCA and 2DLDA algorithms were used for the 2D-based method. To classify the extracted features in both methods, the Bagging classifier, with the decision tree as a weak learner was used. The five variants, i.e. PCA, PCA + LDA, DLDA, 2DPCA, and 2DLDA, of the approach were tested using the Flavia public dataset which consists of 1907 colored leaves images. The accuracy of these variants was evaluated and the results showed that the 2DPCA and 2DLDA methods were much better than using the PCA, PCA + LDA, and DLDA. Furthermore, it was found that the 2DLDA method was the best one and the increase of the weak learners of the Bagging classifier yielded a better classification accuracy. Also, a comparison with the most related work showed that our approach achieved better accuracy under the same dataset and same experimental setup

An improved moth flame optimization algorithm based on rough sets for tomato diseases detection

Plant diseases is one of the major bottlenecks in agricultural production that have bad effects on the economic of any country. Automatic detection of such disease could minimize these effects. Features selection is a usual pre-processing step used for automatic disease detection systems. It is an important process for detecting and eliminating noisy, irrelevant, and redundant data. Thus, it could lead to improve the detection performance. In this paper, an improved moth-flame approach to automatically detect tomato diseases was proposed. The moth-flame fitness function depends on the rough sets dependency degree and it takes into a consideration the number of selected features. The proposed algorithm used both of the power of exploration of the moth flame and the high performance of rough sets for the feature selection task to find the set of features maximizing the classification accuracy which was evaluated using the support vector machine (SVM). The performance of the MFORSFS algorithm was evaluated using many benchmark datasets taken from UCI machine learning data repository and then compared with feature selection approaches based on Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) with rough sets. The proposed algorithm was then used in a real-life problem, detecting tomato diseases (Powdery mildew and early blight) where a real dataset of tomato disease were manually built and a tomato disease detection approach was proposed and evaluated using this dataset. The experimental results showed that the proposed algorithm was efficient in terms of Recall, Precision, Accuracy and F-Score, as long as feature size reduction and execution time

Trust-based secure clustering in WSN-based intelligent transportation systems

Increasing the number of vehicles on roads leads to congestion and safety problems. Wireless Sensor Network (WSN) is a promising technology providing Intelligent Transportation Systems (ITS) to address these problems. Usually, WSN-based applications, including ITS ones, incur high communication overhead to support efficient connectivity and communication activities. In the ITS environment, clustering would help in addressing the high communication overhead problem. In this paper, we introduce a bio-inspired and trust-based cluster head selection approach for WSN adopted in ITS applications. A trust model is designed and used to compute a trust level for each node and the Bat Optimization Algorithm (BOA) is used to select the cluster heads based on three parameters: residual energy, trust value and the number of neighbors. The simulation results showed that our proposed model is energy efficient (i.e., its power consumption is more efficient than many well-known clustering algorithm such as LEACH, SEP, and DEEC under homogeneous and heterogeneous networks). In addition, the results demonstrated that our proposed model achieved longer network lifetime, i.e., nodes are kept alive longer than what LEACH, SEP and DEEC can achieve. Moreover, the the proposed model showed that the average trust value of selected Cluster Head (CH) is high under different percentage (30% and 50%) of malicious nodes

Particle Swarm Optimization : a tutorial

Optimization algorithms are necessary to solve many problems such as parameter tuning. Particle Swarm Optimization (PSO) is one of these optimization algorithms. The aim of PSO is to search for the optimal solution in the search space. This paper highlights the basic background needed to understand and implement the PSO algorithm. This paper starts with basic definitions of the PSO algorithm and how the particles are moved in the search space to find the optimal or near optimal solution. Moreover, a numerical example is illustrated to show how the particles are moved in a convex optimization problem. Another numerical example is illustrated to show how the PSO trapped in a local minima problem. Two experiments are conducted to show how the PSO searches for the optimal parameters in one-dimensional and two-dimensional spaces to solve machine learning problems

Optimized and efficient image-based IoT malware detection method

With the widespread use of IoT applications, malware has become a difficult and sophisticated threat. Without robust security measures, a massive volume of confidential and classified data could be exposed to vulnerabilities through which hackers could do various illicit acts. As a result, improved network security mechanisms that can analyse network traffic and detect malicious traffic in real-time are required. In this paper, a novel optimized machine learning image-based IoT malware detection method is proposed using visual representation (i.e., images) of the network traffic. In this method, the ant colony optimizer (ACO)-based feature selection method was proposed to get a minimum number of features while improving the support vector machines (SVMs) classifier’s results (i.e., the malware detection results). Further, the PSO algorithm tuned the SVM parameters of the different kernel functions. Using a public dataset, the experimental results showed that the SVM linear function kernel is the best with an accuracy of 95.56%, recall of 96.43%, precision of 94.12%, and F1_score of 95.26%. Comparing with the literature, it was concluded that bio-inspired techniques, i.e., ACO and PSO, could be used to build an effective and lightweight machine-learning-based malware detection system for the IoT environment

A blockchain protocol for authenticating space communications between satellites constellations

Blockchain has found many applications, apart from Bitcoin, in different fields and it has the potential to be very useful in the satellite communications and space industries. Decentralized and secure protocols for processing and manipulating space transactions of satellite swarms in the form of Space Digital Tokens (SDT) can be built using blockchain technology. Tokenizing space transactions using SDTs will open the door to different new blockchain-based solutions for the advancement of constellation-based satellite communications in the space industry. Developing blockchain solutions using smart contracts could be used in securely authenticating various P2P satellite communications and transactions within/between satellite swarms. To manage and secure these transactions, using the proposed SDT concept, this paper suggested a blockchain-based protocol called Proof of Space Transactions (PoST). This protocol was adopted to manage and authenticate the transactions of satellite constellations in a P2P connection. The PoST protocol was prototyped using the Ethereum blockchain and experimented with to evaluate its performance using four metrics: read latency, read throughput, transaction latency, and transaction throughput. The simulation results clarified the efficiency of the proposed PoST protocol in processing and verifying satellite transactions in a short time according to read and transaction latency results. Moreover, the security results showed that the proposed PoST protocol is secure and efficient in verifying satellite transactions according to true positive rate (TPR), true negative rate (TNR), and accuracy metrics. These findings may shape a real attempt to develop a new generation of Blockchain-based satellite constellation systems

Long-term drivers of broadband traffic in next-generation networks

This paper is concerned with long-term (20+ years) forecasting of broadband traffic in next-generation networks. Such long-term approach requires going beyond extrapolations of past traffic data while facing high uncertainty in predicting the future developments and facing the fact that, in 20 years, the current network technologies and architectures will be obsolete. Thus, "order of magnitude" upper bounds of upstream and downstream traffic are deemed to be good enough to facilitate such long-term forecasting. These bounds can be obtained by evaluating the limits of human sighting and assuming that these limits will be achieved by future services or, alternatively, by considering the contents transferred by bandwidth-demanding applications such as those using embedded interactive 3D video streaming. The traffic upper bounds are a good indication of the peak values and, subsequently, also of the future network capacity demands. Furthermore, the main drivers of traffic growth including multimedia as well as non-multimedia applications are identified. New disruptive applications and services are explored that can make good use of the large bandwidth provided by next-generation networks. The results can be used to identify monetization opportunities of future services and to map potential revenues for network operators

Representative Set of Objects in Rough Sets Based on Galois Connections

This paper introduces a novel definition, called representative set of objects of a decision class, in the framework of decision systems based on rough sets. The idea behind such a notion is to consider subsets of objects that characterize the different classes given by a decision system. Besides the formal definition of representative set of objects of a decision class, we present different mathematical properties of such sets and a relationship with classification tasks based on rough sets. © 2020, Springer Nature Switzerland AG