Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Finding of optimal stack filter by using graphic searching methods

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhi-Ming Chen ; Inst. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan ; Chin-Chuan Han ; Kuo-Chin Fan

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

Published in:

Image Processing, 1995. Proceedings., International Conference on  (Volume:1 )

Date of Conference:

23-26 Oct 1995