Consideration of perceptual hash using DCT signs

被引：0

作者：

Kouda T. ^{[1
]}

Nishi Y. ^{[2
]}

Orii H. ^{[1
]}

机构：

[1] Faculty of Engineering, Fukuoka University, 8-19-1, Nanakuma, Jonan-ku, Fukuoka

[2] Graduate School of Engineering, Fukuoka University, 8-19-1, Nanakuma, Jonan-ku, Fukuoka

来源：

IEEJ Transactions on Electronics, Information and Systems | 2017年 / 137卷 / 10期

关键词：

DCT sign; Discrete cosine transform; Perceptual hash;

D O I：

10.1541/ieejeiss.137.1433

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The purpose of this research is to consider a new method to generate a perceptual hash using the sign of the DCT coefficient of the image. DCT is performed by reducing the input image to 32×32 pixels, and the DCT coefficient of the low frequency component 8×8 pixels is extracted by raster scan. A 64-bit hash sequence is generated by setting 1 if the DCT coefficient is 0 or more and 0 if it is negative. The Hamming distance of the hash sequence of different images is 20 or more. On the other hand, it was found that the Hamming distance between images that people feel similar is 10 or less. From many experimental results, it was found that perceptual hash can be generated using the sign of the DCT coefficient of the low frequency component of the image. © 2017 The Institute of Electrical Engineers of Japan.

引用

页码：1433 / 1434

页数：1