{'fraction_non_alphanumeric': 0.017267267267267267, 'fraction_numerical': 0.0, 'mean_word_length': 5.566502463054187, '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}}
Euclidean distance transform on a dedicated architecture based on a reconfigurable mesh network

This paper describes a parallel algorithm for the Euclidean distance transform on a special-purpose architecture based on a reconfigurable mesh interconnection network. The proposed architecture, which supports the Euclidean distance transform algorithm as well as other low-level image processing algorithms, is particularly interesting because it can be effectively implemented in hardware and it can be programmed at a high level. The Euclidean distance transform algorithm described in this paper exploits the specific features of the reconfigurable interconnection network of the proposed dedicated architecture and takes advantage of the natural matching both between the data structure of the problem (a mesh of pixels) and that of the dedicated architecture (a mesh of processing elements) and between the nature of the computation (distance computation) and the capability of the interconnection network to let information flow from one node to a set of nodes by means of reconfigurable buses. The proposed algorithm has been implemented and has been validated through simulation, its computational complexity is O(N) (worst case) for pictures of N/spl times/N pixels on an architecture with N/spl times/N processing elements.