检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吕晓琪[1] 王海录 任国印[1] 贾东征[1] 孟会含
机构地区:[1]内蒙古科技大学信息工程学院,包头014010
出 处:《系统仿真学报》2014年第6期1251-1256,共6页Journal of System Simulation
基 金:国家自然科学基金项目(61179019);内蒙古科技大学创新基金项目(2012NCL018)
摘 要:虚拟内窥镜自动漫游的中心路径提取采用边界距离变换算法实现。通过判断与组织相关的体素点、计算体素点的ID值和灰度值、标记处理点并将其作为新的边界点的方法来缩短边界距离场的建立时间;利用下标与体素点的边界距离一致的结构体数组作为快速查找表,将体素点按照其边界距离链接到数组的相应位置,每次选取位于数组下标最大位置的点进行处理,利用数组查询时间复杂度低的方法提高建立源距离场的时间效率。实验结果表明该实现方法时间效率高,提取的中心路径漫游效果好,实时性好。The method of the boundary distance transform was often adopted in the exaction of the centerline of virtual endoscopy automatic roaming technology. Several methods were used in order to shorten the time of establishing boundary distance field, such as judging the data set points, calculating the ID and grey value of voxel point, marking the point and regarding it as the new boundary point. Structured array which has the same boundary distance between the subscript and the voxel point was used as the fast lookup table. According to the boundary distance, the voxel point was linked to the corresponding position of the array. In each time the point which had the largest subscript of array was chosen and dealt with. So, this method of the low complexity was made use of in order to increase the time efficiency of establishing source distance field. The experiment shows that the methods possess the features of high efficiency, good effect of navigation of the extracted centerline and good timeliness.
关 键 词:虚拟内窥镜 自动漫游 边界距离变换 边界距离场 源距离场
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.171.58