Finding of optimal stack filter by using graphic searching methods

Zhi Ming Chen, Chin Chuan Han, Kuo Chin Fan

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
Pages350-353
Number of pages4
StatePublished - 1996
EventProceedings of the 1995 IEEE International Conference on Image Processing. Part 3 (of 3) - Washington, DC, USA
Duration: 23 Oct 199526 Oct 1995

Conference

ConferenceProceedings of the 1995 IEEE International Conference on Image Processing. Part 3 (of 3)
CityWashington, DC, USA
Period23/10/9526/10/95

Cite this