Assessing the completeness properties of pairwise geometric histograms

doi:10.1016/0262-8856(95)99729-K

Image and Vision Computing

Volume 13, Issue 5, June 1995, Pages 423-429

https://doi.org/10.1016/0262-8856(95)99729-K Get rights and content

Abstract

A pairwise geometric histogram (PGH) encodes the probability of geometric co-occurrences between any line and the set of lines defining an object. An object therefore has a set of PGHs associated with it, one histogram for each line. We describe here the way in which the probability of geometric co-occurrence is calculated and entered in the histograms, the different ways these histograms can be defined and the completeness properties of the set of histograms in terms of arbitrary shape representation. We show that this representation provides unambiguous shape representation by demonstrating an inverse reconstruction algorithm. We conclude that the methods suggested in a previous paper for object recognition and location provide a complete solution to the problem of recognition of edge based descriptors for fixed 2D projected views of rigid objects.

References (8)

DG Lowe
Three-dimensional object recognition from two-dimensional images
Artif. Intell.
(1987)
AC Evans et al.
The use of geometric histograms for model-based object recognition
CA Rothwell et al.
Canonical frames for planar object recognition
CT Zahn et al.
Fourier descriptors for plane closed curves
IEEE Trans. Comput.
(1972)

There are more references available in the full text version of this article.

Cited by (24)

Performance characterization in computer vision: A guide to best practices
2008, Computer Vision and Image Understanding
It is frequently remarked that designers of computer vision algorithms and systems cannot reliably predict how algorithms will respond to new problems. A variety of reasons have been given for this situation and a variety of remedies prescribed in literature. Most of these involve, in some way, paying greater attention to the domain of the problem and to performing detailed empirical analysis. The goal of this paper is to review what we see as current best practices in these areas and also suggest refinements that may benefit the field of computer vision. A distinction is made between the historical emphasis on algorithmic novelty and the increasing importance of validation on particular data sets and problems.
Relational object recognition from large structural libraries
2002, Pattern Recognition
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which uses a nearest neighbour graph to establish the adjacency of line-segments. Associated with each pair of line-segments connected in this way is a vector of Euclidean invariant relative angle and distance ratio attributes. The relational similarity measure uses robust error kernels to compare sets of pairwise attributes on the edges of a nearest neighbour graph. We use the relational similarity measure in a series of recognition experiments which involve a library of over 2500 line-patterns. A sensitivity study reveals that the method is capable of delivering a recognition accuracy of 94%. A comparative study reveals that the method is most effective when either a Gaussian kernel or Huber's robust kernel is used to weight the attribute relations. Moreover, the method consistently outperforms the standard and the quantile Hausdorff distance.
Image Analysis and Computer Vision: 1995
1996, Computer Vision and Image Understanding
This paper presents a bibliography of over 1550 references related to computer vision and image analysis, arranged by subject matter. The topics covered include computational techniques; feature detection and segmentation; image and scene analysis; two-dimensional shape; pattern; color and texture; matching and stereo; three-dimensional recovery and analysis; three-dimensional shape; and motion. A few references are also given on related topics, including geometry and graphics, compression and processing, sensors and optics, visual perception, neural networks, artificial intelligence and pattern recognition, as well as on applications.
Shape indexing using self-organizing maps
2002, IEEE Transactions on Neural Networks
Logo recognition: Theory and practice
2016, Logo Recognition: Theory and Practice
Stereo vision based autonomous navigation for 3-DOF systems in unstructured environments
2016, 2016 14th International Conference on Control, Automation, Robotics and Vision, ICARCV 2016

View all citing articles on Scopus

View full text

Assessing the completeness properties of pairwise geometric histograms

Abstract

Artif. Intell.

The use of geometric histograms for model-based object recognition

Canonical frames for planar object recognition

Fourier descriptors for plane closed curves

IEEE Trans. Comput.