%0 Journal Article
%T Finding rotational symmetries by cyclic string matching
%A Josep Llados
%A Horst Bunke
%A Enric Marti
%J Pattern recognition letters
%D 1997
%V 18
%N 14
%I Elsevier
%F Josep Llados1997
%O DAG;IAM;
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=1562), last updated on Tue, 17 May 2016 11:29:05 +0200
%X Symmetry is an important shape feature. In this paper, a simple and fast method to detect perfect and distorted rotational symmetries of 2D objects is described. The boundary of a shape is polygonally approximated and represented as a string. Rotational symmetries are found by cyclic string matching between two identical copies of the shape string. The set of minimum cost edit sequences that transform the shape string to a cyclically shifted version of itself define the rotational symmetry and its order. Finally, a modification of the algorithm is proposed to detect reflectional symmetries. Some experimental results are presented to show the reliability of the proposed algorithm
%K Rotational symmetry
%K Reflectional symmetry
%K String matching
%U http://dx.doi.org/10.1016/S0167-8655(97)00144-X
%U http://refbase.cvc.uab.es/files/LBM1997a.pdf
%P 1435-1442