| 摘要: |
| 针对耳廓多角度扫描获取的三维网格合并问题，提出了一种新的三维网格合并方法——去补丁合并法.首先，基于kd-tree算法将三维耳廓配准后的两幅网格快速分割为重叠区域与非重叠区域；然后，根据连通性对重叠区域和非重叠区域进行分块，并从重叠区域分块中去除冗余的补丁块、构建边界点；最后，基于边界点将保留的重叠区域网格与邻接的非重叠区域网格缝合.实验结果表明，与同类算法相比，该方法具有较好的合并效果与较高的计算效率. |
| 关键词: 三维耳廓 kd-tree 网格合并 重叠区域 补丁去除 |
| DOI：10.13328/j.cnki.jos.005088 |
| 分类号: |
| 基金项目:国家自然科学基金（61472170，61170143，60873110）；北京邮电大学智能通信软件与多媒体北京市重点实验室开放课题（ITSM201301） |
|
| 3D Ear Mesh Merge Algorithm Based on Patch Removing |
|
SUN Xiao-Peng1,2, GAI Yu1, XU Nan1, LI Zhi1
|
|
1.Computer System Institute, School of Computer and Information Technology, Liaoning Normal University, Dalian 116029, China;2.Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia(Beijing University of Posts and Telecommunications), Beijing 100876, China
|
| Abstract: |
| To address the problem of merging the multiple meshes of the same human ear, which is scanned from different perspectives, this paper proposes a novel approach-patch removing, for merging 3D ear meshes. First, kd-tree is used to segment the two registration meshes of 3D ear into un-overlapping area and overlapped area. Then, the un-overlapping area and overlapping are segmented into blocks according to their connectivity. Next, the redundant patch in the overlapping area is discarded, thus establishing the points on the boundary of blocks. Finally, to merge the 3D ear meshes, the mesh blocks in the un-overlapping area and the rest of the overlapping area are stitched along the boundary points. Experimental results show that, comparing with other works, the proposed algorithm can merge the 3D ear meshes more effectively with higher computational efficiency. |
| Key words: D ear kd-tree mesh merge overlapping area patch removing |
