- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work presents a synthetic data generation pipeline SimpleProc to generate effective training data for downstream MVS tasks such as depth estimation in fully procedural manner. The procedural generator is driven by lofting random NURBS profile curves ("starfish" or "reptile" style) along a 3D random-walk stem curve. It adds brick, wave, or noise displacement, applies textures made from thresholded procedural patterns combined with Boolean operations, and samples simple material parameters. Each scene contains up to 8 large and many small objects, an optional room box, optional ground scatter, area lights, and 8 cameras on a spherical band, rendered with Blender EEVEE. The experiments show that, with the same scale of data under limited budget, the MVS model trained by generated data is outperforming the one trained with curated data. When considering an unlimited budget scenario, model trained by SimpleProc is comparable to the curated baseline when ScanNet is excluded, with about half the images. However, the result also reveals that the model powered by the generation pipeline struggles to scale to sparse visibility indoor scene.
Critical strengths
- At an equal number of training images, SimpleProc data outperforms the curated mixture on four of five benchmarks and MegaSynth [1] on all five, with aggregate margins well beyond the reported standard deviation.
- The generator is fully procedural and needs no artist-made assets or image textures.
[1] CVPR 2025, Jiang, MegaSynth: Scaling Up 3D Scene Reconstruction with Synthesized Data.
Critical weaknesses
Pipeline design is not connected to the research questions. The introduction asks which rules MVS data needs and argues that realism is unnecessary (L073–075). However, Sec. 4 lists implementation details without explaining what the NURBS shapes and procedural textures contribute to MVS training. Several rules are instead justified by realism: clustered placement, the room box, and ground scatter (L301–306). I suggest that the authors define what MVS training data requires and map each rule to it, which would make the "small set of rules" claim testable.
Ablations could more clearly isolate the contribution of each rule. First, all shapes are lofted NURBS surfaces (L191), yet the only stated motivation is that they contain "both smooth and sharp features" (L227–228), and the only baseline is cubes, spheres, and cylinders (L672–675). Explaining why NURBS suits MVS training, and comparing it with a representation of similar complexity, such as the implicit surfaces in Shape Evolution [2], would show whether the gain comes from NURBS or from richer geometry. Second, the abstract names displacement and texture as core rules (L015–016), but these rules are ablated only in Appendix A; moving these results into the main text would let readers assess which rules matter.
Only one architecture is tested. All results use MVSAnywhere [3], which combines monocular and multi-view cues, so the claim that the generator "is by no means specialized to MVSAnywhere" (L151–152) is untested. At least one purely multi-view model without monocular depth cues (e.g., CasMVSNet [4] or MVSFormer++ [5]) trained on SimpleProc and on curated data is needed.
[2] CVPR 2018, Yang, Shape from Shading through Shape Evolution.
[3] CVPR 2025, Izquierdo, MVSAnywhere: Zero-Shot Multi-View Stereo.
[4] CVPR 2020, Gu, Cascade Cost Volume for High-Resolution Multi-View Stereo and Stereo Matching.
[5] ICLR 2024, Cao, MVSFormer++: Revealing the Devil in Transformer's Details for Multi-View Stereo.
Questions for authors
- How does performance change as each rule is added to a minimal NURBS generator? Since the best configuration may shift with dataset size (L656–657), was it re-validated at 352K?
- How is MVSAnywhere [3] initialized? If Depth Anything V2 [6] weights are used, does SimpleProc still match curated data with a randomly initialized encoder?
- Why does each image still take 262 s (L315) when the rasterization-based EEVEE engine is chosen for efficiency (L308), and what is the rendering resolution? How much performance is lost with cheaper rendering, such as coarser NURBS tessellation or simpler shading? The reported compute also seems inconsistent: 352,000 images x 262 s ≈ 25,600 GPU-hours, which already equals the stated total (L364–365), yet that total is said to include variant configurations during generator development. What is the rendering cost of the final 352K dataset alone, and how much compute went into tuning the generator on the validation split?
[6] NeurIPS 2024, Yang, Depth Anything V2.