A unifying view for stack filter design based on graph search methods

作者:

Highlights:

摘要

Stack filters are operators that commute with the thresholding operation, i.e., thresholding a signal, applying the binary filter on each thresholded binary signals, and then summing up (stacking) the results yields the same result as applying the multi-level (gray-scale) filter on the original signal. Several approaches for designing optimal stack filters from training data, where optimality is characterized in terms of costs based on input–output joint observations, have been proposed. This work considers stack filter design from training data under a general statistical framework developed in the context of morphological image operator design. This framework (1) provides a common point of view for distinct design approaches, being useful for comparative analysis or for emphasizing differences, (2) clearly answers the issue of why binary signals from different threshold levels, although following distinct distributions, can be pooled together in the cost estimation process, and (3) helps to show that several stack filter design approaches based on lattice diagrams search methods share a common underlying formulation.

论文关键词:Stack filter,Positive boolean function,Threshold decomposition,Mathematical morphology,Filter design,Boolean lattice,Graph search methods

论文评审过程:Received 10 September 2004, Accepted 17 February 2005, Available online 31 May 2005.

论文官网地址:https://doi.org/10.1016/j.patcog.2005.02.018