微信服务号

微信订阅号

2025年3月24日 9:44 星期一
首页 > 过刊浏览>2016年第27卷第10期 >2612-2621. DOI:10.13328/j.cnki.jos.005088
PDF HTML阅读 XML下载 导出引用 引用提醒
耳廓三维网格去补丁合并算法
作者:
基金项目:

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


3D Ear Mesh Merge Algorithm Based on Patch Removing
Author:
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)

  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [27]
    • |
  • 相似文献
    • |
  • 引证文献
    • | |
  • 文章评论
    摘要:

    针对耳廓多角度扫描获取的三维网格合并问题，提出了一种新的三维网格合并方法——去补丁合并法.首先，基于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.

    参考文献
    [1] Prakash S,Gupta P.An efficient ear recognition technique invariant to illumination and pose.Telecommunication Systems,2011,52(2):1435-1448.[doi:10.1007/s11235-011-9621-2]
    [2] Bi ZM,Wang LH.Review:Advances in 3D data acquisition and processing for industrial applications.Robotics and Computer-Integrated Manufacturing,2010,26(5):403-413.[doi:10.1016/j.rcim.2010.03.003]
    [3] Nagai Y,Ohtake Y,Suzuki H.Tomographic surface reconstruction from point cloud.Computers&Graphics,2015,46:55-63.[doi:10.1016/j.cag.2014.09.034]
    [4] Albarelli A,Rodolà E,Torsello A.Fast and accurate surface alignment through an isometry-enforcing game.Pattern Recognition,2015,48(7):2209-2226.[doi:10.1016/j.patcog.2015.01.020]
    [5] Kaushik R,Xiao JZ.Accelerated patch-based planar clustering of noisy range images in indoor environments for robot mapping.Robotics and Autonomous Systems,2012,60(4):584-598.[doi:10.1016/j.robot.2011.12.001]
    [6] Fuhrmann S,Goesele M.Floating scale surface reconstruction.ACM Trans.on Graphics (TOG),2014,33(4):1-11.[doi:10.1145/2601097.2601163]
    [7] Zhou QY,Koltun V.Dense scene reconstruction with points of interest.ACM Trans.on Graphics (TOG),2013,32(4):96.[doi:10.1145/2461912.2461919]
    [8] Bergström P,Edlund O.Robust registration of point sets using iteratively reweighted least squares.Computational Optimization and Applications,2014,58(3):543-561.[doi:10.1007/s10589-014-9643-2]
    [9] Wu SH,Huang H,Gong ML,Zwicker M,Cohen-Or D.Deep points consolidation.ACM Trans.on Graphics (TOG),2015,34(6):1-13.[doi:10.1145/2816795.2818073]
    [10] Nießner M,Zollhöfer M,Izadi S,Stamminger M.Real-Time 3D reconstruction at scale using voxel hashing.ACM Trans.on Graphics (TOG),2013,3(6):1-11.[doi:10.1145/2508363.2508374]
    [11] Fuhrmann S,Goesele M.Fusion of depth maps with multiple scales.ACM Trans.on Graphics (TOG),2011,30(6):61-64.[doi:10.1145/2070781.2024182]
    [12] Zou BJ,Zhou HY,Wang L,Liang YX.3D mesh merging and stitching with large overlaps.Acta Electronica Sinica,2012,40(5):1005-1010(in Chinese with English abstract).[doi:10.3969/j.issn.0372-2112.2012.05.023]
    [13] Pan RJ,Skala V.Continuous global optimization in surface reconstruction from an oriented point cloud.Computer Aided Design,2011,43(8):896-901.[doi:10.1016/j.cad.2011.03.005]
    [14] Gálvez A,Iglesias A.Particle swarm optimization for non-uniform rational B-spline surface reconstruction from clouds of 3D data points.Information Sciences,2012,192:174-192(in Chinese with English abstract).[doi:10.1016/j.ins.2010.11.007]
    [15] Nie JH.Rapid surface reconstruction algorithm from dense point cloud.Journal of Computer-Aided Design and Computer Graphics,2012,24(5):574-582(in Chinese with English abstraact).[doi:10.3969/j.issn.1003-9775.2012.05.002]
    [16] Turk G,Levoy M.Zippered polygon meshes form range images.In:Proc.of the SIGGRAPH.1994,(94):311-318.[doi:10.1145/192161.192241]
    [17] Liu H,Xiang SM,Chen R,Li H.Merged and regularized polygon meshes from range images.Computer Engineering and Applications,2004,40(29):28-31(in Chinese with English abstract).
    [18] Du JJ,Guo XY,Lu SL,Xiao BX,Wen WL.Automatic mesh split-and-merge technique for multiple surface models.In:Proc.of the 11th ACM SIGGRAPH Int'l Conf.on Virtual-Reality Continuum and Its Applications in Industry.2012.227-230.[doi:10.1145/2407516.2407571]
    [19] Denning JD.MeshGit:Diffing and merging meshes for polygonal modeling.In:Proc.of the ACM Trans.on Graphics (TOG) SIGGRAPH.2013.[doi:10.1145/2461912.2461942]
    [20] Wang Y,Deng YK,Qian GP.Robust algorithm for real-time mesh geometric editing.Journal of Image and Graphics,2014,19(5):764-770(in Chinese with English abstract).[doi:10.11834/jig.20140515]
    [21] Liu J,Chen WQ,Xiong BS.Three-de mesh generation through volume data reconstructed form surface.Journal of Image and Graphics,2014,19(5):771-780(in Chinese with English abstract).[doi:10.11834/jig.20140516]
    [22] Wei H,Du Y,Liang F.A kd tree-based algorithm to parallelize kriging interpolation of big spatial data.GIScience&Remote Sensing,2015,52(1):40-57.[doi:10.1016/j.cad.2011.03.005]
    [12] 邹北骥,周浩宇,王磊,梁毅雄.大交叠区域的三维网格的融合与拼接.电子学报,2012,40(5):1005-1010.[doi:10.3969/j.issn.0372-2112.2012.05.023]
    [15] 聂建辉.针对密集点云的快速曲面重建算法.计算机辅助设计与图形学学报,2012,24(5):574-582.[doi:10.3969/j.issn.1003-9775.2012.05.002]
    [17] 刘晖,向世明,陈睿,李华.三维扫描网格的合并和优化.计算机工程与应用,2004,40(29):28-31.
    [20] 汪悦,邓元凯,钱归平.鲁棒的网格实时几何编辑算法.中国图象图形学报,2014,19(5):764-770.[doi:10.11834/jig.20140515]
    [21] 刘君,陈伟强,熊邦书.从表面重构的体数据实现三维网格剖分.中国图象图形学报,2014,19(5):771-780.[doi:10.11834/jig.20140516]
    相似文献
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

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

复制
分享
文章指标
  • 点击次数:4506
  • 下载次数: 6038
  • HTML阅读次数: 2792
  • 引用次数: 0
历史
  • 收稿日期:2016-01-21
  • 最后修改日期:2016-03-25
  • 在线发布日期: 2016-08-11
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19727414位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号