A Low-Complexity Region-Based Authentication Algorithm for 3D Polygonal Models

This study proposes a low-complexity region-based authentication algorithm for three-dimensional (3D) polygonal models, based on local geometrical property evaluation. A vertex traversal scheme with a secret key is adopted to classify each vertex into one of two categories: embeddable vertices and reference vertices. An embeddable vertex is one with an authentication code embedded. The algorithm then uses reference vertices to calculate local geometrical properties for the corresponding embeddable vertices. For each embeddable vertex, we feed the number of reference vertices and local properties into a hash function to generate the authentication code. The embeddable vertex is then embedded with the authentication code, which is based on a simple message-digit substitution scheme. The proposed algorithm is of low complexity and distortion-controllable and possesses a higher and more adaptive embedding capacity and a higher embedding rate than most existing region-based authentication algorithms for 3D polygonal models. The experimental results demonstrate the feasibility of the proposed algorithm.