Information-theoretic hashing of 3D objects using spectral graph theory

Authors:
Khaled Tarmissi;A. Ben Hamza
Affiliations:
Concordia Institute for Information Systems Engineering, 1515 Ste-Catherine Street West EV7.631, Concordia University, Montréal, QC, Canada;Concordia Institute for Information Systems Engineering, 1515 Ste-Catherine Street West EV7.631, Concordia University, Montréal, QC, Canada
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 6
Cited 3

Spectral compression of mesh geometry

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Rapid Object Indexing and Recognition Using Enhanced Geometric Hashing

ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I
Public Authentication of 3D Mesh Models

WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Robust and secure image hashing

IEEE Transactions on Information Forensics and Security
Perceptual Image Hashing Via Feature Points: Performance Evaluation and Tradeoffs

IEEE Transactions on Image Processing

Autonomous Shape Control of a Deformable Object by Multiple Manipulators

Journal of Intelligent and Robotic Systems
Robust 3D mesh model hashing based on feature object

Digital Signal Processing
Key-dependent 3D model hashing for authentication using heat kernel signature

Digital Signal Processing

Quantified Score

Hi-index	12.05

Visualization

Abstract

Identification and authentication of multimedia content has become one of the most important aspects of multimedia security. In this paper, we present a hashing technique for 3D models using spectral graph theory and entropic spanning trees. The main idea is to partition a 3D triangle mesh into an ensemble of sub-meshes, then apply eigen-decomposition to the Laplace-Beltrami matrix of each sub-mesh, followed by computing the hash value of each sub-mesh. This hash value is defined in terms of spectral coefficients and Tsallis entropy estimate. The experimental results on a variety of 3D models demonstrate the effectiveness of the proposed technique in terms of robustness against the most common attacks including Gaussian noise, mesh smoothing, mesh compression, scaling, rotation as well as combinations of these attacks.