Representing and reasoning with temporal constraints in multimedia presentations

With the growing use of computers to create technical, business and personal presentations, there has been a huge increase in the number of multimedia presentation tools out in the market. Thus, over the coming years, there will be a growing need to build the ability to query rapidly databases consisting of interactive multimedia presentations. The MPA algebra proposed by Adali et al. provides a specification of how primitive algebraic operations on interactive multimedia presentations can be implemented. In this paper we define a temporal extension of MPA dealing with temporal constraints in the representation and in the queries. In particular, we point out the different types of (explicit and implicit) temporal constraints within a multimedia presentation and define a suitable framework in which the different types of constraints can be represented and queries (regarding also the temporal aspects) can be answered efficiently.

[1]  K. Selçuk Candan,et al.  Retrieval schedules based on resource availability and flexible presentation specifications , 1998, Multimedia Systems.

[2]  Barbara Pernici,et al.  Later: Managing Temporal Information Efficiently , 1997, IEEE Expert.

[3]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[4]  Polle T. Zellweger,et al.  Automatic temporal layout mechanisms , 2001 .

[5]  K. Selçuk Candan,et al.  Management and Rendering of Multimedia Views , 1998, Multimedia Information Systems.

[6]  Elisa Bertino,et al.  Temporal Synchronization Models for Multimedia Data , 1998, IEEE Trans. Knowl. Data Eng..

[7]  Renée J. Miller,et al.  Querying multimedia presentations , 1997, Proceedings of International Conference on Protocols for Multimedia Systems - Multimedia Networking.

[8]  Ernest Davis,et al.  Constraint Propagation with Interval Labels , 1987, Artif. Intell..

[9]  Luca Console,et al.  Efficient Processing of Queries and Assertions about Qualitative and Quantitative Temporal Constraints , 1999 .

[10]  Lluís Vila,et al.  A Survey on Temporal Reasoning in Artificial Intelligence , 1994, AI Communications.

[11]  Luca Console,et al.  On the Computational Complexity of Querying Bounds on Differences Constraints , 1995, Artif. Intell..

[12]  V. S. Subrahmanian,et al.  An algebra for creating and querying multimedia presentations , 2000, Multimedia Systems.

[13]  K. Selçuk Candan,et al.  CHIMP: a framework for supporting distributed multimedia document authoring and presentation , 1997, MULTIMEDIA '96.

[14]  Peter van Beek,et al.  Temporal query processing with indefinite information , 1991, Artif. Intell. Medicine.

[15]  Michelle Y. Kim,et al.  Multimedia documents with elastic time , 1995, MULTIMEDIA '95.

[16]  V. S. Subrahmanian Principles of Multimedia Database Systems , 1998 .

[17]  Barbara Pernici,et al.  LaTeR: A General Purpose Manager of Temporal Information , 1994, ISMIS.

[18]  Gultekin Özsoyoglu,et al.  Querying Multimedia Presentations Based on Content , 1999, IEEE Trans. Knowl. Data Eng..

[19]  Barbara Pernici,et al.  Qualitative and Quantitative Temporal Constraints and Relational Databases: Theory, Architecture, and Applications , 1999, IEEE Trans. Knowl. Data Eng..