Robust Image Hashing with Tensor Decomposition
Lists
Only you see this
Abstract
This paper presents a new image hashing that is designed with tensor decomposition (TD), referred to as TD hashing, where image hash generation is viewed as deriving a compact representation from a tensor. Specifically, a stable three-order tensor is first constructed from the normalized image, so as to enhance the robustness of our TD hashing. A popular TD algorithm, called Tucker decomposition, is then exploited to decompose the three-order tensor into a core tensor and three orthogonal factor matrices. As the factor matrices can reflect intrinsic structure of original tensor, hash construction with the factor matrices makes a desirable discrimination of the TD hashing. To examine these claims, there are 14,551 images selected for our experiments. A receiver operating characteristics (ROC) graph is used to conduct theoretical analysis and the ROC comparisons illustrate that the TD hashing outperforms some state-of-the-art algorithms in classification performance between the robustness and discrimination.
BibTeX
@article{tang2019robust,
author = {Zhenjun Tang and Lv Chen and Xianquan Zhang and Shichao Zhang},
title = {{Robust Image Hashing with Tensor Decomposition}},
journal = {IEEE Trans. Knowl. Data Eng.},
year = {2019},
doi = {10.1109/tkde.2018.2837745},
}Loading related content...