Skip to content
AI.info

Research

Structure from Collision via Hypothesis-Space Reasoning

Overview Research area: Computer vision / physics-based 3D inverse reconstruction — specifically Structure from Collision (SfC), the problem of inferring an object's hidden interior cavities from vide

arXiv
2611.07900
Published
2026-11-05
Authors
Takuhiro Kaneko

AI summary

Overview

Research area: Computer vision / physics-based 3D inverse reconstruction — specifically Structure from Collision (SfC), the problem of inferring an object's hidden interior cavities from video of how it deforms when it collides with something.

Technical level: Advanced. The paper assumes familiarity with differentiable physics simulation, the Material Point Method (MPM), neural rendering (NeRF, 3D Gaussian splatting), Chamfer distance, and gradient-free optimization.

Scope: The paper reformulates hidden-cavity inference as search over an explicit, low-dimensional space of structural hypotheses evaluated by forward physics simulation, followed by differentiable particle-level refinement, and benchmarks it against a density-based SfC baseline.

What This Paper Is About

Two objects can look identical from the outside but behave completely differently in a collision because one has a hidden cavity inside. Static images cannot reveal this, but the way the surface moves after impact can. This paper asks: given multiview video of an object colliding with the ground, can we reconstruct where the empty space is inside it — and does doing so let us predict future motion better?

Key Contributions

  1. Diagnosis of a structural failure mode. The authors show that in the previous density-based SfC method (SfC-NeRF), surface-matching gradients can point away from the true cavity, and that density gradients are weak or uninformative inside void regions because voids are an absence of material.
  2. Reformulation as hypothesis-space reasoning. Instead of implicitly updating a density field, hidden cavities are represented as explicit structural hypotheses with compact variables — shape representation τ, center c, size s, and orientation R — that encode whatever structural assumptions are available.
  3. A two-stage framework. A global stage performs gradient-free optimization over the hypothesis space using forward-only MPM simulation (250 forward simulations, coarse-to-fine enumeration by default); a local stage refines the selected hypothesis as a Lagrangian particle system using differentiable MPM simulation (2,000 iterations).
  4. Benchmark evidence plus scope characterization. Improved reconstruction and future prediction over the density-based baseline on the SfC benchmark, together with interior-topology stress tests and robustness analyses (optimizer choice, physical-parameter error, motion blur, reduced frame rate).

Main Findings

  • Reconstruction gains are larger where localization is hardest. On the SfC benchmark, under cavity size variation the method reaches CD 0.063 / F-score 0.151 versus SfC-NeRF's 0.165 / 0.135. Under cavity position variation the gap widens: CD 0.109 / F 0.144 versus 0.281 / 0.128. (CD scaled by 10³.)
  • Both stages contribute, and they are complementary. Starting from exterior-derived cavity instantiation alone (CD 0.204, F 0.136), adding local refinement gives 0.156 / 0.138, adding global optimization alone gives 0.121 / 0.141, and the full pipeline gives 0.109 / 0.144.
  • Geometry-aware losses help. With no such losses, local refinement yields CD 0.136 / F 0.124; repulsion only gives 0.124 / 0.142; repulsion plus fixed volume 0.112 / 0.143; repulsion plus adaptive volume 0.109 / 0.144.
  • Complex topology remains hard. On the Topology dataset under the known-size setting, the method beats SfC-NeRF on all three subsets (symmetric 0.142 vs 0.174; asymmetric 0.185 vs 0.287; complex 0.582 vs 0.728), but the complex error stays high — detailed reconstruction of intricate cavities from collision alone is still difficult.
  • Richer structural assumptions help far more than better optimization. Providing candidate templates with a known center drops CD to 0.111 / 0.066 / 0.083 across symmetric / asymmetric / complex; a known template and center gives 0.090 / 0.066 / 0.070. The authors stress these rows are not directly comparable to each other because they supply different amounts of information.
  • Future prediction improves substantially, and long-horizon gains are largest. At +7 frames beyond the 14 observed frames: full method 33.6 PSNR / 0.991 SSIM versus SfC-NeRF 27.1 / 0.982 and GIC 23.1 / 0.977. At +14 frames: 30.8 / 0.988 versus 25.2 / 0.978 and 22.1 / 0.974. Global optimization alone gives 24.9 / 0.980 and 23.6 / 0.977, so local refinement drives much of the prediction gain.
  • Global-stage optimizer choice barely matters. Random search and CMA-ES match the default grid enumeration within 0.002 CD with nearly identical F-scores.
  • Moderate physical-parameter error and motion blur are tolerated; degraded observations and unknown parameters hurt position estimation. With ±10% error in Young's modulus E, CD is 0.061 / 0.100 (size / position); with ±10% error in Poisson's ratio ν, 0.059 / 0.101; unknown physical parameters jointly estimated give 0.060 / 0.119; motion blur (shutter angle 0.5) gives 0.064 / 0.096; half frame rate gives 0.061 / 0.112. The clean reference is 0.059 / 0.100.
  • The global stage is cheap relative to the local stage. In a representative timing measurement it accounted for approximately 3% of local-refinement runtime, since each evaluation is forward-only and uses only collision-adjacent frames.

Methodology in Plain English

The pipeline starts from a dense particle cloud reconstructed from multiview images, following the Gaussian-Informed Continuum (GIC) setup — a fully filled object with no cavity.

