检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华侨大学数字化视觉测量厦门市重点实验室,福建厦门361021
出 处:《计算机工程与应用》2016年第6期186-190,共5页Computer Engineering and Applications
基 金:国家科技支撑计划资助项目(No.2012BAF12B15);国家自然科学基金(No.50975100;No.51175191;No.51105150);福建省自然科学基金(No.2011H2003;No.2013J01190;No.2011J01314);福建省科技计划项目(No.2008H0085)
摘 要:为了在具有多个特征边界的散乱点云上提取指定目标特征边界,提出了一种基于目标特征边界交互提取的算法。拾取目标特征及其周围的点云。利用KD树建立散乱点云的空间拓扑关系,计算出每个数据点的k邻域。通过数据点k邻域构成的最小二乘平面的投影点角度差,根据角度差的最大值来判断该点是否为边界点。拾取目标特征边界上的某个点作为种子点,按照某一个固定方向搜索边界点,直到搜索整条封闭边界为止。实验表明,该方法能够准确获取散乱点云上任意指定目标特征的边界。A method of interactive extraction of boundary of specified target feature is proposed to extract the boundary of specified target feature from the scattered point cloud with multiple feature boundary. Firstly, the point cloud of specified feature and its surrounding is picked up. The topological relations of scattered point cloud are established with KD tree,then the k-nearest points of each point would be searched. Whether the point is the boundary point is judged by the maximum value of angle difference which is calculated by projection points on the least square plane with the k-nearest points. Lastly,one point on the boundary of the specified feature is picked up as the seed point, then according to a fixed direction to search for boundary points, until the entire closed boundary is extracted. Experiments show that, this method can accurately obtain any specified target feature boundary on the scattered point cloud.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.169