An asynchronous architecture decouples incremental voxel-based mapping from VLM-based semantic enrichment to produce queryable open-vocabulary 3D scene graphs that match or exceed prior methods on segmentation and grounding benchmarks.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
A multimodal alignment framework derives morphology-aware image embeddings as continuous traits for Bayesian phylogenetic reconstruction, improving topological agreement on the Rove-Tree-11 dataset.
VeriDrive introduces a verifiable counterfactual supervision framework using a Perception-Evaluation-Revision chain and validator-guided correction to generate cost-efficient structured data for vision-language driving models, showing metric gains on nuScenes.
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
citing papers explorer
-
Think While You Map: Asynchronous Vision-Language Agents for Incremental 3D Scene Graphs
An asynchronous architecture decouples incremental voxel-based mapping from VLM-based semantic enrichment to produce queryable open-vocabulary 3D scene graphs that match or exceed prior methods on segmentation and grounding benchmarks.
-
Morphology-Aware Multimodal Representation Learning for Insect Phylogenetic Reconstruction
A multimodal alignment framework derives morphology-aware image embeddings as continuous traits for Bayesian phylogenetic reconstruction, improving topological agreement on the Rove-Tree-11 dataset.
-
VeriDrive: Verifiable Counterfactual Supervision for Cost-Efficient Vision-Language Planning
VeriDrive introduces a verifiable counterfactual supervision framework using a Perception-Evaluation-Revision chain and validator-guided correction to generate cost-efficient structured data for vision-language driving models, showing metric gains on nuScenes.
-
Maximizing Reachability via Shifting of Temporal Paths
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.