This article presents a new algorithm for searching odour sources across large search spaces with groups of mobile robots. The proposed algorithm is inspired in the particle swarm optimization (PSO) method. In this method, the search space is sampled by dynamic particles that use their knowledge about the previous sampled space and share this knowledge with other neighbour searching particles allowing the emergence of efficient local searching behaviours. In this case, chemical searching cues about the potential existence of upwind odour sources are exchanged. By default, the agents tend to avoid each other, leading to the emergence of exploration behaviours when no chemical cue exists in the neighbourhood. This behaviour improves the global searching performance.The article explains the relevance of searching odour sources with autonomous agents and identifies the main difficulties for solving this problem. A major difficulty is related with the chaotic nature of the odour transport in the atmosphere due to turbulent phenomena. The characteristics of this problem are described in detail and a simulation framework for testing and analysing different odour searching algorithms was constructed. The proposed PSO-based searching algorithm and modified versions of gradient-based searching and biased random walk-based searching strategies were tested in different environmental conditions and

In this work, we propose an approach that relies on cues from depth perception from RGB-D images, where features related to human body motion (3D skeleton features) are used on multiple learning classifiers in order to recognize human activities on a benchmark dataset. A Dynamic Bayesian Mixture Model (DBMM) is designed to combine multiple classifier likelihoods into a single form, assigning weights (by an uncertainty measure) to counterbalance the likelihoods as a posterior probability. Temporal information is incorporated in the DBMM by means of prior probabilities, taking into consideration previous probabilistic inference to reinforce current-frame classification. The publicly available Cornell Activity Dataset [1] with 12 different human activities was used to evaluate the proposed approach. Reported results on testing dataset show that our approach overcomes state of the art methods in terms of precision, recall and overall accuracy. The developed work allows the use of activities classification for applications where the human behaviour recognition is important, such as human-robot interaction, assisted living for elderly care, among others.

To improve applicability of automatic sleep staging an efficient subjectindependent method is proposed with application in sleep-wake detection and in multiclass sleep staging (awake, non-rapid eye movement (NREM) sleep and rapid eye movement (REM) sleep). In turn, NREM is further divided into three stages denoted here by N1, N2, and N3. To assess the method, polysomnographic (PSG) records of 40 patients from our ISRUC-Sleep dataset, which was scored by an expert clinician in the central hospital of Coimbra, are used. To find the best combination of PSG signals for automatic sleep staging, six electroencephalographic (EEG), two electrooculographic (EOG), and one electromyographic (EMG) channels are analyzed. An extensive set of feature extraction techniques are applied, covering temporal, frequency and timefrequency domains. The maximum overlap wavelet transform (MODWT), a shift invariant transform, was used to extract the features in time-frequency domain. The extracted feature set is transformed and normalized to reduce the effect of extreme values of features. The most discriminative features are selected through a two-step method composed by a manual selection step based on features' histogram analysis followed by an automatic feature selector. The selected feature set is classified using support vector machines (SVMs). The system achieved the best performance by combining 6 channels (C3, C4, O1, left EOG (LOC), right EOG (ROC) and chin EMG (X1)) for sleep-wake detection, and 9 channels (C3, C4, O1, O2, F3, F4, LOC, ROC, X1) for multiclass sleep staging.

The image of a planar mirror reflection (IPMR) can be interpreted as a virtual view of the scene, acquired by a camera with a pose symmetric to the pose of the real camera with respect to the mirror plane. The epipolar geometry of virtual views associated with different IPMRs is well understood, and it is possible to recover the camera motion and perform 3D scene reconstruction by applying standard structure-from-motion methods that use image correspondences as input. In this article we address the problem of estimating the pose of the real camera, as well as the positions of the mirror plane, by assuming that the rigid motion between N virtual views induced by planar mirror reflections is known. The solution of this problem enables the registration of objects lying outside the camera field-of-view, which can have important applications in domains like non-overlapping camera network calibration and robot vision. We show that the positions of the mirror planes can be uniquely determined by solving a system of linear equations. This enables to estimate the pose of the real camera in a straightforward closed-form manner using a minimum of N = 3 virtual views. Both synthetic tests and real experiments show the superiority of our approach with respect to current state-of-the-art methods.

No abstract

No abstract

No abstract

, A human activity recognition framework using max-min features and key poses with differential evolution random forests classifier,