Decomposition of arbitrary gray-scale morphological structuring elements

Document Type

Article

Publication Date

12-1-2005

Abstract

Mathematical morphology has been widely used for many applications in image processing and analysis. Most image processing architectures adapted to morphological operations use structuring elements of a limited size. Therefore, difficulties arise when we deal with a large-sized structuring element. In this paper, we present algorithms for the decomposition of arbitrary gray-scale structuring elements into combined dilations or maximum operators of smaller structuring components. Our method does not need to perform additional pre-processes, such as checking the type of structuring elements and the decomposition rules. Furthermore, it is suited for a parallel pipelined architecture. © 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Identifier

25144447799 (Scopus)

Publication Title

Pattern Recognition

External Full Text Location

https://doi.org/10.1016/j.patcog.2005.04.003

ISSN

00313203

First Page

2323

Last Page

2332

Issue

12

Volume

38

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS