Detecting Rotational Symmetries
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 C/sub n/ 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.
Cite
Text
Prasad and Davis. "Detecting Rotational Symmetries." IEEE/CVF International Conference on Computer Vision, 2005. doi:10.1109/ICCV.2005.71Markdown
[Prasad and Davis. "Detecting Rotational Symmetries." IEEE/CVF International Conference on Computer Vision, 2005.](https://mlanthology.org/iccv/2005/prasad2005iccv-detecting/) doi:10.1109/ICCV.2005.71BibTeX
@inproceedings{prasad2005iccv-detecting,
title = {{Detecting Rotational Symmetries}},
author = {Prasad, V. Shiv Naga and Davis, Larry S.},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {2005},
pages = {954-961},
doi = {10.1109/ICCV.2005.71},
url = {https://mlanthology.org/iccv/2005/prasad2005iccv-detecting/}
}