@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",
}