Secure Image Processing and Transmission Schema in Cluster-Based Wireless Sensor Network

WSN as a new category of computer-based computing platforms and network structures is showing new applications in different areas such as environmental monitoring, health care and military applications. Although there are a lot of secure image processing schemas designed for image transmission over a network, the limited resources and the dynamic environment make it invisible to be used with Wireless Sensor Networks (WSNs). In addition, the current secure data transmission schemas in WSN are concentrated on the text data and are not applicable for image transmission's applications. Furthermore, secure image transmission is a big challenging issue in WSNs especially for the application that uses image as its main data such as military applications. The reason why is because the limited resources of the sensor nodes which are usually deployed in unattended environments. This chapter introduces a secure image processing and transmission schema in WSN using Elliptic Curve Cryptography (ECC) and Homomorphic Encryption (HE).

Enhanced Breast Cancer Diagnosis System Using Fuzzy Clustering Means Approach in Digital Mammography

Breast cancer or malignant breast neoplasm is the most common type of cancer in women. Researchers are not sure of the exact cause of breast cancer. If the cancer can be detected early, the options of treatment and the chances of total recovery will increase. Computer Aided Diagnostic (CAD) systems can help the researchers and specialists in detecting the abnormalities early. The main goal of computerized breast cancer detection in digital mammography is to identify the presence of abnormalities such as mass lesions and Micro calcification Clusters (MCCs). Early detection and diagnosis of breast cancer represent the key for breast cancer control and can increase the success of treatment. This chapter investigates a new CAD system for the diagnosis process of benign and malignant breast tumors from digital mammography. X-ray mammograms are considered the most effective and reliable method in early detection of breast cancer. In this chapter, the breast tumor is segmented from medical image using Fuzzy Clustering Means (FCM) and the features for mammogram images are extracted. The results of this work showed that these features are used to train the classifier to classify tumors. The effectiveness and performance of this work is examined using classification accuracy, sensitivity and specificity and the practical part of the proposed system distinguishes tumors with high accuracy.

Bio-Inspired Optimization Algorithms for Arabic Handwritten Characters

There are still many obstacles for achieving high recognition accuracy for Arabic handwritten optical character recognition system, each character has a different shape, as well as the similarities between characters. In this chapter, several feature selection-based bio-inspired optimization algorithms including Bat Algorithm, Grey Wolf Optimization, Whale optimization Algorithm, Particle Swarm Optimization and Genetic Algorithm have been presented and an application of Arabic handwritten characters recognition has been chosen to see their ability and accuracy to recognize Arabic characters. The experiments have been performed using a benchmark dataset, CENPARMI by k-Nearest neighbors, Linear Discriminant Analysis, and random forests. The achieved results show superior results for the selected features when comparing the classification accuracy for the selected features by the optimization algorithms with the whole feature set in terms of the classification accuracy and the processing time. The experiments have been performed using a benchmark dataset, CENPARMI by k-Nearest neighbors, Linear Discriminant Analysis, and random forests. The achieved results show superior results for the selected features when comparing the classification accuracy for the selected features by the optimization algorithms with the whole feature set in terms of the classification accuracy and the processing time.

Hybrid Wavelet-Neuro-Fuzzy Systems of Computational Intelligence in Data Mining Tasks

This work is devoted to synthesis of adaptive hybrid systems based on the Computational Intelligence (CI) methods (especially artificial neural networks (ANNs)) and the Group Method of Data Handling (GMDH) ideas to get new qualitative results in Data Mining, Intelligent Control and other scientific areas. The GMDH-artificial neural networks (GMDH-ANNs) are currently well-known. Their nodes are two-input N-Adalines. On the other hand, these ANNs can require a considerable number of hidden layers for a necessary approximation quality. Introduced Q-neurons can provide a higher quality using the quadratic approximation. Their main advantage is a high learning rate. Universal approximating properties of the GMDH-ANNs can be achieved with the help of compartmental R-neurons representing a two-input RBFN with the grid partitioning of the input variables' space. An adjustment procedure of synaptic weights as well as both centers and receptive fields is provided. At the same time, Epanechnikov kernels (their derivatives are linear to adjusted parameters) can be used instead of conventional Gauss functions in order to increase a learning process rate. More complex tasks deal with stochastic time series processing. This kind of tasks can be solved with the help of the introduced adaptive W-neurons (wavelets). Learning algorithms are characterized by both tracking and smoothing properties based on the quadratic learning criterion. Robust algorithms which eliminate an influence of abnormal outliers on the learning process are introduced too. Theoretical results are illustrated by multiple experiments that confirm the proposed approach's effectiveness.

