Fast Binary Dilation/Erosion Algorithm Using Reference Points

摘要

A new method of fast binary image dilation/erosion operation called RPI is proposed in this paper. Without the regularity of structure elements or pixel processing sequence, dilation/erosion operation can be carried out by looking up a precomputed increments table with this algorithm. The definition of reference points set and coding method for fast looking up the combination status, including its algorithm framework, are given. Compared with KSD algorithm, the average performance of RPI algorithm is a little h. However, RPI algorithm becomes more effective in the worst case and is more suitable for real-time image processing.