Non-negative dictionary learning for paper watermark similarity

David Picard, Thomas Rice Henn, Georg Josef Dietz · 2016

In this paper, we investigate the retrieval of paper watermark by visual similarity. We propose to perform the visual similarity by encoding small regions of the watermark using a non-negative dictionary optimized on a large collection of watermarks. The local codes are then aggregated into a single vector representing the whole watermark. Experiments are carried out on a test of tracings (manual binarization of watermarks).

Read the paper · More papers on PaperTik