A fast and accurate erosion-dilation method suitable for microcomputers
CVGIP: Graphical Models and Image Processing
Fast erosion and dilation by contour processing and thresholding of distance maps
Pattern Recognition Letters
Methods for fast morphological image transforms using bitmapped binary images
CVGIP: Graphical Models and Image Processing
A new set of fast algorithms for mathematical morphology I: idempotent geodesic transforms
CVGIP: Image Understanding
| Hi-index | 0.00 |
We introduce and investigate measures of rotation and reflectionsymmetries for compact convex sets. The appropriate symmetrization transformations are used to transform original sets into symmetrical ones. Symmetry measures are defined as the ratio of volumes (Lebesgue measure) of the original set and the corresponding symmetrical set.For the case of rotation symmetry we use as a symmetrizationtransformation a generalization of the Minkowski symmetric set (a difference body) for a cyclic group of rotations. For the case of reflection symmetry we investigate Blaschke symmetrization. Given a convex set and a hyperplane E in R^n we get a set symmetrical with respect to this hyperplane. Analyzing all hyperplanes containing the coordinate center one gets the measure of reflection symmetry. We discuss the lower bounds of this symmetry measure and also a derived symmetry measure.In the two dimensional case a perimetric measure representation of convexsets is applied for convex sets symmetrization as well as for the symmetry measure calculation. The perimetric measure allows also to perform a decomposition of a compact convex set into Minkowski sum of two sets. The first one is rotationally symmetrical and the second one is completely asymmetrical in the sense that it does not allow such a decomposition.We discuss a problem of the fast computation of symmetrization transformations. Minkowski addition of two sets is reduced to the convolution of their characteristic functions. Therefore, in the case of the discrete plane Z^2, Fast Fourier Transformation can be applied for the fast computation of symmetrization transformations.