Pith. sign in

REVIEW 3 major objections 4 minor 48 references

Visual Execution and Validation of Finite-State Machines and Pushdown Automata

T0 review · 3 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Two new tools visualize every computation branch of nondeterministic automata and pushdown automata, step by step.

desk verdict A worthwhile teaching-tool idea, but the completeness claim is unguarded and the submitted full text is the wrong paper. read the letter →

arxiv 2508.03641 v1 pith:A6IF2KD6 submitted 2025-08-05 cs.FL cs.HCcs.PLcs.SE

Marco T. Morazán (Seton Hall University) , David Anthony K. Fields (Seton Hall University) , Andrés M. Garced (Seton Hall University) , Tijana Minić (University of Washington) This is my paper
classification cs.FLcs.HCcs.PLcs.SE MSC 68Q45
keywords finite-statemachinespushdownautomatanondeterminismvisualizationtheoryeducationFSMlanguagestepwisecomputationstateinvariants
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper presents two visualization tools built for the FSM programming language, a domain-specific language used in automata theory classrooms. The tools display every computation a nondeterministic finite-state machine or a pushdown automaton can perform on a given word, in a stepwise manner. They also let users check whether the property a state is supposed to represent actually holds when the machine transitions into that state. The goal is to help students understand the operational semantics of nondeterminism and stack-based machines, which are often difficult to grasp from textual traces alone.

What carries the argument

The central objects are the operational semantics of the FSM language and the computation tree (or graph) of all configurations reachable from the start configuration on a fixed input word. For pushdown automata, each configuration includes the state, the remaining input, and the stack. The tools animate these configurations in lockstep, and for each transition they evaluate the target state's specified invariant, enabling the visual validation of state properties.

What would settle it

Run a carefully constructed nondeterministic pushdown automaton with a word known to have a specific finite number of computation paths; if the tool's displayed path count differs, its completeness is disproven. Alternatively, define a state invariant that is false on a particular reachable configuration and check whether the tool fails to flag it.

Watch

Extended reading notes

Core claim

The paper's central claim is that stepwise, exhaustive visualization of all computation branches of nondeterministic finite-state machines and pushdown automata is practical within the FSM language. The tool for finite-state machines enumerates every possible path, while the pushdown-automaton tool shows the stack contents along each path, making visible the fact that two computations on the same word can reach the same state with different stack values. In addition, the validation feature pairs each transition with the target state's declared property, so a user can visually confirm whether that property holds when the machine enters the state.

Load-bearing premise

The tools' claim of displaying all computations depends entirely on the underlying implementation being faithful and complete with respect to the FSM language's semantics; if any branch is omitted or a stack update is wrong, the pedagogical benefit collapses.

Editorial extensions

If this is right

  • Students can see all nondeterministic branches of a computation, not just one accepting path, which clarifies why a machine accepts or rejects a word.
  • The stack visualization makes explicit that different branches can reach the same state with different stack contents, addressing a known source of confusion.
  • The property-checking feature turns state invariants into testable assertions that run during execution, helping students verify that their machine designs behave as intended.
  • Instructors gain a shared visual representation for debugging and discussing automata in the classroom, potentially improving how operational semantics are taught.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the visualization is faithful to the language's semantics, the same stepwise configuration-enumeration approach could extend to other automata models, such as Turing machines or alternating automata.
  • The property-checking mechanism could support automated feedback: a student's machine could be checked against a specification, flagging states whose invariants fail on some reachable computation.
  • A testable extension would compare student debugging performance with these tools against textual execution traces, measuring whether the visual approach actually accelerates understanding of nondeterminism.
  • The tools' ability to show 'all computations' suggests a natural link to curriculum exercises on counting computation paths or on reasoning about ambiguity in context-free languages.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The manuscript under review, as identified by its title and abstract, proposes two new dynamic visualization tools for FSM, a domain-specific language for teaching automata theory. The claimed tools would display all computations of nondeterministic finite-state machines and pushdown automata stepwise, and would allow students to visually check whether state properties hold on transition. However, the body of the submitted manuscript is an unrelated computer vision paper about 3D reconstruction ('Uni3R'), and contains no description of the FSM language, the visualization tools, any implementation, or any evaluation. The abstract itself also leaves the central 'all computations' claim underspecified for machines with epsilon-cycles. The submission therefore cannot be assessed on the merits.

