The Community for Technology Leaders
Computer Vision, IEEE International Conference on (1998)
Bombay, India
Jan. 4, 1998 to Jan. 7, 1998
ISBN: 81-7319-221-9
pp: 563
Benoit Huet , University of York
Edwin R. Hancock , University of York
This paper is concerned with the retrieval of images from large databases based on their shape similarity to a query image. Our approach is based on two dimensional histograms that encode both the local and global geometric properties of the shapes. The pairwise attributes are the directed segment relative angle and directed relative position The novelty of the proposed approach is to simultaneously use the relational and structural constraints, derived from an adjacency graph, to gate histogram contributions. We investiguate the retrieval cap abilities of the method for various queries. We also investigate the robustness of the method to segmentation errors. We conclude that a relational histo gram of pairwise segment attributes presents a very efficient way of indexing into large databases. The optimal configuration is obtained when the local features are constructed from six neighbouring segments pairs. Moreover, a sensitivity analysis reveals that segmentation errors do not affect the retrieval performances.

E. R. Hancock and B. Huet, "Relational Histograms for Shape Indexing," Computer Vision, IEEE International Conference on(ICCV), Bombay, India, 1998, pp. 563.
92 ms
(Ver 3.3 (11022016))