Time flow is the distinctive structure of various kinds of data, such as multimedia movie, electrocardiogram, and stock price quote. To make good use of these data, locating desired instant or interval along the time is indispensable. In addition to domain specific methods like automatic TV program segmentation, there should be a common means to search these data according to the changes along the time flow.
In this chapter, I-string and I-regular expression framework is presented together with some examples and a matching algorithm. I-string is a symbolic stringlike annotation model for continuous media which has a virtual continuous branchless time flow. I-regular expression is a pattern language over I-string, which is an extension of conventional regular expression for text search. Although continuous media are often treated as a sequence of time-sliced data in practice, the framework adopts continuous time flow. This abstraction allows the annotation and search query be independent from low-level implementation such as frame rate.
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
James F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832–843, 1983.
John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979.
H. Khalfallah and A. Karmouch. An architecture and a data model for integrated multimedia documents and presentational approach. ACM Multimedia Systems, 3(516):238–250, 1995.
Ken Nakayama, Kazunori Yamaguchi, and Satoru Kawai. I-regular expression: regular expression with continuous interval constraints. In CIKM ’97: Proceedings of the sixth international conference on Information and knowledge management, pages 40–50, New York, NY, USA, 1997. ACM.
E. Oomoto and K. Tanaka. OVID: Design and implementation of a video-object database system. IEEE Transactions on Knowledge and Data Engineering, 5(4):629–643, 1993.
D. Perrin. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pages 1–57. The MIT/Elsevier, Cambridge, MA/Amsterdam, 1990.
R. Weiss, A. Duda, and D. K. Gifford. Composition and search with a video algebra. IEEE Multimedia, 2(1):12–25, 1995.
Gerhard A. Schloss and Michael J. Wynblatt. Providing definition and temporal structure for multimedia data. ACM Multimedia Systems, 3(516):264–277, 1995.
Setrag Khoshafian and A. Brad Baker. MultiMedia and imaging databases, chapter 7.2, pages 333–338. Morgan Kaufman, San Francisco, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nakayama, K. et al. (2008). A Time Interval String Model for Annotating and Searching Linear Continuous Media. In: Hassanien, AE., Abraham, A., Kacprzyk, J. (eds) Computational Intelligence in Multimedia Processing: Recent Advances. Studies in Computational Intelligence, vol 96. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76827-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-76827-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76826-5
Online ISBN: 978-3-540-76827-2
eBook Packages: EngineeringEngineering (R0)