TY - JOUR
T1 - A fast source-oriented image clustering method for digital forensics
AU - Li, Chang Tsun
AU - Lin, Xufeng
N1 - Includes bibliographical references.
PY - 2017/10
Y1 - 2017/10
N2 - We present in this paper an algorithm that is capable of clustering images taken by an unknown number of unknown digital cameras into groups, such that each contains only images taken by the same source camera. It first extracts a sensor pattern noise (SPN) from each image, which serves as the fingerprint of the camera that has taken the image. The image clustering is performed based on the pairwise correlations between camera fingerprints extracted from images. During this process, each SPN is treated as a random variable and a Markov random field (MRF) approach is employed to iteratively assign a class label to each SPN (i.e., random variable). The clustering process requires no a priori knowledge about the dataset from the user. A concise yet effective cost function is formulated to allow different “neighbors” different voting power in determining the class label of the image in question depending on their similarities. Comparative experiments were carried out on the Dresden image database to demonstrate the advantages of the proposed clustering algorithm.
AB - We present in this paper an algorithm that is capable of clustering images taken by an unknown number of unknown digital cameras into groups, such that each contains only images taken by the same source camera. It first extracts a sensor pattern noise (SPN) from each image, which serves as the fingerprint of the camera that has taken the image. The image clustering is performed based on the pairwise correlations between camera fingerprints extracted from images. During this process, each SPN is treated as a random variable and a Markov random field (MRF) approach is employed to iteratively assign a class label to each SPN (i.e., random variable). The clustering process requires no a priori knowledge about the dataset from the user. A concise yet effective cost function is formulated to allow different “neighbors” different voting power in determining the class label of the image in question depending on their similarities. Comparative experiments were carried out on the Dresden image database to demonstrate the advantages of the proposed clustering algorithm.
KW - Digital forensics
KW - Image clustering
KW - Markov random fields
KW - Multimedia forensics
KW - Sensor pattern noise
UR - http://www.scopus.com/inward/record.url?scp=85031735927&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85031735927&partnerID=8YFLogxK
U2 - 10.1186/s13640-017-0217-y
DO - 10.1186/s13640-017-0217-y
M3 - Article
AN - SCOPUS:85031735927
SN - 1687-5176
VL - 2017
SP - 1
EP - 16
JO - Eurasip Journal on Image and Video Processing
JF - Eurasip Journal on Image and Video Processing
M1 - 69
ER -