Spectral Graph and Minimal Spanning Tree for 3D Polygonal Meshes Fingerprinting
| Autor: | Ahmed Fawzi Otoom, Alaa E. Abdallah, Ayoub Alsarhan, Emad E. Abdallah, Ibrahim Al-Oqily |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Theoretical computer science
Spanning tree General Computer Science Computer science Hash function Fingerprint (computing) Minimum spanning tree Robustness (computer science) Polygon mesh Laplacian matrix Algorithm Smoothing ComputingMethodologies_COMPUTERGRAPHICS Computer Science::Cryptography and Security |
| Zdroj: | International Journal of Information Technology and Web Engineering. 9:40-53 |
| ISSN: | 1554-1053 1554-1045 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|