Sensing, Tracking, and Reasoning with Relations Leonidas Guibas, Feng Xie, and Feng Zhao Xerox PARC and Stanford University.

Slides:



Advertisements
Similar presentations
TARGET DETECTION AND TRACKING IN A WIRELESS SENSOR NETWORK Clement Kam, William Hodgkiss, Dept. of Electrical and Computer Engineering, University of California,
Advertisements

AI Pathfinding Representing the Search Space
Net Present Value and Other Investment Criteria
Vision Based Control Motion Matt Baker Kevin VanDyke.
Monte Carlo Localization for Mobile Robots Karan M. Gupta 03/10/2004
1 Distributed localization of networked cameras Stanislav Funiak Carlos Guestrin Carnegie Mellon University Mark Paskin Stanford University Rahul Sukthankar.
Segmentation Divide the image into segments. Each segment:
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
1 Energy-Efficient localization for networks of underwater drifters Diba Mirza Curt Schurgers Department of Electrical and Computer Engineering.
Chapter 1 Software Development. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 1-2 Chapter Objectives Discuss the goals of software development.
Simulation Exploitation Using Open Source Information 1 Problem The US Government would like to share simulation software packages with friendly countries.
Integrating POMDP and RL for a Two Layer Simulated Robot Architecture Presented by Alp Sardağ.
A Probabilistic Approach to Collaborative Multi-robot Localization Dieter Fox, Wolfram Burgard, Hannes Kruppa, Sebastin Thrun Presented by Rajkumar Parthasarathy.
1 Integration of Background Modeling and Object Tracking Yu-Ting Chen, Chu-Song Chen, Yi-Ping Hung IEEE ICME, 2006.
Scalable Information-Driven Sensor Querying and Routing for ad hoc Heterogeneous Sensor Networks Maurice Chu, Horst Haussecker and Feng Zhao Xerox Palo.
Sensing, Tracking, and Reasoning with Relations Leonidas Guibas, Feng Xie, and Feng Zhao Xerox PARC and Stanford University.
Single Point of Contact Manipulation of Unknown Objects Stuart Anderson Advisor: Reid Simmons School of Computer Science Carnegie Mellon University.
Statistics for Managers Using Microsoft Excel, 4e © 2004 Prentice-Hall, Inc. Chap 8-1 Chapter 8 Fundamentals of Hypothesis Testing: One-Sample Tests Statistics.
Quality Function Deployment
1 DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Second Quarterly IPR Meeting January 13, 1999 P. I.s: Leonidas J. Guibas and.
Decentralised Coordination of Mobile Sensors School of Electronics and Computer Science University of Southampton Ruben Stranders,

