Internal:Hashing Meshes: Difference between revisions
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
Robust 3D mesh model hashing based on feature object [http://www.cs.odu.edu/crtc/internal/papers/Lee_Kwon_2012_Robust_3D_mesh_model_hashing_based_on_feature_object.pdf pdf] [https://www.sciencedirect.com/science/article/pii/S1051200412001042 url] | ''' Robust 3D mesh model hashing based on feature object ''' [http://www.cs.odu.edu/crtc/internal/papers/Lee_Kwon_2012_Robust_3D_mesh_model_hashing_based_on_feature_object.pdf pdf] [https://www.sciencedirect.com/science/article/pii/S1051200412001042 url] | ||
'''Abstract:''' | '''Abstract:''' | ||
''3D model hashing can be very useful for the authentication, indexing, copy detection, and watermarking of 3D content, in a manner similar to image hashing. 3D models can be easily modified by graphicsediting while preserving the geometric shape, and the modeling representations are not regular, unlike an image with a fixed pixel array. A 3D model must be authenticated, indexed, or watermarked while being robust against graphics attacks and irregular representations. For these purposes, this paper presents a 3D mesh model hashing based on object feature vectors with the robustness, security, and uniqueness. The proposed hashing groups the distances from feature objects with the highest surface area in a 3D model that consists of a number of objects, permutes indices of groups in feature objects, and generates a binary hash through the binarization of feature values that are calculated by two combinations of group values and a random key. The robustness of a hash can be improved by group coefficients that are obtained from the distribution of vertex distances in feature objects, and the security and uniqueness can be improved by both the permutation of groups, feature vectors, and random key. Experimental results verified that the proposed hashing is robust against various perceptual geometrical and topological attacks and has the security and uniqueness of a hash.'' | ''3D model hashing can be very useful for the authentication, indexing, copy detection, and watermarking of 3D content, in a manner similar to image hashing. 3D models can be easily modified by graphicsediting while preserving the geometric shape, and the modeling representations are not regular, unlike an image with a fixed pixel array. A 3D model must be authenticated, indexed, or watermarked while being robust against graphics attacks and irregular representations. For these purposes, this paper presents a 3D mesh model hashing based on object feature vectors with the robustness, security, and uniqueness. The proposed hashing groups the distances from feature objects with the highest surface area in a 3D model that consists of a number of objects, permutes indices of groups in feature objects, and generates a binary hash through the binarization of feature values that are calculated by two combinations of group values and a random key. The robustness of a hash can be improved by group coefficients that are obtained from the distribution of vertex distances in feature objects, and the security and uniqueness can be improved by both the permutation of groups, feature vectors, and random key. Experimental results verified that the proposed hashing is robust against various perceptual geometrical and topological attacks and has the security and uniqueness of a hash.'' | ||
Revision as of 12:04, 10 March 2020
Robust 3D mesh model hashing based on feature object pdf url
Abstract:
3D model hashing can be very useful for the authentication, indexing, copy detection, and watermarking of 3D content, in a manner similar to image hashing. 3D models can be easily modified by graphicsediting while preserving the geometric shape, and the modeling representations are not regular, unlike an image with a fixed pixel array. A 3D model must be authenticated, indexed, or watermarked while being robust against graphics attacks and irregular representations. For these purposes, this paper presents a 3D mesh model hashing based on object feature vectors with the robustness, security, and uniqueness. The proposed hashing groups the distances from feature objects with the highest surface area in a 3D model that consists of a number of objects, permutes indices of groups in feature objects, and generates a binary hash through the binarization of feature values that are calculated by two combinations of group values and a random key. The robustness of a hash can be improved by group coefficients that are obtained from the distribution of vertex distances in feature objects, and the security and uniqueness can be improved by both the permutation of groups, feature vectors, and random key. Experimental results verified that the proposed hashing is robust against various perceptual geometrical and topological attacks and has the security and uniqueness of a hash.