Annular filters for binary images

A binary annular filter removes isolated points in the foreground and the background of an image. Here, the adjective "isolated" refers to an underlying adjacency relation between pixels, which may be different for foreground and background pixels. In this paper, annular filters are represented in terms of switch pairs. A switch pair consists of two operators which govern the removal of points from foreground and background, respectively. In the case of annular filters, switch pairs are completely determined by foreground and background adjacency. It is shown that a specific triangular condition in terms of both adjacencies is required to establish idempotence of the resulting annular filter. In the case of translation-invariant operators, an annular filter takes the form X-->(X plus sign in circleA) intersectionX union or logical sum(X minus sign in circleB), where A and B are structuring elements satisfying some further conditions: when A intersectionB intersection(A plus sign in circleB) not equal?, it is an (idempotent) morphological filter; when A union or logical sumB subsetA plus sign in circleB, it is a strong filter and in this case it can be obtained by composing in either order the annular opening X-->(X plus sign in circleA) intersectionX and the annular closing X--> union or logical sum(X plus sign in circleB).