摘要
Based on an efficient algorithm of Euclidean distance transform for binary images, a circuit of O(N2) size is proposed. With in-place calculation, both the intermediate data storing and the result output use the same memory with the input data. This reduces the amount of memory largely. By replacing multipliers with counters, comparators, and adders, the circuit size is further reduced and its calculation speed is improved also.
Based on an efficient algorithm of Euclidean distance transform for binary images, a circuit of O(N2) size is proposed. With in-place calculation, both the intermediate data storing and the result output use the same memory with the input data. This reduces the amount of memory largely. By replacing multipliers with counters, comparators, and adders, the circuit size is further reduced and its calculation speed is improved also.
