Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.4018/ijitwe.2014100104 | International Journal of Information Technology and Web Engineering |
Field | DocType | Volume |
Data mining,Laplacian matrix,Polygon mesh,Computer science,Algorithm,Theoretical computer science,Robustness (computer science),Smoothing,Eigendecomposition of a matrix,Spanning tree,Hash function,Minimum spanning tree | Journal | 9 |
Issue | Citations | PageRank |
4 | 0 | 0.34 |
References | Authors | |
25 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emad E. Abdallah | 1 | 112 | 12.57 |
| ibrahim aloqily | 2 | 39 | 5.73 |
| Alaa E. Abdallah | 3 | 20 | 3.29 |
| Ahmed Fawzi Otoom | 4 | 12 | 5.76 |
| Ayoub Alsarhan | 5 | 54 | 15.62 |