A Greedy and Branch and Bound Searching Algorithm for Finding the Optimal Morphological Erosion Filter on Binary Images

Chin Chuan Han, Kuo Chin Fan

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

The searching via error code graph (ECG) to find the optimal morphological erosion filter is proposed in this letter. The problem to find the optimal solution is reduced to the problem for searching a minimal path in ECG. Since this graph satisfies some greedy properties, only few nodes need to be traversed and examined in this graph.

Original languageEnglish
Pages (from-to)41-44
Number of pages4
JournalIEEE Signal Processing Letters
Volume1
Issue number2
DOIs
StatePublished - Feb 1994

Fingerprint

Dive into the research topics of 'A Greedy and Branch and Bound Searching Algorithm for Finding the Optimal Morphological Erosion Filter on Binary Images'. Together they form a unique fingerprint.

Cite this