| 利用等值线跟踪的快速步进法 |
| |
| 引用本文： | 朱贵冬,沈理.利用等值线跟踪的快速步进法[J].计算机辅助设计与图形学学报,2006,18(12):1830-1836. |
| |
| 作者姓名： | 朱贵冬 沈理 |
| |
| 作者单位： | 1. 中国科学院计算技术研究所系统结构部,北京,100080;中国科学院研究生院,北京,100049
2. 中国科学院计算技术研究所系统结构部,北京,100080 |
| |
| 摘 要： | 针对由明暗重构三维形状及普遍意义上的Eikonal偏微分方程求解问题，提出一种基于等值线跟踪的快速步进法，通过跟踪等值线的传播，利用迎风格式对等值线附近的扩展区域进行单遍或两遍更新，使求解过程具有O（N）复杂度．实验结果表明，该方法改进了已有快速步进法的速度和精度，可有效地处理多源问题及由明暗重构形状问题，且在复杂情形下速度优于快速扫描法．
|
| 关 键 词： | 快速步进法 Eikonal方程 迎风格式 由明暗重构三维形状 |
| 收稿时间： | 2006-02-07 |
| 修稿时间： | 2006-04-19 |
Fast Marching by Isoline Tracking |
| |
| Zhu Guidong,Shen Li.Fast Marching by Isoline Tracking[J].Journal of Computer-Aided Design & Computer Graphics,2006,18(12):1830-1836. |
| |
| Authors: | Zhu Guidong Shen Li |
| |
| Affiliation: | 1.Department of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences Beijing 100080;2. Graduate University of Chinese Academy of Sciences, Beijing 100049 |
| |
| Abstract: | A fast marching algorithm is proposed to solve shape-from-shading problems and the general Eikonal equations. First, the expansion of isolines is recorded and tracked. Then, the values of nodes in expanding band are updated by upwind scheme once or twice in different orders. The time complexity is proven to be O(N). Experimental results show that the algorithm can improve the numerical efficiency and accuracy of existing fast marching methods, solve adequately multi-source and shape-from-shading problems, and is much faster than the fast sweeping method in complicated situations. |
| |
| Keywords: | fast marching Eikonal equation upwind scheme shape-from-shading |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
