1) fast marching method
快进法
1.
Then, the whole damaged area can be restored along the routine which defined by the fast marching method.
该算法首先通过对待修复点邻域像素梯度值进行排序,估计出该点的等照度线方向,从而自适应地确定其修复模板,然后利用快进法(fast marching method)确定修复路径并完成对整个破损区域的修复。
2) fast marching method
快进方法
1.
The distant template method(DTM) is proposed and compared with the fast marching method(FFM) and fast sweep method on time complexity,the effects of the width and the number of points with zero level on the narrow band s construction.
提出了距离模板方法并从时间复杂度、窄带宽度以及零水平集点数对窄带生成的影响等方面与快进方法、快速扫描方法进行了比较;在分析快进方法的基础上,给出了一种窄带构造算法;改进了全局快速扫描算法,以用于生成窄带。
3) Fast marching
快速行进法
4) fast-marching algorithm
快速推进法
1.
This paper presented a modified fast-marching algorithm,in which a fitted ellipsoid model was employed to march the evolution surface into the diminished region to insure the extracting of the left-ven.
本研究提出一种基于医学知识的快速推进法,利用拟合的椭球模型将边界演化推进到局部低显像区,从而分割出一个完整的左心室心肌区域。
5) fast marching
快速步进法
1.
A fast marching algorithm is proposed to solve shape-from-shading problems and the general Eikonal equations.
针对由明暗重构三维形状及普遍意义上的Eikonal偏微分方程求解问题,提出一种基于等值线跟踪的快速步进法,通过跟踪等值线的传播,利用迎风格式对等值线附近的扩展区域进行单遍或两遍更新,使求解过程具有O(N)复杂度·实验结果表明,该方法改进了已有快速步进法的速度和精度,可有效地处理多源问题及由明暗重构形状问题,且在复杂情形下速度优于快速扫描法
2.
A fast marching algorithm is proposed to solve shape reconstruction problems and the general Eikonal equations.
针对形状重建及Eikonal方程求解问题,提出了一种根据曲面曲率动态地对网格进行细化的快速步进法,证明了该方法在一阶差分情形下符合因果律,在实现中利用哈希表对邻接点进行快速定位。
6) Fast marching method
快速行进法
1.
Given a pixel (seed point) interior to a region and the filling color, the algorithm fills all other pixels interior to the region according to the arrival time of the front computed by fast marching method.
提出了一种基于快速行进法的区域填充算法,可用于内点表示或边界表示的4 连通区域的单色和渐变填充。
补充资料：快堆(见快中子增殖堆)
快堆(见快中子增殖堆)
fast-breeder reactor
l快堆堆。(fast一breeder reaetor)见快中子增殖
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条