Greedy and A*-searching-based approach to the finding of optimal binary morphological filter

Chin-Chuan Han; Kuo-Chin Fan

doi:10.1117/12.185860

16 September 1994 Greedy and A*-searching-based approach to the finding of optimal binary morphological filter

Chin-Chuan Han, Kuo-Chin Fan

Proceedings Volume 2308, Visual Communications and Image Processing '94; (1994) https://doi.org/10.1117/12.185860
Event: Visual Communications and Image Processing '94, 1994, Chicago, IL, United States

Abstract

In this paper, a greedy and A^*-based searching algorithm is proposed to find the optimal morphological filter on binary images. According to the Matheron representation, the estimator for mean square error (MSE) is defined as the union of multiple erosions. Unfortunately, finding the optimal solution is a long search and time consuming procedure because we have to compute the MSE values over all possible structuring element combinations and make comparisons among them. In this presented paper, the search for the solution is reduced to the problem of obtaining a path with the minimal cost from the root node to one vertex on error code graph. Two graph searching techniques, greedy and A^* algorithms are applied to avoid the search on the extremely large number of search space. Experimental results are illustrated to show the efficiency and performances of our proposed method.

Citation Download Citation

Chin-Chuan Han and Kuo-Chin Fan "Greedy and A*-searching-based approach to the finding of optimal binary morphological filter", Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); https://doi.org/10.1117/12.185860

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available