Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Erik R. Urbach

dblp:13/5763 · also Erik Ronald Urbach · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Image and video processing · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › mathematical morphology
grayscale morphology
0.112008
Efficient 2-D Grayscale Morphological Transformations With Arbitrary Flat Structuring Elements · IEEE Trans. Image Process. 2008
Image and video processing
mathematical morphology
0.112008
Efficient 2-D Grayscale Morphological Transformations With Arbitrary Flat Structuring Elements · IEEE Trans. Image Process. 2008
Image and video processing › mathematical morphology
pattern spectrum
0.112007
Connected Shape-Size Pattern Spectra for Rotation and Scale-Invariant Classification of Gray-Scale Images · IEEE Trans. Pattern Anal. Mach. Intell. 2007
Image and video processing › mathematical morphology
connected operators
0.012007
Connected Shape-Size Pattern Spectra for Rotation and Scale-Invariant Classification of Gray-Scale Images · IEEE Trans. Pattern Anal. Mach. Intell. 2007

Methods — techniques the papers use, named apart from their topics

hit-or-miss transform · 0.1granulometry · 0.1shape-size pattern spectra · 0.1morphological operators · 0.1
YearPublicationVenuePosition
2008 Efficient 2-D Grayscale Morphological Transformations With Arbitrary Flat Structuring Elements
abstract
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.
Erik R. Urbach, Michael H. F. Wilkinson
IEEE Trans. Image Process.1
2007 Connected Shape-Size Pattern Spectra for Rotation and Scale-Invariant Classification of Gray-Scale Images
abstract
In this paper, we describe a multiscale and multishape morphological method for pattern-based analysis and classification of gray-scale images using connected operators. Compared with existing methods, which use structuring elements, our method has three advantages. First, in our method, the time needed for computing pattern spectra does not depend on the number of scales or shapes used, i.e., the computation time is independent of the dimensions of the pattern spectrum. Second, size and strict shape attributes can be computed, which we use for the construction of joint 2D shape-size pattern spectra. Third, our method is significantly less sensitive to noise and is rotation-invariant. Although rotation invariance can also be approximated by methods using structuring elements at different angles, this tends to be computationally intensive. The classification performance of these methods is discussed using four image sets: Brodatz, COIL-20, COIL-100, and diatoms. The new method obtains better or equal classification performance to the best competitor with a 5 to 9-fold speed gain.
Erik R. Urbach, Jos B. T. M. Roerdink, Michael H. F. Wilkinson
IEEE Trans. Pattern Anal. Mach. Intell.1
2006 Efficient 2-D Gray-Scale Dilations and Erosions with Arbitrary Flat Structuring Elements
abstract
An efficient algorithm is presented for the computation of gray-scale morphological operations with 2-D structuring elements (S.E.). The required computing time is independent of the image content and of the number of gray levels used. For circular S.E.s, it always outperforms the only existing comparable method, which was proposed by Van Droogenbroeck and Talbot (1996), by a factor between 1.8 and 8.6, depending on the image type. 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 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.
Erik R. Urbach, Michael H. F. Wilkinson
ICIP1