In this paper, a graphic searching algorithm is proposed to find the optimal stack filter. In this presented paper, the search of optimal stack filter is reduced to a problem of finding a minimal path from the root node to the optimal node in the error code graph(ECG). Two graphic searching techniques, greedy and A algorithms, are applied to avoid the search on the extremely large number of search space. Experimental results are given to show the efficiency and performances of our proposed method.
|Number of pages||4|
|State||Published - 1996|
|Event||Proceedings of the 1995 IEEE International Conference on Image Processing. Part 3 (of 3) - Washington, DC, USA|
Duration: 23 Oct 1995 → 26 Oct 1995
|Conference||Proceedings of the 1995 IEEE International Conference on Image Processing. Part 3 (of 3)|
|City||Washington, DC, USA|
|Period||23/10/95 → 26/10/95|