{'fraction_non_alphanumeric': 0.021052631578947368, 'fraction_numerical': 0.0, 'mean_word_length': 5.578616352201258, '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}}
Unsupervised clustering approaches to color classification for color-based image code recognition.

Color-vision-based applications for mobile phones has become a subject of special interest lately. It would be interesting to investigate an unsupervised, adaptive, and fast algorithm that can classify color components into color clusters. We propose a hierarchical clustering approach using a single-linkage algorithm and a k-means clustering approach to color classification for color-based image code recognition in mobile computing environments. We also measured the performance of the proposed algorithms by color channel stretch, which is a simple color-correction method. Experimental results show that the single-linkage method is more robust than previous algorithms used in experiments with varying cameras and print materials. In particular the k-means-based method with color channel stretching has the highest performance and is the most robust under varying environment conditions such as illuminants, cameras, and print materials.