Tagliasacchi Marco, Valenzise Giuseppe, Tubaro Stefano
Dipartimento di Elettronica e Informazione, Politecnico di Milano, 20133 Milano, Italy.
IEEE Trans Image Process. 2009 Nov;18(11):2491-504. doi: 10.1109/TIP.2009.2028251. Epub 2009 Jul 24.
In the last decade, the increased possibility to produce, edit, and disseminate multimedia contents has not been adequately balanced by similar advances in protecting these contents from unauthorized diffusion of forged copies. When the goal is to detect whether or not a digital content has been tampered with in order to alter its semantics, the use of multimedia hashes turns out to be an effective solution to offer proof of legitimacy and to possibly identify the introduced tampering. We propose an image hashing algorithm based on compressive sensing principles, which solves both the authentication and the tampering identification problems. The original content producer generates a hash using a small bit budget by quantizing a limited number of random projections of the authentic image. The content user receives the (possibly altered) image and uses the hash to estimate the mean square error distortion between the original and the received image. In addition, if the introduced tampering is sparse in some orthonormal basis or redundant dictionary, an approximation is given in the pixel domain. We emphasize that the hash is universal, e.g., the same hash signature can be used to detect and identify different types of tampering. At the cost of additional complexity at the decoder, the proposed algorithm is robust to moderate content-preserving transformations including cropping, scaling, and rotation. In addition, in order to keep the size of the hash small, hash encoding/decoding takes advantage of distributed source codes.
在过去十年中,制作、编辑和传播多媒体内容的可能性增加了,但在保护这些内容不被未经授权传播伪造副本方面,却没有取得类似的进展以达到适当的平衡。当目标是检测数字内容是否被篡改以改变其语义时,使用多媒体哈希结果证明是提供合法性证明并可能识别所引入篡改的有效解决方案。我们提出了一种基于压缩感知原理的图像哈希算法,该算法解决了认证和篡改识别问题。原始内容生产者通过对真实图像的有限数量随机投影进行量化,使用少量比特预算生成哈希。内容用户接收(可能已更改的)图像,并使用该哈希来估计原始图像与接收图像之间的均方误差失真。此外,如果在某些正交基或冗余字典中引入的篡改是稀疏的,则在像素域中给出近似值。我们强调该哈希是通用的,例如,相同的哈希签名可用于检测和识别不同类型的篡改。以解码器处增加的复杂度为代价,所提出的算法对包括裁剪、缩放和旋转在内的适度内容保持变换具有鲁棒性。此外,为了保持哈希的大小较小,哈希编码/解码利用了分布式信源编码。