Detection of the permutation symmetry in pattern sets
Summary: Symmetry is a powerful tool to reduce the freedom degrees of a system. But the applicability of the symmetry tool strongly depends on the ability to calculate the symmetries of the system. There exists an interesting algorithmic problem to search for the symmetry of a high-dimensional system. In this paper, a genetic algorithm-based permutation symmetry detection approach is proposed for pattern sets. Firstly, the permutation symmetry distance (PSD) is defined to measure the similarity of a pattern set before and after being transformed by a permutation operator. Secondly, the permutation symmetry detection problem is converted into an optimization problem by taking the PSD as a fitness function. Lastly, a genetic algorithm-based approach is designed for the symmetry detection problem. Computer simulation results are also given for five pattern sets of different dimensionality, which show the efficiency and speediness of the proposed detection approach, especially in high-dimensional cases.
- Pattern matching in the cycle structures of permutations
- Improved algorithms for symmetry analysis: structure preserving permutations
- Permutation tests for reflected symmetry
- Some Tests of Permutation Symmetry
- On the detection of permutation polynomials
- Pattern matching for separable permutations
- Patterns in random permutations
- Detecting almost symmetries of graphs
- Detecting and reconstructing centrally symmetric sets from the autocorrelation: two discrete cases
- Pattern selection with \(\mathrm{O}(3)\) symmetry
- Permutation tests for reflected symmetry
- scientific article; zbMATH DE number 1664967 (Why is no real title available?)
- Finding rotational symmetries by cyclic string matching
This page was built for publication: Detection of the permutation symmetry in pattern sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871408)
