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

Chin Chuan Han; Kuo Chin Fan

doi:10.1109/97.300314

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 journal › Article › peer-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 language	English
Pages (from-to)	41-44
Number of pages	4
Journal	IEEE Signal Processing Letters
Volume	1
Issue number	2
DOIs	https://doi.org/10.1109/97.300314
State	Published - Feb 1994

Access to Document

10.1109/97.300314

Cite this

@article{ca0ed01db26243939a777db032337191,

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

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.",

author = "Han, \{Chin Chuan\} and Fan, \{Kuo Chin\}",

note = "Funding Information: Manuscript received November 21, 1993; revised January 9, 1994. This work was supported in part by the National Science Council under grant NSC 83-0408-E-008-001.T he associate editor coordinating the review of this letter and approving it for publication was Dr. R. Ansari. The authors are with the Institute of Computer Science and Electronic Engineering, National Central University, Chung-Li, Taiwan, R.0.C IEEE Log Number 9400294.",

year = "1994",

month = feb,

doi = "10.1109/97.300314",

language = "???core.languages.en\_GB???",

volume = "1",

pages = "41--44",

journal = "IEEE Signal Processing Letters",

issn = "1070-9908",

number = "2",

}

TY - JOUR

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

AU - Han, Chin Chuan

AU - Fan, Kuo Chin

N1 - Funding Information: Manuscript received November 21, 1993; revised January 9, 1994. This work was supported in part by the National Science Council under grant NSC 83-0408-E-008-001.T he associate editor coordinating the review of this letter and approving it for publication was Dr. R. Ansari. The authors are with the Institute of Computer Science and Electronic Engineering, National Central University, Chung-Li, Taiwan, R.0.C IEEE Log Number 9400294.

PY - 1994/2

Y1 - 1994/2

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0028378757

U2 - 10.1109/97.300314

DO - 10.1109/97.300314

M3 - 期刊論文

AN - SCOPUS:0028378757

SN - 1070-9908

VL - 1

SP - 41

EP - 44

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

IS - 2

ER -

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

Abstract

Access to Document

Fingerprint

Cite this