Abstract
This paper presents an automated technique that combines manual annotations and knowledge produced by an automatic content characterization technique to build higher level abstraction of video content. We develop a method based on concept languages for automatically discovering structural associations within video sequences. The obtained abstraction of the contents of video sequences can be used, by navigating the tree structure.
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
Baader, F., Küsters, R.: Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions. In: Herzog, O. (ed.) KI 1998. LNCS, vol. 1504, pp. 129–140. Springer, Heidelberg (1998)
Baader, F., Küsters, R., Molitor, R.: Computing Least Common Subsumer in Description Logics with Existential Restrictions. In: Dean, T. (ed.) Proceedings of IJCAI 1999, pp. 96–101 (1999)
Donini, F., Era, A.: Most Specific Concepts Technique for Knowledge Bases with Incomplete Information. In: Finin, T.W., Yesha, Y., Nicholas, C. (eds.) CIKM 1992. LNCS, vol. 752, pp. 545–551. Springer, Heidelberg (1993)
Hacid, M.-S., Decleir, C., Kouloumdjian, J.: A Database Approach for Modeling and Querying Video Data. IEEE Transactions on Knowledge and Data Engineering (IEEE TKDE) 12(5), 729–750 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hajji, H., Hacid, MS., Toumani, F. (2003). Discovering Structures in Video Databases. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds) Foundations of Intelligent Systems. ISMIS 2003. Lecture Notes in Computer Science(), vol 2871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39592-8_84
Download citation
DOI: https://doi.org/10.1007/978-3-540-39592-8_84
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20256-1
Online ISBN: 978-3-540-39592-8
eBook Packages: Springer Book Archive