Metraipolis › archive › dc_ccb15afab4aa

A shape-similarity latent space for fluid interfaces: invertible reduced-order modelling of droplet morphology — arXiv:2609.37947

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37947
License (as archived)
CC0-1.0
Archived
2026-10-07T18:00:15.688Z
SHA-256 of the archived text
ccd0ca822d1e83c76c8409e45aee321408ba181a8829a58caed69bac03612463
Stable URL of this page
https://metraipolis.com/documento/dc_ccb15afab4aa

How to cite

A shape-similarity latent space for fluid interfaces: invertible reduced-order modelling of droplet morphology — arXiv:2609.37947 — arXiv (en), https://arxiv.org/abs/2609.37947 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ccb15afab4aa (Metraipolis archive dc_ccb15afab4aa, sha256 ccd0ca822d1e83c76c8409e45aee321408ba181a8829a58caed69bac03612463)
BibTeX
@misc{dcccb15afab4aa,
  title = {A shape-similarity latent space for fluid interfaces: invertible reduced-order modelling of droplet morphology — arXiv:2609.37947},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37947},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ccb15afab4aa; sha256 ccd0ca822d1e83c76c8409e45aee321408ba181a8829a58caed69bac03612463},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37947. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A droplet breaks up in tens of microseconds, and a recording captures perhaps a dozen frames. The states in between cannot be recovered without repeating the experiment, and simulating them is too costly to sweep an operating envelope. Yet they are present in the corpus as a whole: a campaign spanning a device's actuation range produces morphologies resembling those any single recording missed. Exploiting that requires a representation that is low-dimensional, invertible, and faithful to shape rather than to sampling. Proper orthogonal decomposition supplies the first two but measures distance in sampled coordinates; manifold learning supplies the third but no map back to a shape; elastic shape analysis supplies a shape metric but no reduced coordinates. SHROM composes all three. Interfaces are represented by their square-root velocity functions, a neighbour graph is built over that shape space, and an autoencoder is trained to reconstruct while penalising latents in which graph neighbours are not latent neighbours. The demonstration uses 301,539 inkjet droplet contours and four filmed break-up sequences. The graph term does not improve reconstruction. It determines whether position in the latent carries meaning: clustering the latent of an otherwise identical model recovers the shape-space partition at chance level (ARI = 0.063 +/- 0.059), and at 0.781 +/- 0.049 with the term active. Waveform parameters predict the full contour at R^2 = 0.878 +/- 0.026. Negative results are reported in the same terms. The graph metric proved immaterial across five choices, and interpolation error saturates at the reconstruction limit, so a plain autoencoder leads that task. The main limitation is interpolation across a topology change: no component of the regularised latent holds both a single-component and a post-break-up shape, whereas an unregularised autoencoder mixes them freely.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-30 in stat.ML).
Categorie arXiv: Fluid Dynamics (physics.flu-dyn) ; Computational Physics (physics.comp-ph); Data Analysis, Statistics and Probability (physics.data-an); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.37947 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T17:33:44.767Z dalla pagina https://arxiv.org/catchup/stat.ML/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).