DocumentCode
2589462
Title
Detecting rotational symmetries
Author
Prasad, V. Shiv Naga ; Davis, Larry S.
Author_Institution
Inst. for Adv. Comput. Studies, Maryland Univ., College Park, MD, USA
Volume
2
fYear
2005
fDate
17-21 Oct. 2005
Firstpage
954
Abstract
We present an algorithm for detecting multiple rotational symmetries in natural images. Given an image, its gradient magnitude field is computed, and information from the gradients is spread using a diffusion process in the form of a gradient vector flow (GVF) field. We construct a graph whose nodes correspond to pixels in tire image, connecting points that are likely to be rotated versions of one another The n-cycles present in tire graph are made to vote for Cn symmetries, their votes being weighted by the errors in transformation between GVF in the neighborhood of the voting points, and the irregularity of the n-sided polygons formed by the voters. The votes are accumulated at tire centroids of possible rotational symmetries, generating a confidence map for each order of symmetry. We tested the method with several natural images.
Keywords
axial symmetry; computational geometry; gradient methods; graph theory; image recognition; object detection; tyres; gradient magnitude field; gradient vector flow; multiple rotational symmetries; n-sided polygons; tire graph; tire image; Computer vision; Detectors; Diffusion processes; Educational institutions; Joining processes; Pixel; Reflection; Robustness; Testing; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on
ISSN
1550-5499
Print_ISBN
0-7695-2334-X
Type
conf
DOI
10.1109/ICCV.2005.71
Filename
1544824
Link To Document