摘要
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.
原文 | ???core.languages.en_GB??? |
---|---|
頁面 | 350-353 |
頁數 | 4 |
出版狀態 | 已出版 - 1996 |
事件 | Proceedings of the 1995 IEEE International Conference on Image Processing. Part 3 (of 3) - Washington, DC, USA 持續時間: 23 10月 1995 → 26 10月 1995 |
???event.eventtypes.event.conference???
???event.eventtypes.event.conference??? | Proceedings of the 1995 IEEE International Conference on Image Processing. Part 3 (of 3) |
---|---|
城市 | Washington, DC, USA |
期間 | 23/10/95 → 26/10/95 |