Stage I — global hypothesis search. A "hypothesis" is a proposed cavity: what shape it is, where its center sits, how big it is, and how it is oriented. For each hypothesis, the system carves that region out of the dense particles and runs a physics simulation forward from the moment before impact. It then compares the simulated silhouettes to the real ones on the frames immediately before and after the collision, using only 2D masks and only collision-adjacent frames. No gradients are needed — the hypothesis with the lowest loss wins. Restricting to nearby frames and masks keeps the search focused on coarse structural plausibility rather than penalizing long-term drift that an unrefined guess cannot fix anyway. A displacement regularizer, normalized by object extent, discourages implausibly large cavity shifts.

Stage II — local refinement. The winning hypothesis becomes a starting point for continuous optimization: individual particle positions are nudged so that, after differentiable MPM simulation over the full observed sequence, the predicted surfaces and masks match the observations. Two regularizers keep this from destroying the selected structure — a repulsive term that pushes neighboring particles apart to roughly one grid spacing (preventing collapse and clumping) and a volume-preservation term that keeps estimated material volume close to a reference, which by default is updated adaptively during refinement.

The division of labor is the point: the global stage handles the discrete, ambiguous "which cavity is it" question in a small searchable space; the local stage handles the continuous "exactly which particles go where" question with gradients. Material parameters (Young's modulus, Poisson's ratio, mass density) are treated as given in the main experiments to isolate structural ambiguity from material ambiguity. Default experimental protocol: E = 10⁶, ν = 0.3, N = 14 observed frames, M = 11 views.

Why This Matters

Impact on research. The paper reframes an inverse problem that has been approached through implicit field optimization as a structured search problem, and gives a concrete mechanistic account of why the implicit approach fails (surface-motion cues can be actively misleading, and voids have nothing to differentiate). That reframing generalizes: whenever the unknown is defined by absence rather than presence, explicit hypotheses may beat gradient descent on a density field.

Real-world applications:

  • Nondestructive inspection — inferring internal voids, bubbles, or cracks in manufactured parts or structures from how they respond to impact or vibration, without cutting them open.
  • Robotic manipulation — a robot that knows an object is hollow on one side can predict how it will tumble, bounce, or break, and plan grasps and placements accordingly.
  • Predictive simulation and digital twins — building physically faithful simulation assets from capture alone, where mass distribution determines behavior more than surface geometry does.
  • Quality control in additive manufacturing and food/agriculture — detecting internal gaps or hollows in printed parts or produce non-invasively.

Industry relevance. The method's cost profile is practical for iterative use: the structural search is forward-only and accounts for only a few percent of runtime, with the expensive differentiable simulation confined to a single refinement pass. The finding that the gradient-free optimizer barely matters (random search within 0.002 CD of grid enumeration) lowers the barrier to adoption, and the robustness results — graceful degradation under ±10% material-parameter error and motion blur — indicate the approach is not dependent on perfect capture.

Future Directions

  • Moving beyond synthetic, calibrated data. All experiments use controlled synthetic sequences with calibrated cameras and a known simulation model. Calibration noise and forward-model mismatch in real capture, and evaluation on in-the-wild collision sequences, are explicitly left as future work.
  • Richer hypothesis spaces. The authors propose multiple disconnected cavities, anisotropic scaling, and affine transformations, possibly combined with learned shape priors — plus adaptive sampling (rather than exhaustive enumeration) once the hypothesis space grows beyond the current low dimensions.
  • Resolving the topology-set ambiguity. Exact recovery of complex interior topology remains ill-posed under weak structural assumptions. A hypothesis not represented in the space can only be approximated: the global stage must pick the best mismatched option and refinement adjusts geometry but preserves the cavity structure.
  • Beyond impact. Extending the framework to other interactions — squeezing or shaking — could let internal structure be inferred from the ordinary dynamics of everyday objects rather than deliberate collisions.

Target Audience

Researchers and graduate students in computer vision, graphics, and computational physics working on inverse problems, physics-informed reconstruction, or differentiable simulation. It is also relevant to robotics and nondestructive-evaluation engineers interested in inferring material interior from observable behavior, and to anyone studying why implicit neural-field optimization struggles when the target is an absence of material rather than a presence. Readers should come with working knowledge of MPM and differentiable rendering; the paper is not an introductory treatment.

Authors’ abstract

Knowledge of the hidden interior structure of an object, including the presence and location of cavities, is essential for predictive simulation, robotic manipulation, and nondestructive inspection. However, such cavities leave no direct signature on the static visible surface, making collision-induced deformation one of the few cues used to infer their presence. Structure from Collision (SfC) addresses this problem by recovering the hidden interior structure of an object from multiview observations of a collision event. SfC is challenging for two reasons: hidden cavities are only indirectly observable through surface motion, and voids correspond to the absence of material, making direct optimization using standard density representations difficult. The density-based SfC baseline inherits both difficulties. Surface-matching gradients do not directly indicate the cavity location, while density gradients can be weak or uninformative inside or near void regions. Therefore, we reformulate SfC as hypothesis-space reasoning, representing hidden cavities as explicit structural hypotheses whose variables encode available structural assumptions rather than relying on implicit density updates. A global stage performs gradient-free optimization over this hypothesis space using forward-only material point method (MPM) simulation. A local stage then refines the selected hypothesis as a Lagrangian particle system through gradient-based optimization using differentiable MPM simulation. On the SfC benchmark, our method improves hidden-structure reconstruction and future prediction over the density-based SfC baseline. Interior-topology stress tests and robustness analyses characterize its scope and limitations. The project page is available at https://www.kecl.ntt.co.jp/people/kaneko.takuhiro/projects/sfc-hypothesis/.

Read the original paper