{"title":"通过在线扫视序列规划获取高分辨率图像","authors":"Andrew D. Bagdanov, A. del Bimbo, F. Pernici","doi":"10.1145/1099396.1099419","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of scheduling an active observer to visit as many targets in an area of surveillance as possible. We show how it is possible to plan a sequence of decisions regarding what target to look at through such a foveal-sensing action. We propose a framework in which a pan/tilt/zoom camera executes saccades in order to visit, and acquire high resolution images (at least one) of, as many moving targets as possible before they leave the scene. An intelligent choice of the order of sensing the targets can significantly reduce the total dead-time wasted by the active camera and, consequently, its cycle time. We cast the whole problem into a dynamic discrete optimization framework. In particular, we will show that the problem can be solved by modeling the attentional gaze control as a kinetic traveling salesperson problem whose solution is approximated by iteratively solving time dependent orienteering problems.Congestion analysis experiments are reported demonstrating the effectiveness of the solution in acquiring high resolution images of a large number of moving targets in a wide area. The evaluation was conducted with a simulation of a dual camera system in a master-slave configuration. We also report on preliminary experiments conducted using live cameras in a real surveillance environment.","PeriodicalId":196499,"journal":{"name":"Proceedings of the third ACM international workshop on Video surveillance & sensor networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Acquisition of high-resolution images through on-line saccade sequence planning\",\"authors\":\"Andrew D. Bagdanov, A. del Bimbo, F. Pernici\",\"doi\":\"10.1145/1099396.1099419\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of scheduling an active observer to visit as many targets in an area of surveillance as possible. We show how it is possible to plan a sequence of decisions regarding what target to look at through such a foveal-sensing action. We propose a framework in which a pan/tilt/zoom camera executes saccades in order to visit, and acquire high resolution images (at least one) of, as many moving targets as possible before they leave the scene. An intelligent choice of the order of sensing the targets can significantly reduce the total dead-time wasted by the active camera and, consequently, its cycle time. We cast the whole problem into a dynamic discrete optimization framework. In particular, we will show that the problem can be solved by modeling the attentional gaze control as a kinetic traveling salesperson problem whose solution is approximated by iteratively solving time dependent orienteering problems.Congestion analysis experiments are reported demonstrating the effectiveness of the solution in acquiring high resolution images of a large number of moving targets in a wide area. The evaluation was conducted with a simulation of a dual camera system in a master-slave configuration. We also report on preliminary experiments conducted using live cameras in a real surveillance environment.\",\"PeriodicalId\":196499,\"journal\":{\"name\":\"Proceedings of the third ACM international workshop on Video surveillance & sensor networks\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the third ACM international workshop on Video surveillance & sensor networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1099396.1099419\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the third ACM international workshop on Video surveillance & sensor networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1099396.1099419","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Acquisition of high-resolution images through on-line saccade sequence planning
This paper considers the problem of scheduling an active observer to visit as many targets in an area of surveillance as possible. We show how it is possible to plan a sequence of decisions regarding what target to look at through such a foveal-sensing action. We propose a framework in which a pan/tilt/zoom camera executes saccades in order to visit, and acquire high resolution images (at least one) of, as many moving targets as possible before they leave the scene. An intelligent choice of the order of sensing the targets can significantly reduce the total dead-time wasted by the active camera and, consequently, its cycle time. We cast the whole problem into a dynamic discrete optimization framework. In particular, we will show that the problem can be solved by modeling the attentional gaze control as a kinetic traveling salesperson problem whose solution is approximated by iteratively solving time dependent orienteering problems.Congestion analysis experiments are reported demonstrating the effectiveness of the solution in acquiring high resolution images of a large number of moving targets in a wide area. The evaluation was conducted with a simulation of a dual camera system in a master-slave configuration. We also report on preliminary experiments conducted using live cameras in a real surveillance environment.