Event Modeling and Recognition Using Markov Logic Networks
2008, Lecture Notes in Computer Science
https://doi.org/10.1007/978-3-540-88688-4_45Abstract
We address the problem of visual event recognition in surveillance where noise and missing observations are serious problems. Common sense domain knowledge is exploited to overcome them. The knowledge is represented as first-order logic production rules with associated weights to indicate their confidence. These rules are used in combination with a relaxed deduction algorithm to construct a network of grounded atoms, the Markov Logic Network. The network is used to perform probabilistic inference for input queries about events of interest. The system's performance is demonstrated on a number of videos from a parking lot domain that contains complex interactions of people and vehicles.
References (27)
- Richardson, M., Domingos, P.: Markov Logic Networks. Machine Learning 62, 107- 136 (2006)
- Nevatia, R., Zhao, T., Hongeng, S.: Hierarchical language-based representation of events in video stream. In: Proc. of CVPRW on Event Mining, pp. 39-47. IEEE, Los Alamitos (2003)
- Yamato, J., Ohya, J., Ishi, K.: Recognizing human action in time-sequential im- ages using Hidden Markov models. In: Proc. CVPR 1992, pp. 379-385. IEEE, Los Alamitos (1992)
- Rota, N., Thonnat, M.: Activity recognition from video sequences using declarative models. In: Proc. ECAI 2002, pp. 673-680 (2002)
- Shet, V., Harwood, D., Davis, L.: Multivalued default logic for identity maintenance in visual surveillance. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3954, pp. 119-132. Springer, Heidelberg (2006)
- Shet, V., Neumann, J., Ramesh, V., Davis, L.: Bilattice-based logical reasoning for human detection. In: Proc. CVPR 2007, pp. 1-8. IEEE, Los Alamitos (2007)
- Getoor, L., Taskar, B.: Intro. to Statistical Relational Learning. MIT Press, Cam- bridge (2007)
- Liao, L., Fox, D., Kautz, H.: Location-based activity recognition using Relational Markov Networks. In: Proc. IJCAI 2005, pp. 773-778. Morgan Kaufmann, Inc., San Francisco (2005)
- mins .1em Pentney, W., Popescu, A., Wang, S., Kautz, H., Philipose, M.: Sensor- based understanding of daily life via large-scale use of common sense. In: Proc. AAAI 2006 (2006)
- Biswas, R., Thrun, S., Fujimura, K.: Recognizing activities with multiple cues. In: IEEE Works. on Human Motion, pp. 255-270 (2007)
- Bobick, A., Ivanov, Y.: Action recognition using probabilistic parsing. In: CVPR 1998, pp. 196-202 (1998)
- Kok, S., Singla, P., Richardson, M., Domingos, P.: The Alchemy system for statis- tical relational AI. Tech Report -CS Dept., Univ. of Washington (2005)
- Minker, J., Seipel, D.: Disjunctive logic programming: A survey and assessment. In: Computational Logic, London, UK, pp. 472-511. Springer, Heidelberg (2002)
- Singla, P., Domingos, P.: Memory-efficient inference in relational domains. In: Proc. AAAI 2006, AAAI Press, Menlo Park (2006)
- Singla, P., Domingos, P.: Entity resolution with Markov Logic. In: Proc. ICDM, pp. 572-582. IEEE, Los Alamitos (2006)
- Dalal, N., Triggs, B.: Histograms of oriented gradients for human detection. In: Proc. CVPR 2005, vol. 2, pp. 886-893. IEEE, Los Alamitos (2005)
- Liu, H.: The ConceptNet Project, http://web.media.mit.edu/ ∼ hugo/conceptnet/
- Stork, D.: The OpenMind Initiative, http://www.openmind.org/ A Logic Rules List of rules and their corresponding weights used for the parking lot problem (see problem description in Sec. 3).
- If a person opens the trunk of a car, he/she will (likely) enter that car disappear(h) ∧ openT runk(c, h) → enter(c, h), w = 4 5 MAXW
- A person enters only one car: enter(c1, h) ∧ ¬equal(c1, c2) → ¬enter(c2, h), w = MAXW (if h gets into c temporarily and gets out of it, h is not considered to have entered c, just being temporarily occluded)
- A person entering a car c from the left (driver) side will (likely) drive c inLef tZone(c, h) ∧ enter(c, h) → drive(c, h), w = 4 5 MAXW
- A person entering a car c from the right (passenger) side will (less likely) drive c inRightZone(c, h) ∧ enter(c, h) → drive(c, h), w = 1 5 MAXW
- Two persons shaking hand with each other will (likely) not enter the same cars. shakeHand(h1, h2) ∧ enter(c1, h1) → ¬enter(c1, h2), w = 4 5 MAXW
- For a car to drive away, it needs a driver: carLeave(c) → (∃ h enter(c, h) ∧ drive(c, h)), w = MAXW
- A car has only one driver: drive(c, h1) ∧ ¬equal(h1, h2) → ¬drive(c, h2), w = MAXW
- A person can drive only one car: drive(c1, h) ∧ ¬equal(c1, c2) → ¬drive(c2, h), w = MAXW
- A person has to enter a car to drive it: drive(c, h) → enter(c, h), w = MAXW