Trace Inference, Curvature Consistency, and Curve Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature grouping in a hierarchical probabilistic network
Image and Vision Computing
Probabilistic approach to the Hough transform
Image and Vision Computing
A Bayesian multiple-hypothesis approach to edge grouping and contour segmentation
International Journal of Computer Vision
Inferring global perceptual contours from local features
International Journal of Computer Vision - Special issue on computer vision research at the University of Southern California
A probabilistic approach to perceptual grouping
Computer Vision and Image Understanding
Quantitative measures of change based on feature organization: eigenvalues and eigenvectors
Computer Vision and Image Understanding
A probabilistic method for extracting chains of collinear segments
Computer Vision and Image Understanding - Special issue on perceptual organization in computer vision
Computer Vision and Image Understanding - Special issue on robusst statistical techniques in image understanding
A Factorization Approach to Grouping
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
Fast Radial Symmetry for Detecting Points of Interest
IEEE Transactions on Pattern Analysis and Machine Intelligence
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Road-Sign Detection and Recognition Based on Support Vector Machines
IEEE Transactions on Intelligent Transportation Systems
Real-Time Speed Sign Detection Using the Radial Symmetry Detector
IEEE Transactions on Intelligent Transportation Systems
Journal of Visual Communication and Image Representation
Real-time landing place assessment in man-made environments
Machine Vision and Applications
Hi-index | 0.01 |
This paper describes a robust regular polygon detector. Given image edges, we derive the a posteriori probability for a mixture of regular polygons, and thus the probability density function for the appearance of a set of regular polygons. Likely regular polygons can be isolated quickly by discretising and collapsing the search space into three dimensions. We derive a complete formulation for efficiently recovering the remaining dimensions using maximum likelihood at the locations of the most likely polygons. Results show robustness to noise, the ability to find and differentiate different shape types, and to perform real-time sign detection for driver assistance.