{'fraction_non_alphanumeric': 0.021003500583430573, 'fraction_numerical': 0.0, 'mean_word_length': 5.402985074626866, '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}}
QR Code detection using parallel lines

Several basic techniques are known for QR Code detection in digital images. This paper presents an approach that utilizes a special line parameterization, along with a variant of the Hough-transform, called PClines. The premised parameterization uses a parallel coordinate system, which allows faster accumulation than the slope-intercept method used by the basic Hough-transform, due to simpler computation. The presented technique can be easily adapted to any kind of matrix code. Mathematical and algorithmic foundations of this approach are presented, along with an implementation on Microsoft's .NET framework. Test results are also presented, emphasizing the effect of different parameters on the overall detection rate. These results are then compared to other implementations using the same PClines technique.