arXiv research

The paper presents a method to reduce arm motion complexity for prosthetics and robotics.

We conduct cluster analysis on a class of locally asymptotically self-similar stochastic processes, which includes multifractional Brownian motion as a representative. When the true number of clusters is supposed to be known, a new covariance-based dissimilarity measure is introduced, from which we obtain the approxima…

We present a robust multiple manifolds structure learning (RMMSL) scheme to robustly estimate data structures under the multiple low intrinsic dimensional manifolds assumption. In the local learning stage, RMMSL efficiently estimates local tangent space by weighted low-rank matrix factorization. In the global learning …

A framework clusters vehicle motion trajectories efficiently.

New method separates market motion from stock correlations.

Subspace clustering is a growing field of unsupervised learning that has gained much popularity in the computer vision community. Applications can be found in areas such as motion segmentation and face clustering. It assumes that data originate from a union of subspaces, and clusters the data depending on the correspon…

A measure called relative cluster entropy distinguishes between correlated and uncorrelated sequences.

Paper shows affine constraint is unnecessary for high-dimensional data.

This study uses moving average cluster entropy to analyze financial market dynamics.

New model uses variance-Hawkes process to fit energy market returns.

In this article, we will formulate a mathematical framework that allows us to treat character animations as points on infinite dimensional Hilbert manifolds. Constructing geodesic paths between animations on those manifolds allows us to derive a distance function to measure similarities of different motions. This appro…

Unified framework for clustering with sparse convex combinations.

Considering the driving habits which are learned from the naturalistic driving data in the path-tracking system can significantly improve the acceptance of intelligent vehicles. Therefore, the goal of this paper is to generate the prediction results of lateral commands with confidence regions according to the reference…

Ankle sprains and instability are major public health concerns. Up to 70% of individuals do not fully recover from a single ankle sprain and eventually develop chronic ankle instability (CAI). The diagnosis of CAI has been mainly based on self-report rather than objective biomechanical measures. The goal of this study …

A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of unknown subspaces $\mathscr{U}=\underset{i=1}{\overset{M}\bigcup}S_i$. The similarity matrices thus c…

A lens cluster minimizes perimeter in the plane with given area constraints.

Complex network analysis reveals dominant stocks in financial stock returns correlations.

Sparse subspace clustering (SSC) is an elegant approach for unsupervised segmentation if the data points of each cluster are located in linear subspaces. This model applies, for instance, in motion segmentation if some restrictions on the camera model hold. SSC requires that problems based on the $l_1$-norm are solved …

Low-rank matrix is desired in many machine learning and computer vision problems. Most of the recent studies use the nuclear norm as a convex surrogate of the rank operator. However, all singular values are simply added together by the nuclear norm, and thus the rank may not be well approximated in practical problems. …

This paper presents a novel context-based approach for pedestrian motion prediction in crowded, urban intersections, with the additional flexibility of prediction in similar, but new, environments. Previously, Chen et. al. combined Markovian-based and clustering-based approaches to learn motion primitives in a grid-bas…

Matrix rank minimization problem is in general NP-hard. The nuclear norm is used to substitute the rank function in many recent studies. Nevertheless, the nuclear norm approximation adds all singular values together and the approximation error may depend heavily on the magnitudes of singular values. This might restrict…

GCAO improves clustering of high-dimensional data by grouping low-density boundary points.

Matrix rank minimizing subject to affine constraints arises in many application areas, ranging from signal processing to machine learning. Nuclear norm is a convex relaxation for this problem which can recover the rank exactly under some restricted and theoretically interesting conditions. However, for many real-world …

We consider the problem of subspace clustering: given points that lie on or near the union of many low-dimensional linear subspaces, recover the subspaces. To this end, one first identifies sets of points close to the same subspace and uses the sets to estimate the subspaces. As the geometric structure of the clusters …

We consider the problem of clustering noisy finite-length observations of stationary ergodic random processes according to their generative models without prior knowledge of the model statistics and the number of generative models. Two algorithms, both using the $L^1$-distance between estimated power spectral densities…

A low-rank transformation learning framework for subspace clustering and classification is here proposed. Many high-dimensional data, such as face images and motion sequences, approximately lie in a union of low-dimensional subspaces. The corresponding subspace clustering problem has been extensively studied in the lit…

There exist many approaches for description and recognition of unseen classes in datasets. Nevertheless, it becomes a challenging problem when we deal with multivariate time-series (MTS) (e.g., motion data), where we cannot apply the vectorial algorithms directly to the inputs. In this work, we propose a novel multiple…

Market dynamic is quantified in terms of the entropy $S(τ,n)$ of the clusters formed by the intersections between the series of the prices $p_t$ and the moving average $\widetilde{p}_{t,n}$. The entropy $S(τ,n)$ is defined according to Shannon as $\sum P(τ,n)\log P(τ,n),$ with $P(τ,n)$ the probability for the cluster t…

The hidden Markov model (HMM) is a widely-used generative model that copes with sequential data, assuming that each observation is conditioned on the state of a hidden Markov chain. In this paper, we derive a novel algorithm to cluster HMMs based on the hierarchical EM (HEM) algorithm. The proposed algorithm i) cluster…

Community recovery is a central problem that arises in a wide variety of applications such as network clustering, motion segmentation, face clustering and protein complex detection. The objective of the problem is to cluster data points into distinct communities based on a set of measurements, each of which is associat…

We investigate the general problem of how to model the kinematics of stock prices without considering the dynamical causes of motion. We propose a stochastic process with long-range correlated absolute returns. We find that the model is able to reproduce the experimentally observed clustering, power law memory, fat tai…

The vision of automated driving is to increase both road safety and efficiency, while offering passengers a convenient travel experience. This requires that autonomous systems correctly estimate the current traffic scene and its likely evolution. In highway scenarios early recognition of cut-in maneuvers is essential f…

In many real-world problems, we are dealing with collections of high-dimensional data, such as images, videos, text and web documents, DNA microarray data, and more. Often, high-dimensional data lie close to low-dimensional structures corresponding to several classes or categories the data belongs to. In this paper, we…

Long-term human motion can be represented as a series of motion modes---motion sequences that capture short-term temporal dynamics---with transitions between them. We leverage this structure and present a novel Motion Transformation Variational Auto-Encoders (MT-VAE) for learning motion sequence generation. Our model j…

Introduces Motion Programs for better video analysis of human motion.

Study motion planning for points avoiding obstacles in a plane.

Programmatic Motion Concepts learn human actions from paired videos.

Unified framework for human motion generation on Riemannian manifolds.

Study on determinants of unitary Brownian motion and their asymptotic laws.

Data-driven modelling and synthesis of motion is an active research area with applications that include animation, games, and social robotics. This paper introduces a new class of probabilistic, generative, and controllable motion-data models based on normalising flows. Models of this kind can describe highly complex d…

Study refracted skew Brownian motion, find densities and asymptotics.

Neural network predicts vessel motions with high accuracy.

Study fractal dimension for motion without crossing a subset.

Let $E$ be a closed set in the Riemann sphere $\widehat{\mathbb{C}}$. We consider a holomorphic motion $φ$ of $E$ over a complex manifold $M$, that is, a holomorphic family of injections on $E$ parametrized by $M$. It is known that if $M$ is the unit disk $Δ$ in the complex plane, then any holomorphic motion of $E$ ove…

Study cohomological equation for robotic screw motions on SE(3).

New approach for obstacle avoidance in robotics using learned representations.

Paper defines multi-dimensional fractional Brownian motion under volatility uncertainty.

This paper extends subordinated models to include stochastic time changes, improving financial modeling.