A Comprehensive Tensor Framework for the Clustering of Hyperspectral Paper Data with an Application to Forensic Document Analysis
Peer reviewed, Journal article
Published version
![Thumbnail](/ntnu-xmlui/bitstream/handle/11250/3053206/George.pdf.jpg?sequence=6&isAllowed=y)
Åpne
Permanent lenke
https://hdl.handle.net/11250/3053206Utgivelsesdato
2021Metadata
Vis full innførselSamlinger
Sammendrag
In forensic document analysis, the authenticity of a document must be properly checked in the context of suspected forgery. Hyperspectral Imaging (HSI) is a non-invasive way of detecting fraudulent papers in a multipage document. The occurrence of a forged paper in a multi-page document may have a substantial difference from rest of the papers in its age, type, color, texture, and so on. Each pixel in an HSI data can be used as the material fingerprint for the spatial point it corresponds to. Hence, hyperspectral data of paper samples made of the same substance have similar characteristics and can be grouped into a single cluster. Similarly, paper samples made of different substances have different spectral properties. This paper relies on this heuristic and proposes a tensor based clustering framework for hyperspectral paper data, with an application to detect the forged papers in multi-page documents. Information embedded in the hyperspectral patches of the papers to be clustered is arranged into individual lateral slices of a third-order tensor in this framework. Further, this work employs the self-expressiveness property of submodules and an objective function is formulated to extract self-expressive representation tensor with low multirank and f-diagonal structure. Objective function of the proposed method incorporates l12 -induced Tensor Nuclear Norm (TNN) and l12 regularization to impart better low rankness and f-diagonal structure to the representation tensor. Experimental results of the proposed method were compared to the state-of-the-art subspace clustering approaches. The results demonstrate improved performance of the proposed method over the existing clustering algorithms.