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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2323-2332 |
| Number of pages | 10 |
| Journal | Pattern Recognition |
| Volume | 38 |
| Issue number | 12 |
| DOIs | |
| State | Published - Dec 2005 |
All Science Journal Classification (ASJC) codes
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence
Keywords
- Decomposition
- Image processing
- Mathematical morphology
- Structuring element
Fingerprint
Dive into the research topics of 'Decomposition of arbitrary gray-scale morphological structuring elements'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver