SARA: Scene-Aware Reconstruction Accelerator

• URL: http://arxiv.org/abs/2601.06831v1
• Date: Sun, 11 Jan 2026 09:45:03 GMT
• Title: SARA: Scene-Aware Reconstruction Accelerator
• Abstract summary: We present SARA, a geometry-driven pair selection module for Structure-from-Motion (SfM)<n>Unlike conventional pipelines that select pairs based on visual similarity alone, SARA introduces geometry-first pair selection.<n>A lightweight pre-matching stage uses mutual nearest neighbors and RANSAC to estimate reconstruction informativeness.
• Score: 8.403194119298622
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present SARA (Scene-Aware Reconstruction Accelerator), a geometry-driven pair selection module for Structure-from-Motion (SfM). Unlike conventional pipelines that select pairs based on visual similarity alone, SARA introduces geometry-first pair selection by scoring reconstruction informativeness - the product of overlap and parallax - before expensive matching. A lightweight pre-matching stage uses mutual nearest neighbors and RANSAC to estimate these cues, then constructs an Information-Weighted Spanning Tree (IWST) augmented with targeted edges for loop closure, long-baseline anchors, and weak-view reinforcement. Compared to exhaustive matching, SARA reduces rotation errors by 46.5+-5.5% and translation errors by 12.5+-6.5% across modern learned detectors, while achieving at most 50x speedup through 98% pair reduction (from 30,848 to 580 pairs). This reduces matching complexity from quadratic to quasi-linear, maintaining within +-3% of baseline reconstruction metrics for 3D Gaussian Splatting and SVRaster.

Related papers

• MoARa: Module-Aware Rank Allocation and Structure-Preserving Decomposition for Low-Rank LLM Pre-training [29.567949375022994]
  MoARa combines a static profiling-based module-aware projection-rank allocation with a block-wise magnitude-direction decomposition.<n>GaLore with MoARa reaches standard GaLore's final perplexity in fewer steps and 34% less wall-clock time on Llama 2 7B.
  arXiv  Detail & Related papers  (2026-09-14T04:53:09Z)
• Robust structure from motion for aerial-ground images via detector-free feature matching and multi-view track refinement [15.28970239781579]
  Integrated 3D reconstruction from aerial-ground images is essential for generating high-precision urban 3D models.<n>This study introduces a rotation-robust detector-free matching network coupled with multi-view track refinement for incremental Structure from Motion (ISfM)<n>By using real aerial-ground datasets, experimental results demonstrate that the proposed method improves AUC at 5 pose error by 93.9% compared with LoFTR.
  arXiv  Detail & Related papers  (2026-08-15T14:16:02Z)
• Similarity-Guided Curriculum Fine-Tuning of LLMs for Neural Architecture Synthesis [48.83701310501069]
  We introduce a MinHash-based similarity scheduling framework that constructs a progressive curriculum over neural architecture code for neural architecture search (NAS)<n>We evaluate the framework on OlympicCoder-7B within the LEMUR benchmark on CIFAR-10 image classification.<n>We report a cross-dataset transfer observation on SVHN, where direct base-model generation without curriculum yields 27% peak SR at substantially lower accuracy (60.5%) than the CIFAR-10 equivalent.
  arXiv  Detail & Related papers  (2026-07-13T14:14:30Z)
• OVS-DINO: Open-Vocabulary Segmentation via Structure-Aligned SAM-DINO with Language Guidance [53.45125687428705]
  Open-Vocabulary aims to segment image regions beyond predefined category sets by leveraging semantic descriptions.<n>Recent efforts have incorporated Vision Foundation Models (VFMs) like DINO to alleviate these limitations.<n>We propose OVS-DINO, a novel framework that revitalizes latent edge-sensitivity of DINO through structural alignment.
  arXiv  Detail & Related papers  (2026-04-09T16:57:11Z)
• Resonant Sparse Geometry Networks [0.0]
  We introduce Resonant Sparse Geometry Networks (RSGN), a brain-inspired architecture with self-organizing sparse hierarchical input-dependent connectivity.<n> RSGN embeds computational nodes in learned hyperbolic space where connection strength decays with geodesic distance, achieving dynamic sparsity that adapts to each input.
  arXiv  Detail & Related papers  (2026-01-26T01:45:51Z)
