A greedy and branch and bound searching algorithm for finding the optimal morphological erosion filter on binary images

摘要

Searching via error code graph (ECG) to find the optimal morphological erosion filter is proposed. 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 a few nodes need to be traversed and examined in this graph.