Structure-guided shape-preserving mesh texture smoothing via joint low-rank matrix recovery

被引:26
作者
Chen, Honghua [1 ]
Huang, Jin [1 ]
Remil, Oussama [2 ]
Xie, Haoran [3 ]
Qin, Jing [4 ]
Guo, Yanwen [5 ]
Wei, Mingqiang [1 ]
Wang, Jun [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Nanjing, Jiangsu, Peoples R China
[2] Ecole Mil Polytech, Bordj El Bahri, Algeria
[3] Educ Univ Hong Kong, Hong Kong, Peoples R China
[4] Hong Kong Polytech Univ, Hong Kong, Peoples R China
[5] Nanjing Univ, Nanjing, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Mesh texture smoothing; Joint low-rank matrix recovery; Bas-relief modeling; DIFFUSION; REGULARIZATION; SPARSE;
D O I
10.1016/j.cad.2019.05.036
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Mesh texture smoothing (MTS) seeks to smooth out the detailed appearances in noise-free surfaces, while preserving the intrinsic geometric properties. However, the intricacy of mesh texture patterns commonly results in side-effects, including remnant textures, improperly-smoothed structures and distorted shapes. We propose a new joint low-rank matrix recovery (J-LRMR) model to the problem of MTS with the properties of texture smoothing, structure preservation, and shape fitting. J-LRMR benefits from our three key observations: (1) local surface patches sharing approximate geometric properties always exist within an original surface (OS); (2) the OS comprises three geometric properties, i.e., details, structures, and the smooth-varying shape, where the structures construct the step-edge surface (SS), but more importantly the later two components contribute to forming the underlying surface (US); (3) the US normals can be defined as signals over both the OS and SS. By exploring the three observations, we first collect similar patches together by the local iterative closest point technique on the OS, and concurrently optimize the OS to produce the SS by l(0) normal minimization. Second, we pack the normals on the similar patches of both the OS and SS into the patch-group matrix (PGM) for rank analysis. The rank of sub-PGM from the OS is high due to suffering from details (textures), while the rank of sub-PGM from the SS is low but does not have a smooth shape. Third, we formulate a structure-guided shape-preserving optimization framework by non-local low-rank matrix recovery to produce the normals of US containing both the structures and the smooth-varying shape. Finally, we update the vertex positions of OS to fit the recovered normals of US by Poisson reconstruction. We have verified our method on a variety of surfaces with abundant details, and compared it with several state-of-the-art methods. Both visual and quantitative comparisons show that our method can better remove mesh textures with a minimal disturbance of the underlying surface. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:122 / 134
页数:13
相关论文
共 62 条
[1]  
[Anonymous], 2017, IEEE TRANSP EL C EXP, DOI DOI 10.1109/ITEC-AP.2017.8081041
[2]  
[Anonymous], T VIS COMPUT GRAPH
[3]  
[Anonymous], 2001, Res. Rep. RC2213 IBM
[4]   Anisotropic diffusion of surfaces and functions on surfaces [J].
Bajaj, CL ;
Xu, GL .
ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (01) :4-32
[5]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[6]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[7]   Bilateral Texture Filtering [J].
Cho, Hojin ;
Lee, Hyunjoon ;
Kang, Henry ;
Lee, Seungyong .
ACM TRANSACTIONS ON GRAPHICS, 2014, 33 (04)
[8]   Anisotropic geometric diffusion in surface processing [J].
Clarenz, U ;
Diewald, U ;
Rumpf, M .
VISUALIZATION 2000, PROCEEDINGS, 2000, :397-405
[9]  
Desbrun M, 2000, PROC GRAPH INTERF, P145
[10]  
Desbrun M, 1999, COMP GRAPH, P317, DOI 10.1145/311535.311576