Significance. If the claimed tools exist and work as described, they could provide a genuinely useful pedagogical aid: stepwise visualization of nondeterministic branches and stack configurations is a known pain point in automata courses, and the idea of attaching verifiable state invariants to transitions is attractive. The submission, however, provides no artifact, no formal semantics, no correctness argument, and no evaluation. The potential significance is real but entirely conditional, and the current manuscript gives the reader no basis to verify any of it.

major comments (3)
  1. [Full Text] The manuscript body is an entirely different paper, 'Uni3R: Unified 3D Reconstruction and Semantic Understanding via Generalizable Gaussian Splatting from Unposed Multi-View Images', with no relationship to the claimed title or abstract. None of the claimed FSM/PDA visualization tools, the FSM language, or any implementation, correctness argument, or evaluation appears in the submitted text. As a consequence, the central claim that the tools exist and visualize all computations is unverifiable from the submitted manuscript.
  2. [Abstract] The abstract claims the tools 'visualize all computations that may be performed' stepwise. For a nondeterministic PDA with an epsilon-cycle (e.g., δ(q, ε, Z) ∋ (q, XZ)), a fixed input word admits infinitely many computations, and no finite display can enumerate them all. The abstract states no restriction on the machine class, no depth/stack bound, and no definition of 'all computations' as a finite representative prefix. This ambiguity is load-bearing: if the tools truncate or prune, the displayed set is not all computations and student conclusions about acceptance could rest on an incomplete view; if they do not truncate, the tools need not terminate on standard classroom PDAs. Please specify the finite interpretation of 'all computations' and how completeness is guaranteed.
  3. [Abstract] The abstract asserts that the tools 'aid student understanding' and allow users to 'visually validate' state properties, but no user study, formal verification of the visualization's semantics, or comparison with existing automata visualization tools is described anywhere in the submitted text. Since the paper's stated contribution is pedagogical, this missing evidence is load-bearing for the claimed benefit. At minimum, a correctness argument for the visualization engine and an evaluation with students or experts is required.
minor comments (4)
  1. [Abstract] The phrase 'a pushdown automata' is ungrammatical; it should be 'a pushdown automaton'.
  2. [Abstract] The acronyms FSM and PDA are used without expansion or definition on first use, and the FSM programming language is not described or referenced.
  3. [Abstract] No references to prior visualization tools for automata (e.g., JFLAP, OpenFLAP) are provided, so the novelty claim is not contextualized.
  4. [Abstract] The phrase 'the properties a state represents hold when a machine transitions into it' needs a formal definition of how state properties are expressed in the FSM language.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the paper's claims are tool-capability statements with no derivational chain to reduce.

full rationale

The target abstract (arXiv:2508.03641) makes engineering claims about two visualization tools for the FSM language: they display all computations that may be performed by NFAs and PDAs stepwise and aid visual validation of state properties. Nothing in the abstract defines or derives a result from itself: there are no equations, no fitted parameters, no imported uniqueness theorems, and no load-bearing self-citations. The supplied full text is an unrelated Uni3R 3D-reconstruction paper, so no implementation details or evaluation are available; the circularity pass must therefore rely on the abstract alone. The skeptic's observation that ordinary PDAs with epsilon-cycles can have infinitely many computations and that 'all computations' is then literally unrealizable without an unstated bound or machine restriction is a specification/completeness concern, not a circularity concern: the claim may be false or underspecified, but it is not equivalent to its inputs by construction. Accordingly, no circular step is identified and the score is 0.

Assumptions & free parameters 0 free parameters · 0 assumptions · 0 invented entities

No free parameters, axioms, or invented entities can be identified from the abstract alone. The full text supplied is a mismatched CV paper, and the actual FSM paper's technical content was unavailable.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Visual Execution and Validation of Finite-State Machines and Pushdown Automata." pith.science (2026). https://pith.science/paper/A6IF2KD6

@misc{pith2026250803641,
  author       = {Pith},
  title        = {Pith review of: Visual Execution and Validation of Finite-State Machines and Pushdown Automata},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/A6IF2KD6}},
  note         = {Machine review of arXiv:2508.03641}
}
read the original abstract

