FastMap: Revisiting Dense and Scalable Structure from Motion

• URL: http://arxiv.org/abs/2505.04612v2
• Date: Tue, 20 May 2025 03:10:38 GMT
• Title: FastMap: Revisiting Dense and Scalable Structure from Motion
• Authors: Jiahao Li, Haochen Wang, Muhammad Zubair Irshad, Igor Vasiljevic, Matthew R. Walter, Vitor Campagnolo Guizilini, Greg Shakhnarovich,
• Abstract summary: We propose FastMap, a new global structure from motion method focused on speed and simplicity.<n>Previous methods like COLMAP and GLOMAP suffer from poor scalability when the number of matched keypoint pairs becomes large.<n>We show that FastMap is faster than COLMAP and GLOMAP on large-scale scenes with comparable pose accuracy.
• Score: 26.930994695116198
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose FastMap, a new global structure from motion method focused on speed and simplicity. Previous methods like COLMAP and GLOMAP are able to estimate high-precision camera poses, but suffer from poor scalability when the number of matched keypoint pairs becomes large. We identify two key factors leading to this problem: poor parallelization and computationally expensive optimization steps. To overcome these issues, we design an SfM framework that relies entirely on GPU-friendly operations, making it easily parallelizable. Moreover, each optimization step runs in time linear to the number of image pairs, independent of keypoint pairs or 3D points. Through extensive experiments, we show that FastMap is faster than COLMAP and GLOMAP on large-scale scenes with comparable pose accuracy.

Related papers

• SparseMap: A Sparse Tensor Accelerator Framework Based on Evolution Strategy [5.687126431324017]
  The demand for sparse computation algebra (SpTA) in machine learning and big data has driven the development of various sparse accelerators.<n>Previous works focus solely on either mapping (i.e., tensor communication and tiling in space and time) or sparse strategy.<n>We propose an evolution strategy-based sparse accelerator optimization framework, called SparseMap.
  arXiv  Detail & Related papers  (2025-08-18T13:13:30Z)
• Revisiting FastMap: New Applications [9.754590060356119]
  We first present FastMap to generate Euclidean embeddings of graphs in near-linear time.<n>We then apply the graph version of FastMap to efficiently solve various graph-theoretic problems.<n>We also present a novel learning framework, called FastMapSVM, by combining FastMap and Support Vector Machines.
  arXiv  Detail & Related papers  (2025-03-14T22:29:10Z)
• RTMO: Towards High-Performance One-Stage Real-Time Multi-Person Pose Estimation [46.659592045271125]
  RTMO is a one-stage pose estimation framework that seamlessly integrates coordinate classification. It achieves accuracy comparable to top-down methods while maintaining high speed. Our largest model, RTMO-l, attains 74.8% AP on COCO val 2017 and 141 FPS on a single V100 GPU.
  arXiv  Detail & Related papers  (2023-12-12T18:55:29Z)
• ELRA: Exponential learning rate adaption gradient descent optimization method [83.88591755871734]
  We present a novel, fast (exponential rate), ab initio (hyper-free) gradient based adaption. The main idea of the method is to adapt the $alpha by situational awareness. It can be applied to problems of any dimensions n and scales only linearly.
  arXiv  Detail & Related papers  (2023-09-12T14:36:13Z)
• TAPIR: Tracking Any Point with per-frame Initialization and temporal Refinement [64.11385310305612]
  We present a novel model for Tracking Any Point (TAP) that effectively tracks any queried point on any physical surface throughout a video sequence. Our approach employs two stages: (1) a matching stage, which independently locates a suitable candidate point match for the query point on every other frame, and (2) a refinement stage, which updates both the trajectory and query features based on local correlations. The resulting model surpasses all baseline methods by a significant margin on the TAP-Vid benchmark, as demonstrated by an approximate 20% absolute average Jaccard (AJ) improvement on DAVIS.
  arXiv  Detail & Related papers  (2023-06-14T17:07:51Z)
• Accelerated First-Order Optimization under Nonlinear Constraints [61.98523595657983]
  We exploit between first-order algorithms for constrained optimization and non-smooth systems to design a new class of accelerated first-order algorithms.<n>An important property of these algorithms is that constraints are expressed in terms of velocities instead of sparse variables.
  arXiv  Detail & Related papers  (2023-02-01T08:50:48Z)
• Nesterov Meets Optimism: Rate-Optimal Separable Minimax Optimization [108.35402316802765]
  We propose a new first-order optimization algorithm -- AcceleratedGradient-OptimisticGradient (AG-OG) Ascent. We show that AG-OG achieves the optimal convergence rate (up to a constant) for a variety of settings. We extend our algorithm to extend the setting and achieve the optimal convergence rate in both bi-SC-SC and bi-C-SC settings.
  arXiv  Detail & Related papers  (2022-10-31T17:59:29Z)
• FastMapSVM: Classifying Complex Objects Using the FastMap Algorithm and Support-Vector Machines [12.728875331529345]
  We present FastMapSVM, a novel framework for classifying complex objects. FastMapSVM combines the strengths of FastMap and Support-Map Machines. We show that FastMapSVM's performance is comparable to that of other state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-04-07T18:01:16Z)
