Finding of optimal morphological filter on binary images based on greedy and branch & bound searching

The method by searching the error code graph (ECG) to find the optimal morphological filter on binary image is proposed in this paper. 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.<
>