【24h】

3D-3D Alignment using Particle Swarm Optimization

机译:使用粒子群算法的3D-3D对准

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

摘要

Three-dimensional datasets of unique, complex objects are readily available from the tomographic modalities, and fusion of these data sets leads to new understanding of the data and their relationships. In many cases, automatic alignment of the objects is difficult or time consuming when substantial misalignments are present or point correspondences cannot be established, or the solution space is non-convex. These issues effectively exclude most optimization algorithms used in conventional data alignment. Here, we present the particle swarm optimization (PSO) approach which is not sensitive to initial conditions, local minima or non-convex solution space. Intercommunicating particle swarms are randomly placed in the solution space (representing the parameters of the rigid transformations). Each member of each swarm traverses the solution space, constantly evaluating the objective function at its own position and communicating with other members of the swarm about theirs. In addition, the swarms communicate between themselves. Through this information sharing between swarm members and the swarms, the space is searched completely and efficiently, and as a result all swarms converge near the globally optimal rigid transformation. To evaluate the technique, high-resolution micro-CT data sets of single mouse heads were acquired with large initial misalignments. Using two communicating particle swarms in the same solution space, six distinct mouse head objects were aligned finding the approximate global minima in about 25 iterations or 140 seconds on a standard PC independent of initial conditions. Faster speeds (better accuracy) can be obtained by relaxing (restricting) the convergence criteria. These results indicate that the particle swarm approach may be a valuable tool for stand-alone or hybrid alignments.
机译:独特而复杂的对象的三维数据集可从断层扫描模态中轻松获得,这些数据集的融合使人们对数据及其关系有了新的认识。在许多情况下,当出现严重的未对准或无法建立点对应关系或解决方案空间不为凸时,对象的自动对准将非常困难或耗时。这些问题实际上排除了常规数据对齐中使用的大多数优化算法。在这里,我们提出了对初始条件,局部极小值或非凸解空间不敏感的粒子群优化(PSO)方法。相互通信的粒子群随机放置在解空间中(表示刚性变换的参数)。每个群的每个成员遍历求解空间,不断评估目标函数在其自身位置上的位置,并与群的其他成员进行交流。另外,群之间相互通信。通过群体成员和群体之间的这种信息共享,可以完全有效地搜索空间,结果所有群体都收敛于全局最优刚性变换附近。为了评估该技术,获取了具有较大初始偏差的单个鼠标头的高分辨率micro-CT数据集。在相同的解决方案空间中使用两个通信粒子群,将六个不同的鼠标头对象对齐,在独立于初始条件的标准PC上,在大约25次迭代或140秒内找到近似的全局最小值。通过放宽(限制)收敛标准可以获得更快的速度(更好的准确性)。这些结果表明,粒子群方法可能是独立或混合排列的有价值的工具。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号