This work presents a new camera fingerprint-based image clustering algorithm. The proposed algorithm is based on sorting the camera fingerprints according to information that is inherently present in images. A ranking index is constructed for each image, taking into account the combined effect of gray-level, saturation and texture on camera fingerprint estimation. Then, camera fingerprints are ordered according to this ranking index and clusters are iteratively constructed using as reference fingerprint the top-ranked fingerprint among the currently un-clustered fingerprints. The algorithm can be optionally implemented with an additional attraction stage to refine clustering. The results confirm that the proposed method achieves a performance comparable to state of the art approaches, with a significantly lower computational complexity. The method can also handle cases in which the number of clusters is much larger than the average size of the clusters.

Fast Image Clustering Based on Camera Fingerprint Ordering / Khan, Sahib; Bianchi, Tiziano. - (2019), pp. 766-771. (Intervento presentato al convegno 2019 IEEE International Conference on Multimedia and Expo (ICME) tenutosi a Shanghai, China nel 8-12 July 2019) [10.1109/ICME.2019.00137].

Fast Image Clustering Based on Camera Fingerprint Ordering

Khan, Sahib;Bianchi, Tiziano
2019

Abstract

This work presents a new camera fingerprint-based image clustering algorithm. The proposed algorithm is based on sorting the camera fingerprints according to information that is inherently present in images. A ranking index is constructed for each image, taking into account the combined effect of gray-level, saturation and texture on camera fingerprint estimation. Then, camera fingerprints are ordered according to this ranking index and clusters are iteratively constructed using as reference fingerprint the top-ranked fingerprint among the currently un-clustered fingerprints. The algorithm can be optionally implemented with an additional attraction stage to refine clustering. The results confirm that the proposed method achieves a performance comparable to state of the art approaches, with a significantly lower computational complexity. The method can also handle cases in which the number of clusters is much larger than the average size of the clusters.
2019
978-1-5386-9552-4
File in questo prodotto:
File Dimensione Formato  
khan_ICME2019.pdf

accesso riservato

Descrizione: articolo versione publisher
Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 367.66 kB
Formato Adobe PDF
367.66 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
khan_ICME2019_OA.pdf

accesso aperto

Descrizione: articolo versione autore
Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: Pubblico - Tutti i diritti riservati
Dimensione 437.35 kB
Formato Adobe PDF
437.35 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2746392