Jump-Miss Binary Erosion Algorithm

This work presents a new and fast algorithm for binary morphological erosions with arbitrary shaped structuring elements inspired by preprocessing techniques that are quite similar to those presented in many fast string matching algorithms (jumps and miss-matchings). The result of these preprocessing techniques is a speed up for computing binary erosions. A time complexity analysis shows that this algorithm has clear advantages over some known implementations. Experimental results confirm this analysis and shows that this algorithm has a good performance and can be a better option for erosions computation.