Abstract
This paper provides a detailed sensitivity analysis for the problem of recognising line patterns from large structural libraries. The analysis focuses on the characterization of two different recognition strategies. The first is histogram-based while the second uses feature-sets. In the former case comparison is based on the Bhattacharyya distance between histograms, while in the latter case the feature-sets are compared using a probabilistic variant of the Hausdorff distance. We study the two algorithms under line-dropout, line fragmentation, line addition and line end-point position errors. The analysis reveals that while the histogram-based method is most sensitive to the addition of line segments and end-point position errors, the set-based method is most sensitive to line dropout.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Gevers and A. Smeulders. Image indexing using composite color and shape invariant features. IEEE ICCV’98, pages 576–581, 1998.
G. L. Gimelfarb and A. K. Jain. On retrieving textured images from an image database. Pattern Recognition, 29(9):1461–1483, 1996.
B. Huet, A. D. J. Cross, and E. R. Hancock. Graph matching for shape retrieval. Advances in Neural Information Processing Systems 11, Edited by M.J. Kearns, S.A. Solla and D.A. Cohn, MIT Press, (available May 1999), 1998. to appear.
B. Huet and E. R. Hancock. Fuzzy relational distance for large-scale object recognition. IEEE CVPR’98, pages 138–143, June 1998.
B. Huet and E. R. Hancock. Relational histograms for shape indexing. IEEE ICCV’98, pages 563–569, Jan 1998.
A. K. Jain and A. Vailaya. Image retrieval using color and shape. Pattern Recognition, 29(8):1233–1244, 1996.
R. W. Picard. Light-years from lena: Video and image libraries of the future. IEEE ICIP’95, 1:310–313, 1995.
W. J. Rucklidge. Locating ojects using the Hausdorff distance. IEEE ICCV’95, pages 457–464, 1995.
M. J. Swain and D. H. Ballard. Indexing via colour histograms. IEEE ICCV’90, pages 390–393, 1990.
N. A. Thacker, P. A. Riocreux, and R. B. Yates. Assessing the completeness properties of pairwise geometric histograms. Image and Vision Computing, 13(5):423–429, June 1995.
R. Wilson and E. R. Hancock. Structural matching by discrete relaxation. IEEE PAMI, 19(6):634–648, June 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huet, B., Hancock, E.R. (1999). Structural Sensitivity for Large-Scale Line-Pattern Recognition. In: Huijsmans, D.P., Smeulders, A.W.M. (eds) Visual Information and Information Systems. VISUAL 1999. Lecture Notes in Computer Science, vol 1614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48762-X_88
Download citation
DOI: https://doi.org/10.1007/3-540-48762-X_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66079-8
Online ISBN: 978-3-540-48762-3
eBook Packages: Springer Book Archive