An improvement to vertex decimation: Finding referencing neighbors for low distortion in 3D steganography

The concept of data hiding has made it possible to effectively transmit data in such a way that there is no compromise in security. Recent 3D steganographic techniques focus on maximizing the amount of data that can be embedded within the cover model and minimal distortion. A technique based on vertex decimation was recently published, which focuses on minimizing the distortion ensued during data embedding. Since the very aim of a steganographic technique is to hide data, this point is extremely relevant. While this technique is effective, it is subject to high time complexity. This paper proposes an improved technique to finding the referencing neighbors, which is the very aim of vertex decimation, in a less complex manner, when compared to the vertex decimation algorithm proposed in [1].