Data Clustering Using Sine Cosine Algorithm

The clustering techniques suffer from cluster centers initialization and local optima problems. In this chapter, the new metaheuristic algorithm, Sine Cosine Algorithm (SCA), is used as a search method to solve these problems. The SCA explores the search space of given dataset to find out the near-optimal cluster centers. The center based encoding scheme is used to evolve the cluster centers. The proposed SCA-based clustering technique is evaluated on four real-life datasets. The performance of SCA-based clustering is compared with recently developed clustering techniques. The experimental results reveal that SCA-based clustering gives better values in terms of cluster quality measures.

Interpreting Brain Waves

BCI (Brain-Computer Interface) gives you the power to manipulate things around you just by thinking of what you want to do. It allows your thoughts to be interpreted by the computer and hence act upon it. This could be utilized in helping disabled people, remote controlling of robots or even getting personalized systems depending upon your mood. The most important part of any BCI application is interpreting the brain signalsasthere are many mental tasks to be considered. In this chapter, the authors focus on interpreting motor imagery tasks and more specifically, imagining left hand, right hand, foot and tongue. Interpreting the signal consists of two main steps: feature extraction and classification. For the feature extraction,Empirical Mode Decomposition (EMD) was used and for the classification,the Support Vector Machine (SVM) with Radial Basis Function (RBF) kernel was used. The authors evaluated this system using the BCI competition IV dataset and reached a very promising accuracy.

A Hybrid Optimization Algorithm for Single and Multi-Objective Optimization Problems

This chapter presents a hybrid optimization algorithm namely FOA-FA for solving single and multi-objective optimization problems. The proposed algorithm integrates the benefits of the fruit fly optimization algorithm (FOA) and the firefly algorithm (FA) to avoid the entrapment in the local optima and the premature convergence of the population. FOA operates in the direction of seeking the optimum solution while the firefly algorithm (FA) has been used to accelerate the optimum seeking process and speed up the convergence performance to the global solution. Further, the multi-objective optimization problem is scalarized to a single objective problem by weighting method, where the proposed algorithm is implemented to derive the non-inferior solutions that are in contrast to the optimal solution. Finally, the proposed FOA-FA algorithm is tested on different benchmark problems whether single or multi-objective aspects and two engineering applications. The numerical comparisons reveal the robustness and effectiveness of the proposed algorithm.

Machine Learning Applications in Breast Cancer Diagnosis

Breast cancer is one of the leading causes of death in women worldwide. Early detection is the key to reduce the mortality rates. Mammography screening has proven to be one of the effective tools for diagnosis of breast cancer. Computer aided diagnosis (CAD) system is a fast, reliable, and cost-effective tool in assisting the radiologists/physicians for diagnosis of breast cancer. CAD systems play an increasingly important role in the clinics by providing a second opinion. Clinical trials have shown that CAD systems have improved the accuracy of breast cancer detection. A typical CAD system involves three major steps i.e. segmentation of suspected lesions, feature extraction and classification of these regions into normal or abnormal class and further into benign or malignant stages. The diagnostics ability of any CAD system is dependent on accurate segmentation, feature extraction techniques and most importantly classification tools that have ability to discriminate the normal tissues from the abnormal tissues. In this chapter we discuss the application of machine learning algorithms e.g. ANN, binary tree, SVM, etc. together with segmentation and feature extraction techniques in a CAD system development. Various methods used in the detection and diagnosis of breast lesions in mammography are reviewed. A brief introduction of machine learning tools, used in diagnosis and their classification performance on various segmentation and feature extraction techniques is presented.

T-Spanner Problem

The t-spanner problem is a popular combinatorial optimization problem and has different applications in communication networks and distributed systems. This chapter considers the problem of constructing a t-spanner subgraph H in a given undirected edge-weighted graph G in the sense that the distance between every pair of vertices in H is at most t times the shortest distance between the two vertices in G. The value of t, called the stretch factor, quantifies the quality of the distance approximation of the corresponding t-spanner subgraph. This chapter studies two variations of the problem, the Minimum t-Spanner Subgraph (MtSS) and the Minimum Maximum Stretch Spanning Tree(MMST). Given a value for the stretch factor t, the MtSS problem asks to find the t-spanner subgraph of the minimum total weight in G. The MMST problem looks for a tree T in G that minimizes the maximum distance between all pairs of vertices in V (i.e., minimizing the stretch factor of the constructed tree). It is easy to conclude from the literatures that the above problems are NP-hard. This chapter presents genetic algorithms that returns a high quality solution for those two problems.

Particle Swarm Optimization

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.