Jacobian Computation for Cumulative B-splines on SE(3) and Application to Continuous-Time Object Tracking

• URL: http://arxiv.org/abs/2201.10602v1
• Date: Tue, 25 Jan 2022 19:53:33 GMT
• Title: Jacobian Computation for Cumulative B-splines on SE(3) and Application to Continuous-Time Object Tracking
• Authors: Javier Tirado, Javier Civera
• Abstract summary: We propose a method that estimates the $SE(3)$ continuous trajectories (orientation and translation) of the dynamic rigid objects present in a scene, from multiple RGB-D views. We fit the object trajectories to cumulative B-Splines curves, which allow us to interpolate, at any intermediate time stamp, not only their poses but also their linear and angular velocities and accelerations.
• Score: 13.249453757295086
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper we propose a method that estimates the $SE(3)$ continuous trajectories (orientation and translation) of the dynamic rigid objects present in a scene, from multiple RGB-D views. Specifically, we fit the object trajectories to cumulative B-Splines curves, which allow us to interpolate, at any intermediate time stamp, not only their poses but also their linear and angular velocities and accelerations. Additionally, we derive in this work the analytical $SE(3)$ Jacobians needed by the optimization, being applicable to any other approach that uses this type of curves. To the best of our knowledge this is the first work that proposes 6-DoF continuous-time object tracking, which we endorse with significant computational cost reduction thanks to our analytical derivations. We evaluate our proposal in synthetic data and in a public benchmark, showing competitive results in localization and significant improvements in velocity estimation in comparison to discrete-time approaches.

Related papers

• DELTAv2: Accelerating Dense 3D Tracking [79.63990337419514]
  We propose a novel algorithm for accelerating dense long-term 3D point tracking in videos.<n>We introduce a coarse-to-fine strategy that begins tracking with a small subset of points and progressively expands the set of tracked trajectories.<n>The newly added trajectories are using a learnable module, which is trained end-to-end alongside the tracking network.
  arXiv  Detail & Related papers  (2025-08-02T03:15:47Z)
• EMoTive: Event-guided Trajectory Modeling for 3D Motion Estimation [59.33052312107478]
  Event cameras offer possibilities for 3D motion estimation through continuous adaptive pixel-level responses to scene changes. This paper presents EMove, a novel event-based framework that models-uniform trajectories via event-guided parametric curves. For motion representation, we introduce a density-aware adaptation mechanism to fuse spatial and temporal features under event guidance. The final 3D motion estimation is achieved through multi-temporal sampling of parametric trajectories, flows and depth motion fields.
  arXiv  Detail & Related papers  (2025-03-14T13:15:54Z)
• From Target Tracking to Targeting Track -- Part III: Stochastic Process Modeling and Online Learning [18.8192435654239]
  This study describes the target trajectory as a sample path of a process (SP) By adopting a deterministic-stochastic decomposition framework, we decompose the learning of the trajectory SP into two sequential stages. This leads to a Markov-free data-driven tracking approach that produces the continuous-time trajectory with minimal prior knowledge of the target dynamics.
  arXiv  Detail & Related papers  (2025-03-03T12:04:38Z)
• ICP-Flow: LiDAR Scene Flow Estimation with ICP [2.9290232815049926]
  Scene flow characterizes the 3D motion between two LiDAR scans captured by an autonomous vehicle at nearby timesteps. We propose ICP-Flow, a learning-free flow estimator, to associate objects over scans and then estimate the locally rigid transformations. We outperform state-of-the-art baselines, including supervised models, on the dataset and perform competitively on Argoverse-v2 and nuScenes.
  arXiv  Detail & Related papers  (2024-02-27T09:41:59Z)
• A 5-Point Minimal Solver for Event Camera Relative Motion Estimation [47.45081895021988]
  We introduce a novel minimal 5-point solver that estimates line parameters and linear camera velocity projections, which can be fused into a single, averaged linear velocity when considering multiple lines. Our method consistently achieves a 100% success rate in estimating linear velocity where existing closed-form solvers only achieve between 23% and 70%.
  arXiv  Detail & Related papers  (2023-09-29T08:30:18Z)
• Vanishing Point Estimation in Uncalibrated Images with Prior Gravity Direction [82.72686460985297]
  We tackle the problem of estimating a Manhattan frame. We derive two new 2-line solvers, one of which does not suffer from singularities affecting existing solvers. We also design a new non-minimal method, running on an arbitrary number of lines, to boost the performance in local optimization.
  arXiv  Detail & Related papers  (2023-08-21T13:03:25Z)
• Distributed Unconstrained Optimization with Time-varying Cost Functions [1.52292571922932]
  The objective is to track the optimal trajectory that minimizes the total cost at each time instant. Our approach consists of a two-stage dynamics, where the first one samples the first and second derivatives of the local costs to periodically construct an estimate of the descent direction towards the optimal trajectory. To demonstrate the performance of the proposed method, a numerical example is conducted that studies tuning the algorithm's parameters and their effects on the convergence of local states to the optimal trajectory.
  arXiv  Detail & Related papers  (2022-12-12T23:59:54Z)
• Deep Projective Rotation Estimation through Relative Supervision [31.05330535795121]
  Deep learning has offered a way to develop image-based orientation estimators. These estimators often require training on a large labeled dataset. We propose a new algorithm for selfsupervised orientation estimation.
  arXiv  Detail & Related papers  (2022-11-21T04:58:07Z)
• Optimal Stopping with Gaussian Processes [2.126171264016785]
  We show that structural properties commonly exhibited by financial time series allow the use of Gaussian and Deep Gaussian Process models. We additionally quantify uncertainty in the value function by propagating the price model through the optimal stopping analysis. We show that our family of algorithms outperforms benchmarks on three historical time series datasets.
  arXiv  Detail & Related papers  (2022-09-22T21:19:27Z)
• IDEA-Net: Dynamic 3D Point Cloud Interpolation via Deep Embedding Alignment [58.8330387551499]
  We formulate the problem as estimation of point-wise trajectories (i.e., smooth curves) We propose IDEA-Net, an end-to-end deep learning framework, which disentangles the problem under the assistance of the explicitly learned temporal consistency. We demonstrate the effectiveness of our method on various point cloud sequences and observe large improvement over state-of-the-art methods both quantitatively and visually.
  arXiv  Detail & Related papers  (2022-03-22T10:14:08Z)
• Averaging Spatio-temporal Signals using Optimal Transport and Soft Alignments [110.79706180350507]
  We show that our proposed loss can be used to define temporal-temporal baryechecenters as Fr'teche means duality. Experiments on handwritten letters and brain imaging data confirm our theoretical findings.
  arXiv  Detail & Related papers  (2022-03-11T09:46:22Z)
• Event-Based Feature Tracking in Continuous Time with Sliding Window Optimization [55.11913183006984]
  We propose a novel method for continuous-time feature tracking in event cameras. We track features by aligning events along an estimated trajectory in space-time. We experimentally confirm that the proposed sliding-window B-spline optimization leads to longer and more accurate feature tracks.
  arXiv  Detail & Related papers  (2021-07-09T16:41:20Z)
• Robust 6D Object Pose Estimation by Learning RGB-D Features [59.580366107770764]
  We propose a novel discrete-continuous formulation for rotation regression to resolve this local-optimum problem. We uniformly sample rotation anchors in SO(3), and predict a constrained deviation from each anchor to the target, as well as uncertainty scores for selecting the best prediction. Experiments on two benchmarks: LINEMOD and YCB-Video, show that the proposed method outperforms state-of-the-art approaches.
  arXiv  Detail & Related papers  (2020-02-29T06:24:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.