• Recommender System Expedited Quantum Control Optimization [0.0]
  Quantum control optimization algorithms are routinely used to generate optimal quantum gates or efficient quantum state transfers. There are two main challenges in designing efficient optimization algorithms, namely overcoming the sensitivity to local optima and improving the computational speed. Here, we propose and demonstrate the use of a machine learning method, specifically the recommender system (RS), to deal with the latter challenge.
  arXiv  Detail & Related papers  (2022-01-29T10:25:41Z)
• Multiway Non-rigid Point Cloud Registration via Learned Functional Map Synchronization [105.14877281665011]
  We present SyNoRiM, a novel way to register multiple non-rigid shapes by synchronizing the maps relating learned functions defined on the point clouds. We demonstrate via extensive experiments that our method achieves a state-of-the-art performance in registration accuracy.
  arXiv  Detail & Related papers  (2021-11-25T02:37:59Z)
• ASH: A Modern Framework for Parallel Spatial Hashing in 3D Perception [91.24236600199542]
  ASH is a modern and high-performance framework for parallel spatial hashing on GPU. ASH achieves higher performance, supports richer functionality, and requires fewer lines of code. ASH and its example applications are open sourced in Open3D.
  arXiv  Detail & Related papers  (2021-10-01T16:25:40Z)
• Nesterov Accelerated ADMM for Fast Diffeomorphic Image Registration [63.15453821022452]
  Recent developments in approaches based on deep learning have achieved sub-second runtimes for DiffIR. We propose a simple iterative scheme that functionally composes intermediate non-stationary velocity fields. We then propose a convex optimisation model that uses a regularisation term of arbitrary order to impose smoothness on these velocity fields.
  arXiv  Detail & Related papers  (2021-09-26T19:56:45Z)
• Generic Merging of Structure from Motion Maps with a Low Memory Footprint [3.7838598767969502]
  We present new tools that will enable efficient, flexible and robust map merging. Using both simulated and real data - from both a hand held mobile phone and from a drone - we verify the performance of the proposed method.
  arXiv  Detail & Related papers  (2021-03-24T15:03:25Z)
• Solving Inverse Problems by Joint Posterior Maximization with Autoencoding Prior [0.0]
  We address the problem of solving ill-posed inverse problems in imaging where the prior is a JPal autoencoder (VAE) We show that our technique is quite sufficient that it satisfies the proposed objective function. Results also show the robustness of our approach to provide more robust estimates.
  arXiv  Detail & Related papers  (2021-03-02T11:18:34Z)
• Acceleration Methods [57.202881673406324]
  We first use quadratic optimization problems to introduce two key families of acceleration methods. We discuss momentum methods in detail, starting with the seminal work of Nesterov. We conclude by discussing restart schemes, a set of simple techniques for reaching nearly optimal convergence rates.
  arXiv  Detail & Related papers  (2021-01-23T17:58:25Z)
• Displacement-Invariant Cost Computation for Efficient Stereo Matching [122.94051630000934]
  Deep learning methods have dominated stereo matching leaderboards by yielding unprecedented disparity accuracy. But their inference time is typically slow, on the order of seconds for a pair of 540p images. We propose a emphdisplacement-invariant cost module to compute the matching costs without needing a 4D feature volume.
  arXiv  Detail & Related papers  (2020-12-01T23:58:16Z)
• Kernel methods through the roof: handling billions of points efficiently [94.31450736250918]
  Kernel methods provide an elegant and principled approach to nonparametric learning, but so far could hardly be used in large scale problems. Recent advances have shown the benefits of a number of algorithmic ideas, for example combining optimization, numerical linear algebra and random projections. Here, we push these efforts further to develop and test a solver that takes full advantage of GPU hardware.
  arXiv  Detail & Related papers  (2020-06-18T08:16:25Z)
• FarSee-Net: Real-Time Semantic Segmentation by Efficient Multi-scale Context Aggregation and Feature Space Super-resolution [14.226301825772174]
  We introduce a novel and efficient module called Cascaded Factorized Atrous Spatial Pyramid Pooling (CF-ASPP) It is a lightweight cascaded structure for Convolutional Neural Networks (CNNs) to efficiently leverage context information. We achieve 68.4% mIoU at 84 fps on the Cityscapes test set with a single Nivida Titan X (Maxwell) GPU card.
  arXiv  Detail & Related papers  (2020-03-09T03:53:57Z)
• Voxel Map for Visual SLAM [57.07800982410967]
  We propose a voxel-map representation to efficiently map points for visual SLAM. Our method is geometrically guaranteed to fall in the camera field-of-view, and occluded points can be identified and removed to a certain extend. Experimental results show that our voxel map representation is as efficient as a map with 5s and provides significantly higher localization accuracy (average 46% improvement in RMSE) on the EuRoC dataset.
  arXiv  Detail & Related papers  (2020-03-04T18:39:14Z)
• Image Matching across Wide Baselines: From Paper to Practice [80.9424750998559]
  We introduce a comprehensive benchmark for local features and robust estimation algorithms. Our pipeline's modular structure allows easy integration, configuration, and combination of different methods. We show that with proper settings, classical solutions may still outperform the perceived state of the art.
  arXiv  Detail & Related papers  (2020-03-03T15:20:57Z)

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.