论文标题

用于高分辨率测量和不确定性定量的基于端到端KNN的PTV方法

An end-to-end KNN-based PTV approach for high-resolution measurements and uncertainty quantification

论文作者

Tirelli, Iacopo, Ianiro, Andrea, Discetti, Stefano

论文摘要

我们引入了一种新型的端到端方法,以改善PIV测量的分辨率。该方法将来自不同快照的信息融合在一起,而无需在不同快照中流动区域相似的时间进行时间分辨测量。主要的假设是,具有足够大的统计独立快照集合,可以识别形态上相似但在不同时间发生的流动结构是可行的。因此,可以合并来自具有相似流动组织的不同快照的测得的个体向量,从而使颗粒浓度人为地增加。这允许完善询问区域,从而增加空间分辨率。测量域在子域中分裂。相似性仅在局部规模上执行,即仅在与同一流动区域相对应的子域中寻求形态相似的区域。局部相似的快照的识别是基于无监督的K-Nearealt邻居搜索在具有重要流动特征的空间中的。此类特征是根据适当的正交分解来定义的,该分解在原始低分辨率数据的子域中执行,该数据以标准的交叉相关或粒子跟踪的固定速度计数据具有相对较大的垃圾箱大小。然后根据确定的“足够接近”快照的数量选择精制的bin尺寸。然后使用箱中速度向量的统计分散量来估计不确定性并选择最小化量的最佳k。该方法对数据集进行了测试和验证,其复杂性逐渐增加:两个虚拟实验基于直接模拟流体弹球和通道流量以及在湍流边界层中收集的实验数据。

We introduce a novel end-to-end approach to improving the resolution of PIV measurements. The method blends information from different snapshots without the need for time-resolved measurements on grounds of similarity of flow regions in different snapshots. The main hypothesis is that, with a sufficiently large ensemble of statistically-independent snapshots, the identification of flow structures that are morphologically similar but occurring at different time instants is feasible. Measured individual vectors from different snapshots with similar flow organisation can thus be merged, resulting in an artificially increased particle concentration. This allows to refine the interrogation region and, consequently, increase the spatial resolution. The measurement domain is split in subdomains. The similarity is enforced only on a local scale, i.e. morphologically-similar regions are sought only among subdomains corresponding to the same flow region. The identification of locally-similar snapshots is based on unsupervised K-nearest neighbours search in a space of significant flow features. Such features are defined in terms of a Proper Orthogonal Decomposition, performed in subdomains on the original low-resolution data, obtained either with standard cross-correlation or with binning of Particle Tracking Velocimetry data with a relatively large bin size. A refined bin size is then selected according to the number of "sufficiently close" snapshots identified. The statistical dispersion of the velocity vectors within the bin is then used to estimate the uncertainty and to select the optimal K which minimises it. The method is tested and validated against datasets with a progressively increasing level of complexity: two virtual experiments based on direct simulations of the wake of a fluidic pinball and a channel flow and the experimental data collected in a turbulent boundary layer.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源