We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Spectral Graph and Minimal Spanning Tree for 3D Polygonal Meshes Fingerprinting.
- Authors
Abdallah, Emad E.; Al-Oqily, Ibrahim; Abdallah, Alaa E.; Otoom, Ahmed F.; Alsarhan, Ayoub
- Abstract
In this paper, the authors present a robust three-dimensional fingerprint algorithm for verification, indexing, and identification. The core idea behind our technique is to apply the eigen-decomposition to the mesh Laplacian matrix, and then compute minimum spanning trees (MST) of several concentrations of the mesh shape structure. The fixed size hash vector of a 3D mesh is defined in terms of the MST values and number of the initial patches. The extensive experimental results on several 3D meshes prove the uniqueness of the extracted hash vectors and the robustness of the proposed technique against the most common attacks including distortion-less attacks, compression, noise, smoothing, scaling, rotation as well as mixtures of these attacks.
- Publication
International Journal of Information Technology & Web Engineering, 2014, Vol 9, Issue 4, p40
- ISSN
1554-1045
- Publication type
Article
- DOI
10.4018/ijitwe.2014100104