Fundamentals of Hypothesis Testing: One-Sample Tests
Nursing Science and the Foundation of Knowledge
Presented by: Chaitanya K. Sambhara Paper by: Maarten Ditzel, Caspar Lageweg, Johan Janssen, Arne Theil TNO Defence, Security and Safety, The Hague, The.
Tracking Mobile Sensor Nodes in Wildlife Francine Lalooses Hengky Susanto EE194-Professor Chang.
Week 8 Fundamentals of Hypothesis Testing: One-Sample Tests
Slide Adaptive Sampling and Prediction (ASAP) AOSN-II Undersea Persistent Surveillance (UPS) Autonomous Wide Aperture.
1. Introduction Motion Segmentation The Affine Motion Model Contour Extraction & Shape Estimation Recursive Shape Estimation & Motion Estimation Occlusion.
Lecture 12 Statistical Inference (Estimation) Point and Interval estimation By Aziza Munir.
Distributed solutions for visual sensor networks to detect targets in crowds Cheng Qian.
September 23, 2014Computer Vision Lecture 5: Binary Image Processing 1 Binary Images Binary images are grayscale images with only two possible levels of.
ECE 8443 – Pattern Recognition LECTURE 07: MAXIMUM LIKELIHOOD AND BAYESIAN ESTIMATION Objectives: Class-Conditional Density The Multivariate Case General.
MURI: Integrated Fusion, Performance Prediction, and Sensor Management for Automatic Target Exploitation 1 Dynamic Sensor Resource Management for ATE MURI.
Features-based Object Recognition P. Moreels, P. Perona California Institute of Technology.
DIST: A Distributed Spatio-temporal Index Structure for Sensor Networks Anand Meka and Ambuj Singh UCSB, 2005.
Goal-Driven Autonomy Learning for Long-Duration Missions Héctor Muñoz-Avila.
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
Authors: Rupert Paget, John Homer, and David Crisp
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
SCALABLE INFORMATION-DRIVEN SENSOR QUERYING AND ROUTING FOR AD HOC HETEROGENEOUS SENSOR NETWORKS Paper By: Maurice Chu, Horst Haussecker, Feng Zhao Presented.
High-integrity Sensor Networks Mani Srivastava UCLA.
Hypothesis Testing An understanding of the method of hypothesis testing is essential for understanding how both the natural and social sciences advance.
1-1 Software Development Objectives: Discuss the goals of software development Identify various aspects of software quality Examine two development life.
Robotics Club: 5:30 this evening
SCALABLE INFORMATION-DRIVEN SENSOR QUERYING AND ROUTING FOR AD HOC HETEROGENEOUS SENSOR NETWORKS Paper By: Maurice Chu, Horst Haussecker, Feng Zhao Presented.
Software Project Management
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
A Sparse Undersea Sensor Network Decision Support System Based on Spatial and Temporal Random Field April 10, 2007 Defense and Security Symposium 2007.
Robust Estimation With Sampling and Approximate Pre-Aggregation Author: Christopher Jermaine Presented by: Bill Eberle.
Systems Realization Laboratory The Role and Limitations of Modeling and Simulation in Systems Design Jason Aughenbaugh & Chris Paredis The Systems Realization.
Using Adaptive Tracking To Classify And Monitor Activities In A Site W.E.L. Grimson, C. Stauffer, R. Romano, L. Lee.
Energy-Efficient Signal Processing and Communication Algorithms for Scalable Distributed Fusion.
Smart Sleeping Policies for Wireless Sensor Networks Venu Veeravalli ECE Department & Coordinated Science Lab University of Illinois at Urbana-Champaign.
Submitted by: Sounak Paul Computer Science & Engineering 4 th Year, 7 th semester Roll No:
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Learning for Physically Diverse Robot Teams Robot Teams - Chapter 7 CS8803 Autonomous Multi-Robot Systems 10/3/02.
Intelligent Agents Chapter 2. How do you design an intelligent agent? Definition: An intelligent agent perceives its environment via sensors and acts.
Hypothesis Tests. An Hypothesis is a guess about a situation that can be tested, and the test outcome can be either true or false. –The Null Hypothesis.
Planning Strategies RSS II Lecture 6 September 21, 2005.
Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Statistics for Business and Economics 8 th Edition Chapter 9 Hypothesis Testing: Single.
The KDD Process for Extracting Useful Knowledge from Volumes of Data Fayyad, Piatetsky-Shapiro, and Smyth Ian Kim SWHIG Seminar.
Wireless Sensor Network Architectures
Net 435: Wireless sensor network (WSN)
Intelligent Agents Chapter 2.
Dynamical Models of Decision Making Optimality, human performance, and principles of neural information processing Jay McClelland Department of Psychology.
Overview: Chapter 4 (cont)
Overview: Chapter 2 Localization and Tracking
Presentation transcript:

Sensing, Tracking, and Reasoning with Relations Leonidas Guibas, Feng Xie, and Feng Zhao Xerox PARC and Stanford University

Sensing for Reasoning and Acting Lead to high-level understanding of a situation Support efficient decision- making Allow for efficient updates as the world-state changes A system of collaborating sensors should provide data that can: Clustering of enemy forces Optimal route selection

From Pixels to Predicates Data size: sensor data is usually voluminous, yet it must be transmitted and aggregated over a wide area Robustness: Noise and uncertainty in the data must be handled Sensor control: Sensors must be appropriately tasked to collect and communicate the information relevant to the problem at hand Efficient updates: As objects move and the word-state changes, the high-level reasoning performed by the net must be incrementally updated To be able to provide such high-level functions, a sensor net must address a number of key technical challenges:

