{'fraction_non_alphanumeric': 0.02611218568665377, 'fraction_numerical': 0.0009671179883945841, 'mean_word_length': 5.234939759036145, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Co-occurrence matrix and self-organizing map-based query from spectral image database

A co-occurrence matrix and Self-Organizing Map (SOM) based technique for searching images from a spectral image database is proposed. At first the SOM is trained and the Best Matching Unit (BMU) histogram is created for every spectral image of a database. Next, the texture-histogram is calculated from the co-occurrence matrices, generated using the 1st inner product images of the spectral images. BMU-histogram and the texture-histogram are combined to one feature histogram and these histograms, generated for each spectral image of a database, are saved to a histogram database. The dissimilarities between the histogram of the query image and the histograms of the database are calculated using different distance measures, more precisely Euclidean distance, dynamic partial distance and Jeffrey divergence. Finally, the images are ordered according to the histogram dissimilarity. The results using a real spectral image database are given.