Assessing human movement quality is essential in healthcare for diagnosing and monitoring musculoskeletal disorders. Traditional annotation methods are time-consuming and provide limited insights. In this work we present a web-based annotation tool tailored for efficient expert annotation of human exercises, featuring dual-angle RGB video views coupled with interactive 3D visualization of the movement and patient data integration. Through the concurrent streaming of 2D and 3D visualizations of a movement, the platform aims to streamline dataset creation, enhance annotation precision, and support the development of machine-learning based, Functional Capacity Evaluation (FCE) and rehabilitation systems.

Load-sensing floors are capable of tracking objects without suffering from occlusions nor posing the same privacy issues as cameras. They have been mostly used to analyze human gait as a way of continuous diagnosis but could also be placed alongside robots to help monitoring in specialized institutions, such as elderly care facilities. However, large-scale deployments necessitate cheap sensors which do not necessarily offer the same precision. With more noisy sensors, lighter robots might be difficult to track and precisely localize. In this article, we investigate various models in order to estimate the position of a robot. We experiment with several robots of different weights and compare the models' estimates against ground truth measurements provided by a motion capture system. We show that with standard-sized tiles of 60 cm, we can track even the lighter robots with less than 4 cm of error.

This paper introduces two novel algorithms for detecting groups of people standing or freely moving in a crowded environment. The proposed algorithms exploit low-level features extracted from videos. The first algorithm, the Link Method, uses a learning and forgetting strategy for modeling dynamics of proxemics between individuals. Two versions of this algorithm are proposed: they differ in the analysis of proxemics. The second one, called Interpersonal Synchrony Method, explicitly adopts interpersonal synchrony to refine clusters of persons detected by combining together proxemics and 2D field of view of individuals. The algorithms are evaluated on both simulated and real-world video sequences from state-of-the-art databases. Clustering metrics such as the Adjusted Mutual Information shows that our models outperform the approach based on F-formations. This work developed algorithms that can be readily applied in robotics, to allow robots to automatically detect groups in crowded environments.

In ambient intelligence, pressure sensing can be used for detecting and recognizing objects based on their load profile. This paper presents a pressure scanning technique that improves weight-based object recognition, by adding information about the surface of the object in contact with the floor. The new high-resolution pressure scanning technique employs sub-pixel shifting to assemble a series of low-resolution scans into an aggregated high-resolution scan. The proposed scanning device is composed of 4 load-sensing tiles, on which the scanned object slides in regular movements. The result is a regular grid image of the object's contact surface, containing the weight of each section of the grid, as well as the corresponding centers of mass. A formal proof-of-concept is provided, together with experimental results obtained both on a noiseless simulated platform, and on a noisy physical platform.

This paper presents a new taboo-list approach for multi-robot exploration of unknown structured environments, in which agents are implicitly guided in their navigation on a globally shared map. Agents have a local view of their environment, inside which they navigate in a asynchronous manner. When the exploration is complete, agents gather at a rendezvous point. The novelty consists in using a distributed exploration algorithm which is not guided by frontiers to perform this task. Using the Brick&Mortar Improved ant-algorithm as a base, we add robot-perspective vision, variable vision range, and an optimization which prevents agents from going to the rendezvous point before exploration is complete. The algorithm was evaluated in simulation on a set of standard maps.

This paper presents a new ant algorithm for the navigation of several robots, whose objective is to autonomously explore an unknown environment. When the coverage is completed, all robots move to a previously defined meeting point. The approach that we propose in this paper for solving this problem, considers that the robots build, while moving, a common and shared representation of the environment. In this representation, the environment is viewed as a graph (typically a set of connected cells in a regular grid), each grid cell having a local memory able to store a limited amount of data. A robot can write numbers on the cell on which it is lying. It can also read the values of the cells in its neighborhood, and perform some simple operations, such as computing the minimum of a set of values. Each robot is capable, contrary to most ant-based approaches, to determine, in a distributed way, when the environment coverage has completed. Few ant algorithms can do that. Brick&Mortar is one of them and this is why it retains a central place in our proposition. The novelty of our approach is that, due to an emerging property of the underlying algorithm, agents will finish their exploration at a predefined evacuation point. In addition, several improvements of the original Brick&Mortar algorithm are proposed in this paper, such as the possibility to use better local strategies at the robot level (using, for example, LRTA*). The paper also presents a set of benchmarks against the best existing ant algorithms on several widespread graph topologies.