Learning Independent Sparse Representation in Application to Symmetry Detection Problem

2021 ◽  
pp. 352-357
Author(s):  
Alexander Lebedev
2006 ◽  
Vol 2006 ◽  
pp. 1-12 ◽  
Author(s):  
Dong Ji-Yang ◽  
Zhang Jun-Ying

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 set. 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.


2015 ◽  
Vol 21 (4) ◽  
pp. 373-401
Author(s):  
CARLOS ARECES ◽  
EZEQUIEL ORBE

AbstractIn this paper we develop the theoretical foundations to exploit symmetries in modal logics. We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas using the framework provided by coinductive modal models introduced in [5]. Hence, the results apply to a wide class of modal logics including, for example, hybrid logics. We present two graph constructions that enable the reduction of symmetry detection in modal formulas to the graph automorphism detection problem, and we evaluate the graph constructions on modal benchmarks.


Author(s):  
ATSUSHI IMIYA ◽  
TOMOKI UENO ◽  
IRIS FERMIN

Symmetry of an object on a plane and in a space is an important geometric feature for biology, chemistry, and the understanding of human perception of figures. We propose a randomized method for the detection of symmetry in planar polygons and polyhedrons without assuming the predetermination of the centroids of the objects. Using a voting process, which is the main concept of the Hough transform in image processing, we transform the geometric computation for symmetry detection which is usually based on graph theory and combinatorial optimization, to the peak detection problem in a voting space in the context of the Hough transform. Our algorithm detects the centroid after detecting symmetry of an object for both planar and spatial objects.


2010 ◽  
Vol 30 (11) ◽  
pp. 2956-2958
Author(s):  
Xue-song XU ◽  
Ling-juan LI ◽  
Li-wei GUO

Sign in / Sign up

Export Citation Format

Share Document