【24h】

Grid-based Image Registration

机译:基于网格的图像配准

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

摘要

We introduce and discuss preliminary experience with an application that has V vast potential to exploit the Grid for social benefit and offers interesting resource assessment and allocation challenges, having real-time aspects: image registration. Image registration is generally formulated as an optimization problem that satisfies constraints, such as coordinate displacements that are affine or volume-preserving or that obey the laws of elasticity. Three-dimensional registration of high-resolution images is computationally complex and justifies parallel implementation. In turn, ensembles of registration tasks exploit concurrency in the simpler sense of job farming. Registration is an elementary example of a much larger class of large-scale mesh-based computations that are in principle amenable to execution on the Grid, but are sensitive to workload-to-capability balance at synchronization points. While better resource assessment and allocation tools lift all such applications, reducing sensitivity to synchronization within an individual application is a complementary and equally important objective. We therefore examine the potential for weakening the synchronization sensitivity of general mesh-based bulk synchronous computations through less restrictive programming paradigms.
机译:我们将介绍并讨论具有V潜力的应用程序的初步经验,该应用程序具有巨大的潜力来利用Grid以获得社会利益,并提供有趣的资源评估和分配挑战,并具有实时方面:图像配准。图像配准通常被公式化为满足约束的优化问题,例如仿射或体积保留的坐标位移或遵循弹性定律的约束。高分辨率图像的三维配准在计算上很复杂,并且证明了并行实现的合理性。反过来,注册任务的集合则从更简单的工作农业的角度利用并发性。注册是大型的基于网格的大型计算的基本示例,这些计算原则上可以在Grid上执行,但对同步点处的工作负载与功能之间的平衡很敏感。虽然更好的资源评估和分配工具可以提升所有这些应用程序的性能,但降低单个应用程序内部对同步的敏感性却是一个补充且同样重要的目标。因此,我们研究了通过较少限制的编程范例来削弱一般基于网格的批量同步计算的同步敏感性的潜力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号