Fitting a polygon to a set of points is a task that finds application in many scientific fields. In particular, in robot-based neurorehabilitation, it would be interesting to retrieve the shape that best fits with the path followed by a patient, and evaluate the performance based on the accuracy of the drawing. However, when dealing with a dataset sampled by a drawn trajectory, the methods proposed by the literature may not be exhaustive. In this work we propose a method to define the distance between a set of points and a polygon, which is used as cost function of a Genetic Algorithm to solve the polygon fitting problem. This method involves a novel space separation metrics to retrieve the correct polygon edge to be compared with each point of the set, featuring linear time complexity. We compared the proposed approach with the metrics known in the literature, finding that our method performs significantly better in retrieving the original polygon. Finally, we present a robot-based rehabilitation application in which the proposed method is used to evaluate the performance of a group of subjects. The achievements of twenty healthy subjects were compared with three stroke patients. Results emphasize significant differences between the two categories of subjects, proving that the proposed algorithm can quantitatively determine the degree of impairment of a stroke survivor and be used in the future as reference for monitoring and enhancing the efficiency of robot-based therapies.
|Titolo:||Convex polygon fitting in robot-based neurorehabilitation|
|Data di pubblicazione:||2018|
|Appare nelle tipologie:||1.1 Articolo su Rivista/Article|