In Formal Languages and Automata Theory courses, students find understanding nondeterministic finite-state and pushdown automata difficult. In many cases, this means that it is challenging for them to comprehend the operational semantics of such machines and, as a consequence, determine why a word is accepted or rejected. This is not entirely surprising, because students are mostly trained to design and implement deterministic programs. Comprehension of pushdown automata is further complicated, because reasoning about the stack is necessary. A common difficulty students face, for example, is understanding that two different computations on the same word may reach the same state with different stack values. To aid student understanding, we present two novel dynamic visualization tools for FSM -- a domain-specific programming language for the Automata Theory classroom -- to support the design of such machines. These tools visualize all computations that may be performed, respectively, by a nondeterministic finite-state machine or by a pushdown automata in a stepwise manner. In addition, these tools aid the machine verification process by allowing users to visually validate whether the properties a state represents hold when a machine transitions into it.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

48 extracted references · 37 canonical work pages

  1. [1]

    Mip-nerf 360: Unbounded anti-aliased neural radiance fields

    Jonathan T Barron, Ben Mildenhall, Dor Verbin, Pratul P Srinivasan, and Peter Hedman. Mip-nerf 360: Unbounded anti-aliased neural radiance fields. InProceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 5470–5479, 2022. 6, 8

    work page 2022

  2. [2]

    Patchmatch stereo - stereo matching with slanted support windows

    Michael Bleyer, Christoph Rhemann, and Carsten Rother. Patchmatch stereo - stereo matching with slanted support windows. InBritish Machine Vision Conference, BMVC 2011, Dundee, UK, August 29 - September 2, 2011. Proceed- ings, pages 1–11, 2011. 2

    work page 2011

  3. [3]

    Pixelsplat: 3d gaussian splats from image pairs for scalable generalizable 3d reconstruction

    David Charatan, Sizhe Lester Li, Andrea Tagliasacchi, and Vincent Sitzmann. Pixelsplat: 3d gaussian splats from image pairs for scalable generalizable 3d reconstruction. InIEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2024, Seattle, WA, USA, June 16-22, 2024, pages 19457–19467, 2024. 2

    work page 2024

  4. [4]

    Mvsnerf: Fast general- izable radiance field reconstruction from multi-view stereo

    Anpei Chen, Zexiang Xu, Fuqiang Zhao, Xiaoshuai Zhang, Fanbo Xiang, Jingyi Yu, and Hao Su. Mvsnerf: Fast general- izable radiance field reconstruction from multi-view stereo. In2021 IEEE/CVF International Conference on Computer Vision, ICCV 2021, Montreal, QC, Canada, October 10-17, 2021, pages 14104–14113, 2021. 2

    work page 2021

  5. [5]

    Mvsplat: Efficient 3d gaussian splatting from sparse multi-view images

    Yuedong Chen, Haofei Xu, Chuanxia Zheng, Bohan Zhuang, Marc Pollefeys, Andreas Geiger, Tat-Jen Cham, and Jianfei Cai. Mvsplat: Efficient 3d gaussian splatting from sparse multi-view images. InComputer Vision - ECCV 2024 - 18th European Conference, Milan, Italy, September 29-October 4, 2024, Proceedings, Part XXI, pages 370–386, 2024. 2

    work page 2024

  6. [6]

    Chang, Manolis Savva, Maciej Hal- ber, Thomas A

    Angela Dai, Angel X. Chang, Manolis Savva, Maciej Hal- ber, Thomas A. Funkhouser, and Matthias Nießner. Scan- net: Richly-annotated 3d reconstructions of indoor scenes. In2017 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2017, Honolulu, HI, USA, July 21-26, 2017, pages 2432–2443, 2017. 2, 6, 8, 1

    work page 2017

  7. [7]

    Seitz, Charles E

    Frank Dellaert, Steven M. Seitz, Charles E. Thorpe, and Se- bastian Thrun. Structure from motion without correspon- dence. In2000 Conference on Computer Vision and Pattern Recognition (CVPR 2000), 13-15 June 2000, Hilton Head, SC, USA, pages 2557–2564, 2000. 2, 6

    work page 2000

  8. [8]

    Large spatial model: End-to-end unposed images to semantic 3d

    Zhiwen Fan, Jian Zhang, Wenyan Cong, Peihao Wang, Renjie Li, Kairun Wen, Shijie Zhou, Achuta Kadambi, Zhangyang Wang, Danfei Xu, Boris Ivanovic, and Marco Pavone. Large spatial model: End-to-end unposed images to semantic 3d. InAdvances in Neural Information Process- ing Systems 38: Annual Conference on Neural Information Processing Systems 2024, NeurIPS ...

    work page 2024

