Complex Visual Activity Recognition Using a Temporally Ordered Database

  • Shailendra Bhonsle
  • Amarnath Gupta
  • Simone Santini
  • Marcel Worring
  • Ramesh Jain
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1614)


We propose using a temporally ordered database for complex visual activity recognition. We use a temporal precedence relation together with the assumption of fixed bounded temporal uncertainty of occurrence time of an atomic activity and comparatively large temporal extent of the complex activity. Under these conditions we identify the temporal structure of complex activities as a semiorder and design a database that has semiorder as its data model. A query algebra is then defined for this data model.


Order Relation Activity Recognition Query Language Atomic Activity Node Label 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Del Bimbo, E. Vicario, and D. ZIngoni. Symbolic description and visual querying of image sequences using spatio-temporal logic. IEEE Transactions on Knowledge and Data Engineering, 7(4), 1994.Google Scholar
  2. 2.
    S. Grumbach and T. Milo. An algebra for pomsets. In ICDT’ 95, pages 191–207. Springer-Verlag, 1995.Google Scholar
  3. 3.
    Amarnath Gupta, Shailendra Bhonsle, Simone Santini, and Ramesh Jain. An event management architecture for activity recognition in a multistream video database. In Proceedings of the 1998 Image Understanding Workshop, Monterey, CA, November 1998.Google Scholar
  4. 4.
    Ivana Mikic, Simone Santini, and Ramesh Jain. Video processing and integration from multiple cameras. In Proceedings of the 1998 Image Understanding Workshop, Monterey, CA, November 1998.Google Scholar
  5. 5.
    R. H. Mohring. Computationally tractable classes of ordered sets. In I. Rival, editor, Algorithms and Order. Kluwer Academic, 1989.Google Scholar
  6. 6.
    Wilfred Ng and Mark Levine. An extension of SQL to support ordered domains in relational databases. In Proceedings of the 1997 International Database Engineering and Applications Symposium, Montreal, Que., Canada, 25–27 Aug., pages 358–367, 1997.Google Scholar
  7. 7.
    V. R. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15(1), 1986.Google Scholar
  8. 8.
    Nuno Vasconcelos and Andrew Lippman. Towards semantically meaningful feature spaces for the characterization of video content. In Proceedings of International Conference on Image Processing, Santa Barbara, CA, USA, 26–29 Oct., pages 25–28, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Shailendra Bhonsle
    • 1
  • Amarnath Gupta
    • 2
  • Simone Santini
    • 1
  • Marcel Worring
    • 3
  • Ramesh Jain
    • 1
  1. 1.Visual Computing LaboratoryUniversity of California San DiegoSan Diego
  2. 2.San Diego Supercomputer CenterSan Diego
  3. 3.Intelligent Sensory Information SystemsUniversity of AmsterdamAmsterdam

Personalised recommendations