Methods › Computer Vision › 3D Reconstruction › CodeSLAM

CodeSLAM

2 papers tagged archive 2025-07-28

Introduced by Michael Bloesch et al. in CodeSLAM - Learning a Compact, Optimisable Representation for Dense Visual SLAM

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

CodeSLAM represents the 3D geometry of a scene using the latent space of a variational autoencoder. The depth thus becomes a function of the RGB image and the unknown code, D = G_θ(I,c). During training time, the weights of the network G_θ are learnt by training the generator and encoder using a standard autoencoding task. At test time the code c and the pose of the images is found by optimizing the reprojection error over multiple images.

PaperSource

Papers archive 2025-07-28

2 shown of 2, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

Tasks archive 2025-07-28

3 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
3D Reconstruction1
Depth Estimation1
Scene Understanding1

Usage over time archive 2025-07-28

Papers per year tagged with CodeSLAM: 2018 to 2021, peak 1 1 0 2018: 1 paper 2018 2019: 0 papers 2019 2020: 0 papers 2020 2021: 1 paper 2021
Papers per year the archive tags with this method, by the paper's archive date (2 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

3D Reconstruction

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections