minkowski_sub1minkowski_sub1MinkowskiSub1MinkowskiSub1MinkowskiSub1minkowski_sub1 computes the Minkowski subtraction of the
input regions with a structuring element. By applying
minkowski_sub1minkowski_sub1MinkowskiSub1MinkowskiSub1MinkowskiSub1minkowski_sub1 to a region, its boundary gets smoothed.
In the process, the area of the region is reduced. Furthermore,
connected regions may be split. Such regions, however, remain
logically one region. The Minkowski subtraction is a set-theoretic
region operation. It uses the intersection operation.
Let M (StructElementStructElementStructElementStructElementstructElementstruct_element) and R (区域区域区域区域区域区域) be
two regions, where M is the structuring element and R is the
region to be processed. Furthermore, let m be a point in M.
Then the displacement vector is defined as the difference of the
center of gravity of M and the vector . Let
denote the translation of a
region R by a vector . Then
The parameter IterationsIterationsIterationsIterationsiterationsiterations determines the number of
iterations which are to be performed with the structuring element.
The result of iteration n-1 is used as input for iteration n.
From the above definition it follows that the maximum region is
generated in case of an empty structuring element.
Value range:
1
≤
IterationsIterationsIterationsIterationsiterationsiterations (lin)
Minimum increment:
1
Recommended increment:
1
Complexity
Let F1 be the area of the input region, and F2 be the area of
the structuring element. Then the runtime complexity for one region
is:
结果
minkowski_sub1minkowski_sub1MinkowskiSub1MinkowskiSub1MinkowskiSub1minkowski_sub1 returns 2 (
H_MSG_TRUE)
if all parameters are
correct. The behavior in case of empty or no input region can be
set via: