scholarly journals Triangle Mesh Compression and Homological Spanning Forests

2012 ◽  
pp. 108-116
Author(s):  
Javier Carnero ◽  
Helena Molina-Abril ◽  
Pedro Real
Keyword(s):  
Triangle Mesh ◽  
Mesh Compression ◽  
Spanning Forests

Advancing fan-front: 3D triangle mesh compression using fan based traversal

2004 ◽  
Vol 22 (14) ◽  
pp. 1165-1173 ◽  
Author(s):  
S.P. Mudur ◽  
S. Venkata Babji ◽  
Dinesh Shikhare
Keyword(s):  
Triangle Mesh ◽  
Mesh Compression

Triangle mesh compression along the Hamiltonian cycle

2013 ◽  
Vol 29 (6-8) ◽  
pp. 717-727 ◽  
Author(s):  
Jie Zhang ◽  
Changwen Zheng ◽  
Xiaohui Hu
Keyword(s):  
Hamiltonian Cycle ◽  
Triangle Mesh ◽  
Mesh Compression

Delphi: geometry-based connectivity prediction in triangle mesh compression

2004 ◽  
Vol 20 (8-9) ◽  
pp. 507-520 ◽  
Author(s):  
Volker Coors ◽  
Jarek Rossignac
Keyword(s):  
Triangle Mesh ◽  
Mesh Compression

Triangle Mesh Compression Based on Reverse Subdivision for Mobile Terminals

2009 ◽  
Vol 20 (9) ◽  
pp. 2607-2615 ◽  
Author(s):  
Jian-Ping MA ◽  
Xiao-Nan LUO ◽  
Bo CHEN ◽  
Zheng LI
Keyword(s):  
Triangle Mesh ◽  
Mobile Terminals ◽  
Mesh Compression

Research on hole filling algorithm in triangle mesh models

2009 ◽  
Vol 29 (8) ◽  
pp. 2035-2037 ◽  
Author(s):  
Jian-lei TIAN ◽  
Xu-min LIU ◽  
Yong GUAN
Keyword(s):  
Triangle Mesh ◽  
Hole Filling ◽  
Mesh Models

scholarly journals Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

2019 ◽  
Vol 9 (4) ◽  
pp. 642 ◽  
Author(s):  
Xu Xi ◽  
Xinchang Zhang ◽  
Weidong Liang ◽  
Qinchuan Xin ◽  
Pengcheng Zhang
Keyword(s):  
Singular Value Decomposition ◽  
Singular Value ◽  
Two Dimensional ◽  
Triangle Mesh ◽  
Vector Map ◽  
Vector Maps ◽  
Feature Sequence ◽  
Zero Watermarking ◽  
Value Decomposition ◽  
Watermarking Scheme

Digital watermarking is important for the copyright protection of electronic data, but embedding watermarks into vector maps could easily lead to changes in map precision. Zero-watermarking, a method that does not embed watermarks into maps, could avoid altering vector maps but often lack of robustness. This study proposes a dual zero-watermarking scheme that improves watermark robustness for two-dimensional (2D) vector maps. The proposed scheme first extracts the feature vertices and non-feature vertices of the vector map with the Douglas-Peucker algorithm and subsequently constructs the Delaunay Triangulation Mesh (DTM) to form a topological feature sequence of feature vertices as well as the Singular Value Decomposition (SVD) matrix to form intrinsic feature sequence of non-feature vertices. Next, zero-watermarks are obtained by executing exclusive disjunction (XOR) with the encrypted watermark image under the Arnold scramble algorithm. The experimental results show that the scheme that synthesizes both the feature and non-feature information improves the watermark capacity. Making use of complementary information between feature and non-feature vertices considerably improves the overall robustness of the watermarking scheme. The proposed dual zero-watermarking scheme combines the advantages of individual watermarking schemes and is robust against such attacks as geometric attacks, vertex attacks and object attacks.

Sign in / Sign up

Export Citation Format

Share Document