Abstract
A wide variety of data structures are used to represent images. At the low level, raw grey-level image or binary images are represented by arrays of pixels (with square, triangular or hexagonal connectivity). Object boundaries are described by fourier descriptors or strings (Freeman chain code, symbolic strings). The adjacency of object regions is described by graph structures such as the region adjacency graph. Finally hierarchical or pyramidal <192> data structures which describe an image at a series of different levels or resolutions have proved useful (eg. quad trees <193>).
This is a preview of subscription content, log in via an institution to check access.
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
Tanimoto, S. and Klinger, A. Structured Computer Vision. Academic Press, New York, 1980.
Nagel, H.H. On the estimation of optical flow: relations between different approaches and some new results. Artificial Intelligence, 33:299–324, 1987
Fu, K.S. and Mui, J.K. A survey on image segmentation. Pattern Recognition, 13:3–16, 1981.
Brady, M. Computational approaches to image understanding. ACM Computer Surveys, 14:3–71, 1982.
Bundy, A. Incidence Calculus: A Mechanism for Probabilistic Reasoning. Journal of Automated Reasoning, 1:263–284, 1985. Also available as DAI Research Paper No 216, Edinburgh University.
Quinlan, J.R. Inferno: a cautious approach to uncertain inference. The Computer Journal, 26(3), 1983.
Sussman, G.J. A computational model of skill acquisition. American Elsevier, New York, 1975.
Tate, A. Interacting goals and their use. In Proceedings of IJCAI-79, International Joint Conference on Artificial Intelligence, 1979.
Waldinger, R. Achieving several goals simultaneously. Technical Note 107, SRI AI Center, Menlo Park, 1975.
Warren, D.H.D. WARPLAN: A system for generating plans. Memo 76, Dept. of Artificial Intelligence, Edinburgh, 1974.
Allen, J. Toward a general model of action and time. Artificial Intelligence, 23, 1984.
Brady, M. Computational approaches to image understanding. Computer Surveys, 14(1):2–71, 1982.
Barrow, H.G. and Tenenbaum, J.M. Computational vision. In Proc IEEE 6, pages 572–596, IEEE, 1981.
McAllester, D. Reasoning Utility Package User’s Manual Version One. Memo 667, MIT AI Lab, Cambridge, Mass., April 1982.
Muggleton, S. and Buntine, W. Machine invention of first-order predicates by inverting resolution. In Proceedings of the Fifth International Conference on Machine Learning, pages 339–352. Morgan Kaufmann, San Mateo, California, 1988.
Fahlman, S.E. NETL, a system for representing and using real-world knowledge. MIT Press, Cambridge, Mass., 1979.
Woods, W. et al. Speech Understanding Systems, Final Report Vol. 4. Report 3438, Beranek and Newman Inc., 1976.
Korf, R. Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27(1):97–109, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A. (1990). I. In: Bundy, A. (eds) Catalogue of Artificial Intelligence Techniques. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-97276-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-97276-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-97278-2
Online ISBN: 978-3-642-97276-8
eBook Packages: Springer Book Archive