Aboul Ella Hassanien (Abo)

Fish image segmentation can be considered an essential process in developing a system for fish recognition. This task is challenging as different specimens, rotations, positions, illuminations, and backgrounds exist in fish images. In this research, a segmentation model is proposed for fish images using Salp Swarm Algorithm (SSA). The segmentation is formulated using Simple Linear Iterative Clustering (SLIC) method with initial parameters optimized by the SSA. The SLIC method is used to cluster image pixels to generate compact and nearly uniform superpixels. Finally, a thresholding using Otsu’s method helped to produce satisfactory results of extracted fishes from the original images under different conditions. A fish dataset consisting of real-world images was tested. In experiments, the proposed model shows robustness for different cases compared to conventional work.

In this paper, we investigate the eect of using an optimum
number of clusters with Fuzzy C-Means clustering, for Liver CT image
segmentation. The optimum number of clusters to be used was measured
using the average silhouette value. The evaluation was carried out using
the Jaccard index, in which we concluded that using the optimum number
of clusters may not necessarily lead to the best segmentation results.

Abstract: This paper presents a Fuzzy C-Means based image segmentation approach that benefits from the Minkowski distance as the dissimilarity measure, denoted as FCM-M, instead of the traditional Euclidean distance, herein identified as FCM-E. The proposed approach was applied on Liver CT images, and a thorough comparison between both methods was carried out. FCM-M provided better accuracy when compared to the traditional FCM-E, with an area under the ROC curve of 85.44% and 47.96%, respectively. In terms of statistical significant analysis, a twofold benefit was obtained from using the proposed approach: the performance of the image segmentation procedure was maintained, or even slightly increased in some situations, while the CPU processing time was significantly decreased. The advantages inherent to the proposed FCM-M pave the way to a whole new chain of fully automatic segmentation methods.

Learning methods and approximation algorithms are fundamental tools that deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems have a large number of applications arising from a variety of fields, such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, scheduling problems and so on. The past years have witnessed a large number of interesting applications using various techniques of Computational Intelligence such as rough sets, connectionist learning; fuzzy logic; evolutionary computing; artificial immune systems; swarm intelligence; reinforcement learning, intelligent multimedia processing etc.. In spite of numerous successful applications of Computational Intelligence in business and industry, it is sometimes difficult to explain the performance of these techniques and algorithms from a theoretical perspective. Therefore, we encouraged authors to present original ideas dealing with the incorporation of different mechanisms of Computational Intelligent dealing with Learning and Approximation algorithms and underlying processes.

Approximation theory is that area of analysis which is concerned with the ability to approximate functions by simpler and more easily calculated functions. It is an area which, like many other fields of analysis, has its primary roots in the mathematics.The need for function approximation and classification arises in many branches of applied mathematics, computer science and data mining in particular.

Human reasoning usually is very approximate and involves various types of uncertainties. Approximate reasoning is the computational modelling of any part of the process used by humans to reason about natural phenomena or to solve real world problems. The scope of this book includes fuzzy sets, Dempster-Shafer theory, multi-valued logic, probability, random sets, and rough set, near set and hybrid intelligent systems. Besides research articles and expository papers on theory and algorithms of approximation reasoning, papers on numerical experiments and real world applications were also encouraged. This Volume comprises of 12 chapters including an overview chapter providing an up-to-date and state-of-the research on the applications of Computational Intelligence techniques for approximation reasoning. The Volume is divided into 2 parts: Part-I: Approximate Reasoning – Theoretical Foundations and Part-II: Approximate Reasoning – Success Stories and Real World Applications

Computational tools or solutions based on intelligent systems are being used with great success in Data Mining applications. Nature has been very successful in providing clever and efficient solutions to different sorts of challenges and problems posed to organisms by ever-changing and unpredictable environments. It is easy to observe that strong scientific advances have been made when issues from different research areas are integrated. A particularly fertile integration combines biology and computing. Computational tools inspired on biological process can be found in a large number of applications. One of these applications is Data Mining, where computing techniques inspired on nervous systems; swarms, genetics, natural selection, immune systems and molecular biology have provided new efficient alternatives to obtain new, valid, meaningful and useful patterns in large datasets.

Finding information hidden in data is as theoretically difficult as it is practically important. With the objective of discovering unknown patterns from data, the methodologies of data mining were derived from statistics, machine learning, and artificial intelligence, and are being used successfully in application areas such as bioinformatics, business, health care, banking, retail, and many others. Advanced representation schemes and computational intelligence techniques such as rough sets, neural networks; decision trees; fuzzy logic; evolutionary algorithms; artificial immune systems; swarm intelligence; reinforcement learning, association rule mining, Web intelligence paradigms etc. have proved valuable when they are applied to Data Mining problems. Computational tools or solutions based on intelligent systems are being used with great success in Data Mining applications. It is also observed that strong scientific advances have been made when issues from different research areas are integrated.

Global optimization is a branch of applied mathematics and numerical analysis that deals with the task of finding the absolutely best set of admissible conditions to satisfy certain criteria / objective function(s), formulated in mathematical terms. Global optimization includes nonlinear, stochastic and combinatorial programming, multiobjective programming, control, games, geometry, approximation, algorithms for parallel architectures and so on. Due to its wide usage and applications, it has gained the attention of researchers and practitioners from a plethora of scientific domains. Typical practical examples of global optimization applications include: Traveling salesman problem and electrical circuit design (minimize the path length); safety engineering (building and mechanical structures); mathematical problems (Kepler conjecture); Protein structure prediction (minimize the energy function) etc.

Face sketch recognition is one of the recent biometrics,
which is used to identify criminals. In this paper, a
proposed model is used to identify face sketch images based
on local invariant features. In this model, two local invariant
feature extraction methods, namely, Scale Invariant Feature
Transform (SIFT) and Local Binary Patterns (LBP) are used
to extract local features from photos and sketches. Minimum
distance and Support Vector Machine (SVM) classifiers are used
to match the features of an unknown sketch with photos. Due to
high dimensional features, Direct Linear Discriminant Analysis
(Direct-LDA) is used. CHUK face sketch database images is used
in our experiments. The experimental results show that SIFT
method is robust and it extracts discriminative features than LBP.
Moreover, different parameters of SIFT and LBP are discussed
and tuned to extract robust and discriminative features.

Fish detection and identication are important steps towards
monitoring sh behavior. The importance of such monitoring step comes
from the need for better understanding of the sh ecology and issuing
conservative actions for keeping the safety of this vital food resource.
The recent advances in machine learning approaches allow many appli-
cations to easily analyze and detect a number of sh species. The main
competence between these approaches is based on two main detection
parameters: the time and the accuracy measurements. Therefore, this
paper proposes a sh detection approach based on BAT optimization
algorithm (BA). This approach aims to reduce the classication time
within the sh detection process. The performance of this system was
evaluated by a number of well-known machine learning classiers, KNN,
ANN, and SVM. The approach was tested with 151 images to detect the
Nile Tilapia sh species and the results showed that k-NN can achieve
high accuracy 90%, with feature reduction ratio close to 61% along with
a noticeable decrease in the classication time.

n/a