Automatic citrus canker detection from leaf images captured in field

Citrus canker, a bacterial disease of citrus tree leaves, causes significant damage to citrus production worldwide. Effective and fast disease detection methods must be undertaken to minimize the losses of citrus canker infection. In this paper, we present a new approach based on global features and zone-based local features to detect citrus canker from leaf images collected in field which is more difficult than the leaf images captured in labs. Firstly, an improved AdaBoost algorithm is used to select the most significant features of citrus lesions for the segmentation of the lesions from their background. Then a canker lesion descriptor is proposed which combines both color and local texture distribution of canker lesion zones suggested by plant phytopathologists. A two-level hierarchical detection structure is developed to identify canker lesions. Thirdly, we evaluate the proposed method and its comparison with other approaches, and the experimental results show that the proposed approach achieves similar classification accuracy as human experts

Increasing allocated tasks with a time minimization algorithm for a search and rescue scenario

Rescue missions require both speed to meet strict time constraints and maximum use of resources. This study presents a Task Swap Allocation (TSA) algorithm that increases vehicle allocation with respect to the state-of-the-art consensus-based bundle algorithm and one of its extensions, while meeting time constraints. The novel idea is to enable an online reconfiguration of task allocation among distributed and networked vehicles. The proposed strategy reallocates tasks among vehicles to create feasible spaces for unallocated tasks, thereby optimizing the total number of allocated tasks. The algorithm is shown to be efficient with respect to previous methods because changes are made to a task list only once a suitable space in a schedule has been identified. Furthermore, the proposed TSA can be employed as an extension for other distributed task allocation algorithms with similar constraints to improve performance by escaping local optima and by reacting to dynamic environments

Classification of human hand movements using surface EMG for myoelectric control

© Springer International Publishing AG 2017.Surface electromyogram (sEMG) is a bioelectric signal that can be captured non-invasively by placing electrodes on the human skin. The sEMG is capable of representing the action intent of nearby muscles. The research of myoelectric control using sEMG has been primarily driven by the potential to create humanmachine interfaces which respond to users intentions intuitively. However, it is one of the major gaps between research and commercial applications that there are rarely robust simultaneous control schemes. This paper proposes one classification method and a potential real-time control scheme. Four machine learning classifiers have been tested and compared to find the best configuration for different potential applications, and non-negative matrix factorisation has been used as a pre-processing tool for performance improvement. This control scheme achieves its highest accuracy when it is adapted to a single user at a time. It can identify intact subjects hand movements with above 98% precision and 91% upwards for amputees but takes double the amount of time for decision-making

Cognitive and neuromuscular robotic rehabilitation framework

© Springer International Publishing AG 2017.This paper presents a cognitive and neuromuscular robotic rehabilitation framework to support enhanced control of arm movement for humans with muscular control impairment, typically with some level of memory deficiency due to, for example, suffering from a stroke. It describes the design, development and integration of the framework architecture as well as a Baxter robot based demonstration platform. Three key elements of the proposed framework (rehabilitation module, workspace and rehabilitation scenarios) have been described in detail. In the rehabilitation sessions, the users and the robot are asked to work together to place cubes so as to form a predefined shape. The robot and the user hold the same object in order to move it to a particular destination according to a rehabilitation scenario. If the robot detects a force from the user directed in the wrong direction during the navigation then it resists and corrects the movement in order to assist the user towards the right direction. The assistive support scenarios were designed to evaluate the achieved enhancement of precision, efficiency and dexterity of arm movements. The proposed rehabilitation framework provides a modular, automated and open-source platform for researchers and practitioners in neuromuscular rehabilitation applications

A novel approach for pilot error detection using Dynamic Bayesian Networks

In the last decade Dynamic Bayesian Networks (DBNs) have become one type of the most attractive probabilistic modelling framework extensions of Bayesian Networks (BNs) for working under uncertainties from a temporal perspective. Despite this popularity not many researchers have attempted to study the use of these networks in anomaly detection or the implications of data anomalies on the outcome of such models. An abnormal change in the modelled environment's data at a given time, will cause a trailing chain effect on data of all related environment variables in current and consecutive time slices. Albeit this effect fades with time, it still can have an ill effect on the outcome of such models. In this paper we propose an algorithm for pilot error detection, using DBNs as the modelling framework for learning and detecting anomalous data. We base our experiments on the actions of an aircraft pilot, and a flight simulator is created for running the experiments. The proposed anomaly detection algorithm has achieved good results in detecting pilot errors and effects on the whole system. © Springer Science+Business Media 2014

A heuristic distributed task allocation method for multivehicle multitask problems and its application to search and rescue scenario

