PRISM: Probabilistic Real-Time Inference in Spatial World Models
- URL: http://arxiv.org/abs/2212.02988v1
- Date: Tue, 6 Dec 2022 13:59:06 GMT
- Title: PRISM: Probabilistic Real-Time Inference in Spatial World Models
- Authors: Atanas Mirchev, Baris Kayalibay, Ahmed Agha, Patrick van der Smagt,
Daniel Cremers, Justin Bayer
- Abstract summary: PRISM is a method for real-time filtering in a probabilistic generative model of agent motion and visual perception.
The proposed solution runs at 10Hz real-time and is similarly accurate to state-of-the-art SLAM in small to medium-sized indoor environments.
- Score: 52.878769723544615
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce PRISM, a method for real-time filtering in a probabilistic
generative model of agent motion and visual perception. Previous approaches
either lack uncertainty estimates for the map and agent state, do not run in
real-time, do not have a dense scene representation or do not model agent
dynamics. Our solution reconciles all of these aspects. We start from a
predefined state-space model which combines differentiable rendering and 6-DoF
dynamics. Probabilistic inference in this model amounts to simultaneous
localisation and mapping (SLAM) and is intractable. We use a series of
approximations to Bayesian inference to arrive at probabilistic map and state
estimates. We take advantage of well-established methods and closed-form
updates, preserving accuracy and enabling real-time capability. The proposed
solution runs at 10Hz real-time and is similarly accurate to state-of-the-art
SLAM in small to medium-sized indoor environments, with high-speed UAV and
handheld camera agents (Blackbird, EuRoC and TUM-RGBD).
Related papers
- Uncertainty Quantification for Local Model Explanations Without Model
Access [0.44241702149260353]
We present a model-agnostic algorithm for generating post-hoc explanations for a machine learning model.
Our algorithm uses a bootstrapping approach to quantify the uncertainty that inevitably arises when generating explanations from a finite sample of model queries.
arXiv Detail & Related papers (2023-01-13T21:18:00Z) - TempSAL -- Uncovering Temporal Information for Deep Saliency Prediction [64.63645677568384]
We introduce a novel saliency prediction model that learns to output saliency maps in sequential time intervals.
Our approach locally modulates the saliency predictions by combining the learned temporal maps.
Our code will be publicly available on GitHub.
arXiv Detail & Related papers (2023-01-05T22:10:16Z) - LOPR: Latent Occupancy PRediction using Generative Models [49.15687400958916]
LiDAR generated occupancy grid maps (L-OGMs) offer a robust bird's eye-view scene representation.
We propose a framework that decouples occupancy prediction into: representation learning and prediction within the learned latent space.
arXiv Detail & Related papers (2022-10-03T22:04:00Z) - Wireless Channel Prediction in Partially Observed Environments [10.803318254625687]
Site-specific radio frequency (RF) propagation prediction increasingly relies on models built from visual data such as cameras and LIDAR sensors.
This paper introduces a method to extract statistical channel models, given partial observations of the surrounding environment.
It is shown that the proposed method can interpolate between fully statistical models when no partial information is available and fully deterministic models when the environment is completely observed.
arXiv Detail & Related papers (2022-07-03T01:46:57Z) - Learning to track environment state via predictive autoencoding [0.0]
This work introduces a neural architecture for learning forward models of environments.
The task is achieved solely through learning from temporal unstructured observations in the form of images.
The network can output both expectation over future observations and samples from belief distribution.
arXiv Detail & Related papers (2021-12-14T21:07:21Z) - PDC-Net+: Enhanced Probabilistic Dense Correspondence Network [161.76275845530964]
Enhanced Probabilistic Dense Correspondence Network, PDC-Net+, capable of estimating accurate dense correspondences.
We develop an architecture and an enhanced training strategy tailored for robust and generalizable uncertainty prediction.
Our approach obtains state-of-the-art results on multiple challenging geometric matching and optical flow datasets.
arXiv Detail & Related papers (2021-09-28T17:56:41Z) - Bayesian deep learning of affordances from RGB images [5.939410304994348]
We present a deep learning method to predict the affordances available in the environment directly from RGB images.
Based on previous work on socially accepted affordances, our model is based on a multiscale CNN that combines local and global information from the object and the full image.
Our results show a marginal better performance of deep ensembles, compared to MC-dropout on the Brier score and the Expected Error.
arXiv Detail & Related papers (2021-09-27T07:39:47Z) - RNN with Particle Flow for Probabilistic Spatio-temporal Forecasting [30.277213545837924]
Many classical statistical models often fall short in handling the complexity and high non-linearity present in time-series data.
In this work, we consider the time-series data as a random realization from a nonlinear state-space model.
We use particle flow as the tool for approximating the posterior distribution of the states, as it is shown to be highly effective in complex, high-dimensional settings.
arXiv Detail & Related papers (2021-06-10T21:49:23Z) - Learning Interpretable Deep State Space Model for Probabilistic Time
Series Forecasting [98.57851612518758]
Probabilistic time series forecasting involves estimating the distribution of future based on its history.
We propose a deep state space model for probabilistic time series forecasting whereby the non-linear emission model and transition model are parameterized by networks.
We show in experiments that our model produces accurate and sharp probabilistic forecasts.
arXiv Detail & Related papers (2021-01-31T06:49:33Z) - Nonparametric Estimation in the Dynamic Bradley-Terry Model [69.70604365861121]
We develop a novel estimator that relies on kernel smoothing to pre-process the pairwise comparisons over time.
We derive time-varying oracle bounds for both the estimation error and the excess risk in the model-agnostic setting.
arXiv Detail & Related papers (2020-02-28T21:52:49Z)
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.