Abstract
In content-based image retrieval we are faced with continuously growing image databases that require efficient and effective search strategies. In this context, shapes play a particularly important role, especially as soon as not only the overall appearance of images is of interest, but if actually their content is to be analysed, or even to be recognised. In this paper we argue in favour of numeric features which characterise shapes by single numeric values. Therewith, they allow compact representations and efficient comparison algorithms. That is, pairs of shapes can be compared with constant time complexity. We introduce three numeric features which are based on a qualitative relational system. The evaluation with an established benchmark data set shows that the new features keep up with other features pertaining to the same complexity class. Furthermore, the new features are well-suited in order to supplement existent methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Allen, J.F.: Maintaining Knowledge about Temporal Intervals. Communications of the ACM 26(11), 832–843 (1983)
Attneave, F.: Some Informational Aspects of Visual Perception. Psychological Review 61, 183–193 (1954)
Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. John Wiley & Sons, Chichester (1973)
Garson, G.D., Biggs, R.S.: Analytic Mapping and Geographic Databases. Sage Publications, Thousand Oaks (1992)
Gottfried, B.: Reasoning about Intervals in Two Dimensions. In: IEEE Int. Conf. on Systems, Man and Cybernetics, The Hague, The Netherlands, pp. 5324–5332. IEEE Computer Society Press, Los Alamitos (2004)
Gottfried, B.: Shape from Positional-Contrast — Characterising Sketches with Qualitative Line Arrangements. Deutscher Universitäts-Verlag (2007)
Hu, M.-K.: Visual Pattern Recognition by Moment Invariants. IRE Transactions on Information Theory 8(2), 179–187 (1962)
Latecki, L.J., Lakämper, R.: Shape Similarity Measure Based on Correspondence of Visual Parts. IEEE PAMI 22(10), 1185–1190 (2000)
Latecki, L.J., Lakämper, R., Eckhardt, U.: Shape Descriptors for Non-rigid Shapes with a Single Closed Contour. In: IEEE CVPR, Hilton Head Island, SC, USA, pp. 424–429. IEEE Computer Society Press, Los Alamitos (2000)
Mitzias, D.A., Mertzios, B.G.: Shape Recognition with a Neural Classifier Based on a Fast Polygon Approximation Technique. Pattern Recognition 27, 627–636 (1994)
Rosin, P.L.: Assessing the Behaviour of Polygonal Approximation Algorithms. Pattern Recognition 36, 505–518 (2003)
Schuldt, A., Gottfried, B., Herzog, O.: Retrieving Shapes Efficiently by a Qualitative Shape Descriptor: The Scope Histogram. In: Sundaram, H., Naphade, M., Smith, J.R., Rui, Y. (eds.) CIVR 2006. LNCS, vol. 4071, pp. 261–270. Springer, Heidelberg (2006)
Schuldt, A., Gottfried, B., Herzog, O.: Towards the Visualisation of Shape Features: The Scope Histogram. In: Freksa, C., Kohlhase, M., Schill, K. (eds.) KI 2006. LNCS (LNAI), vol. 4314, pp. 289–301. Springer, Heidelberg (2007)
Steger, C.: On the Calculation of Arbitrary Moments of Polygons. Technical Report FGBV-96-05, Informatik IX, Technische Universität München (1996)
Zimmermann, K., Freksa, C.: Qualitative Spatial Reasoning Using Orientation, Distance, and Path Knowledge. Applied Intelligence 6, 49–58 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gottfried, B., Schuldt, A., Herzog, O. (2007). Extent, Extremum, and Curvature: Qualitative Numeric Features for Efficient Shape Retrieval. In: Hertzberg, J., Beetz, M., Englert, R. (eds) KI 2007: Advances in Artificial Intelligence. KI 2007. Lecture Notes in Computer Science(), vol 4667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74565-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-74565-5_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74564-8
Online ISBN: 978-3-540-74565-5
eBook Packages: Computer ScienceComputer Science (R0)