Using distributed task allocation methods for cooperating multivehicle systems is becoming increasingly attractive. However, most effort is placed on various specific experimental work and little has been done to systematically analyze the problem of interest and the existing methods. In this paper, a general scenario description and a system configuration are first presented according to search and rescue scenario. The objective of the problem is then analyzed together with its mathematical formulation extracted from the scenario. Considering the requirement of distributed computing, this paper then proposes a novel heuristic distributed task allocation method for multivehicle multitask assignment problems. The proposed method is simple and effective. It directly aims at optimizing the mathematical objective defined for the problem. A new concept of significance is defined for every task and is measured by the contribution to the local cost generated by a vehicle, which underlies the key idea of the algorithm. The whole algorithm iterates between a task inclusion phase, and a consensus and task removal phase, running concurrently on all the vehicles where local communication exists between them. The former phase is used to include tasks into a vehicle’s task list for optimizing the overall objective, while the latter is to reach consensus on the significance value of tasks for each vehicle and to remove the tasks that have been assigned to other vehicles. Numerical simulations demonstrate that the proposed method is able to provide a conflict-free solution and can achieve outstanding performance in comparison with the consensus-based bundle algorithm

Robot competence development by constructive learning

This paper presents a constructive learning approach for developing sensor-motor mapping in autonomous systems. The system's adaptation to environment changes is discussed and three methods are proposed to deal with long term and short term changes. The proposed constructive learning allows autonomous systems to develop network topology and adjust network parameters. The approach is supported by findings from psychology and neuroscience especially during infants cognitive development at early stages. A growing radial basis function network is introduced as a computational substrate for sensory-motor mapping learning. Experiments are conducted on a robot eye/hand coordination testbed and results show the incremental development of sensory-motor mapping and its adaptation to changes such as in tool-use

S.A.R.A.H.: The bipedal robot with machine learning step decision making

Herein, we describe a custom-made bipedal robot that uses electromagnets for performing movements as opposed to conventional DC motors. The robot uses machine learning to stabilize its self by taking steps. The results of several machine learning techniques for step decision are described. The robot does not use electric motors as actuators. As a result, it makes imprecise movements and is inherently unstable. To maintain stability, it must take steps. Classifiers are required to learn from users about when and which leg to move to maintain stability and locomotion. Classifiers such as Decision tree, Linear/Quadratic Discriminant, Support Vector Machine, K-Nearest Neighbor, and Neural Networks are trained and compared. Their performance/accuracy is noted

Parameterization of point-cloud freeform surfaces using adaptive sequential learning RBFnetworks

We propose a self-organizing Radial Basis Function (RBF) neural network method for parameterization of freeform surfaces from larger, noisy and unoriented point clouds. In particular, an adaptive sequential learning algorithm is presented for network construction from a single instance of point set. The adaptive learning allows neurons to be dynamically inserted and fully adjusted (e.g. their locations, widths and weights), according to mapping residuals and data point novelty associated to underlying geometry. Pseudo-neurons, exhibiting very limited contributions, can be removed through a pruning procedure. Additionally, a neighborhood extended Kalman filter (NEKF) was developed to significantly accelerate parameterization. Experimental results show that this adaptive learning enables effective capture of global low-frequency variations while preserving sharp local details, ultimately leading to accurate and compact parameterization, as characterized by a small number of neurons. Parameterization using the proposed RBF network provides simple, low cost and low storage solutions to many problems such as surface construction, re-sampling, hole filling, multiple level-of-detail meshing and data compression from unstructured and incomplete range data. Performance results are also presented for comparison

How good are distributed allocation algorithms for solving urban search and rescue problems? A comparative study with centralized algorithms

In this paper, a modified centralized algorithm based on particle swarm optimization (MCPSO) is presented to solve the task allocation problem in the search and rescue domain. The reason for this paper is to provide a benchmark against distributed algorithms in search and rescue application area. The hypothesis of this paper is that a centralized algorithm should perform better than distributed algorithms because it has all the available information at hand to solve the problem. Therefore, the centralized approach will provide a benchmark for evaluating how well the distributed algorithms are working and how much improvement can still be gained. Among the distributed algorithms, the consensus-based bundle algorithm (CBBA) is a relatively recent method based on the market auction mechanism, which is receiving considerable attention. Other distributed algorithms, such as PI and PI with softmax, have shown to perform better than CBBA. Therefore, in this paper, the three distributed algorithms mentioned earlier are compared against three centralized algorithms. They are particle swarm optimization, MCPSO, described in this paper, and genetic algorithms. Two experiments were conducted. The first involved comparing all the above-mentioned algorithms, both centralized and distributed, using the same set of application scenarios. It is found that MCPSO always outperforms the other five algorithms in time cost. Due to the high failure rate of CBBA and the other two centralized methods, the second experiment focused on carrying out more tests to compare MCPSO against PI and PI with softmax. All the results are shown and analyzed to determine the performance gaps between the distributed algorithms and the MCPSO