AIarXiv

Ranked by formulaVerdict: Notable

IntriAdapt: Generalizable Intrinsic-Guided Test-Time Adaptation for Metric Geometry Estimation

Recovering metric 3D geometry from images is fundamentally ill-posed due to perspective projection ambiguity.

By Chen, Yan, Zhuang +4

Score████░░░░░░3.6

Caveats

  • Preprint; not yet peer reviewed.

VerdictWorth a reader's time today.

Read the originalPDF

Abstract

Recovering metric 3D geometry from images is fundamentally ill-posed due to perspective projection ambiguity. Current geometry models incorporate supplied or predicted intrinsics during inference, but do not use them to supervise model adaptation. To refine these predictions, test-time adaptation (TTA) typically relies on external depth measurements. In this paper, we instead use camera intrinsics as an output-side geometric verifier. Comparing the point cloud's viewing rays with those defined by the known intrinsics yields a direct measure of geometric inconsistency. We propose IntriAdapt, a TTA framework that minimizes this closed-form geometric residual. By optimizing a lightweight LoRA adapter on a frozen geometry foundation model, our method aligns the prediction with the specific camera model without depth sensors or external priors. We further extend this approach to video sequences, demonstrating that adapting a short sequence generalizes to other sequences captured by the same camera. The adapted model processes held-out images in a feed-forward pass, without repeating optimization for each frame. Experiments on ten single-image and seven sequence benchmarks across multiple base models show that IntriAdapt consistently outperforms both unadapted and oracle-intrinsics baselines in metric accuracy and relative geometry.

Jiaxing Chen, Zizheng Yan, Jingyu Zhuang, Jinwei Chen, Shuguang Cui, Guanying Chen, Qingnan Fan

The editor's rubric

Heuristic review

Leverage4 / 5
A general-purpose tool used across several fields (Adam, ResNet, LoRA, next-generation sequencing).
24% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
18% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
14% of this desk’s rubric
Novelty2 / 5
A new combination of known ideas.
16% of this desk’s rubric
Trajectory3 / 5
A clear path to scale.
18% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
10% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); breadth (generalizes, many tasks); gains (outperforms); verification (multiple benchmarks, held-out test).

How the score was computed

rank-2026-10-18

Score████░░░░░░3.6

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
6.0 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.8 / 10
Shrunk toward the desk prior by editor confidence (42%).
Attention
0%
Citations, upvotes, points, mentions.
Freshness
48%
Half-life decay since publication.

No attention signals recorded yet.

The record

  • Reviewed by heuristic-v7 on Oct 20, 2026, 01:36 UTC. Paper type: theory.
  • Categories: cs.CV
  • BRIEF, No.7 in the Artificial Intelligence edition of October 20, 2026.