首页 | 本学科首页   官方微博 | 高级检索  
     检索      

耳廓三维网格去补丁合并算法
引用本文:孙晓鹏,盖宇,徐南,李志.耳廓三维网格去补丁合并算法[J].软件学报,2016,27(10):2612-2621.
作者姓名:孙晓鹏  盖宇  徐南  李志
作者单位:辽宁师范大学计算机与信息技术学院计算机系统研究所, 辽宁 大连 116029;智能通信软件与多媒体北京市重点实验室(北京邮电大学), 北京 100876,辽宁师范大学计算机与信息技术学院计算机系统研究所, 辽宁 大连 116029,辽宁师范大学计算机与信息技术学院计算机系统研究所, 辽宁 大连 116029,辽宁师范大学计算机与信息技术学院计算机系统研究所, 辽宁 大连 116029
基金项目:国家自然科学基金(61472170,61170143,60873110);北京邮电大学智能通信软件与多媒体北京市重点实验室开放课题(ITSM201301)
摘    要:针对耳廓多角度扫描获取的三维网格合并问题,提出了一种新的三维网格合并方法—去补丁合并法.首先基于kd-tree算法将三维耳廓配准后的两幅网格快速分割为重叠区域与非重叠区域;然后根据连通性对重叠区域和非重叠区域进行分块,并从重叠区域分块中去除冗余的补丁块、构建边界点;最后基于边界点将保留的重叠区域网格与邻接的非重叠区域网格缝合.实验结果表明,与同类算法相比,本文方法具有较好的合并效果与较高的计算效率.

关 键 词:三维耳廓  kd-tree  网格合并  重叠区域  补丁去除
收稿时间:2016/1/21 0:00:00
修稿时间:2016/3/25 0:00:00

3D Ear Mesh Merge Algorithm Based on Patch Removing
SUN Xiao-Peng,GAI Yu,XU Nan and LI Zhi.3D Ear Mesh Merge Algorithm Based on Patch Removing[J].Journal of Software,2016,27(10):2612-2621.
Authors:SUN Xiao-Peng  GAI Yu  XU Nan and LI Zhi
Institution:Computer System Institute, Department of Computer and Information Technology, Liaoning Normal University, Dalian 116029, China;Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia (Beijing University of Posts and Telecommunications), Beijing 100876, China,Computer System Institute, Department of Computer and Information Technology, Liaoning Normal University, Dalian 116029, China,Computer System Institute, Department of Computer and Information Technology, Liaoning Normal University, Dalian 116029, China and Computer System Institute, Department of Computer and Information Technology, Liaoning Normal University, Dalian 116029, China
Abstract:To merge the multiple meshes of the same human ear, which was scanned from different perspectives, this paper proposes a novel approach for 3D ear mesh merge-Patch Removing. First, we use kd-tree to segment the two registration meshes of 3D ear into un-overlapping area and overlapped area; Then, segment the un-overlapping area and overlapping into blocks according to their connectivity, discard the redundant patch in the overlapping area, and find the points on the boundary of blocks; Finally, to merge the 3D ear meshes, we stitch the mesh blocks in the un-overlapping area and the rest of the overlapping area along the boundary points. Our experiments show that, comparing with other works, our algorithm can merge the 3D ear meshes with more effectively and higher computational efficiency.
Keywords:3D ear  kd-tree  mesh merge  overlapping area  patch removing
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号