Renormalization for Initialization of Rolling Shutter Visual-Inertial
Odometry
- URL: http://arxiv.org/abs/2008.06399v2
- Date: Wed, 24 Mar 2021 19:46:11 GMT
- Title: Renormalization for Initialization of Rolling Shutter Visual-Inertial
Odometry
- Authors: Branislav Micusik, Georgios Evangelidis
- Abstract summary: Initialization is a prerequisite for using inertial signals and fusing them with visual data.
We propose a novel statistical solution to the problem on visual and inertial data simultaneously, by casting it into the renormalization scheme of Kanatani.
Extensive evaluations on ground truth exhibit superior performance and a gain in accuracy of up to $20%$ over the originally proposed Least Squares solution.
- Score: 5.33024001730262
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper we deal with the initialization problem of a visual-inertial
odometry system with rolling shutter cameras. Initialization is a prerequisite
for using inertial signals and fusing them with visual data. We propose a novel
statistical solution to the initialization problem on visual and inertial data
simultaneously, by casting it into the renormalization scheme of Kanatani. The
renormalization is an optimization scheme which intends to reduce the inherent
statistical bias of common linear systems. We derive and present the necessary
steps and methodology specific to the initialization problem. Extensive
evaluations on ground truth exhibit superior performance and a gain in accuracy
of up to $20\%$ over the originally proposed Least Squares solution. The
renormalization performs similarly to the optimal Maximum Likelihood estimate,
despite arriving at the solution by different means. With this paper we are
adding to the set of Computer Vision problems which can be cast into the
renormalization scheme.
Related papers
- Error Feedback under $(L_0,L_1)$-Smoothness: Normalization and Momentum [56.37522020675243]
We provide the first proof of convergence for normalized error feedback algorithms across a wide range of machine learning problems.
We show that due to their larger allowable stepsizes, our new normalized error feedback algorithms outperform their non-normalized counterparts on various tasks.
arXiv Detail & Related papers (2024-10-22T10:19:27Z) - Motion and Structure from Event-based Normal Flow [26.513167481193225]
Neuromorphic event-based cameras place great demands on approaches that use raw event data as input to solve this fundamental problem.
Existing state-of-the-art solutions typically infer implicitly data association by iteratively reversing the event data generation process.
We show that the event-based normal flow can be used, via the proposed geometric error term, as an alternative to the full flow in solving a family of geometric problems.
arXiv Detail & Related papers (2024-07-17T01:11:20Z) - Prescriptive PCA: Dimensionality Reduction for Two-stage Stochastic
Optimization [1.1612308609123565]
We develop a prescriptive dimensionality reduction framework that aims to minimize the degree of suboptimality in the optimization phase.
For the case where the downstream optimization problem has an expected value objective, we show that prescriptive dimensionality reduction can be performed via solving a distributionally-robust optimization problem.
Our approach significantly outperforms principal component analysis with real and synthetic data sets.
arXiv Detail & Related papers (2023-06-04T00:50:35Z) - DM-VIO: Delayed Marginalization Visual-Inertial Odometry [62.746533939737446]
We present DM-VIO, a visual-inertial system based on delayed marginalization and pose graph bundle adjustment.
We evaluate our system on the EuRoC, TUM-VI, and 4Seasons datasets, which comprise flying drone, large-scale handheld, and automotive scenarios.
arXiv Detail & Related papers (2022-01-11T18:30:37Z) - On the Explicit Role of Initialization on the Convergence and Implicit
Bias of Overparametrized Linear Networks [1.0323063834827415]
We present a novel analysis of single-hidden-layer linear networks trained under gradient flow.
We show that the squared loss converges exponentially to its optimum.
We derive a novel non-asymptotic upper-bound on the distance between the trained network and the min-norm solution.
arXiv Detail & Related papers (2021-05-13T15:13:51Z) - Data-driven Weight Initialization with Sylvester Solvers [72.11163104763071]
We propose a data-driven scheme to initialize the parameters of a deep neural network.
We show that our proposed method is especially effective in few-shot and fine-tuning settings.
arXiv Detail & Related papers (2021-05-02T07:33:16Z) - Pushing the Envelope of Rotation Averaging for Visual SLAM [69.7375052440794]
We propose a novel optimization backbone for visual SLAM systems.
We leverage averaging to improve the accuracy, efficiency and robustness of conventional monocular SLAM systems.
Our approach can exhibit up to 10x faster with comparable accuracy against the state-art on public benchmarks.
arXiv Detail & Related papers (2020-11-02T18:02:26Z) - A Flexible Framework for Designing Trainable Priors with Adaptive
Smoothing and Game Encoding [57.1077544780653]
We introduce a general framework for designing and training neural network layers whose forward passes can be interpreted as solving non-smooth convex optimization problems.
We focus on convex games, solved by local agents represented by the nodes of a graph and interacting through regularization functions.
This approach is appealing for solving imaging problems, as it allows the use of classical image priors within deep models that are trainable end to end.
arXiv Detail & Related papers (2020-06-26T08:34:54Z) - Revisiting Initialization of Neural Networks [72.24615341588846]
We propose a rigorous estimation of the global curvature of weights across layers by approximating and controlling the norm of their Hessian matrix.
Our experiments on Word2Vec and the MNIST/CIFAR image classification tasks confirm that tracking the Hessian norm is a useful diagnostic tool.
arXiv Detail & Related papers (2020-04-20T18:12:56Z)
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.