LCP-Fusion: A Neural Implicit SLAM with Enhanced Local Constraints and Computable Prior

• URL: http://arxiv.org/abs/2411.03610v1
• Date: Wed, 06 Nov 2024 02:05:44 GMT
• Title: LCP-Fusion: A Neural Implicit SLAM with Enhanced Local Constraints and Computable Prior
• Abstract summary: LCP-Fusion is a neural implicit SLAM system with enhanced local constraints and computable prior. We show that our method achieve better localization accuracy and reconstruction consistency than existing RGB-D implicit SLAM.
• Score: 22.948360879064758
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently the dense Simultaneous Localization and Mapping (SLAM) based on neural implicit representation has shown impressive progress in hole filling and high-fidelity mapping. Nevertheless, existing methods either heavily rely on known scene bounds or suffer inconsistent reconstruction due to drift in potential loop-closure regions, or both, which can be attributed to the inflexible representation and lack of local constraints. In this paper, we present LCP-Fusion, a neural implicit SLAM system with enhanced local constraints and computable prior, which takes the sparse voxel octree structure containing feature grids and SDF priors as hybrid scene representation, enabling the scalability and robustness during mapping and tracking. To enhance the local constraints, we propose a novel sliding window selection strategy based on visual overlap to address the loop-closure, and a practical warping loss to constrain relative poses. Moreover, we estimate SDF priors as coarse initialization for implicit features, which brings additional explicit constraints and robustness, especially when a light but efficient adaptive early ending is adopted. Experiments demonstrate that our method achieve better localization accuracy and reconstruction consistency than existing RGB-D implicit SLAM, especially in challenging real scenes (ScanNet) as well as self-captured scenes with unknown scene bounds. The code is available at https://github.com/laliwang/LCP-Fusion.

Related papers

• Across the Loss Landscape with Progressive Growth [51.366966420881646]
  We show how grow-and-optimize strategies to train toward flatter regions by viewing growth as progressive relaxation.<n>We empirically validate these predictions in controlled toy basins and in a realistic ResNet/CI-100 setting.<n>Although progressive subspace growth reliably produces flatter solutions, curvature reductions do not universally translate into improved test performance, highlighting subtleties in the flatness-generalization connection.
  arXiv  Detail & Related papers  (2026-08-25T13:50:48Z)
• CHOW-SLAM: Compact Hybrid Representation with Complementary Overlap Window Optimization for RGB-D SLAM [15.5419422901587]
  CHOW-SLAM is a dense RGB-D SLAM framework that explicitly constructs complementary spatial and temporal constraints.<n>CHOW-SLAM outperforms state-of-the-art methods in both scene reconstruction quality and camera tracking accuracy.
  arXiv  Detail & Related papers  (2026-08-03T08:47:28Z)
• GLAM-SLAM: Real-time Gaussian Large-scale Mapping via Flow Densification and Spatial Decomposition [15.113183931728814]
  We present GLAM-SLAM, a real-time, decoupled Gaussian-splatting SLAM system.<n>We ensure lightweight tracking using a robust, feature-based SLAM.<n>We adopt a structured, sparse anchor grid representation that ensures scalable operation and maintains scene across long-term sequences.<n>We evaluate our system on the challenging, long-sequence KITTI Odometry, Oxford RobotCar, and M Splatalaga datasets.
  arXiv  Detail & Related papers  (2026-07-23T15:22:42Z)
• LCPNet: Latent Consistent Proximal Unfolding Network for Infrared Small Target Detection [50.3892176822492]
  Infrared small target detection (IRSTD) aims to identify long distance small targets from complex infrared backgrounds.<n>Deep learning methods have improved IRSTD by learning discriminative image-to-mask mappings.<n>Deep unfolding methods partially address this issue by embedding model-driven iterations into neural networks.<n>We propose Latent Consistent Proximal unfolding network (LCPNet) to address these limitations.
  arXiv  Detail & Related papers  (2026-07-06T02:15:09Z)
• LightSplit: Practical Privacy-Preserving Split Learning via Orthogonal Projections [54.51153206716027]
  Split learning (SL) enables collaborative training by partitioning a neural network across clients and a central server.<n>We propose LightSplit, which limits information exposure and reduces communication overhead by applying a lightweight fixed random projection at the cut layer.<n>Our results show that the method retains more than 95% of the baseline accuracy at up to 32x reduction in transmitted dimensionality.
  arXiv  Detail & Related papers  (2026-05-13T09:45:49Z)
• Thinking with Images as Continuous Actions: Numerical Visual Chain-of-Thought [55.65577137924979]
  We propose a framework that enables MLLMs to reason over images using continuous numerical coordinates.<n> NV-CoT expands the MLLM action space from discrete vocabulary tokens to a continuous Euclidean space.<n>Experiments on three benchmarks demonstrate that NV-CoT significantly improves localization precision and final answer accuracy.
  arXiv  Detail & Related papers  (2026-02-27T12:04:07Z)
• Non-Rigid Structure-from-Motion via Differential Geometry with Recoverable Conformal Scale [17.935227965480475]
  We introduce a novel method, called Con-NRSfM, for NRSfM under conformal deformations.<n>Our approach performs point-wise reconstruction using 2D selected image warps optimized through a graph-based framework.<n>Our framework decouples constraints on depth and conformal scale, which are inseparable in other approaches.
  arXiv  Detail & Related papers  (2025-10-02T04:46:46Z)
• RemixFusion: Residual-based Mixed Representation for Large-scale Online RGB-D Reconstruction [18.4683556884268]
  RemixFusion is a novel residual-based mixed representation for scene reconstruction and camera pose estimation.<n>In particular, we propose a residual-based map representation comprised of an explicit coarse TSDF grid and an implicit neural module.<n>Our method surpasses all state-of-the-art ones, including those based either on explicit or implicit representations.
  arXiv  Detail & Related papers  (2025-07-23T15:27:09Z)
