Finding of optimal binary morphological erosion filter via greedy and branch & bound searching

Chin Chuan Han, Kuo Chin Fan

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

In this paper, an effective and efficient algorithm for finding the optimal morphological erosion filter on binary images is proposed. The design of morphological erosion filter is based on statistical method by minimizing mean square error. Traditionally, finding optimal morphological erosion filters requires searching through a large number of structuring-element combinations which is a long search and time consuming procedure. In the proposed method, the problem of finding the optimal solution is reduced to the problem of searching a minimal path on the error code graph (ECG). Since the graph satisfies some greedy criteria, only few nodes need to be traversed and examined. Experiments are conducted to illustrate the validity of our proposed method.

Original languageEnglish
Pages (from-to)335-353
Number of pages19
JournalJournal of Mathematical Imaging and Vision
Volume6
Issue number4
DOIs
StatePublished - 1996

Keywords

  • Branch and bound algorithm
  • Error code graph
  • Greedy algorithm
  • Mean-square error
  • Morphological erosion filter

Fingerprint

Dive into the research topics of 'Finding of optimal binary morphological erosion filter via greedy and branch & bound searching'. Together they form a unique fingerprint.

Cite this