トップページ |
ログイン
公表論文>
論文>
Bypass Method Based on Neighbor Node Determination Algorithm for Automatic Human Tracking System
|
英語タイトル
|
Bypass Method Based on Neighbor Node Determination Algorithm for Automatic Human Tracking System
|
|
著者
|
- Hiroto Kakiuchi（柿内 博人）
- Shinya Iwasaki（岩崎 慎弥）
- Takao Kawamura（川村 尚生）
- Kazunori Sugahara（菅原 一孔）
|
|
論文誌
|
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
|
|
巻
|
|
|
号
|
|
|
ページ
|
pp. 361-369
|
|
出版年
|
2009年9月
|
|
概要
|
This paper proposes two bypass methods to track a suspicious person by mobile agent technologies. The proposed methods are ”Recalculation Bypass Method” and ”Additional Calculation Bypass Method”. The proposed methods utilizes the algorithm which was elaborated in the paper, ”An Algorithm to Determine Neighbor Nodes”. The algorithm is efficient in determining the next destination node of the mobile agents. The mobile agents is operating on automatic human tracking system which is enhanced by video
surveillance system with mobile agent technologies. In the automatic human tracking system, the video camera and the server computer is treated as a single node. The video camera captures a suspicious person and pass the information to the server computer which it extracts the feature of the person. If a server computer is broken, then a mobile agent will loose track of the suspicious person. In the automatic human tracking system it is very important for the mobile agent not to lose track. On such case the bypass methods resolve two types of problem to ensure the tracking ability of the mobile agent. First problem is a logical problem which occurs inside the system an example would be a ”broken server” Second problem is a physical problem which occurs outside the system an example would be a ”pathway being modified”. By utilizing the methods, the system can continuously track the suspicious person even
on the uncertain cases.
|
|
ファイル
|
BibTeX
PDF
|