Finding of optimal stack filter by using graphic searching methods

A graphic searching algorithm is proposed to find the optimal stack filter. The search of the optimal stack filter is reduced to a problem of finding a minimal path from the root node to the optimal node in the error cone graph (ECG). Two graphic searching techniques, the greedy and A* algorithms, are applied to avoid the searching an extremely large search space. Experimental results are given to show the efficiency and performance of our proposed method.