Efficient 2-D grayscale morphological transformations with arbitrary flat structuring elements

An efficient algorithm is presented for the computation of grayscale morphological operations with arbitrary 2-D flat structuring elements (S.E.). The required computing time is independent of the image content and of the number of gray levels used. It always outperforms the only existing comparable...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 17(2008), 1 vom: 12. Jan., Seite 1-8
1. Verfasser: Urbach, Erik R (VerfasserIn)
Weitere Verfasser: Wilkinson, Michael H F
Format: Aufsatz
Sprache:English
Veröffentlicht: 2008
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM177188596
003 DE-627
005 20231223145654.0
007 tu
008 231223s2008 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0591.xml 
035 |a (DE-627)NLM177188596 
035 |a (NLM)18229799 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Urbach, Erik R  |e verfasserin  |4 aut 
245 1 0 |a Efficient 2-D grayscale morphological transformations with arbitrary flat structuring elements 
264 1 |c 2008 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 19.02.2008 
500 |a Date Revised 27.10.2019 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a An efficient algorithm is presented for the computation of grayscale morphological operations with arbitrary 2-D flat structuring elements (S.E.). The required computing time is independent of the image content and of the number of gray levels used. It always outperforms the only existing comparable method, which was proposed in the work by Van Droogenbroeck and Talbot, by a factor between 3.5 and 35.1, depending on the image type and shape of S.E. So far, filtering using multiple S.E.s is always done by performing the operator for each size and shape of the S.E. separately. With our method, filtering with multiple S.E.s can be performed by a single operator for a slightly reduced computational cost per size or shape, which makes this method more suitable for use in granulometries, dilation-erosion scale spaces, and template matching using the hit-or-miss transform. The discussion focuses on erosions and dilations, from which other transformations can be derived 
650 4 |a Journal Article 
700 1 |a Wilkinson, Michael H F  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 17(2008), 1 vom: 12. Jan., Seite 1-8  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:17  |g year:2008  |g number:1  |g day:12  |g month:01  |g pages:1-8 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 17  |j 2008  |e 1  |b 12  |c 01  |h 1-8