Real-time implementation of morphological filters with polygonal structuring elements

In mathematical morphology, circular structuring elements (SE) are used whenever one needs angular isotropy. The circles—difficult to implement efficiently—are often approximated by convex, symmetric polygons that decompose under the Minkowski addition to 1-D inclined segments. In this paper, we show how to perform this decomposition efficiently, in stream with almost optimal latency to compute gray-scale erosion and dilation by flat regular polygons. We further increase its performance by introducing a spatial parallelism while maintaining sequential access to data. We implement these principles in a dedicated hardware block. Several of these blocks can be concatenated to efficiently compute sequential filters, or granulometries in one scan. With a configurable image size and programmable SE size, this architecture is usable in high-end, real-time industrial applications. We show on an example that it conforms to real-time requirements of the 100Hz 1080p FullHD TV standard, even for serial morphological filters using large hexagons or octagons.

[1]  Christophe Clienti,et al.  An Efficient Hardware Architecture without Line Memories for Morphological Image Processing , 2008, ACIVS.

[2]  Jianning Xu Decomposition of Convex Polygonal Morphological Structuring Elements into Neighborhood Subsets , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Takeshi Ikenaga,et al.  Real-time morphology processing using highly parallel 2-D cellular automata CAM2 , 2000, IEEE Trans. Image Process..

[4]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[5]  Ioannis Pitas,et al.  On fast running max-min filtering , 1997 .

[6]  J. Chermant,et al.  Image analysis and mathematical morphology for civil engineering materials , 2001 .

[7]  G. Matheron Random Sets and Integral Geometry , 1976 .

[8]  J. Velten,et al.  Implementation of a high-performance hardware architecture for binary morphological image processing operations , 2004, The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04..

[9]  Michael Werman,et al.  Computing 2-D Min, Median, and Max Filters , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  R. W. Brodersen,et al.  Architectures and design techniques for real-time image-processing IC's , 1987 .

[11]  Petr Dokládal,et al.  Computationally efficient, one-pass algorithm for morphological filters , 2011, J. Vis. Commun. Image Represent..

[12]  Pierre Soille,et al.  Morphological Image Analysis: Principles and Applications , 2003 .

[13]  J. Serra,et al.  An overview of morphological filtering , 1992 .

[14]  Marc Van Droogenbroeck,et al.  Fast computation of morphological operations with arbitrary structuring elements , 1996, Pattern Recognit. Lett..

[15]  Olivier Déforges,et al.  Fast recursive grayscale morphology operators: from the algorithm to the pipeline architecture , 2013, Journal of Real-Time Image Processing.

[16]  Jean Serra,et al.  The texture analyser , 1972 .

[17]  Hugues Talbot,et al.  Mathematical Morphology: from theory to applications , 2013 .

[18]  Vjaceslav Georgiev,et al.  Parallel implementation of sequential morphological filters , 2011, Journal of Real-Time Image Processing.

[19]  Liang-Gee Chen,et al.  Partial-result-reuse architecture and its design technique for morphological operations with flat structuring elements , 2005, IEEE Transactions on Circuits and Systems for Video Technology.

[20]  Marcel van Herk A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels , 1992, Pattern Recognit. Lett..

[21]  Ioannis Pitas,et al.  Fast algorithms for running ordering and max/min calculation , 1989 .

[22]  Rolf Adams,et al.  Radial Decomposition of Discs and Spheres , 1993, CVGIP Graph. Model. Image Process..

[23]  Daniel Lemire,et al.  Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element , 2006, Nord. J. Comput..

[24]  Pierre Soille,et al.  Recursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[25]  J. Pecht Speeding-up successive Minkowski operations with bit-plane computers , 1985, Pattern Recognit. Lett..

[26]  J. C. Klein,et al.  PIMM1, an image processing ASIC based on mathematical morphology , 1989, Proceedings., Second Annual IEEE ASIC Seminar and Exhibit,.

[27]  Christophe Clienti,et al.  A system on chip dedicated to pipeline neighborhood processing for Mathematical Morphology , 2008, 2008 16th European Signal Processing Conference.

[28]  Vjaceslav Georgiev,et al.  Stream implementation of serial morphological filters with approximated polygons , 2010, 2010 17th IEEE International Conference on Electronics, Circuits and Systems.

[29]  Vjaceslav Georgiev,et al.  Pipeline architecture for compound morphological operators , 2010, 2010 IEEE International Conference on Image Processing.

[30]  Nicolas Normand Convex Structuring Element Decomposition for Single Scan Binary Mathematical Morphology , 2003, DGCI.