耳廓三维网格去补丁合并算法
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

国家自然科学基金(61472170,61170143,60873110);北京邮电大学智能通信软件与多媒体北京市重点实验室开放课题(ITSM201301)


3D Ear Mesh Merge Algorithm Based on Patch Removing
Author:
Affiliation:

Fund Project:

National Natural Science Foundation of China (61472170, 61170143, 60873110); Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia (Beijing University of Posts and Telecommunications) (ITSM201301)

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对耳廓多角度扫描获取的三维网格合并问题,提出了一种新的三维网格合并方法——去补丁合并法.首先,基于kd-tree算法将三维耳廓配准后的两幅网格快速分割为重叠区域与非重叠区域;然后,根据连通性对重叠区域和非重叠区域进行分块,并从重叠区域分块中去除冗余的补丁块、构建边界点;最后,基于边界点将保留的重叠区域网格与邻接的非重叠区域网格缝合.实验结果表明,与同类算法相比,该方法具有较好的合并效果与较高的计算效率.

    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.

    参考文献
    相似文献
    引证文献
引用本文

孙晓鹏,盖宇,徐南,李志.耳廓三维网格去补丁合并算法.软件学报,2016,27(10):2612-2621

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2016-01-21
  • 最后修改日期:2016-03-25
  • 录用日期:
  • 在线发布日期: 2016-08-11
  • 出版日期:
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号