A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust recognition of scaled shapes using pairwise geometric histograms
BMVC '95 Proceedings of the 6th British conference on Machine vision (Vol. 2)
Real-time classification of traffic signs
Real-Time Imaging
Object Recognition from Local Scale-Invariant Features
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Real-Time 3D Object Recognition for Automatic Tracker Initialization
ISAR '01 Proceedings of the IEEE and ACM International Symposium on Augmented Reality (ISAR'01)
Three-Dimensional Tracking at Micro-scale Using a Single Optical Microscope
ICIRA '08 Proceedings of the First International Conference on Intelligent Robotics and Applications: Part II
Hi-index | 0.00 |
This paper presents a description of the ''Pairs Of Lines'' object recognition algorithm used in the MIMAS Computer Vision toolkit. This toolkit was developed at Sheffield Hallam University and the ''Pairs of Lines'' method was used in a recent European Union funded project. The algorithm was developed to enable a micro-robot system (Amavasai et al., InstMC Journal of Measurement and Control) to recognize geometric planar objects in real-time, in a noisy environment. The method involves using straight line segments which are extracted from both the known object models and from the visual scene that the objects are to be located in. Pairs of these straight lines are then compared. If there is a geometric match between the two pairs an estimate of the possible position, orientation and scale of the model in the scene is made. The estimates are collated, as all possible pairs of lines are compared. The process yields the position, orientation and scale of the known models in the scene. The algorithm has been optimized for speed. This paper describes the method in detail and presents experimental results which indicate that the technique exhibits robustness to camera noise and partial occlusion and produces recognition in times under 1s on a desktop PC. Recognition times are shown to be from 2 to 16 times faster than with the well-studied pairwise geometric histograms method. Recognition rates of up to 80% were achieved with scenes having signal to noise ratios of 2.5.