Robust and secure image hashing via non-negative matrix factorizations

Vishal Monga, M. Kivanç Mihçak

Research output: Contribution to journalArticle

252 Citations (Scopus)

Abstract

In this paper, we propose the use of non-negative matrix factorization (NMF) for image hashing. In particular, we view images as matrices and the goal of hashing as a randomized dimensionality reduction that retains the essence of the original image matrix while preventing intentional attacks of guessing and forgery. Our work is motivated by the fact that standard-rank reduction techniques, such as QR and singular value decomposition, produce low-rank bases which do not respect the structure (i.e., non-negativity for images) of the original data. We observe that NMFs have two very desirable properties for secure image hashing applications: 1) The additivity property resulting from the non-negativity constraints results in bases that capture local components of the image, thereby significantly reducing misclassification and 2) the effect of geometric attacks on images in the spatial domain manifests (approximately) as independent identically distributed noise on NMF vectors, allowing the design of detectors that are both computationally simple and, at the same time, optimal in the sense of minimizing error probabilities. Receiver operating characteristics analysis over a large image database reveals that the proposed algorithms significantly outperform existing approaches for image hashing.

Original languageEnglish (US)
Pages (from-to)376-390
Number of pages15
JournalIEEE Transactions on Information Forensics and Security
Volume2
Issue number3
DOIs
StatePublished - Sep 1 2007

Fingerprint

Factorization
Singular value decomposition
Detectors

All Science Journal Classification (ASJC) codes

  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications

Cite this

@article{1fd51652a1ed41a9a2ab2d67b2a887d3,
title = "Robust and secure image hashing via non-negative matrix factorizations",
abstract = "In this paper, we propose the use of non-negative matrix factorization (NMF) for image hashing. In particular, we view images as matrices and the goal of hashing as a randomized dimensionality reduction that retains the essence of the original image matrix while preventing intentional attacks of guessing and forgery. Our work is motivated by the fact that standard-rank reduction techniques, such as QR and singular value decomposition, produce low-rank bases which do not respect the structure (i.e., non-negativity for images) of the original data. We observe that NMFs have two very desirable properties for secure image hashing applications: 1) The additivity property resulting from the non-negativity constraints results in bases that capture local components of the image, thereby significantly reducing misclassification and 2) the effect of geometric attacks on images in the spatial domain manifests (approximately) as independent identically distributed noise on NMF vectors, allowing the design of detectors that are both computationally simple and, at the same time, optimal in the sense of minimizing error probabilities. Receiver operating characteristics analysis over a large image database reveals that the proposed algorithms significantly outperform existing approaches for image hashing.",
author = "Vishal Monga and Mih{\cc}ak, {M. Kivan{\cc}}",
year = "2007",
month = "9",
day = "1",
doi = "10.1109/TIFS.2007.902670",
language = "English (US)",
volume = "2",
pages = "376--390",
journal = "IEEE Transactions on Information Forensics and Security",
issn = "1556-6013",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

Robust and secure image hashing via non-negative matrix factorizations. / Monga, Vishal; Mihçak, M. Kivanç.

In: IEEE Transactions on Information Forensics and Security, Vol. 2, No. 3, 01.09.2007, p. 376-390.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Robust and secure image hashing via non-negative matrix factorizations

AU - Monga, Vishal

AU - Mihçak, M. Kivanç

PY - 2007/9/1

Y1 - 2007/9/1

N2 - In this paper, we propose the use of non-negative matrix factorization (NMF) for image hashing. In particular, we view images as matrices and the goal of hashing as a randomized dimensionality reduction that retains the essence of the original image matrix while preventing intentional attacks of guessing and forgery. Our work is motivated by the fact that standard-rank reduction techniques, such as QR and singular value decomposition, produce low-rank bases which do not respect the structure (i.e., non-negativity for images) of the original data. We observe that NMFs have two very desirable properties for secure image hashing applications: 1) The additivity property resulting from the non-negativity constraints results in bases that capture local components of the image, thereby significantly reducing misclassification and 2) the effect of geometric attacks on images in the spatial domain manifests (approximately) as independent identically distributed noise on NMF vectors, allowing the design of detectors that are both computationally simple and, at the same time, optimal in the sense of minimizing error probabilities. Receiver operating characteristics analysis over a large image database reveals that the proposed algorithms significantly outperform existing approaches for image hashing.

AB - In this paper, we propose the use of non-negative matrix factorization (NMF) for image hashing. In particular, we view images as matrices and the goal of hashing as a randomized dimensionality reduction that retains the essence of the original image matrix while preventing intentional attacks of guessing and forgery. Our work is motivated by the fact that standard-rank reduction techniques, such as QR and singular value decomposition, produce low-rank bases which do not respect the structure (i.e., non-negativity for images) of the original data. We observe that NMFs have two very desirable properties for secure image hashing applications: 1) The additivity property resulting from the non-negativity constraints results in bases that capture local components of the image, thereby significantly reducing misclassification and 2) the effect of geometric attacks on images in the spatial domain manifests (approximately) as independent identically distributed noise on NMF vectors, allowing the design of detectors that are both computationally simple and, at the same time, optimal in the sense of minimizing error probabilities. Receiver operating characteristics analysis over a large image database reveals that the proposed algorithms significantly outperform existing approaches for image hashing.

UR - http://www.scopus.com/inward/record.url?scp=34548085689&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34548085689&partnerID=8YFLogxK

U2 - 10.1109/TIFS.2007.902670

DO - 10.1109/TIFS.2007.902670

M3 - Article

AN - SCOPUS:34548085689

VL - 2

SP - 376

EP - 390

JO - IEEE Transactions on Information Forensics and Security

JF - IEEE Transactions on Information Forensics and Security

SN - 1556-6013

IS - 3

ER -