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,657 papers · 148 categories

Trend · papers per month

84168251335 · Jun 202019922001200920172026
48 results for point tracking

Paper introduces TAP-Vid, a benchmark for tracking any point in videos.

problem Tackles the problem of tracking arbitrary physical points on surfaces over longer video clips.
method Formalizes the problem as TAP, introduces TAP-Vid benchmark, uses crowdsourced pipeline with optical flow estimates, proposes TAP-Net model.
result TAP-Net outperforms all prior methods on TAP-Vid benchmark when trained on synthetic data.

This paper proposes a DGP approach with UCBs for point target tracking over WSNs.

problem Uncertainty quantification in distributed machine learning-based tracking over WSNs.
method Distributed Gaussian process (DGP) approach with upper confidence bounds (UCBs).
result UCBs provide 88% and 42% higher probability of encompassing true target states in X and Y coordinates, respectively.

SoccerCPD detects tactical changes in soccer matches using spatiotemporal tracking data.

problem Detecting consistent team formations in fluid sports like soccer.
method Two-step change-point detection: formation and role changes.
result Accurately detects tactical changes and estimates formation and role assignments.

PiVoT improves real-time multi-object detection and tracking in clutter.

problem Challenges in multi-object detection and tracking from noisy point clouds.
method Variational inference for fast, clutter-resilient multi-object tracking.
result Substantial performance improvement over existing Bayesian trackers.

The study of random walks on hyperbolic spaces and Teichmüller spaces, proving central limit theorems and geodesic tracking.

problem Analyzing random walks on hyperbolic and Teichmüller spaces.
method Proving central limit theorems and geodesic tracking using finite moments and logarithmic moments.
result Translation lengths of random isometries satisfy a central limit theorem if and only if the random walk has finite second moment.

EggNet reconstructs particle tracks from hits using evolving graph attention networks.

problem Particle track reconstruction is computationally expensive and combinatorial.
method EggNet uses a one-shot object condensation approach with evolving graph attention networks.
result EggNet outperforms methods requiring fixed input graphs on TrackML dataset.

New data-driven Cartan connection tracks complex vascular structures.

problem Tracking complex vascular structures in multi-orientation images.
method Formulated a data-driven Cartan connection on M2\mathbb{M}_2 for geodesic tracking.
result Improved geodesic tracking of vascular trees with globally optimal curves.

Classifies knots in the Poincaré sphere, using fixed points and folding automata.

problem Classifying knots in the Poincaré sphere and understanding their properties.
method Theory of train tracks, folding automata, and knot Floer homology.
result Almost completely classified genus-two, hyperbolic, fibered knots.

In this paper we develop the metric theory for the outer space of a free product of groups. This generalizes the theory of the outer space of a free group, and includes its relative versions. The outer space of a free product is made of GG-trees with possibly non-trivial vertex stabilisers. The strategies are the same…

2013-12-15abs ↗pdf ↗

Global results are proved about the way in which Boyland's forcing partial order organizes a set of braid types: those of periodic orbits of Smale's horseshoe map for which the associated train track is a star. This is a special case of a conjecture introduced in a previous paper, which claims that forcing organizes al…

2002-04-10abs ↗pdf ↗

A new method for distributed optimization with noisy function evaluations.

problem Distributed optimization with noisy function evaluations.
method Zero-order one-point estimate with distributed stochastic gradient-tracking technique.
result The method converges almost surely to the optimum with a rate of O(1k)O(\frac{1}{\sqrt{k}}).

The paper studies the action of automorphisms on train tracks and finds that the set of minimally displaced points is co-compact.

problem The study of automorphisms and their action on train tracks in free products.
method Analysis of train track points and minimally displaced set under cyclic subgroup generated by automorphisms.
result The minimally displaced set is co-compact under the action of the cyclic subgroup generated by the automorphism.

Cascading chains of events are a salient feature of many real-world social, biological, and financial networks. In social networks, social reciprocity accounts for retaliations in gang interactions, proxy wars in nation-state conflicts, or Internet memes shared via social media. Neuron spikes stimulate or inhibit spike…

2014-08-29abs ↗pdf ↗

Improved tracking of tangled point sources using Riemannian metrics.

problem Tangled point source trajectories in temporal stacks.
method Lifting to higher-dimensional space of roto-translation group, new regularisation based on relaxed Reeds-Shepp metric.
result Reconstruction and untangling of trajectories even from numerical standpoint.

The study proves a theorem about subword complexity for free group automorphisms.

problem Analyzing subword complexity for attracting fixed points of automorphisms of free groups.
method Combinatorial arguments and train tracks.
result Subword complexity of attracting fixed points is equivalent to n, n log log n, n log n, or n^2.

VRSGT algorithm reduces orthogonality constraints in decentralized optimization.

problem Decentralized optimization with orthogonality constraints.
method VRSGT algorithm with variance reduction and orthogonal techniques.
result VRSGT achieves convergence rate of O(1 / k) for orthogonality constraints.

We assess cluster stability by trimming extreme points and tracking data range reduction.

problem Assessing stability of one-dimensional clusters.
method Probabilistic method using diameter-shrinkage ratio to track data range reduction.
result Our method achieves higher accuracy than classical tests in small or noisy samples.

AI system analyzes financial analyst recommendations and track records for portfolio construction.

problem Human PMs rely on analyst recommendations and track records for portfolio decisions.
method Develops AI-based Recommender Systems to replicate analyst conviction and track records.
result AI can improve portfolio construction by integrating analyst conviction and track records.

This work uses SVM to identify track component failures in AC Track Circuits.

problem Detecting and identifying specific track component failures in AC Track Circuits.
method Applied SVM classifier to STDS track circuit data.
result Successfully classified 15 different track component failures.

New method uses cluster shapes to improve track finding in particle collisions.

problem Combining timing and additional detector information for efficient track finding.
method Neural networks to analyze cluster shapes for track seeding.
result Cluster shapes reduce fake combinatorial backgrounds while maintaining high track efficiency.

We are often interested in clustering objects that evolve over time and identifying solutions to the clustering problem for every time step. Evolutionary clustering provides insight into cluster evolution and temporal changes in cluster memberships while enabling performance superior to that achieved by independently c…

2019-12-27abs ↗pdf ↗

This paper optimizes object tracking on edge devices with small matrices.

problem Efficiently tracking objects in video sequences on edge devices with small matrices.
method Parallelized a Simple Online and Real-time Tracking (SORT) application on shared-memory multicores.
result Throughput-based parallelization technique outperforms multi-threading for small matrices.

Let $φ\in \mbox{Out}(F_n)$ be a free group outer automorphism that can be represented by an expanding, irreducible train-track map. The automorphism φφ determines a free-by-cyclic group Γ=FnφZ,Γ=F_n \rtimes_φ\mathbb Z, and a homomorphism αH1(Γ;Z)α\in H^1(Γ; \mathbb Z). By work of Neumann, Bieri-Neumann-Strebel and Dowdall-Kapovi…

2013-10-28abs ↗pdf ↗

The efficiency of a modern economy depends on what we call the Value-Tracking Hypothesis: that market prices of key assets broadly track some underlying value. This can be expected if a sufficient weight of market participants are valuation-based traders, buying and selling an asset when its price is, respectively, bel…

2019-03-23abs ↗pdf ↗

We show that the subsurface projection of a train track splitting sequence is an unparameterized quasi-geodesic in the curve complex of the subsurface. For the proof we introduce induced tracks, efficient position, and wide curves. This result is an important step in the proof that the disk complex is Gromov hyperbolic…

2010-04-26abs ↗pdf ↗