.png){kind=icon}
返回
Fast and Robust Circular Object Detection With Probabilistic Pairwise Voting
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2011.2166956.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Accurate and efficient detection of circular objects in images is a challenging computer vision problem. Existing circular object detection methods can be broadly classified into two categories: voting based and maximum likelihood estimation (MLE) based. The former is robust to noise, however its computational complexity and memory requirement are high. On the other hand, MLE based methods (e. g., robust least squares fitting) are more computationally efficient but sensitive to noise, and can not detect multiple circles. This letter proposes Probabilistic Pairwise Voting (PPV), a fast and robust algorithm for circular object detection based on an extension of Hough Transform. The main contributions are threefold. 1) We formulate the problem of circular object detection as finding the intersection of lines in the three dimensional parameter space (i.e., center and radius of the circle). 2) We propose a probabilistic pairwise voting scheme to robustly discover circular objects under occlusion, image noise and moderate shape deformations. 3) We use a mode-finding algorithm to efficiently find multiple circular objects. We demonstrate the benefits of our approach on two real-world problems: 1) detecting circular objects in natural images, and 2) localizing iris in face images.
Keyword:
Circular object detection
Circular Hough Transform
iris localization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
Hyposensitization with Dermatophagoides pteronyssinus Antigen: Trial in Asthma Induced by House Dust.png)
BMJ
OAAI
BMJIF0
OAAI分享收藏
分享收藏Optimization of an Hough transform algorithm for the search of a centerPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏 没有更多内容
没有更多内容