Preprint Concept Paper Version 1 Preserved in Portico This version is not peer-reviewed

Ink Detection Using K-Mean Clustering in Hyperspectral Document

Version 1 : Received: 30 June 2020 / Approved: 1 July 2020 / Online: 1 July 2020 (09:01:50 CEST)

How to cite: Raza, R.; Saeed, S.; Sharif, R. Ink Detection Using K-Mean Clustering in Hyperspectral Document. Preprints 2020, 2020070002. https://doi.org/10.20944/preprints202007.0002.v1 Raza, R.; Saeed, S.; Sharif, R. Ink Detection Using K-Mean Clustering in Hyperspectral Document. Preprints 2020, 2020070002. https://doi.org/10.20944/preprints202007.0002.v1

Abstract

In document forensic, Ink mismatch relays very important information about forgeries in this way we can find out the authenticity of documents. Finding out and distinguishing these unique inks from the multispectral document is very challenging task. In this paper we proposed the method to identify the inks using clustering. We used K-Mean clustering instead of widely known Fuzzy C-Means Clustering (FCM) and successfully identity the number of inks. For the purpose of optimizing and improving our results we used two optimization techniques such as Elbow and silhouette optimization techniques.

Keywords

Forensic; Ink Mismatch; Clustering; K-means algorithm; Elbow; Silhouette

Subject

Engineering, Electrical and Electronic Engineering

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.