用户名: 密码: 验证码:
三维几何数据的交互式着色算法
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:An Interactive Colorization Algorithm for 3D Models
  • 作者:单欣 ; 赵勇 ; 李玲 ; 郭清华 ; 董军宇
  • 英文作者:Shan Xin;Zhao Yong;Li Ling;Guo Qinghua;Dong Junyu;Department of Computer Science and Technology, Ocean University of China;School of Mathematical Sciences, Ocean University of China;
  • 关键词:三维模型 ; 交互式着色 ; 随机游走 ; 显著特征
  • 英文关键词:3D model;;interactive colorization;;random walk;;salient features
  • 中文刊名:JSJF
  • 英文刊名:Journal of Computer-Aided Design & Computer Graphics
  • 机构:中国海洋大学计算机科学与技术系;中国海洋大学数学科学学院;
  • 出版日期:2019-06-15
  • 出版单位:计算机辅助设计与图形学学报
  • 年:2019
  • 期:v.31
  • 基金:国家自然科学基金(61303145,U1706218);; 山东省自然科学基金(ZR2018MF006);; 浙江大学CAD&CG国家重点实验室开放课题(A1809)
  • 语种:中文;
  • 页:JSJF201906003
  • 页数:6
  • CN:06
  • ISSN:11-2925/TP
  • 分类号:20-25
摘要
获取三维模型的纹理信息是计算机图形学领域的一个重要研究问题.传统的方法往往通过纹理映射来完成这个任务,其局限是需要一幅合适的纹理图像.为了能够更简便地得到模型的纹理,提出一种交互式着色算法.对于网格模型,首先进行显著特征的提取和分类来减少用户对重复出现的特征的交互量,进而由用户在不同区域上交互几条颜色曲线作为种子曲线.然后结合位置、法向和曲率信息来衡量相邻顶点的相似度,以防止相邻区域之间出现渗色,并通过随机游走算法计算出每个顶点到每条种子曲线的跳转概率;最后以跳转概率作为权值对各条种子曲线的颜色进行加权平均,得到每个网格顶点的颜色.进一步地,还将上述算法应用到点云模型上.实验结果表明,该算法能够准确地区分不同的区域,鲁棒地为三维模型着色.
        It is a fundamental problem to obtain texture information of 3 D models in computer graphics.Texture mapping was often used to complete this task. However, texture mapping needed a suitable texture image. Therefore, an interactive colorization algorithm is proposed in this paper to obtain texture information more easily. For a mesh model, salient features are first extracted and classified to reduce user's interaction on repetitive features, and then user can scribble some curves with desired colors in various regions as seed curves. Secondly, position, normal, and curvature information are combined to measure vertices similarity to avoid color bleeding between neighboring regions, and random walk algorithm is adopted to compute the probability from each vertex to each seed curve. Finally, weighted by these probabilities, the color of each vertex can be expressed as the weighted average of seed curves' color. Furthermore, the above algorithm is applied to colorize point clouds. Experiment results show that our algorithm can distinguish different regions accurately, and colorize 3 D models robustly.
引文
[1]Levin A,Lischinski D,Weiss Y.Colorization using optimization[J].ACM Transactions on Graphics,2004,23(3):689-694
    [2]Leifman G,Tal A.Mesh colorization[J].Computer Graphics Forum,2012,31(2pt2):421-430
    [3]Leifman G,Tal A.Pattern-driven colorization of 3D surfaces[C]//Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition.Los Alamitos:IEEE Computer Society Press,2013:241-248
    [4]Lévy B.Constrained texture mapping for polygonal meshes[C]//Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques.New York:ACM Press,2001:417-424
    [5]Tai Y W,Brown M S,Tang C K,et al.Texture amendment:reducing texture distortion in constrained parameterization[J].ACM Transactions on Graphics,2008,27(5):Article No.136
    [6]Ma Y W,Zheng J M,Xie J.Foldover-free mesh warping for constrained texture mapping[J].IEEE Transactions on Visualization and Computer Graphics,2015,21(3):375-388
    [7]Sinha S N,Steedly D,Szeliski R,et al.Interactive 3D architectural modeling from unordered photo collections[J].ACMTransaction on Graphics,2008,27(5):Article No.159
    [8]Xiao J X,Fang T,Tan P,et al.Image-based facade modeling[J].ACM Transaction on Graphics,2008,27(5):Article No.161
    [9]Tzur Y,Tal A.Flexistickers:photogrammetric texture mapping using casual images[J].ACM Transactions on Graphics,2009,28(3):Article No.45
    [10]Ji Z P,Liu L G,Chen Z G,et al.Easy mesh cutting[J].Computer Graphics Forum,2006,25(3):283-291
    [11]Zheng Y Y,Tai C L.Mesh decomposition with cross-boundary brushes[J].Computer Graphics Forum,2010,29(2):527-535
    [12]Fan L B,Liu L G,Liu K.Paint mesh cutting[J].Computer Graphics Forum,2011,30(2):603-612
    [13]Meng M,Fan L B,Liu L G.ICutter:a direct cut-out tool for 3Dshapes[J].Computer Animation and Virtual Worlds,2011,22(4):335-342
    [14]Zheng Y Y,Tai C L,Au O K C.Dot scissor:a single-click interface for mesh segmentation[J].IEEE Transactions on Visualization and Computer Graphics,2012,18(8):1304-1312
    [15]Lai Y K,Hu S M,Martin R R,et al.Rapid and effective segmentation of 3D models using random walks[J].Computer Aided Geometric Design,2009,26(6):665-679
    [16]Zhang J Y,Zheng J M,Cai J F.Interactive mesh cutting using constrained random walks[J].IEEE Transactions on Visualization and Computer Graphics,2011,17(3):357-367
    [17]Welsh T,Ashikhmin M,Mueller K.Transferring color to greyscale images[J].ACM Transactions on Graphics,2002,21(3):277-280
    [18]Huang Y C,Tung Y S,Chen J C,et al.An adaptive edge detection based colorization algorithm and its applications[C]//Proceedings of the 13th Annual ACM International Conference on Multimedia.New York:ACM Press,2005:351-354
    [19]Qu Y G,Wong T T,Heng P A.Manga colorization[J].ACMTransactions on Graphics,2006,25(3):1214-1220
    [20]Zhu Wei,Liu Ligang.Tone-preserving colorization of blackand-white cartoon image[J].Journal of Computer-Aided Design&Computer Graphics,2011,23(3):392-398(in Chinese)(朱薇,刘利刚.保色调的黑白卡通图像着色方法[J].计算机辅助设计与图形学学报,2011,23(3):392-398)
    [21]Zhang R C,Zhu J Y,Isola P,et al.Real-time user-guided image colorization with learned deep priors[J].ACM Transactions on Graphics,2017,36(4):Article No.119
    [22]Sun J,Ovsjanikov M,Guibas L J.A concise and provably informative multi-scale signature based on heat diffusion[J].Computer Graphics Forum,2009,28(5):1383-1392
    [23]Aubry M,Schlickewei U,Cremers D.The wave kernel signature:a quantum mechanical approach to shape analysis[C]//Proceedings of the IEEE International Conference on Computer Vision Workshops.Los Alamitos:IEEE Computer Society Press,2011:1626-1633
    [24]Pauly M,Gross M,Kobbelt L P.Efficient simplification of point-sampled surfaces[C]//Proceedings of the IEEE Conference on Visualization.Los Alamitos:IEEE Computer Society Press,2002:163-170

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700