Show all 48 references
  1. [9]

    Pointmap association and piecewise-plane constraint for consistent and compact 3d gaussian segmentation field

    Wenhao Hu, Wenhao Chai, Shengyu Hao, Xiaotong Cui, Xuexiang Wen, Jenq-Neng Hwang, and Gaoang Wang. Pointmap association and piecewise-plane constraint for consistent and compact 3d gaussian segmentation field. arXiv preprint arXiv:2502.16303, 2025. 2

    2025 arXiv

  2. [10]

    Large scale multi-view stereopsis evaluation

    Rasmus Ramsbøl Jensen, Anders Lindbjerg Dahl, George V ogiatzis, Engin Tola, and Henrik Aanæs. Large scale multi-view stereopsis evaluation. In2014 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2014, Columbus, OH, USA, June 23-28, 2014, pages 406–413. IEEE C...

    2014

  3. [11]

    Gausstr: Foundation model-aligned gaussian transformer for self-supervised 3d spatial understanding

    Haoyi Jiang, Liu Liu, Tianheng Cheng, Xinjie Wang, Tian- wei Lin, Zhizhong Su, Wenyu Liu, and Xinggang Wang. Gausstr: Foundation model-aligned gaussian transformer for self-supervised 3d spatial understanding. InIEEE/CVF Con- ference on Computer Vision and Pattern Recognition,...

    2025

  4. [12]

    Anysplat: Feed-forward 3d gaussian splatting from unconstrained views.arXiv preprint arXiv:2505.23716,

    Lihan Jiang, Yucheng Mao, Linning Xu, Tao Lu, Kerui Ren, Yichen Jin, Xudong Xu, Mulin Yu, Jiangmiao Pang, Feng Zhao, et al. Anysplat: Feed-forward 3d gaussian splatting from unconstrained views.arXiv preprint arXiv:2505.23716,

  5. [13]

    ilrm: An iterative large 3d reconstruction model, 2025

    Gyeongjin Kang, Seungtae Nam, Xiangyu Sun, Sameh Khamis, Abdelrahman Mohamed, and Eunbyung Park. ilrm: An iterative large 3d reconstruction model, 2025. 3

    2025

  6. [14]

    3d gaussian splatting for real-time radiance field rendering.ACM Trans

    Bernhard Kerbl, Georgios Kopanas, Thomas Leimk ¨uhler, and George Drettakis. 3d gaussian splatting for real-time radiance field rendering.ACM Trans. Graph., 42(4):139:1– 139:14, 2023. 2

    2023

  7. [15]

    LERF: language embed- ded radiance fields

    Justin Kerr, Chung Min Kim, Ken Goldberg, Angjoo Kanazawa, and Matthew Tancik. LERF: language embed- ded radiance fields. InIEEE/CVF International Conference on Computer Vision, ICCV 2023, Paris, France, October 1-6, 2023, pages 19672–19682, 2023. 3

    2023

  8. [16]

    Compact 3d gaussian representation for radiance field

    Joo Chan Lee, Daniel Rho, Xiangyu Sun, Jong Hwan Ko, and Eunbyung Park. Compact 3d gaussian representation for radiance field. InProceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 21719– 21728, 2024. 2

    2024

  9. [17]

    Ground- ing image matching in 3d with mast3r

    Vincent Leroy, Yohann Cabon, and J´erˆome Revaud. Ground- ing image matching in 3d with mast3r. InComputer Vi- sion - ECCV 2024 - 18th European Conference, Milan, Italy, September 29-October 4, 2024, Proceedings, Part LXXII, pages 71–91, 2024. 3

    2024

  10. [18]

    Weinberger, Serge J

    Boyi Li, Kilian Q. Weinberger, Serge J. Belongie, Vladlen Koltun, and Ren ´e Ranftl. Language-driven semantic seg- mentation. InThe Tenth International Conference on Learn- ing Representations, ICLR 2022, Virtual Event, April 25-29, 2022, 2022. 5

    2022

  11. [19]

    Mask-adapter: The devil is in the masks for open-vocabulary segmentation

    Yongkang Li, Tianheng Cheng, Bin Feng, Wenyu Liu, and Xinggang Wang. Mask-adapter: The devil is in the masks for open-vocabulary segmentation. InIEEE/CVF Confer- ence on Computer Vision and Pattern Recognition, CVPR 2025, Nashville, TN, USA, June 11-15, 2025, pages 14998– 1500...

    2025

  12. [20]

    Vicasplat: A single run is all you need for 3d gaussian splatting and camera estimation from unposed video frames.CoRR, abs/2503.10286, 2025

    Zhiqi Li, Chengrui Dong, Yiming Chen, Zhangchi Huang, and Peidong Liu. Vicasplat: A single run is all you need for 3d gaussian splatting and camera estimation from unposed video frames.CoRR, abs/2503.10286, 2025. 8

    2025 arXiv

  13. [21]

    Su- pergseg: Open-vocabulary 3d segmentation with structured super-gaussians.arXiv preprint arXiv:2412.10231, 2024

    Siyun Liang, Sen Wang, Kunyi Li, Michael Niemeyer, Ste- fano Gasperini, Nassir Navab, and Federico Tombari. Su- pergseg: Open-vocabulary 3d segmentation with structured super-gaussians.arXiv preprint arXiv:2412.10231, 2024. 3

    2024

  14. [22]

    Infinite na- ture: Perpetual view generation of natural scenes from a sin- gle image

    Andrew Liu, Ameesh Makadia, Richard Tucker, Noah Snavely, Varun Jampani, and Angjoo Kanazawa. Infinite na- ture: Perpetual view generation of natural scenes from a sin- gle image. In2021 IEEE/CVF International Conference on Computer Vision, ICCV 2021, Montreal, QC, Canada, Oc-...

    2021

  15. [23]

    Mvsgaussian: Fast generalizable gaussian splatting recon- struction from multi-view stereo

    Tianqi Liu, Guangcong Wang, Shoukang Hu, Liao Shen, Xinyi Ye, Yuhang Zang, Zhiguo Cao, Wei Li, and Ziwei Liu. Mvsgaussian: Fast generalizable gaussian splatting recon- struction from multi-view stereo. InEuropean Conference on Computer Vision, pages 37–53. Springer, 2024. 2

    2024

  16. [24]

    Srinivasan, Matthew Tancik, Jonathan T

    Ben Mildenhall, Pratul P. Srinivasan, Matthew Tancik, Jonathan T. Barron, Ravi Ramamoorthi, and Ren Ng. Nerf: Representing scenes as neural radiance fields for view syn- thesis. InComputer Vision - ECCV 2020 - 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceed-...

    2020

  17. [25]

    Generative den- sification: Learning to densify gaussians for high-fidelity generalizable 3d reconstruction

    Seungtae Nam, Xiangyu Sun, Gyeongjin Kang, Younggeun Lee, Seungjun Oh, and Eunbyung Park. Generative den- sification: Learning to densify gaussians for high-fidelity generalizable 3d reconstruction. InIEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2025, N...

    2025

  18. [26]

    V o et al

    Maxime Oquab, Timoth ´ee Darcet, Th ´eo Moutakanni, and Huy V . V o et al. Dinov2: Learning robust visual features without supervision.Trans. Mach. Learn. Res., 2024. 4, 6

    2024

  19. [27]

    Py- torch: An imperative style, high-performance deep learn- ing library

    Adam Paszke, Sam Gross, and Francisco Massa et al. Py- torch: An imperative style, high-performance deep learn- ing library. InAdvances in Neural Information Processing Systems 32: Annual Conference on Neural Information Pro- cessing Systems 2019, NeurIPS 2019, December 8-14, ...

    2019

  20. [28]

    Langsplat: 3d language gaussian splat- ting

    Minghan Qin, Wanhua Li, Jiawei Zhou, Haoqian Wang, and Hanspeter Pfister. Langsplat: 3d language gaussian splat- ting. InIEEE/CVF Conference on Computer Vision and Pat- tern Recognition, CVPR 2024, Seattle, WA, USA, June 16-22, 2024, pages 20051–20060, 2024. 2, 3

    2024

  21. [29]

    Learning transferable visual models from natural language supervision

    Alec Radford, Jong Wook Kim, and Ilya Sutskever et al. Learning transferable visual models from natural language supervision. InProceedings of the 38th International Con- ference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event, pages 8748–8763, 2021. 3

    2021

  22. [30]

    Vi- sion transformers for dense prediction

    Ren ´e Ranftl, Alexey Bochkovskiy, and Vladlen Koltun. Vi- sion transformers for dense prediction. In2021 IEEE/CVF International Conference on Computer Vision, ICCV 2021, Montreal, QC, Canada, October 10-17, 2021, pages 12159– 12168, 2021. 4

    2021

  23. [31]

    Chen, Zeyu Zhang, Jia-Wang Bian, Bohan Zhuang, and Chunhua Shen

    Duochao Shi, Weijie Wang, Donny Y . Chen, Zeyu Zhang, Jia-Wang Bian, Bohan Zhuang, and Chunhua Shen. Revisit- ing depth representations for feed-forward 3d gaussian splat- ting.CoRR, abs/2506.05327, 2025. 5

    2025 arXiv

  24. [32]

    Splatt3r: Zero-shot gaussian splat- ting from uncalibrated image pairs.CoRR, abs/2408.13912,

    Brandon Smart, Chuanxia Zheng, Iro Laina, and Vic- tor Adrian Prisacariu. Splatt3r: Zero-shot gaussian splat- ting from uncalibrated image pairs.CoRR, abs/2408.13912,

    arXiv

  25. [33]

    F-3dgs: Factorized co- ordinates and representations for 3d gaussian splatting

    Xiangyu Sun, Joo Chan Lee, Daniel Rho, Jong Hwan Ko, Usman Ali, and Eunbyung Park. F-3dgs: Factorized co- ordinates and representations for 3d gaussian splatting. In Proceedings of the 32nd ACM International Conference on Multimedia, pages 7957–7965, 2024. 2

    2024

  26. [34]

    Uniforward: Unified 3d scene and semantic field re- construction via feed-forward gaussian splatting from only sparse-view images.CoRR, abs/2506.09378, 2025

    Qijian Tian, Xin Tan, Jingyu Gong, Yuan Xie, and Lizhuang Ma. Uniforward: Unified 3d scene and semantic field re- construction via feed-forward gaussian splatting from only sparse-view images.CoRR, abs/2506.09378, 2025. 2

    2025 arXiv

  27. [35]

    Least-squares estimation of transformation parameters between two point patterns.IEEE Trans

    Shinji Umeyama. Least-squares estimation of transformation parameters between two point patterns.IEEE Trans. Pattern Anal. Mach. Intell., 13(4):376–380, 1991. 6

    1991

  28. [36]

    VGGT: visual geometry grounded transformer

    Jianyuan Wang, Minghao Chen, Nikita Karaev, Andrea Vedaldi, Christian Rupprecht, and David Novotn ´y. VGGT: visual geometry grounded transformer. InIEEE/CVF Con- ference on Computer Vision and Pattern Recognition, CVPR 2025, Nashville, TN, USA, June 11-15, 2025, pages 5294– 53...

    2025

  29. [37]

    Dust3r: Geometric 3d vision made easy

    Shuzhe Wang, Vincent Leroy, Yohann Cabon, Boris Chidlovskii, and J ´erˆome Revaud. Dust3r: Geometric 3d vision made easy. InIEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2024, Seattle, WA, USA, June 16-22, 2024, pages 20697–20709, 2024. 2, 3

    2024

  30. [38]

    Gsemsplat: Generalizable semantic 3d gaussian splatting from uncalibrated image pairs.arXiv preprint arXiv:2412.16932, 2024

    Xingrui Wang, Cuiling Lan, Hanxin Zhu, Zhibo Chen, and Yan Lu. Gsemsplat: Generalizable semantic 3d gaussian splatting from uncalibrated image pairs.arXiv preprint arXiv:2412.16932, 2024. 3

    2024 arXiv

  31. [39]

    Depthsplat: Connecting gaussian splatting and depth

    Haofei Xu, Songyou Peng, and Marc Pollefeys et al. Depthsplat: Connecting gaussian splatting and depth. In IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2025, Nashville, TN, USA, June 11-15, 2025, pages 16453–16463. Computer Vision Foundation / IEEE, 2025. 2, 3

    2025

  32. [40]

    No pose, no prob- lem: Surprisingly simple 3d gaussian splats from sparse un- posed images

    Botao Ye, Sifei Liu, Haofei Xu, Xueting Li, Marc Pollefeys, Ming-Hsuan Yang, and Songyou Peng. No pose, no prob- lem: Surprisingly simple 3d gaussian splats from sparse un- posed images. InThe Thirteenth International Conference on Learning Representations, ICLR 2025, Singapor...

    2025

  33. [41]

    Scannet++: A high-fidelity dataset of 3d indoor scenes

    Chandan Yeshwanth, Yueh-Cheng Liu, Matthias Nießner, and Angela Dai. Scannet++: A high-fidelity dataset of 3d indoor scenes. InIEEE/CVF International Conference on Computer Vision, ICCV 2023, Paris, France, October 1-6, 2023, pages 12–22. IEEE, 2023. 6, 1

    2023

  34. [42]

    pixelnerf: Neural radiance fields from one or few images

    Alex Yu, Vickie Ye, Matthew Tancik, and Angjoo Kanazawa. pixelnerf: Neural radiance fields from one or few images. In IEEE Conference on Computer Vision and Pattern Recogni- tion, CVPR 2021, virtual, June 19-25, 2021, pages 4578– 4587, 2021. 2

    2021

  35. [43]

    Panogs: Gaussian-based panoptic seg- mentation for 3d open vocabulary scene understanding

    Hongjia Zhai, Hai Li, Zhenzhe Li, Xiaokun Pan, Yijia He, and Guofeng Zhang. Panogs: Gaussian-based panoptic seg- mentation for 3d open vocabulary scene understanding. In Proceedings of the Computer Vision and Pattern Recognition Conference, pages 14114–14124, 2025. 3

    2025

  36. [44]

    Efros, Eli Shecht- man, and Oliver Wang

    Richard Zhang, Phillip Isola, Alexei A. Efros, Eli Shecht- man, and Oliver Wang. The unreasonable effectiveness of deep features as a perceptual metric. In2018 IEEE Con- ference on Computer Vision and Pattern Recognition, CVPR 2018, Salt Lake City, UT, USA, June 18-22, 2018, p...

    2018

  37. [45]

    Feature 3dgs: Supercharg- ing 3d gaussian splatting to enable distilled feature fields

    Shijie Zhou, Haoran Chang, Sicheng Jiang, Zhiwen Fan, Ze- hao Zhu, Dejia Xu, Pradyumna Chari, Suya You, Zhangyang Wang, and Achuta Kadambi. Feature 3dgs: Supercharg- ing 3d gaussian splatting to enable distilled feature fields. InIEEE/CVF Conference on Computer Vision and Patt...

    2024

  38. [46]

    Stereo magnification: Learning view synthesis using multiplane images.arXiv preprint arXiv:1805.09817, 2018

    Tinghui Zhou, Richard Tucker, John Flynn, Graham Fyffe, and Noah Snavely. Stereo magnification: Learning view synthesis using multiplane images.arXiv preprint arXiv:1805.09817, 2018. 2, 6, 7, 8, 1 Uni3R: Unified 3D Reconstruction and Semantic Understanding via Generalizable Ga...

    2018 arXiv

  39. [48]

    Appendix 6.1. Results on the DTU and ScanNet++ dataset To evaluate the cross-domain generalization of Uni3R, we follow NoPoSplat [40]: training on RE10K [46] dataset and testing on DTU [10] and ScanNet++[41] dataset. As shown in Tab. 8, Uni3R consistently outperforms all basel...

  40. [595]

    Computer Vision Foundation / IEEE Computer Society,

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.