Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

17355269 · Feb 202019922001200920172026
48 results for motion segmentation

This paper presents a novel yet intuitive approach to unsupervised feature learning. Inspired by the human visual system, we explore whether low-level motion-based grouping cues can be used to learn an effective visual representation. Specifically, we use unsupervised motion-based segmentation on videos to obtain segme…

2016-12-19abs ↗pdf ↗

We provide a proof and analyze the asymptotic behavior of a formula for the linking number of line segments.

problem The invariant formula for the linking number of line segments and its asymptotic behavior.
method Detailed proof and asymptotic analysis of the formula.
result We provide a proof and analyze the asymptotic behavior of the formula for the linking number of line segments.

Study examines how body segments respond to random vibrations.

problem Understanding human body responses to random vibrations.
method 35 participants were tested with random noise signals. Multiple linear regression models were created to determine influential predictors of peak translational gains.
result Multiple predictors, including motion direction and body segment, significantly influence peak translational gains.

The paper learns pose variations within shape populations using constrained mixtures of factor analyzers.

problem Learning pose variations within a shape population with articulated parts and relative rotations.
method Formulated as mixtures of factor analyzers, segmentation by component posterior probabilities, and constraints on factor loading matrices for rotation matrices.
result Automatic learning of pose variations from shape populations, resulting in smooth and realistic animations.

Active learning improves subspace clustering with less labeled data.

problem Efficiently incorporating labeled data to improve subspace clustering models.
method Proposes an active learning framework for subspace clustering that queries informative points and updates the subspace model.
result Demonstrates the advantage of the proposed active strategy over state-of-the-art methods.

Proposes a new convolutional neural network for non-grid data.

problem Limited applicability of standard CNNs to non-grid structured data.
method Introduces Parametric Continuous Convolution (PCC) with learnable kernel functions.
result Significant improvement in point cloud segmentation and lidar motion estimation.

Vision problems ranging from image clustering to motion segmentation to semi-supervised learning can naturally be framed as subspace segmentation problems, in which one aims to recover multiple low-dimensional subspaces from noisy and corrupted input data. Low-Rank Representation (LRR), a convex formulation of the subs…

2013-04-20abs ↗pdf ↗

Generative models learn from unlabeled videos via object segmentation and scene modeling.

problem Learning generative models from unlabelled videos.
method Decomposed into three subtasks: motion segmentation, background and foreground modeling, and scene sampling.
result Approach allows learning models that generalize beyond occlusions and represent scenes in a modular fashion.

Synthetic learning improves neonatal brain MRI segmentation robustness.

problem Challenges in neonatal brain MRI segmentation due to image contrast and anatomical variations.
method Synthetic learning model trained on few T2-weighted volumes, then enhanced with motion artifacts and over-segmentation.
result Synthetic learning robust to image contrast and improves segmentation of both T1- and T2-weighted images.

Deep learning has thrived by training on large-scale datasets. However, in robotics applications sample efficiency is critical. We propose a novel adaptive masked proxies method that constructs the final segmentation layer weights from few labelled samples. It utilizes multi-resolution average pooling on base embedding…

2019-02-19abs ↗pdf ↗

Proposes a hybrid deep learning network for better heart failure survival prediction.

problem Improving survival prediction in heart failure patients.
method Joint analysis of cardiac motion features and clinical risk factors using a hybrid deep learning network.
result Optimal integration of clinical risk factors into deep prediction networks.

Cilia are hairlike structures protruding from nearly every cell in the body. Diseases known as ciliopathies, where cilia function is disrupted, can result in a wide spectrum of disorders. However, most techniques for assessing ciliary motion rely on manual identification and tracking of cilia; this process is laborious…

2018-03-20abs ↗pdf ↗

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 …

2012-06-18abs ↗pdf ↗

In this article we extend the computational geometric curve reconstruction approach to curves in Riemannian manifolds. We prove that the minimal spanning tree, given a sufficiently dense sample, correctly reconstructs the smooth arcs and further closed and simple curves in Riemannian manifolds. The proof is based on th…

