浏览全部资源
扫码关注微信
收稿：2017-07-11，
修回：2017-11-3，
纸质出版：2018-05-16
移动端阅览
目的
2
青铜器是我国的文化瑰宝，然而出土青铜器大多破损、变形，需要修复以进行保护。随着3维激光扫描技术及数字几何处理研究的发展，文物数字化修复技术得到了广泛的重视。在青铜器修复过程中需要将相邻碎片的纹饰对准，以保证纹饰的连续性，从而保证修复质量。因此，青铜器纹饰特征的有效提取是青铜器修复过程中的一项重要工作，鉴于青铜器纹饰特征一般具有比较明显的尖锐边，本文提出并实现了一种青铜器尖锐特征增强及自动提取算法。
方法
2
首先，为了减少网格均匀度对特征提取的不利影响，提出一种加权法向距离；其次，为了增强尖锐特征提取效果，提出一种逆双边滤波算法，并利用该算法获得反锐化掩膜，增强法向距离间的差异性，使得大的更大，小的更小；最后，采用Otsu算法自动确定分割阈值，依据该阈值把网格顶点分为特征点集和非特征点集，实现青铜器纹饰特征的提取。
结果
2
对实际3维激光扫描获得的青铜器模型，分别采用本文算法和Tran等人提出的尖锐特征自动提取算法进行了纹饰特征提取，包括采用两种算法进行了纹饰特征增强前后纹饰特征提取实验，本文使用的3个模型点数在6 000至80万之间，这些模型都可以在1 s到10 s之间得到最终的提取结果，具有较高的效率。同时，本文算法可以更为准确地提取尖锐特征点，且得到的特征点更为连续，有利于进一步的处理。
结论
2
采用本文提出的青铜器纹饰提取算法，能够自动、高效地提取青铜器纹饰特征。
Objective
2
Bronzes are one of China's cultural treasures. However
most unearthed bronzes are broken and deformed
and restoration is needed to protect them. Recently
digital restoration technologies for cultural relics have attracted considerable attention with the development of 3D laser scanning technologies and the research progress in digital geometry processing. Patterns of the adjacent pieces of a broken bronze should be aligned during restoration to ensure the continuity of the patterns and guarantee high restoration quality. Consequently
the extraction of bronze patterns is a significant step in the restoration process.
Method
2
Generally
bronze patterns have apparent sharp edges
which distinguish decoration feature parts from non-decoration feature parts. Therefore
an algorithm for enhancing and extracting the sharp features of bronzes
which aims to extract pattern features
is proposed and implemented in this study. No interactive parameter setting is needed in the proposed algorithm
and the feature points are extracted automatically. First
a weighted projection distance is proposed to eliminate the adverse effect of the nonuniformity of the mesh on feature extraction. The projection distance of a vertex is the absolute value of the dot product between the normal at the vertex and the vector from the vertex to the center point of its one-ring neighborhood vertices. The projection distance of a vertex on sharp edges is always larger than that on non-sharp edges for a uniform triangular mesh model. Thus
it is easy to distinguish the feature point in this case. However
it is difficult to distinguish the feature point for the nonuniform mesh
which is more general in application. Therefore
the weighted projection distance
which means that all edges in the one-ring neighborhood of a vertex should be normalized first before calculating the projection distance
is more adaptive than the traditional projection distance for the triangular meshes in general. Then
reverse bilateral filtering is proposed and utilized to generate an anti-sharpening mask to enhance the weighted projection distance because the feature points are not obvious in the reconstructed mesh model of a real bronze as a result of the digital nature of the scanning process. The anti-sharpening mask is a three-step image enhancement process. First
the original image is filtered and subtracted from the smoothed image to obtain the weight. Second
the mask is added to the original image. Finally
the details of the image are enhanced. Reverse bilateral filtering is developed to filter all weighted projection distances with the intention to smooth all weighted projection distances of the feature points to the maximum extent instead of preserving features in bilateral filtering. The enhanced weighted projection distance is obtained by performing the three-step anti-sharpening mask in image enhancement. Consequently
a large weighted projection distance becomes even larger and a small weighted projection distance becomes even smaller. Finally
Otsu's method is applied to the histogram of the enhanced weighted projection distance to determine the optimal threshold automatically
and the vertices of the mesh model are classified into feature and non-feature point sets with the threshold.
Result
2
We compare the extraction results of our algorithm with those of Tran's algorithm with the scanned bronze models
including before and after weighted projection distance enhancement. All experiments show that better extraction results can be achieved with the proposed algorithm than the existing algorithms
and the identified feature points of the proposed algorithm are more continuous than those of the existing algorithms. The time consumed by all of the three models with vertex numbers between 6 000 and 800 000 is less than 10 s. Therefore
the proposed algorithm is effective
and its results are beneficial for the succeeding process.
Conclusion
2
The decoration features of bronzes can be extracted automatically and efficiently with the proposed algorithm.
Chen Y, Cheng Z Q, Li J, et al. Relief extraction and editing[J]. Computer-Aided Design, 2011, 43(12):1674-1682.[DOI:10.1016/j.cad.2011.07.011]
Zatzarinni R, Tal A, Shamir A. Relief analysis and extraction[J]. ACM Transactions on Graphics, 2009, 28(5):#136.[DOI:10.1145/1618452.1618482]
Tran T T, Cao V T, Nguyen V T, et al. Automatic method for sharp feature extraction from 3D data of man-made objects[C]//Proceedings of 2014 International Conference on Computer Graphics Theory and Applications. Lisbon, Portugal, Portugal: IEEE, 2014: 1-8.
Wang C C L. Bilateral recovering of sharp edges on feature-insensitive sampled meshes[J]. IEEE Transactions on Visualization and Computer Graphics, 2006, 12(4):629-639.[DOI:10.1109/TVCG.2006.60]
Wang C C L. Incremental reconstruction of sharp edges on mesh surfaces[J]. Computer-Aided Design, 2006, 38(6):689-702.[DOI:10.1016/j.cad.2006.02.009]
Attene M, Falcidieno B, Rossignac J, et al. Sharpen&Bend:recovering curved sharp edges in triangle meshes produced by feature-insensitive sampling[J]. IEEE Transactions on Visualization and Computer Graphics, 2005, 11(2):181-192.[DOI:10.1109/TVCG.2005.34]
Kim H S, Choi H K, Lee K H. Feature detection of triangular meshes based on tensor voting theory[J]. Computer-Aided Design, 2009, 41(1):47-58.[DOI:10.1016/j.cad.2008.12.003]
Hildebrandt K, Polthier K, Wardetzky M. Smooth feature lines on surface meshes[C]//Proceedings of the 3rd Eurographics Symposium on Geometry Processing. Switzerland: Eurographics Association, 2005: 85.
Ohtake Y, Belyaev A, Seidel H P. Ridge-valley lines on meshes via implicit surface fitting[J]. ACM Transactions on Graphics, 2004, 23(3):609-612.[DOI:10.1145/1015706.1015768]
Vieira M, Shimada K. Surface mesh segmentation and smooth surface extraction through region growing[J]. Computer Aided Geometric Design, 2005, 22(8):771-792.[DOI:10.1016/j.cagd.2005.03.006]
Zeng L, Liu Y J, Zhang D L. Feature-preserved contour editing for 3D printing[J]. Journal of Computer-Aided Design&Computer Graphics, 2015, 27(6):974-983.
曾龙, 刘永进, 张东亮.面向三维打印的特征驱动轮廓线编辑方法[J].计算机辅助设计与图形学学报, 2015, 27(6):974-983.
Otsu N. A threshold selection method from gray-level histograms[J]. IEEE Transactions on Systems, Man, and Cybernetics, 1979, 9(1):62-66.[DOI:10.1109/TSMC.1979.4310076]
Jin S S, Lewis R R, West D. A comparison of algorithms for vertex normal computation[J]. The Visual Computer, 2005, 21(1-2):71-82.[DOI:10.1007/s00371-004-0271-1]
Fleishman S, Drori I, Cohen-Or D. Bilateral mesh denoising[J]. ACM Transactions on Graphics, 2003, 22(3):950-953.[DOI:10.1145/882262.882368]
相关作者
相关机构
京公网安备11010802024621
