Decomposition of binary morphological structuring elements based on genetic algorithms

Frank Y. Shih, Yi Ta Wu

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

Most image processing architectures adapted to morphological operations use structuring elements of a limited size. Various algorithms have been developed for decomposing a large sized structuring element into dilations of small structuring components. However, these decompositions often come with certain restricted conditions. In this paper, we present an improved technique using genetic algorithms to decompose arbitrarily shaped binary structuring elements. The specific initial population, fitness functions, dynamic threshold adaptation, and the recursive size reduction strategy are our features to enhance the performance of decomposition. It can generate the solution in less computational costs, and is suited for parallel implementation.

Original languageEnglish (US)
Pages (from-to)291-302
Number of pages12
JournalComputer Vision and Image Understanding
Volume99
Issue number2
DOIs
StatePublished - Aug 2005

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition

Keywords

  • Decomposition
  • Genetic algorithms
  • Mathematical morphology
  • Structuring element

Fingerprint

Dive into the research topics of 'Decomposition of binary morphological structuring elements based on genetic algorithms'. Together they form a unique fingerprint.

Cite this