The present study investigates users' movement behavior in a virtual environment when they attempted to avoid a virtual character. At each iteration of the experiment, four conditions (Self-Avatar LookAt, No Self-Avatar LookAt, Self-Avatar No LookAt, and No Self-Avatar No LookAt) were applied to examine users' movement behavior based on kinematic measures. During the experiment, 52 participants were asked to walk from a starting position to a target position. A virtual character was placed at the midpoint. Participants were asked to wear a head-mounted display throughout the task, and their locomotion was captured using a motion capture suit. We analyzed the captured trajectories of the participants' routes on four kinematic measures to explore whether the four experimental conditions influenced the paths they took. The results indicated that the Self-Avatar LookAt condition affected the path the participants chose more significantly than the other three conditions in terms of length, duration, and deviation, but not in terms of speed. Overall, the length and duration of the task, as well as the deviation of the trajectory from the straight line, were greater when a self-avatar represented participants. An additional effect on kinematic measures was found in the LookAt (Gaze) conditions. Implications for future research are discussed.
A number of studies have used distance metrics between trajectories @cite_33 @cite_6 @cite_10 . @cite_40 proposed a set of metrics, namely the mean radius of curvature along the full path, the maximum Euclidean distance from a straight line between the origin and the target, and the minimum Euclidean distance between the path and the obstacles of the virtual environment. Principal component analysis of a set of trajectories has also been used @cite_35 . The stride length, step width, variability in stride velocity, and variability in step width have also been used to evaluate and compare trajectories generated in virtual and real environments based on the gait cycle of walkers @cite_29 @cite_11 . Finally, @cite_5 proposed nine metrics related to the shape, performance, and kinematic features that could be used to compare virtual and real trajectories. To evaluate the participants' trajectories in the current study, we adopted metrics proposed in @cite_5 .
@cite_35 @cite_33 @cite_29 @cite_6 @cite_40 @cite_5 @cite_10 @cite_11
2543099233 2140017549 2182206537 2106053110
This paper addresses the problem of understanding the shape of the locomotor trajectories for a human being walking in an empty space to reach a goal defined both in position and in direction. Among all the possible trajectories reaching a given goal what are the fundamental reasons to chose one trajectory instead of another (see Fig. (1))? The underlying idea to attack this question has been to relate this problem to an optimal control problem: the trajectory is chosen according to some optimization principle. This is our basic starting assumption. The subject being viewed as a controlled system, the question becomes what criteria is optimized? Is it the time to perform the trajectory? the length of the path? the minimum jerk along the path?... In this study we show that the human locomotor trajectories are well approximated by the geodesics of a differential system minimizing the L2 norm of the control. Such geodesics are made of arcs of clothoids. The clothoid or Cornu spiral is a curve, whose curvature grows with the distance from the origin. The study is based on an experimental protocol involving 7 subjects. They had to walk within a motion capture room from a fixed starting point, and to cross over distant porches from which both position in the room and orientation were changing over trials. In this paper, we introduce a set of novel distance metrics that use model based representations for trajectories. We determine the similarity of trajectories using the conformity of the corresponding HMM models. These metrics enable the comparison of tracjectories without any limitations of the conventional measures. They accurately identify the coordinate, orientation, and speed affinity. The proposed HMM based distance metrics can be used not only for ground truth comparisons but for clustering as well. Our experiments prove that they have superior discriminative properties. We are interested in supervised metric learning of Mahalanobis like distances. Existing approaches mainly focus on learning a new distance using similarity and dissimilarity constraints between examples. In this paper, instead of bringing closer examples of the same class and pushing far away examples of different classes we propose to move the examples with respect to virtual points. Hence, each example is brought closer to a a priori defined virtual point reducing the number of constraints to satisfy. We show that our approach admits a closed form solution which can be kernelized. We provide a theoretical analysis showing the consistency of the approach and establishing some links with other classical metric learning methods. Furthermore we propose an efficient solution to the difficult problem of selecting virtual points based in part on recent works in optimal transport. Lastly, we evaluate our approach on several state of the art datasets. The accuracy of k-nearest neighbor (kNN) classification depends significantly on the metric used to compute distances between different examples. In this paper, we show how to learn a Mahalanobis distance metric for kNN classification from labeled examples. The Mahalanobis metric can equivalently be viewed as a global linear transformation of the input space that precedes kNN classification using Euclidean distances. In our approach, the metric is trained with the goal that the k-nearest neighbors always belong to the same class while examples from different classes are separated by a large margin. As in support vector machines (SVMs), the margin criterion leads to a convex optimization based on the hinge loss. Unlike learning in SVMs, however, our approach requires no modification or extension for problems in multiway (as opposed to binary) classification. In our framework, the Mahalanobis distance metric is obtained as the solution to a semidefinite program. On several data sets of varying size and difficulty, we find that metrics trained in this way lead to significant improvements in kNN classification. Sometimes these results can be further improved by clustering the training examples and learning an individual metric within each cluster. We show how to learn and combine these local metrics in a globally integrated manner.