Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/41242
DC FieldValue
dc.titleTowards adversary aware surveillance systems
dc.contributor.authorSingh, V.K.
dc.contributor.authorKankanhalli, M.S.
dc.date.accessioned2013-07-04T08:22:55Z
dc.date.available2013-07-04T08:22:55Z
dc.date.issued2007
dc.identifier.citationSingh, V.K.,Kankanhalli, M.S. (2007). Towards adversary aware surveillance systems. Proceedings of the 2007 IEEE International Conference on Multimedia and Expo, ICME 2007 : 2038-2041. ScholarBank@NUS Repository.
dc.identifier.isbn1424410177
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/41242
dc.description.abstractWe consider surveillance problems to be a set of system- adversary interaction problems in which an adversary can be modeled as a rational (selfish) agent trying to maximize his utility. We feel that appropriate adversary modeling can provide deep insights into the system performance and also clues for optimizing the system's performance against the adversary. Further, we propose that system designers should exploit the fact that they can impose certain restrictions on the intruders and the way they interact with the system. The system designers can find the assumptions under which the surveillance system shall out-perform the intruder and then enforce those assumptions over the system-intruder interaction as part of a 'scenario engineering' approach. We study both these aspects using a game theoretic framework and undertake practical experiments to verify the proposed enhancements. ©2007 IEEE.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleProceedings of the 2007 IEEE International Conference on Multimedia and Expo, ICME 2007
dc.description.page2038-2041
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.