Fast computation of morphological operations with arbitrary structuring elements
暂无分享,去创建一个
[1] Bidyut Baran Chaudhuri. An efficient algorithm for running window pel gray level ranking in 2-D images , 1990, Pattern Recognit. Lett..
[2] G. Matheron. Random Sets and Integral Geometry , 1976 .
[3] Hugues Talbot,et al. Fast gray-level morphological transforms with any structuring element , 1993, Other Conferences.
[4] Pierre Soille,et al. Recursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles , 1996, IEEE Trans. Pattern Anal. Mach. Intell..
[5] Michael Werman,et al. Computing 2-D Min, Median, and Max Filters , 1993, IEEE Trans. Pattern Anal. Mach. Intell..
[6] Xinhua Zhuang,et al. Image Analysis Using Mathematical Morphology , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[7] J. Pecht. Speeding-up successive Minkowski operations with bit-plane computers , 1985, Pattern Recognit. Lett..
[8] Edward K. Wong,et al. Hierarchical algorithms for morphological image processing , 1993, Pattern Recognit..
[9] Jean Serra,et al. Image Analysis and Mathematical Morphology , 1983 .
[10] Thomas S. Huang,et al. A fast two-dimensional median filtering algorithm , 1979 .
[11] Luc Vincent,et al. Morphological transformations of binary images with arbitrary structuring elements , 1991, Signal Process..