Focus on Relations between Objects Data size: relational or aggregated information can be compactly encoded and efficiently transmitted Robustness: aggregated information can be statistically more robust than individual data Sensor control: Reasoning is naturally relation- based; well-established theories exist on how to go from observations to conclusions a c High-level reasoning is often based on relations between objects, or other aggregate information. Focusing on relations has many advantages:

More Relational Advantages Often relations can be sensed directly by the sensors, without first estimating object positions or poses Aggregated information, if carefully selected, can be stored and re-used Relations between objects are more robust and stable than object positions and poses When certain relations become unsupportable, alternate relations may do just as well a b c Efficient updates

Example: “Am_I_Surrounded?” We have a relatively flat terrain with friendly (white) and enemy (black) vehicles, stationary or moving. The field contains PIR and acoustic amplitude sensors. We want to know when a friendly vehicle is surrounded by enemy vehicles. Say “surrounded”  inside the convex hull

“Am_I_Surrounded” via CCW Relations The notion of being surrounded can always be captured by a a number of CCW predicates on the vehicle positions. CCW(a,b,c) asserts that the triangle defined by a, b, and c is counterclockwise oriented. CCW predicates can capture the notion of the convex hull of a set of points, and the notion of inclusion in a convex polygon or triangle.

Direct Sensing of CCW Relations s1, s2, and s3 are PIR sensors They directly sense the relations CCW(f,e1,e2), CCW(f,e2,e3), and CCW(f,e3,e1). From these relations, the containment of f in the triangle defined by e1, e2, and e3 follows.

Target Localization for CCW Relations In general, direct sensing is not possible. However, by sufficiently localizing the targets, CCW relations (or their negations) can be estimated with high confidence. CCW relations can be estimated using the current belief state of the system about the location of each target. Improved estimation requires a non-trivial sensor selection strategy. For CCW(t1,t2,t3), s2 is more valuable than s1.

An Example: CCW Using Distance Sensors We are given three targets t1, t2, and t3. Two acoustic amplitude measurements per target were used to obtain the distributions shown. Our goal is to have (say) 90% confidence that CCW(t1,t2,t3) is true. This is not yet the case in the current belief state – additional sensing is necessary to improve localization. We assume the sensor field is known. Darker color indicates higher likelihood. The x indicates actual target location, the x expected location. The + indicates location of the last sensor used. t1 t2 t3

Computing the CCW confidence Target location belief states are represented as 2-d arrays. A quad-tree-like multi-resolution structure is superimposed, to speed up computation. Undetermined tile triplets are refined until the mass in the “CCW’ or “not CCW” bins exceeds the desired threshold, or until a triplet budget is exceeded. Triplets of quad-tree tiles, one from each target, are classified as CCW, not CCW, or undetermined.

Sensor Selection Strategies Use Mahalanobis distance and cycle among the targets. Use a geometric heuristic – this selects a sensor close to the perpendicular from one target to the line through the other two. Use expected reduction in uncertainty, based on the current belief states and the known sensor locations. To have ground truth, simulate the effect of using each sensor, and choose the one that actually reduces uncertainty the most.

Using the Target Cycling Heuristic Uncertain mass CCW mass 23 45

Using the Geometry Heuristic Reduction in uncertainty is less.

Tracking the “Am_I_Surrounded” Relation As vehicles move, we maintain three CCW relations establishing that the friendly vehicle is indeed in a triangle formed by three enemy vehicles. When the friendly vehicle escapes the triangle, the sensor net searches for a new enemy vehicle that can still establish containment. The triplet basis is maintained under motion.

Conclusion Sensing and tracking with relations provides a new approach to sensor exploitation. The approach allows the sensor net to focus its resources towards the task at hand and take advantage of discrete reasoning. It also raises many new and interesting problems on task decomposition, sensor selection, recovery from failure, etc.