• MapReduce LoRA: Advancing the Pareto Front in Multi-Preference Optimization for Generative Models [52.32146943039743]
  Reinforcement learning from human feedback has advanced alignment of generative models to human aesthetic and perceptual preferences.<n>We introduce two complementary methods: MapReduce LoRA and Reward-aware Token Embedding (RaTE)<n>Our framework sets a new state-of-the-art multi-preference alignment recipe across modalities.
  arXiv  Detail & Related papers  (2025-11-25T18:49:21Z)
• A Stable Whitening Optimizer for Efficient Neural Network Training [99.7641280234926]
  Building on the Shampoo family of algorithms, we identify and alleviate three key issues, resulting in the proposed SPlus method.<n>First, we find that naive Shampoo is prone to divergence when matrix-inverses are cached for long periods.<n>Second, we adapt a shape-aware scaling to enable learning rate transfer across network width.<n>Third, we find that high learning rates result in large parameter noise, and propose a simple iterate-averaging scheme which unblocks faster learning.
  arXiv  Detail & Related papers  (2025-06-08T18:43:31Z)
• 3D Face Reconstruction Error Decomposed: A Modular Benchmark for Fair and Fast Method Evaluation [30.625439879741847]
  We present a toolkit for a Modularized 3D Face reconstruction Benchmark (M3DFB)<n>The fundamental components of error are segregated and interchangeable, allowing one to quantify the effect of each.<n>We propose a new component, namely correction, and present a computationally efficient approach that penalizes for mesh topology inconsistency.
  arXiv  Detail & Related papers  (2025-05-23T15:28:43Z)
• Speedy MASt3R [68.47052557089631]
  MASt3R redefines image matching as a 3D task by leveraging DUSt3R and introducing a fast reciprocal matching scheme.<n>Fast MASt3R achieves a 54% reduction in inference time (198 ms to 91 ms per image pair) without sacrificing accuracy.<n>This advancement enables real-time 3D understanding, benefiting applications like mixed reality navigation and large-scale 3D scene reconstruction.
  arXiv  Detail & Related papers  (2025-03-13T03:56:22Z)
• Analyzing And Improving Neural Speaker Embeddings for ASR [54.30093015525726]
  We present our efforts w.r.t integrating neural speaker embeddings into a conformer based hybrid HMM ASR system. Our best Conformer-based hybrid ASR system with speaker embeddings achieves 9.0% WER on Hub5'00 and Hub5'01 with training on SWB 300h.
  arXiv  Detail & Related papers  (2023-01-11T16:56:03Z)
• A Densely Interconnected Network for Deep Learning Accelerated MRI [0.0]
  A cascading deep learning reconstruction framework (baseline model) was modified by applying three architectural modifications. The proposed densely interconnected residual cascading network (DIRCN) achieved a SSIM improvement of 8% and 11% for four- and eight-fold acceleration.
  arXiv  Detail & Related papers  (2022-07-05T14:24:05Z)
• Low-complexity deep learning frameworks for acoustic scene classification [64.22762153453175]
  We present low-complexity deep learning frameworks for acoustic scene classification (ASC) The proposed frameworks can be separated into four main steps: Front-end spectrogram extraction, online data augmentation, back-end classification, and late fusion of predicted probabilities. Our experiments conducted on DCASE 2022 Task 1 Development dataset have fullfiled the requirement of low-complexity and achieved the best classification accuracy of 60.1%.
  arXiv  Detail & Related papers  (2022-06-13T11:41:39Z)
• Rethinking Dilated Convolution for Real-time Semantic Segmentation [0.0]
  We take a different approach by using dilated convolutions with large dilation rates throughout the backbone. Our model RegSeg achieves competitive results on real-time Cityscapes and CamVid datasets.
  arXiv  Detail & Related papers  (2021-11-18T22:08:21Z)
• Inception Convolution with Efficient Dilation Search [121.41030859447487]
  Dilation convolution is a critical mutant of standard convolution neural network to control effective receptive fields and handle large scale variance of objects. We propose a new mutant of dilated convolution, namely inception (dilated) convolution where the convolutions have independent dilation among different axes, channels and layers. We explore a practical method for fitting the complex inception convolution to the data, a simple while effective dilation search algorithm(EDO) based on statistical optimization is developed.
  arXiv  Detail & Related papers  (2020-12-25T14:58:35Z)

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.