2010-12-15abs ↗pdf ↗

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

problem Reducing the complexity of human arm motions for robotic and prosthetic control.
method Data-driven techniques including DTW, DBA, Ward's distance, batch-DTW, and fPCA.
result Representative motion clusters and averages for different arm DOF levels.

Motion analysis is used in computer vision to understand the behaviour of moving objects in sequences of images. Optimising the interpretation of dynamic biological systems requires accurate and precise motion tracking as well as efficient representations of high-dimensional motion trajectories so that these can be use…

2018-10-08abs ↗pdf ↗

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

problem The necessity of an affine constraint in affine subspace clustering.
method Theoretical and empirical analysis of conditions for correctness of affine subspace clustering methods.
result Affine constraint has negligible effect on clustering performance for high-dimensional data.

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 l1l_1-norm are solved …

2016-09-16abs ↗pdf ↗

DGE learns event representations from image sequences without manual annotations.

problem Data hunger and domain adaptation issues in self-supervised learning for temporal segmentation.
method Dynamic Graph Embedding (DGE) learns event representations by iteratively updating a graph and its embedding.
result DGE achieves robust temporal segmentation on benchmark datasets, outperforming state-of-the-art methods.

Is it possible to generally construct a dynamical system to simulate a black system without recovering the equations of motion of the latter? Here we show that this goal can be approached by a learning machine. Trained by a set of input-output responses or a segment of time series of a black system, a learning machine …

2017-07-24abs ↗pdf ↗

We prove that any properly oriented C2,1C^{2,1} isometric immersion of a positively curved Riemannian surface M into Euclidean 3-space is uniquely determined, up to a rigid motion, by its values on any curve segment in M. A generalization of this result to nonnegatively curved surfaces is presented as well under suitable…

2018-05-07abs ↗pdf ↗

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…

2015-10-30abs ↗pdf ↗

Tracking large numbers of densely-arranged, interacting objects is challenging due to occlusions and the resulting complexity of possible trajectory combinations, as well as the sparsity of relevant, labeled datasets. Here we describe a novel technique of collective tracking in the model environment of a 2D honeybee hi…

2018-12-31abs ↗pdf ↗

We propose a Bayesian nonparametric approach to the problem of jointly modeling multiple related time series. Our approach is based on the discovery of a set of latent, shared dynamical behaviors. Using a beta process prior, the size of the set and the sharing pattern are both inferred from data. We develop efficient M…

2011-11-17abs ↗pdf ↗

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 …

2015-08-18abs ↗pdf ↗

Extends Shifts dataset for MS lesion segmentation and marine vessel power estimation.

problem Distributional shift in training and deployment data for ML models.
method Develops new datasets for high-risk industrial applications.
result Demonstrates robustness and uncertainty estimation in new industrial tasks.

Segmental structure is a common pattern in many types of sequences such as phrases in human languages. In this paper, we present a probabilistic model for sequences via their segmentations. The probability of a segmented sequence is calculated as the product of the probabilities of all its segments, where each segment …

2017-02-24abs ↗pdf ↗

Bayesian nonparametric method segments multi-sequence time series data.

problem Temporal segmentation of multi-sequence time series data into stationary segments.
method Gaussian process priors and nonparametric distribution for segment partitioning.
result Model effectively segments synthetic and real-time series data.

BiPE blends intra-segment and inter-segment encodings for better length extrapolation.

problem Improving length extrapolation in language models.
method Bilevel Positional Encoding (BiPE) that separates intra-segment and inter-segment encodings.
result BiPE enhances length extrapolation across various text modalities.

CNNs can be trained with clinically available segmentations for OARs in radiotherapy.

problem Lack of dedicated training volumes for CNNs in radiotherapy.
method Used clinically available segmentations from PACS, applied multi-label segmentation, empirically assessed training set size.
result Clinically available segmentations can be used to train an accurate OAR segmentation model.