• Convex Hull-based Algebraic Constraint for Visual Quadric SLAM [9.855936120653995]
  Using quadrics as the object representation has the benefits of both generality closed-form projection between image and world spaces. Although numerous have been proposed for dualc reconstruction, we found that many of them are imprecise and provide minimal improvements to localization. We introduce a concise yet more precise convex hull-based constraint for object landmarks. Experiments on public datasets demonstrate that our approach is applicable to both monocular and RGB-D SLAM.
  arXiv  Detail & Related papers  (2025-03-03T07:30:07Z)
• GlORIE-SLAM: Globally Optimized RGB-only Implicit Encoding Point Cloud SLAM [53.6402869027093]
  We propose an efficient RGB-only dense SLAM system using a flexible neural point cloud representation scene. We also introduce a novel DSPO layer for bundle adjustment which optimize the pose and depth of implicits along with the scale of the monocular depth.
  arXiv  Detail & Related papers  (2024-03-28T16:32:06Z)
• PNeRFLoc: Visual Localization with Point-based Neural Radiance Fields [54.8553158441296]
  We propose a novel visual localization framework, ie, PNeRFLoc, based on a unified point-based representation. On the one hand, PNeRFLoc supports the initial pose estimation by matching 2D and 3D feature points. On the other hand, it also enables pose refinement with novel view synthesis using rendering-based optimization.
  arXiv  Detail & Related papers  (2023-12-17T08:30:00Z)
• HI-SLAM: Monocular Real-time Dense Mapping with Hybrid Implicit Fields [11.627951040865568]
  Recent neural mapping frameworks show promising results, but rely on RGB-D or pose inputs, or cannot run in real-time. Our approach integrates dense-SLAM with neural implicit fields. For efficient construction of neural fields, we employ multi-resolution grid encoding and signed distance function.
  arXiv  Detail & Related papers  (2023-10-07T12:26:56Z)
• Decoupled Local Aggregation for Point Cloud Learning [12.810517967372043]
  We propose to decouple the explicit modelling of spatial relations from local aggregation. We present DeLA, a lightweight point network, where in each learning stage relative spatial encodings are first formed. DeLA achieves over 90% overall accuracy on ScanObjectNN and 74% mIoU on S3DIS Area 5.
  arXiv  Detail & Related papers  (2023-08-31T08:21:29Z)
• GIFD: A Generative Gradient Inversion Method with Feature Domain Optimization [52.55628139825667]
  Federated Learning (FL) has emerged as a promising distributed machine learning framework to preserve clients' privacy. Recent studies find that an attacker can invert the shared gradients and recover sensitive data against an FL system by leveraging pre-trained generative adversarial networks (GAN) as prior knowledge. We propose textbfGradient textbfInversion over textbfFeature textbfDomains (GIFD), which disassembles the GAN model and searches the feature domains of the intermediate layers.
  arXiv  Detail & Related papers  (2023-08-09T04:34:21Z)
• FMapping: Factorized Efficient Neural Field Mapping for Real-Time Dense RGB SLAM [3.6985351289638957]
  We introduce FMapping, an efficient neural field mapping framework that facilitates the continuous estimation of a colorized point cloud map in real-time dense RGB SLAM. We propose an effective factorization scheme for scene representation and introduce a sliding window strategy to reduce the uncertainty for scene reconstruction.
  arXiv  Detail & Related papers  (2023-06-01T11:51:46Z)
• Fast Monocular Scene Reconstruction with Global-Sparse Local-Dense Grids [84.90863397388776]
  We propose to directly use signed distance function (SDF) in sparse voxel block grids for fast and accurate scene reconstruction without distances. Our globally sparse and locally dense data structure exploits surfaces' spatial sparsity, enables cache-friendly queries, and allows direct extensions to multi-modal data. Experiments show that our approach is 10x faster in training and 100x faster in rendering while achieving comparable accuracy to state-of-the-art neural implicit methods.
  arXiv  Detail & Related papers  (2023-05-22T16:50:19Z)
• NICE-SLAM: Neural Implicit Scalable Encoding for SLAM [112.6093688226293]
  NICE-SLAM is a dense SLAM system that incorporates multi-level local information by introducing a hierarchical scene representation. Compared to recent neural implicit SLAM systems, our approach is more scalable, efficient, and robust.
  arXiv  Detail & Related papers  (2021-12-22T18:45:44Z)
• Sign-Agnostic CONet: Learning Implicit Surface Reconstructions by Sign-Agnostic Optimization of Convolutional Occupancy Networks [39.65056638604885]
  We learn implicit surface reconstruction by sign-agnostic optimization of convolutional occupancy networks. We show this goal can be effectively achieved by a simple yet effective design.
  arXiv  Detail & Related papers  (2021-05-08T03:35:32Z)
• Local Propagation in Constraint-based Neural Network [77.37829055999238]
  We study a constraint-based representation of neural network architectures. We investigate a simple optimization procedure that is well suited to fulfil the so-called architectural constraints.
  arXiv  Detail & Related papers  (2020-02-18T16:47:38Z)
• Image Fine-grained Inpainting [89.17316318927621]
  We present a one-stage model that utilizes dense combinations of dilated convolutions to obtain larger and more effective receptive fields. To better train this efficient generator, except for frequently-used VGG feature matching loss, we design a novel self-guided regression loss. We also employ a discriminator with local and global branches to ensure local-global contents consistency.
  arXiv  Detail & Related papers  (2020-02-07T03:45:25Z)

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.