Coarse-to-Fine Non-Rigid Registration for Side-Scan Sonar Mosaicking
- URL: http://arxiv.org/abs/2512.00052v1
- Date: Wed, 19 Nov 2025 12:44:31 GMT
- Title: Coarse-to-Fine Non-Rigid Registration for Side-Scan Sonar Mosaicking
- Authors: Can Lei, Nuno Gracias, Rafael Garcia, Hayat Rajani, Huigang Wang,
- Abstract summary: Side-scan sonar mosaicking plays a crucial role in large-scale seabed mapping.<n>Existing rigid or affine registration methods fail to model complex deformations.<n>We propose a coarse-to-fine hierarchical non-rigid registration framework tailored for large-scale side-scan sonar images.
- Score: 0.1631115063641726
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Side-scan sonar mosaicking plays a crucial role in large-scale seabed mapping but is challenged by complex non-linear, spatially varying distortions due to diverse sonar acquisition conditions. Existing rigid or affine registration methods fail to model such complex deformations, whereas traditional non-rigid techniques tend to overfit and lack robustness in sparse-texture sonar data. To address these challenges, we propose a coarse-to-fine hierarchical non-rigid registration framework tailored for large-scale side-scan sonar images. Our method begins with a global Thin Plate Spline initialization from sparse correspondences, followed by superpixel-guided segmentation that partitions the image into structurally consistent patches preserving terrain integrity. Each patch is then refined by a pretrained SynthMorph network in an unsupervised manner, enabling dense and flexible alignment without task-specific training. Finally, a fusion strategy integrates both global and local deformations into a smooth, unified deformation field. Extensive quantitative and visual evaluations demonstrate that our approach significantly outperforms state-of-the-art rigid, classical non-rigid, and learning-based methods in accuracy, structural consistency, and deformation smoothness on the challenging sonar dataset.
Related papers
- Seamlessly Natural: Image Stitching with Natural Appearance Preservation [0.6089774484591287]
SENA prioritizes structural fidelity in challenging real-world scenes characterized by parallax and depth variation.<n> SENA addresses fundamental limitations through three key contributions.<n>Experiments conducted on challenging datasets demonstrate that SENA achieves alignment accuracy comparable to leading homography-based methods.
arXiv Detail & Related papers (2026-01-03T18:40:35Z) - Variational Geometry-aware Neural Network based Method for Solving High-dimensional Diffeomorphic Mapping Problems [1.2955718209635254]
We propose a mesh-free learning framework designed for $n$-dimensional mapping problems.<n>We regulate conformality distortion and volume distortion, enabling robust control over deformation quality.
arXiv Detail & Related papers (2025-10-31T20:39:08Z) - MeshMosaic: Scaling Artist Mesh Generation via Local-to-Global Assembly [62.48017648785026]
We introduce MeshMosaic, a novel local-to-global framework for artist mesh generation that scales to over 100K triangles.<n>We show that MeshMosaic significantly outperforms state-of-the-art methods in both geometric fidelity and user preference.
arXiv Detail & Related papers (2025-09-24T11:02:03Z) - Preconditioned Deformation Grids [41.79220966392968]
We introduce Preconditioned Deformation Grids, a novel technique for estimating coherent deformation fields directly from unstructured point cloud sequences.<n>Our method achieves superior results, particularly for long sequences, compared to state-of-the-art techniques.
arXiv Detail & Related papers (2025-09-22T17:59:55Z) - Generalizable Holographic Reconstruction via Amplitude-Only Diffusion Priors [48.96607421052462]
Phase retrieval in inline holography is a fundamental yet ill-posed inverse problem due to the nonlinear coupling between amplitude and phase in coherent imaging.<n>We present a novel off-the-shelf solution that leverages a diffusion model trained solely on object amplitude to recover both amplitude and phase from diffraction intensities.
arXiv Detail & Related papers (2025-09-16T06:36:08Z) - Denoising as Adaptation: Noise-Space Domain Adaptation for Image Restoration [64.84134880709625]
We show that it is possible to perform domain adaptation via the noise space using diffusion models.<n>In particular, by leveraging the unique property of how auxiliary conditional inputs influence the multi-step denoising process, we derive a meaningful diffusion loss.<n>We present crucial strategies such as channel-shuffling layer and residual-swapping contrastive learning in the diffusion model.
arXiv Detail & Related papers (2024-06-26T17:40:30Z) - Mesh Denoising Transformer [104.5404564075393]
Mesh denoising is aimed at removing noise from input meshes while preserving their feature structures.
SurfaceFormer is a pioneering Transformer-based mesh denoising framework.
New representation known as Local Surface Descriptor captures local geometric intricacies.
Denoising Transformer module receives the multimodal information and achieves efficient global feature aggregation.
arXiv Detail & Related papers (2024-05-10T15:27:43Z) - Non-Rigid Shape Registration via Deep Functional Maps Prior [1.9249120068573227]
We propose a learning-based framework for non-rigid shape registration without correspondence supervision.
We deform source mesh towards the target point cloud, guided by correspondences induced by high-dimensional embeddings.
Our pipeline achieves state-of-the-art results on several benchmarks of non-rigid point cloud matching.
arXiv Detail & Related papers (2023-11-08T06:52:57Z) - Parallax-Tolerant Unsupervised Deep Image Stitching [57.76737888499145]
We propose UDIS++, a parallax-tolerant unsupervised deep image stitching technique.
First, we propose a robust and flexible warp to model the image registration from global homography to local thin-plate spline motion.
To further eliminate the parallax artifacts, we propose to composite the stitched image seamlessly by unsupervised learning for seam-driven composition masks.
arXiv Detail & Related papers (2023-02-16T10:40:55Z) - Implicit field supervision for robust non-rigid shape matching [29.7672368261038]
Establishing a correspondence between two non-rigidly deforming shapes is one of the most fundamental problems in visual computing.
We introduce an approach based on auto-decoder framework, that learns a continuous shape-wise deformation field over a fixed template.
Our method is remarkably robust in the presence of strong artefacts and can be generalised to arbitrary shape categories.
arXiv Detail & Related papers (2022-03-15T07:22:52Z) - Dense Non-Rigid Structure from Motion: A Manifold Viewpoint [162.88686222340962]
Non-Rigid Structure-from-Motion (NRSfM) problem aims to recover 3D geometry of a deforming object from its 2D feature correspondences across multiple frames.
We show that our approach significantly improves accuracy, scalability, and robustness against noise.
arXiv Detail & Related papers (2020-06-15T09:15:54Z) - ProAlignNet : Unsupervised Learning for Progressively Aligning Noisy
Contours [12.791313859673187]
"ProAlignNet" accounts for large scale misalignments and complex transformations between the contour shapes.
It learns by training with a novel loss function which is derived an upperbound of a proximity-sensitive and local shape-dependent similarity metric.
In two real-world applications, the proposed models consistently perform superior to state-of-the-art methods.
arXiv Detail & Related papers (2020-05-23T14:56:14Z) - Hamiltonian Dynamics for Real-World Shape Interpolation [66.47407593823208]
We revisit the classical problem of 3D shape and propose a novel, physically plausible approach based on Hamiltonian dynamics.
Our method yields exactly volume preserving intermediate shapes, avoids self-intersections and is scalable to high resolution scans.
arXiv Detail & Related papers (2020-04-10T18:38:52Z)
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.