You are on page 1of 3

Applied Soft Computing Journal 97 (2020) 106675

Contents lists available at ScienceDirect

Applied Soft Computing Journal


journal homepage: www.elsevier.com/locate/asoc

Editorial

Special Issue on Evolutionary Computer Vision, Image Processing and


Pattern Recognition

Overview process and finalise this special issue. Following three rounds of
rigorous review process, 12 high quality papers were selected and
The intertwining disciplines of computer vision, image anal- published in this volume. For presentation and reading conve-
ysis, signal processing and pattern recognition are major fields nience, we categorise the 12 papers into two sections: Evolution-
of computer science, computer engineering, and electrical and ary Computation for Computer Vision and Image Processing, and
electronic engineering, which have attracted the interest of many Evolutionary Computation for Pattern Recognition.
researchers. The past and ongoing research covers a wide range of
topics and tasks, from pure research to a huge num- ber of real- Evolutionary computer vision and image processing
world industrial applications. To deal with these problems/tasks,
many traditional and recent methods, algorithms and techniques
In this special issue, we have collected seven papers using
have been developed, among which evolutionary computation
evolutionary computation techniques for computer vision and
(EC), including evolutionary algorithms, swarm intelligence and
other paradigms, has played an increasingly important role. The image processing.
terms Evolutionary Computer Vision, Evolutionary Image Anal- The first paper, entitled ‘‘A combination of spectral graph
ysis, and Evolutionary Pattern Recognition are more and more theory and quantum genetic algorithm to find relevant set of
commonly accepted as descriptors of a clearly defined research electrodes for motor imagery classification’’, presents a new elec-
area and family of techniques and applications. This has also been trodes selection method for binary motor imagery classification
favoured by the recent availability of environments for computer that combines the graph theoretic spectral method and the quan-
hardware and systems such as GPUs and grid/cloud/parallel com- tum genetic algorithm in order to select the electrodes that are
puting systems, whose architecture and computation paradigm fit most relevant to motor imagery. The proposed method aims to
EC algorithms extremely well, alleviating the intrinsically heavy optimise the number of electrodes by removing irrelevant and re-
computational burden imposed by such techniques and allowing dundant electrodes. Stationary Common Spatial Patterns (CSP) are
even for the development of real-time applications. used for extracting features from the selected electrodes while
This special issue has brought together researchers to report support vector machines handle the classification of the extracted
state-of-the-art contributions on the latest research and devel- features. The experimental results on a publicly available dataset
opment, up-to-date issues, and challenges in the field of Evolu- show that the proposed method has significantly outperformed
tionary Computer Vision, Image Processing, Pattern Recognition the existing CSP and its variants.
and related applications. The new theories and methods in dif- The second paper included in the special issue is entitled
ferent EC paradigms include evolutionary algorithms such as ge- ‘‘Human mental search-based multilevel thresholding for image
netic algorithms (GAs), genetic programming (GP) and evolution- segmentation’’. A new multilevel thresholding method is pro-
ary strategies (ES), swarm intelligence methods such as particle posed in this paper that aims at utilising a human mental search
swarm optimisation (PSO) and differential evolution (DE), and evolutionary algorithm to automatically find an optimal set of
other EC approaches such as evolutionary multi-objective optimi-
thresholding values. The performance of the proposed method
sation, evolutionary learning, and memetic computing. The com-
has been assessed and compared to that of seven other evolution-
puter vision and image processing applications include edge de-
ary computation methods on a publicly and widely used dataset.
tection, image segmentation, image reconstruction, image feature
The results show the superiority of the newly introduced method
extraction, image and object detection and classification, vehicle
plate detection, face detection and recognition, image encryp- where significantly better performance is achieved compared to
tion, texture image analysis, handwritten recognition, and visual the competitor methods.
tracking. The pattern recognition tasks comprise classification, ‘‘An evolutionary hyper-heuristic to optimise deep belief net-
regression, clustering, feature selection/construction and dimen- works for image reconstruction’’ utilises an evolutionary hyper-
sionality reduction, generalisation, unbalanced data processing, heuristic method to optimise Deep Belief Networks (DBNs) for
and medical and bio-medical data analysis. image reconstruction. The proposed method searches automati-
We have received 135 papers after publicly distributing the cally for a suitable set of parameters to improve the performance
Call-For-Papers on 1 July 2017. With the record number of sub- of DBNs. A non-parametric statistical test is used to select a
missions and variations of the article types during review and re- subset of effective operators for the different phases to reduce
visions, it took much longer than expected to complete the review the search space. Using three benchmark image datasets, the

https://doi.org/10.1016/j.asoc.2020.106675
1568-4946/© 2020 Published by Elsevier B.V.
S. Cagnoni, H. Al-Sahaf, Y. Sun et al. Applied Soft Computing Journal 97 (2020) 106675

