SUSAN—A New Approach to Low Level Image Processing
International Journal of Computer Vision
Building detection and description from a single intensity image
Computer Vision and Image Understanding
Straight-line-based primitive extraction in grey-scale object recognition
Pattern Recognition Letters
Group Theoretical Methods in Image Understanding
Group Theoretical Methods in Image Understanding
Comparing Images Using the Hausdorff Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Extracting geometric models through constraint minimization
VIS '90 Proceedings of the 1st conference on Visualization '90
A Coarse-to-Fine Strategy for Multiclass Shape Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Representation and Detection of Deformable Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Detection and segmentation of generic shapes based on affine modeling of energy in eigenspace
IEEE Transactions on Image Processing
Optimal edge-based shape detection
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
We propose a novel efficient method that finds partial and complete matches to models for families of polygons in fields of corners extracted from images. The polygon models assign specific values of acuteness to each corner in a fixed-length sequence along the boundary. The absolute and relative lengths of sides can be either constrained or left unconstrained by the model. Candidate matches are found by using the model as a guide in linking corners previously extracted from images. Geometrical similarity is computed by comparing corner acutenesses and side lengths for candidate polygons to the model. Photometric similarity is derived by comparing directions of sides in candidate polygons to pixel gradient directions in the image. The flexibility and efficiency of our method is demonstrated by searching for families of buildings in large overhead images.