References

Anelli, G., A. Broggi and G. Destri, 1998. Decomposition of arbitrarily shaped binary morphological structuring elements using genetic algorithms. IEEE Trans. Pattern Anal. Mach. Intell., 20: 217-224.
CrossRef  |  

Gil, J.Y. and R. Kimmel, 2002. Efficient dilation, erosion, opening and closing algorithms. IEEE Trans. Pattern Anal. Mach. Intell., 24: 1606-1617.
CrossRef  |  

Nikopoulos, N. and I. Pitas, 2000. A fast implementation of 3-D binary morphological transformations. IEEE Trans. Image Process., 9: 283-286.
CrossRef  |  

Park, H. and R.T. Chin, 1995. Decomposition of arbitrarily shaped morphological structuring elements. IEEE Trans. Pattern Anal. Mach. Intell., 17: 2-15.
CrossRef  |  

Soille, P. and H. Talbot, 2001. Directional morphological filtering. IEEE Trans. Pattern Anal. Mach. Intell., 23: 1313-1329.
CrossRef  |  

Soille, P., E.J. Breen and R. Jones, 1996. Recursive implementation of erosions and dilations along discrete lines at arbitrary angles. IEEE Trans. Pattern Anal. Mach. Intell., 18: 562-567.
CrossRef  |  

Urbach, E.R. and M.H.F. Wilkinson, 2008. Efficient 2-D grayscale morphological transformations with arbitrary flat structuring elements. IEEE Trans. Image Process., 17: 1-8.
CrossRef  |  

Van Droogenbroeck,M. and H. Talbot, 1996. Fast computation of morphological operations with arbitrary structuring elements. Pattern Recognition Lett., 17: 1451-1460.
CrossRef  |  

Van Vliet, L.J. and B.J.H. Verwer, 1988. A contour processing method for fast binary neighbourhood operations. Pattern Recognition Lett., 7: 27-36.
CrossRef  |