paper-with-me

Papers

Sequential Place Learning: Heuristic-Free High-Performance Long-Term Place Recognition

2021-03-02 · Marvin Chancán, Michael Milford

Sequential matching using hand-crafted heuristics has been standard practice in route-based place recognition for enhancing pairwise similarity results for nearly a decade. However, precision-recall performance of these algorithms dramatically degrades when searching on short temporal window (TW) lengths, while demanding high compute and storage costs on large robotic datasets for autonomous navigation research. Here, influenced by biological systems that robustly navigate spacetime scales even without vision, we develop a joint visual and positional representation learning technique, via a sequential process, and design a learning-based CNN+LSTM architecture, trainable via backpropagation through time, for viewpoint- and appearance-invariant place recognition. Our approach, Sequential Place Learning (SPL), is based on a CNN function that visually encodes an environment from a single traversal, thus reducing storage capacity, while an LSTM temporally fuses each visual embedding with corresponding positional data -- obtained from any source of motion estimation -- for direct sequential inference. Contrary to classical two-stage pipelines, e.g., match-then-temporally-filter, our network directly eliminates false-positive rates while jointly learning sequence matching from a single monocular image sequence, even using short TWs. Hence, we demonstrate that our model outperforms 15 classical methods while setting new state-of-the-art performance standards on 4 challenging benchmark datasets, where one of them can be considered solved with recall rates of 100% at 100% precision, correctly matching all places under extreme sunlight-darkness changes. In addition, we show that SPL can be up to 70x faster to deploy than classical methods on a 729 km route comprising 35,768 consecutive frames. Extensive experiments demonstrate the... Baseline code available at https://github.com/mchancan/deepseqslam

📄 PDF Abstract BibTeX arXiv:2103.02074

Code (1)

mchancan/deepseqslam 공식 구현 pytorch

Tasks

Autonomous DrivingAutonomous NavigationAutonomous VehiclesImage RetrievalMotion EstimationNavigateRepresentation LearningRobot NavigationSelf-Driving CarsSequential Image ClassificationSequential Place LearningSequential Place RecognitionSimultaneous Localization and MappingVisual LocalizationVisual NavigationVisual Place RecognitionVocal Bursts Intensity Prediction

Methods 이 논문이 사용한 방법론

Sigmoid Activation 설명 없음
Tanh Activation 설명 없음
LSTM An LSTM is a type of recurrent neural network that addresses the vanishing gradient problem in vanilla…

Similar Papers 제목 키워드 기반

Critic Sequential Monte Carlo

2022-05-30 · Vasileios Lioutas, Jonathan Wilder Lavington, Justice Sefas, Matthew Niedoba 외

We introduce CriticSMC, a new algorithm for planning as inference built from a composition of sequential Monte Carlo with learned Soft-Q function heuristic factors. These heuristic factors, obtained from parametric appro…

Collision AvoidanceDiversity

PAO: A general particle swarm algorithm with exact dynamics and closed-form transition densities

2023-04-28 · Max D. Champneys, Timothy J. Rogers

A great deal of research has been conducted in the consideration of meta-heuristic optimisation methods that are able to find global optima in settings that gradient based optimisers have traditionally struggled. Of thes…

Form

Free-Placement Optimization of Ground Station Locations for Low-Earth Orbit Satellites

2026-06-10 · Grace Ra Kim, Duncan Eddy, Vedant Srinivas, Mykel J. Kochenderfer arxiv

Rapidly expanding low Earth orbit satellite constellations are placing increasing demands on terrestrial ground networks, motivating the development of more efficient ground station network designs. Current approaches se…

Object Placement on Cluttered Surfaces: A Nested Local Search Approach

2019-06-20 · Abdul Rahman Dabbour, Esra Erdem, Volkan Patoglu

For planning rearrangements of objects in a clutter, it is required to know the goal configuration of the objects. However, in real life scenarios, this information is not available most of the time. We introduce a novel…

Computational Efficiency

Gradient-Free Sequential Bayesian Experimental Design via Interacting Particle Systems

2025-04-17 · Robert Gruhlke, Matei Hanu, Claudia Schillings, Philipp Wacker

We introduce a gradient-free framework for Bayesian Optimal Experimental Design (BOED) in sequential settings, aimed at complex systems where gradient information is unavailable. Our method combines Ensemble Kalman Inver…

Experimental Design