paper-with-me

홈 › Papers

Continuous Neural Reparameterization as a Deep Geometric Prior for Robust Fixed-Chart UV Repair

2026-06-08 · Mohammad Sadegh Salehi arxiv

Traditional UV unwrapping relies on direct optimization of geometric distortion energies and can fail through invalid initialization, local minima, or topological foldovers. We recast fixed-chart UV unwrapping as continuous neural reparameterization: an untrained SIREN maps per-vertex mesh features to UV coordinates, and its weights are optimized for a geometric objective. The practical contribution is a robust chart-solver recipe, combining Laplace--Beltrami spectral inputs, Tutte residual warm-up, a $C^2$ determinant extension, an injectivity barrier, and validity-checked retry/fallback routing, rather than a claim that any single component guarantees validity or that recutting methods should be replaced. NTK--LBO diagnostics show that spectral conditioning changes update geometry, especially at initialization and mid-rank subspaces, but does not by itself predict chart success. On compact pre-cut charts and a 47-chart stratified Thingi10K/xatlas-cut benchmark, the neural solver produces zero flips on all compact charts and 42/47 valid zero-flip stratified solves. BFF and OptCuts comparisons sharpen the scope: recutting can be faster and lower-distortion when allowed, while the neural solver targets supplied-chart validity and validation-first atlas construction. On Amara Spatial generated meshes, the full atlas construction path gives packed-atlas coverage on a 25-asset set and 1000/1000 strict locally valid atlases with zero UV flips in a large-scale Rust atlas run after fallback routing.

📄 PDF Abstract BibTeX arXiv:2606.10050

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables

2016-11-02 · Chris J. Maddison, andriy mnih, Yee Whye Teh

The reparameterization trick enables optimizing large scale stochastic computation graphs via gradient descent. The essence of the trick is to refactor each stochastic node into a differentiable function of its parameter…

Density EstimationStructured Prediction

SpatialFly: Implicit 3D Prior-Guided Visual Reparameterization for Continuous UAV Vision-and-Language Navigation

2026-03-22 · Wen Jiang, Kangyao Huang, Li Wang, Wang Xu 외 arxiv

UAVs play an important role in applications such as autonomous exploration, disaster response, and infrastructure inspection. However, UAV VLN in complex 3D environments remains challenging. A key difficulty is the struc…

3D ReconstructionSpatial Reasoning

Height-Guided Projection Reparameterization for Camera-LiDAR Occupancy

2026-05-06 · Yuan Wu, Zhiqiang Yan, Jiawei Lian, Zhengxue Wang 외 arxiv

3D occupancy prediction aims to infer dense, voxel-wise scene semantics from sensor observations, where the 2D-to-3D view transformation serves as a crucial step in bridging image features and volumetric representations.…

Non-convex online learning via algorithmic equivalence

2022-05-30 · Udaya Ghai, Zhou Lu, Elad Hazan

We study an algorithmic equivalence technique between non-convex gradient descent and convex mirror descent. We start by looking at a harder problem of regret minimization in online non-convex optimization. We show that …

ChartX & ChartVLM: A Versatile Benchmark and Foundation Model for Complicated Chart Reasoning

2024-02-19 · Renqiu Xia, Bo Zhang, Hancheng Ye, Xiangchao Yan 외

Recently, many versatile Multi-modal Large Language Models (MLLMs) have emerged continuously. However, their capacity to query information depicted in visual charts and engage in reasoning based on the queried contents r…