A Method for Modeling of Pedestrian Flow in the Obstacle Space using Laser Range Scanners Yoshitaka NAKAMURA †, Yusuke WADA ‡, Teruo HIGASHINO ‡ & Osamu.

Slides:



Advertisements
Similar presentations
My first aperosentation 9/6/2008 Marios Karagiannis.
Advertisements

Generation of Virtual Image from Multiple View Point Image Database Haruki Kawanaka, Nobuaki Sado and Yuji Iwahori Nagoya Institute of Technology, Japan.
Vision Based Control Motion Matt Baker Kevin VanDyke.
Presented for: CPS Lab-ASU By: Ramtin Kermani
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Adviser : Ming-Yuan Shieh Student ID : M Student : Chung-Chieh Lien VIDEO OBJECT SEGMENTATION AND ITS SALIENT MOTION DETECTION USING ADAPTIVE BACKGROUND.
Chapter 5 Raster –based algorithms in CAC. 5.1 area filling algorithm 5.2 distance transformation graph and skeleton graph generation algorithm 5.3 convolution.
1 Prediction-based Strategies for Energy Saving in Object Tracking Sensor Networks Yingqi Xu, Wang-Chien Lee Proceedings of the 2004 IEEE International.
1 Prediction-based Strategies for Energy Saving in Object Tracking Sensor Networks Tzu-Hsuan Shan 2006/11/06 J. Winter, Y. Xu, and W.-C. Lee, “Prediction.
Distributed Algorithms for Guiding Navigation across a Sensor Network Qun Li, Michael DeRosa, and Daniela Rus Dartmouth College MOBICOM 2003.
University1 GVGrid: A QoS Routing Protocol for Vehicular Ad Hoc Networks Weihua Sun, Hirozumi Yamaguchi, Koji Yukimasa, Shinji.
Impact of Different Mobility Models on Connectivity Probability of a Wireless Ad Hoc Network Tatiana K. Madsen, Frank H.P. Fitzek, Ramjee Prasad [tatiana.
GEOG 111/211A Transportation Planning Trip Distribution Additional suggested reading: Chapter 5 of Ortuzar & Willumsen, third edition November 2004.
Bayesian Filtering for Location Estimation D. Fox, J. Hightower, L. Liao, D. Schulz, and G. Borriello Presented by: Honggang Zhang.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
BluEyes Bluetooth Localization and Tracking Ei Darli Aung Jonathan Yang Dae-Ki Cho Mario Gerla Ei Darli Aung Jonathan Yang Dae-Ki Cho Mario Gerla.
An Experimental Procedure for Mid Block-Based Traffic Assignment on Sub-area with Detailed Road Network Tao Ye M.A.Sc Candidate University of Toronto MCRI.
1 Activity and Motion Detection in Videos Longin Jan Latecki and Roland Miezianko, Temple University Dragoljub Pokrajac, Delaware State University Dover,
Thematic Maps Choropleth, Proportional/Graduated Symbol, Digital Image, Isoline/Isopleth and Dot Distribution Maps.
Optimal Arrangement of Ceiling Cameras for Home Service Robots Using Genetic Algorithms Stefanos Nikolaidis*, ** and Tamio Arai** *R&D Division, Square.
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.
Context Awareness System and Service SCENE JS Lee 1 Energy-Efficient Rate-Adaptive GPS-based Positioning for Smartphones.
PERSONALLY CUSTOMIZABLE GROUP NAVIGATION SYSTEM USING CELLULAR PHONES AND WIRELESS AD-HOC COMMUNICATION Yoshitaka Nakamura, Guiquan Ren, Masatoshi Nakamura,
Presented by: Z.G. Huang May 04, 2011 Did You See Bob? Human Localization using Mobile Phones Romit Roy Choudhury Duke University Durham, NC, USA Ionut.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
LAMI 1. User Oriented Trajectory Similarity Search 2. Calibration-free Localization using Relative Distance Estimations 3. From GPS Traces to a Routable.
Toward Real-Time Extraction of Pedestrian Contexts with Stereo Camera Kei Suzuki, Kazunori Takashio, Hideyuki Tokuda, Masaki Wada, Yusuke Matsuki, Kazunori.
1. Introduction Motion Segmentation The Affine Motion Model Contour Extraction & Shape Estimation Recursive Shape Estimation & Motion Estimation Occlusion.
Navi Rutgers University 2012 Design Presentation
Library & Bookstore Navigation using RFID grid ACE B4 dra 親 richie 卒論最終発表.
Simultaneous Localization and Mapping Presented by Lihan He Apr. 21, 2006.
GPS Calibrated Ad-hoc Localization for Geosocial Networking Dexter H. Hu Cho-Li Wang Yinfeng Wang
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.
© Jalal Kawash 2010 Introduction Peeking into Computer Science 1.
1 Constant Density Spanners for Wireless Ad-Hoc Networks Discrete Mathematics and Algorithms Seminar Melih Onus April
RPS Land Use and Transportation Modeling Results Presentation to RPS TAC & MPO TAC Brian Gregor Transportation Planning Analysis Unit May 17, 2006.
A Hybrid Method for achieving High Accuracy and Efficiency in Object Tracking using Passive RFID Lei Yang 1, Jiannong Cao 1, Weiping Zhu 1, and Shaojie.
1 A Bidding Protocol for Deploying Mobile Sensors GuilingWang, Guohong Cao, and Tom LaPorta Department of Computer Science & Engineering The Pennsylvania.
CLIPS: Infrastructure-free Collaborative Indoor Positioning for Time-critical Team Operations Youngtae Noh (Cisco Systems) Hirozumi Yamaguchi (Osaka University,
Hybrid Simulation with Qualitative and Quantitative Integrated Model under Uncertainty Business Environment Masanori Akiyoshi (Osaka University) Masaki.
Quality Software Project Management Software Size and Reuse Estimating.
Shape-based Similarity Query for Trajectory of Mobile Object NTT Communication Science Laboratories, NTT Corporation, JAPAN. Yutaka Yanagisawa Jun-ichi.
Register Placement for High- Performance Circuits M. Chiang, T. Okamoto and T. Yoshimura Waseda University, Japan DATE 2009.
Vehicle Segmentation and Tracking From a Low-Angle Off-Axis Camera Neeraj K. Kanhere Committee members Dr. Stanley Birchfield Dr. Robert Schalkoff Dr.
College of Engineering Anchor Nodes Placement for Effective Passive Localization Karthikeyan Pasupathy Major Advisor: Dr. Robert Akl Department of Computer.
August 30, 2004STDBM 2004 at Toronto Extracting Mobility Statistics from Indexed Spatio-Temporal Datasets Yoshiharu Ishikawa Yuichi Tsukamoto Hiroyuki.
Lec 27: Ch3.(T&LD): Traffic Analysis – Directional distribution of site traffic Notice the difference in the trip distribution process between urban transportation.
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
An Efficient Localization Algorithm Focusing on Stop-and-Go Behavior of Mobile Nodes IEEE PerCom 2011 Takamasa Higuchi, Sae Fujii, Hirozumi Yamaguchi and.
Chapter 14 : Modeling Mobility Andreas Berl. 2 Motivation  Wireless network simulations often involve movements of entities  Examples  Users are roaming.
Computer Science 1 Using Clustering Information for Sensor Network Localization Haowen Chan, Mark Luk, and Adrian Perrig Carnegie Mellon University
STATISTICAL DATA GATHERING: Sampling a Population.
Turning a Mobile Device into a Mouse in the Air
A configuration method for structured P2P overlay network considering delay variations Tomoya KITANI (Shizuoka Univ. 、 Japan) Yoshitaka NAKAMURA (NAIST,
Generated Trips and their Implications for Transport Modelling using EMME/2 Marwan AL-Azzawi Senior Transport Planner PDC Consultants, UK Also at Napier.
Problem Description: One line explanation of the problem to be solved Problem Description: One line explanation of the problem to be solved Proposed Solution:
Mapping of Traffic Conditions at Downtown Thessaloniki with the Help of GPS Technology P. D. Savvaidis and K. Lakakis Aristotle University of Thessaloniki,
Mobile Node for Wireless Sensor Network to Detect Landmines Presented by : Jameela Hassan.
ParkNet: Drive-by Sensing of Road-Side Parking Statistics Irfan Ullah Department of Information and Communication Engineering Myongji university, Yongin,
Privacy Vulnerability of Published Anonymous Mobility Traces Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip (Purdue University) Nageswara S. V. Rao (Oak.
HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu
Contents Team introduction Project Introduction Applicability
Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors
Presented by Prashant Duhoon
2018/11/12 Certification of Secure Encounter History Among Low Power Mobile Sensors Takurou Sakai†, Akira Uchiyama†, Yoshitaka Nakamura‡ and Teruo Higashino†
Vehicle Segmentation and Tracking in the Presence of Occlusions
Distance Sensor Models
Effective Replica Allocation
Trip Distribution Lecture 8 Norman W. Garrick and Hamed Ahangari
Edinburgh Napier University
Presentation transcript:

A Method for Modeling of Pedestrian Flow in the Obstacle Space using Laser Range Scanners Yoshitaka NAKAMURA †, Yusuke WADA ‡, Teruo HIGASHINO ‡ & Osamu TAKAHASHI † † Future University Hakodate, JAPAN ‡ Osaka University, JAPAN

Background Development of sensing technologies – Various phenomena become able to be measured as digital data – Some services based on this measuring data can be provided Pedestrian flow attracts attention – Movement of the pedestrians For orientation of the services based on mobility pattern of pedestrians For urban planning For control of pedestrian for refuge instructions 2011/9/192IWIN2011

Purpose of Research To generate pedestrian flow model with high accuracy and law cost – Cost of measuring sensor Price of sensor is as low as possible Number of sensor is as little as possible – Cost of data processing Information to use is as little as possible 2011/9/193IWIN2011

Related Work Pedestrian flow detection – Cameras By recognizing the images of pedestrians Disadvantage: Privacy, Setting cost, Angle of view – RFID tag By tracking with RFID of each pedestrian Disadvantage: Cost of RFIDs – Counting number of pedestrians By counting the passage number of pedestrians in each gateway Disadvantage: Affected by occlusions 2011/9/194IWIN2011

Laser Range Scanners(LRS) Measures the distance to an object from LRS Advantage – Fast scanning of wide area – Little probability to infringe pedestrian’s privacy – Small cost of calculation – (Simple tracking by the difference of data is possible) Disadvantage – Easy to lose target objects by obstacles – Difficult to measure all pedestrians completely 2011/9/19IWIN20115

Measuring Data of LRS Measurement time Position coordinate of pedestrian ID of pedestrian assigned by simple tracking of UTM-30LX Simple tracking of UTM-30LX Judge the same pedstrian from the difference of measured data and assign ID to the pedestrian If tracking is succeed, pedestrian’s movement history can be found by ID ID becomes extinct in the place where tracking of the pedestrian failed Even if the same pedestrian is found again, the other ID is assigned 2011/9/19IWIN20116

Precedent Experiment(1/2) Conducted in “Whity Umeda” – By synchronizing 4 LRSs(HOKUYO UTM-30LX) – Measure the height of pedestrians’ waist[17] 2011/9/19IWIN20117 [17] Kawata, Ohya, Yuta, Santosh and Mori, “Development of ultra small lightweight optical range sensor system,” in Proc. of IROS2005

Precedent Experiment(2/2) Beige area is the movable area of pedestrians Orange columns are LRSs Pink lines are the measuring laser of LRSs 2011/9/19IWIN m 33m

Performance of Tracking Simple tracking of UTM-30LX could continue only for a short time – 30%~40% of IDs’ life times are only 1 second Pedestrians are hidden behind obstacles such as pillars Pedestrians are also hidden behind other pedestrians Some pedestrians are staying near LRS and become large obstacles 2011/9/19IWIN20119 =>The other approaches are needed for pedestrian flow generation

Approach Pedestrian flow is often used in – Trajectory analysis of customers in commercial facilities – Pedestrian flow analysis for refuge instruction, etc. In such case, tendencies of the pedestrians’ movement are more important than actual behaviors of pedestrians – Accurate tracking is impossible 2011/9/19IWIN Pay attention to the change of population density in the partial domain of the measurement area

Proposed Method Generate the pedestrian flow model from the population density – Divide measurement area into some square domains(cells) – Calculate population density of each domain – Generate flow model based on the change and distribution of population density 2011/9/19IWIN201111

Assumptions 1.Pedestrians move to the only adjacent cell (in all directions) from the cell where himself/herself is now 2.Pedestrians move from the entrance to the exit without making a detour under Assumption 1 3.Pedestrian is measured only once in each cell where he/she passes 2011/9/19IWIN201112

Overview of Method 1.Dived the measurement area into some unit cells 2.Select the gateway cells 3.Suppose the route candidate between each 2 gateways 4.Calculate the population density of each cell 5.Calculate the number of sojourners 6.Estimate the route where the pedestrian passed and its traffic 7.Determinate the direction of the flow 2011/9/19IWIN201113

Supposition of the Route Candidate Suppose the route candidate according to Assumptions 1 & 2 between each two different gateway cells. 2011/9/19IWIN201114

Calculation of the Population Density Count it up how many pedestrians existed in each cell for constant period of time => Population Density Exclude pedestrians moving at a speed less than minimum speed as sojourners – Minimum speed = 20cm/s 2011/9/19IWIN Sojourners 3

Estimation of the Route One route corresponds to one pedestrian Decide a route candidate passing a cell with high density as a route Update the density data to the data removed a decided route Repeat the process until the population of all cells become almost /9/19IWIN201116

Determination of Direction Detect the speed and direction of pedestrians’ movement from tracking data of UTM-30LXs Count the direction ratio of pedestrians’ movement in each cell on route candidates Determine the direction ratio of route based on direction ratio of pedestrian’s movement 2011/9/19IWIN201117

Example of Generated Flow(1/2) Direction of arrow: Direction of the pedestrian flow Thickness of arrow: Quantity of the pedestrian flow Numbers in Circles: Average number of sojourners of same cell for each 1 minute 2011/9/19IWIN sojourners sojourner sojourners Moring

Example of Generated Flow(2/2) Direction of arrow: Direction of the pedestrian flow Thickness of arrow: Quantity of the pedestrian flow Numbers in Circles: Average number of sojourners of same cell for each 1 minute 2011/9/19IWIN Evening 2 sojourners 2 3 6

Performance Evaluation Evaluate the generated model using scenario data formed by MobiREAL based on the number of pedestrians in the gateway cells – Compare the pedestrian flow model generated by proposed method with the pedestrian’s movement of scenario data 2011/9/19IWIN201120

Scenario Data Set the origin and destination point of each node Generate a realistic movement model using MobiREAL 2011/9/19IWIN201121

Agreement Rate Compare the flow model generated from the scenario data by proposed method with the scenario data 2011/9/19IWIN Agreement rate: Ratio of the cell which the route of generation model passed is the same as scenario data Average agreement rate of route in the whole scenario is about 80.79% Agreement rate: 67% Scenario dataFlow model

Discussion Accuracy of the measuring population density – This method takes the average value of several minutes the tendency of the pedestrian flow does not change in a short time the disappearance of the pedestrian by the obstacle is keeping for an instant – Actually, the disappearing pedestrians exist for a long time depending on the placement of the obstacles(pedestrians) It is necessary to consider about method to estimate density by disappearance probability or different method to calculate the density by flow quantity 2011/9/19IWIN201123

Conclusion Proposed a method for modeling pedestrian flow in the space such as underground shopping center – Using Laser Range Scanners – Using the change of population density Future work – Different calculation method of density corresponding to the real environment – Comparison with the data which completely measured the movement trace of each pedestrian 2011/9/1924IWIN2011