...
首页> 外文期刊>Experiments in Fluids: Experimental Methods and Their Applications to Fluid Flow >A new algorithm for the interrogation of 3D holographic PTV data based on deterministic annealing and expectation minimization optimization
【24h】

A new algorithm for the interrogation of 3D holographic PTV data based on deterministic annealing and expectation minimization optimization

机译:基于确定性退火和期望最小化优化的3D全息PTV数据查询新算法

获取原文
获取原文并翻译 | 示例
           

摘要

Recently we have presented a new particle tracking algorithm for the interrogation of 2D-PTV data [Kuzmanowski et al. (1998); Stellmacher and Obermayer (2000) Exp Fluids 28: 506-518], which estimates particle correspondences and local flow-field parameters simultaneously. The new method is based on an algorithm recently proposed by Cold et al. [Pattern Recognition (1998) 31:1019-1031], and has two advantages: (1) It allows not only local velocity but also other local components of the flow field such as rotation and shear to be determine; and (2) it allows flow-field parameters also to be reliably determined in regions of high velocity gradients (e.g., vortices or shear flow). In this contribution we extend this algorithm to the interrogation of 3D holographic particle image velocimetry (PIV) data. Benchmarks with cross-correlation and nearest-neighbor methods show that the algorithm retains the superior performance which we have observed for the 2D case. Because PTV methods scale with the square of the number of particles rather than exponentially with the dimension of the interrogation cell, the new method is much faster than cross-correlation-based methods without sacrificing accuracy, and it is well adapted to the low particle seeding densities of holographic PIV methods. [References: 17]
机译:最近,我们提出了一种用于2D-PTV数据查询的新粒子跟踪算法[Kuzmanowski等。 (1998); Stellmacher and Obermayer(2000)Exp Fluids 28:506-518],它同时估计了粒子对应关系和局部流场参数。新方法基于Cold等人最近提出的算法。 [Pattern Recognition(1998)31:1019-1031],它有两个优点:(1)它不仅可以确定局部速度,还可以确定流场的其他局部分量,例如旋转和剪切力; (2)它还可以在高速梯度区域(例如,旋涡或剪切流)中可靠地确定流场参数。在这项贡献中,我们将该算法扩展到了3D全息粒子图像测速(PIV)数据的询问。具有互相关和最近邻方法的基准表明,该算法保留了我们在2D情况下观察到的优越性能。由于PTV方法是根据粒子数量的平方而不是与讯问单元的尺寸成指数关系缩放的,因此该新方法比基于互相关的方法要快得多,并且不会牺牲准确性,并且非常适合于低粒子播种全息PIV方法的密度。 [参考:17]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号