16 September 1994 Greedy and A*-searching-based approach to the finding of optimal binary morphological filter
Author Affiliations +
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.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chin-Chuan Han, Chin-Chuan Han, Kuo-Chin Fan, 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); doi: 10.1117/12.185860; https://doi.org/10.1117/12.185860
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT

Precision of morphological estimation
Proceedings of SPIE (May 20 1993)
Morphological filter mean-absolute-error theorem
Proceedings of SPIE (March 31 1992)
Optimal filters from prior filters
Proceedings of SPIE (April 03 1997)
Bayesian multiresolution filter design
Proceedings of SPIE (March 02 2000)

Back to Top