performance of the proposed method is assessed and compared to The second paper ‘‘Hybridization of Chaos and Flower Polli-
four other evolutionary computation methods. The experimental nation Algorithm over K-Means for data clustering’’ hybridizes
results show that the proposed method outperforms all the other the Chaos and Flower Pollination algorithms to improve the effi-
methods on the three datasets. ciency of the k-means clustering algorithm by minimising cluster
The fourth paper ‘‘Particle swarm optimization Markov Chain
integrity. Using 16 benchmark datasets, the performance of the
Monte Carlo for accurate visual tracking with adaptive template
proposed method has been assessed and compared to that 4of
update’’ proposes a novel tracking method to infer a target state
and appearance template simultaneously, which can accurately six benchmark methods. The experimental results show that the
estimate the target state and robustly update the target template. newly introduced algorithm outperforms the other algorithms in
To tackle the joint inference, the proposed method is used for most cases and largely improves the performance of k-means
finding the target state and locating the appearance template clustering.
by combining PSO and Markov chain Monte Carlo sampling. Ex- ‘‘Toxicity risks evaluation of unknown FDA biotransformed
perimental results demonstrate that the proposed tracker adap- drugs based on a multi-objective feature selection approach’’
tively updates the target template and outperforms state-of-the- considers the importance of evaluating the risk factors of un-
art tracking methods on a benchmark dataset. known biotransformed drugs in drug development, as well as
The paper entitled ‘‘Automatic adjustment of the pulse-coupled
the time-consuming and the expensive nature of the current
neural network hyperparameters based on differential evolution
and cluster validity index for image segmentation’’ proposes a evaluation methods. The authors propose a multi-objective opti-
method using Differential Evolution (DE) to optimise the hy- misation algorithm to minimise the number of selected features
perparameters of the pulse-coupled neural networks for image and maximise the dependency degree of the descriptors for an
segmentation applications. The proposed method utilises the effective evaluation. The experimental results show that the pro-
cluster validity index as the fitness function, which defines a posed algorithm achieves high accuracy in forecasting all toxic
relationship between inter-group separation and intra-group co- effects, which indicates the applicability of the proposed method
hesion. The proposed method is tested on a dataset of natural in the early stage of the drug development.
images. The experimental results reveal the promising perfor- The paper entitled ‘‘Mining significant fuzzy association rules
mance of the proposed method on the mean Jaccard value and
with differential evolution algorithm’’ presents a new differential
the entropy criterion. Besides this, the proposed method is also
evolution algorithm for mining optimised statistically significant
tested on two modalities of medical images to demonstrate the
applicability of the proposed method to other kinds of images. fuzzy association rules with strict control over the risk of spurious
‘‘Kapurs entropy based optimal multilevel image segmenta- rules. The most distinctive feature of the proposed algorithm
tion using Crow Search Algorithm’’ concerns image segmenta- lies in the risk control over generating spurious rules and is
tion using a multilevel thresholding schema, and presents the realised via two new statistically sound significance tests on the
Kapur’s entropy-based Crow Search algorithm to estimate the rules. Case studies on hotel room price determinants and wildfire
optimal values of the multilevel thresholds. In the presented risk factors demonstrate the practical usefulness of the proposed
algorithm, Kapur’s entropy is used as an objective function during algorithm.
the optimisation process. The proposed algorithm is validated
The last paper included in this section, entitled ‘‘An improved
on benchmark images for 2, 4, 8, 16 and 32 threshold values,
runner-root algorithm for solving feature selection problems
and compared with PSO, DE, Grey Wolf Optimiser, Moth Flame
Optimisation, and Cuckoo Search. The experimental results show based on rough sets and neighborhood rough sets’’, aims at
that the proposed algorithm performs better than the ones used solving the feature selection problem from datasets containing a
as references. large number of redundant features, by hybridising the rough set
The seventh paper ‘‘A metaheuristic-driven approach to fine- and neighbourhood rough set methods. Although both methods
tune Deep Boltzmann Machines’’ adopts various metaheuristic are powerful, they suffer from high time complexity. To address
optimisation techniques from different swarm intelligence algo- this concern, a new metaheuristic algorithm named the runner-
rithms for the task of fine-tuning the hyperparameters of deep root algorithm is introduced into both methods. The performance
Boltzmann machines. The performance of the proposed method of the proposed approach is validated on the UCI datasets, and
has been assessed on three benchmark datasets for binary re-
the experimental results show the superiority of the proposed
construction. The experimental results show that the proposed
method has obtained comparable results to the existing methods algorithm over the state-of-the-art metaheuristic algorithms.
on those datasets without using expensive resources.

Evolutionary pattern recognition Declaration of competing interest

This special issue also includes five papers that apply evolu-
The authors declare that they have no known competing finan-
tionary computation techniques to pattern recognition problems.
The paper entitled ‘‘Investigating the impact of data normaliza- cial interests or personal relationships that could have appeared
tion on classification performance’’ presents an investigation of to influence the work reported in this paper.
the impact of fourteen data normalisation techniques on classifi-
cation in conjunction with feature selection and feature weight-
ing techniques. Furthermore, the paper proposes a modified ant Acknowledgments
lion optimisation method to automatically search the feature
space and select the best feature weights along with the parame-
The guest editors of this special issue would like to thank the
ter of the nearest neighbour classifier. The experimental results
reveal that there is not any single global data normalisation authors for submitting their valuable research outcomes as well
method that is better than all others. Hence, the paper suggests a as the reviewers who have critically evaluated the papers. We
set of the best and worst methods for different feature selection sincerely hope and expect that readers will find this special issue
and weighting tasks. useful.
2
S. Cagnoni, H. Al-Sahaf, Y. Sun et al. Applied Soft Computing Journal 97 (2020) 106675

Special issue guest editors Yanan Sun


Stefano Cagnoni College of Computer Science, Sichuan University, Chengdu, China
Department of Engineering and Architecture, University of
Parma, Parma, Italy Bing Xue
Mengjie Zhang
Harith Al-Sahaf Evolutionary Computation Research Group, School of Engineering
Evolutionary Computation Research Group, School of Engineering and Computer Science, Victoria University of
and Computer Science, Victoria University of Wellington, Wellington, New Zealand
Wellington, Wellington, New Zealand

You might also like