Light-weight Contour Tracking in Wireless Sensor Networks
|
|
- Ronald Lambert
- 5 years ago
- Views:
Transcription
1 Light-weight Contour Tracking in Wireless Sensor Networks Xianjin Zhu Rik Sarkar Jie Gao Joseph S. B. Mitchell INFOCOM 08 1
2 Motivation Sensor network: sense and monitor the physical world (temperature, traffic density, pollution level, etc). 2
3 Motivation Time-varying 2-D signal field Example application scenario Chemical pollution 3
4 Motivation Time-varying 2-D signal field Example application scenario Chemical pollution 4
5 Motivation Time-varying 2-D signal field Example application scenario Chemical pollution 5
6 Motivation Time-varying 2-D signal field Example application scenario Chemical pollution 6
7 Motivation Time-varying 2-D signal field Example application scenario Chemical pollution 7
8 Motivation Time-varying 2-D signal field Example application scenario Chemical pollution 8
9 Motivation Time-varying 2-D signal field Example application scenario Chemical pollution 9
10 Motivation Topological features are important Queries: Is there a safe path from B to A? C to B? Is a location surrounded by chemical contaminations? B A C 10
11 Contour tracking problem Track contours at a threshold of interest - below/above thresh (0/1). Capture their topological features as contours evolve over time
12 Related works Target tracking [Guibas 2002, Zhao et al. 2002, Aslam et al. 2003, Liu et al. 2004, Kim et al. 2005, He et al. 2006, Shrivastava et al ] Track individual targets Few works on tracking a continuously deforming blob or groups of targets Boundary detection [Fekete et al. 2005, Wang et al. 2006, Funke et al. 2006, Kroller et al. 2006] Can be used in static scenario Periodically running boundary detection in dynamic scenario is inefficient. 12
13 Our contributions Light-weight distributed algorithm to track timevarying contours Capture topological features Low communication cost proportional to the change in the input 13
14 Outline: our approach Network setting & concepts Challenges Contour tracking algorithm Theoretical results Simulation results 14
15 Network setting & concepts Binary sensor model: Color BLACK: all neighbors high WHITE: all neighbors low GRAY: neither BLACK nor WHITE (mixed high and low) We want to track the Black boundaries. Robustness: resilient to outliers and ambiguity. Black regions and white regions are separated by gray. Black regions are bounded by contours of threshold. 15
16 Goal of the algorithm K-gray band: a set of gray nodes at most k-hop from BLACK region Contour network: Graph to capture topological features of contours k-gray band Contour network 16
17 Goal of the algorithm Deformation retract: A thinner version in subspace, with same homotopy. There is a continuous deformation taking the space to the retract. Contour network: skeleton of k-gray band k-gray band Contour network 17
18 Challenges Hard to tell if a contour network is valid from local view Same contour topology may have multiple valid deformation retract with totally different local view (i) (ii)? (iii) (iv) 18
19 Challenges Network setting Each sensor node only has local information Limited resources Goal Maintain graphs with identical topological information Naturally require distributed efficient algorithm global property 19
20 Contour tracking algorithm When change occurs: freeze the valid segments in the old contour graph only repair the contour network where it is broken Automaton runs at each sensor RED: a GRAY node on the contour network 20
21 Contour Repair The simplest case: repair of a single contour cycle 21
22 Contour Repair The simplest case: repair of a single contour cycle Open red nodes take responsibility of repair Red nodes at edge of broken contour a Open red node b 22
23 Contour Repair Which direction to send repair messages? sensor nodes have no sense of orientation The k-hop neighbors of the closed red segments block the propagation of repair messages. a Open region b 23
24 Contour Repair Simultaneous repair, merging and splitting May encounter multiple RED nodes, which RED node to connect to? 24
25 Contour Repair Simultaneous repair, merging and splitting May encounter multiple open RED nodes, which RED node to connect to? Connect by a (non self-intersecting) spanning tree, e.g, the shortest path tree. a c b d 25
26 Contour creation Triggered at some BLACK nodes have a GRAY neighbor but cannot see RED nodes in its k-hop neighborhood GRAY neighbors start to create a new contour Select leaders within k-hop neighborhood Form short chain with length > k Start contour repair 26
27 Summary of algorithm Valid segments of contour network are still usable Repair only happens where the contour network is broken Repair connects all red nodes within a open neighborhood through a spanning tree. Augmented algorithm deals with small holes inside the k-gray band 27
28 Theoretical results Theorem: The contour network is a deformation retract of the k-gray band, when the system stabilizes. Sketch of proof: Existing contour network is a deformation retract of the segment of k-gray band it resides in. Repaired new contour network is a deformation retract of open neighborhood. The boundaries align correctly. a a c b b d 28
29 Simulations Setup: 4000 nodes distributed in a 500*500 field Simulate dynamic changes among a sequence of stabilized states of a contour field Changes happen in a random order between two stabilized states 29
30 Simulations Contour merge/split Two black regions move closer. Their gray bands meet each other and (multiple) bridges are built up. Black regions themselves merge together. 30
31 Simulations Nested contours 31
32 Simulations Contours pass through a hole 32
33 Simulations Multi-level contours Apply the single-level contour tracking algorithm at each level independently 33
34 Simulation Communication cost: Proportional to number of changes 34
35 Simulations Video clips 35
36 Conclusions A light-weight distributed algorithm that captures the topological features of time-varying contours. The communication cost is output-sensitive, proportional to the amount of contour changes. The algorithm provides a foundation for further processing of spatial sensor data, e.g., contour compression and aggregation [Gandhi et al. 2007]. 36
37 Future Works Explore the applications of contour tracking Real-time response and emergency rescue Direct vehicles to alleviate traffic jam Combine with our concurrent contour tree work Tracking? Dynamic # levels Tree 37
38 Thank you! Questions & Comments? 38
Iso-contour Queries and Gradient Descent With Guaranteed Delivery in Sensor Networks
Iso-contour Queries and Gradient Descent With Guaranteed Delivery in Sensor Networks Rik Sarkar Xianjin Zhu Jie Gao Dept. of Computer Science, Stony Brook University Leonidas Guibas Dept. of Computer Science
More informationGreedy Routing with Guaranteed Delivery Using Ricci Flow
Greedy Routing with Guaranteed Delivery Using Ricci Flow Jie Gao Stony Brook University Joint work with Rik Sarkar, Xiaotian Yin, Wei Zeng, Feng Luo, Xianfeng David Gu Greedy Routing Assign coordinatesto
More informationTopological Data Processing for Distributed Sensor Networks with Morse-Smale Decomposition
Topological Data Processing for Distributed Sensor Networks with Morse-Smale Decomposition Xianjin Zhu Rik Sarkar Jie Gao Department of Computer Science, Stony Brook University. {xjzhu, rik, jgao}@cs.sunysb.edu
More informationFractional Cascading in Wireless. Jie Gao Computer Science Department Stony Brook University
Fractional Cascading in Wireless Sensor Networks Jie Gao Computer Science Department Stony Brook University 1 Sensor Networks Large number of small devices for environment monitoring 2 My recent work Lightweight,
More informationBoundary Recognition in Sensor Networks. Ng Ying Tat and Ooi Wei Tsang
Boundary Recognition in Sensor Networks Ng Ying Tat and Ooi Wei Tsang School of Computing, National University of Singapore ABSTRACT Boundary recognition for wireless sensor networks has many applications,
More informationoutline Sensor Network Navigation without Locations 11/5/2009 Introduction
Sensor Network Navigation without Locations Mo Li, Yunhao Liu, Jiliang Wang, and Zheng Yang Department of Computer Science and Engineering Hong Kong University of Science and Technology, outline Introduction
More informationDistributed Data Aggregation Scheduling in Wireless Sensor Networks
Distributed Data Aggregation Scheduling in Wireless Sensor Networks Bo Yu, Jianzhong Li, School of Computer Science and Technology, Harbin Institute of Technology, China Email: bo yu@hit.edu.cn, lijzh@hit.edu.cn
More informationENG 7854 / 9804 Industrial Machine Vision. Midterm Exam March 1, 2010.
ENG 7854 / 9804 Industrial Machine Vision Midterm Exam March 1, 2010. Instructions: a) The duration of this exam is 50 minutes (10 minutes per question). b) Answer all five questions in the space provided.
More informationChallenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning
Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning Brad Karp Berkeley, CA bkarp@icsi.berkeley.edu DIMACS Pervasive Networking Workshop 2 May, 2 Motivating Examples Vast
More informationUsing Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks. Wang Wei Vikram Srinivasan Chua Kee-Chaing
Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wang Wei Vikram Srinivasan Chua Kee-Chaing Overview The motivation of mobile relay The performance analysis for mobile relay in the
More informationLecture 6: Vehicular Computing and Networking. Cristian Borcea Department of Computer Science NJIT
Lecture 6: Vehicular Computing and Networking Cristian Borcea Department of Computer Science NJIT GPS & navigation system On-Board Diagnostic (OBD) systems DVD player Satellite communication 2 Internet
More informationLandmark-based routing
Landmark-based routing [Kleinberg04] J. Kleinberg, A. Slivkins, T. Wexler. Triangulation and Embedding using Small Sets of Beacons. Proc. 45th IEEE Symposium on Foundations of Computer Science, 2004. Using
More information[Kleinberg04] J. Kleinberg, A. Slivkins, T. Wexler. Triangulation and Embedding using Small Sets of Beacons. Proc. 45th IEEE Symposium on Foundations
Landmark-based routing Landmark-based routing [Kleinberg04] J. Kleinberg, A. Slivkins, T. Wexler. Triangulation and Embedding using Small Sets of Beacons. Proc. 45th IEEE Symposium on Foundations of Computer
More informationLocalization of Sensor Networks II
Localization of Sensor Networks II Jie Gao Computer Science Department Stony Brook University 2/3/09 Jie Gao CSE595-spring09 1 Rigidity theory Given a set of rigid bars connected by hinges, rigidity theory
More informationOn Boundary Recognition without Location Information in Wireless Sensor Networks
Rheinische Friedrich-Wilhelms-Universität Bonn Institute for Computer cience IV Römerstraße 164 D-53117 Bonn On Boundary Recognition without Location Information in Wireless ensor Networks Olga aukh 1,
More informationAn efficient implementation of the greedy forwarding strategy
An efficient implementation of the greedy forwarding strategy Hannes Stratil Embedded Computing Systems Group E182/2 Technische Universität Wien Treitlstraße 3 A-1040 Vienna Email: hannes@ecs.tuwien.ac.at
More informationMotivation and Basics Flat networks Hierarchy by dominating sets Hierarchy by clustering Adaptive node activity. Topology Control
Topology Control Andreas Wolf (0325330) 17.01.2007 1 Motivation and Basics 2 Flat networks 3 Hierarchy by dominating sets 4 Hierarchy by clustering 5 Adaptive node activity Options for topology control
More informationCOMPUTER AND ROBOT VISION
VOLUME COMPUTER AND ROBOT VISION Robert M. Haralick University of Washington Linda G. Shapiro University of Washington A^ ADDISON-WESLEY PUBLISHING COMPANY Reading, Massachusetts Menlo Park, California
More informationGreedy Routing in Wireless Networks. Jie Gao Stony Brook University
Greedy Routing in Wireless Networks Jie Gao Stony Brook University A generic sensor node CPU. On-board flash memory or external memory Sensors: thermometer, camera, motion, light sensor, etc. Wireless
More informationCS 664 Segmentation. Daniel Huttenlocher
CS 664 Segmentation Daniel Huttenlocher Grouping Perceptual Organization Structural relationships between tokens Parallelism, symmetry, alignment Similarity of token properties Often strong psychophysical
More informationLecture 5: Simplicial Complex
Lecture 5: Simplicial Complex 2-Manifolds, Simplex and Simplicial Complex Scribed by: Lei Wang First part of this lecture finishes 2-Manifolds. Rest part of this lecture talks about simplicial complex.
More informationSensor Tasking and Control
Sensor Tasking and Control Outline Task-Driven Sensing Roles of Sensor Nodes and Utilities Information-Based Sensor Tasking Joint Routing and Information Aggregation Summary Introduction To efficiently
More informationSegmenting A Sensor Field: Algorithms and Applications in Network Design
Segmenting A Sensor Field: Algorithms and Applications in Network Design XIANJIN ZHU, RIK SARKAR and JIE GAO Stony Brook University The diversity of the deployment settings of sensor networks is naturally
More informationHole Detection and Boundary Recognition in Wireless Sensor Networks
Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh Dept. of Computer Science and Information Engineering National Central University Jhongli, 32054, Taiwan E-mail: rocky@axp1.csie.ncu.edu.tw
More informationLecture 5: Data Query in Networks. Rik Sarkar. Rik Sarkar. FU Berlin. Winter '11-'12.
Lecture 5: Data Query in Networks Rik Sarkar Papers Chalermek Intanagonwiwat, Ramesh Govindan and Deborah Estrin, Directed diffusion: A scalable and robust communica4on paradigm for sensor networks, MobiCom
More informationSpatial Distribution in Routing Table Design for Sensor Networks
Spatial Distribution in Routing Table Design for Sensor Networks Rik Sarkar Xianjin Zhu Jie Gao Department of Computer Science, Stony Brook University. {rik, xjzhu, jgao}@cs.sunysb.edu Abstract We propose
More informationAd hoc and Sensor Networks Topology control
Ad hoc and Sensor Networks Topology control Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity This chapter looks at methods to deal with such networks by Reducing/controlling
More informationDecentralized Boundary Detection without Location Information in Wireless Sensor Networks
2012 IEEE Wireless Communications and Networking Conference: Mobile and Wireless Networks Decentralized Boundary Detection without Location Information in Wireless Sensor Networks Wei-Cheng Chu Institute
More informationAdjacency Data Structures
Last Time? Simple Transformations Adjacency Data Structures material from Justin Legakis Classes of Transformations Representation homogeneous coordinates Composition not commutative Orthographic & Perspective
More informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 04 130131 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Histogram Equalization Image Filtering Linear
More informationAlbert M. Vossepoel. Center for Image Processing
Albert M. Vossepoel www.ph.tn.tudelft.nl/~albert scene image formation sensor pre-processing image enhancement image restoration texture filtering segmentation user analysis classification CBP course:
More informationRouting, Routing Algorithms & Protocols
Routing, Routing Algorithms & Protocols Computer Networks Lecture 6 http://goo.gl/pze5o8 Circuit-Switched and Packet-Switched WANs 2 Circuit-Switched Networks Older (evolved from telephone networks), a
More informationExtracting Layers and Recognizing Features for Automatic Map Understanding. Yao-Yi Chiang
Extracting Layers and Recognizing Features for Automatic Map Understanding Yao-Yi Chiang 0 Outline Introduction/ Problem Motivation Map Processing Overview Map Decomposition Feature Recognition Discussion
More informationDigital Image Processing
Digital Image Processing Lecture # 4 Digital Image Fundamentals - II ALI JAVED Lecturer SOFTWARE ENGINEERING DEPARTMENT U.E.T TAXILA Email:: ali.javed@uettaxila.edu.pk Office Room #:: 7 Presentation Outline
More information1588v2 Performance Validation for Mobile Backhaul May Executive Summary. Case Study
Case Study 1588v2 Performance Validation for Mobile Backhaul May 2011 Executive Summary Many mobile operators are actively transforming their backhaul networks to a cost-effective IP-over- Ethernet paradigm.
More informationUsing Game Theory for Image Segmentation
Using Game Theory for Image Segmentation Elizabeth Cassell Sumanth Kolar Alex Yakushev 1 Introduction 21st March 2007 The goal of image segmentation, is to distinguish objects from background. Robust segmentation
More informationGroup Target Tracking in WSN Based on Convex Hulls Merging
Wireless Sensor Network, 29, 1, 446-452 doi:1.4236/wsn.29.1553 Published Online December 29 (http://www.scirp.org/journal/wsn). Group Target Tracking in Based on Convex Hulls Merging Abstract Quanlong
More informationModule 8. Routing. Version 2 ECE, IIT Kharagpur
Module 8 Routing Lesson 27 Routing II Objective To explain the concept of same popular routing protocols. 8.2.1 Routing Information Protocol (RIP) This protocol is used inside our autonomous system and
More informationCoE4TN4 Image Processing
CoE4TN4 Image Processing Chapter 11 Image Representation & Description Image Representation & Description After an image is segmented into regions, the regions are represented and described in a form suitable
More informationCity, University of London Institutional Repository
City Research Online City, University of London Institutional Repository Citation: Andrienko, N., Andrienko, G., Fuchs, G., Rinzivillo, S. & Betz, H-D. (2015). Real Time Detection and Tracking of Spatial
More informationConnected components - 1
Connected Components Basic definitions Connectivity, Adjacency, Connected Components Background/Foreground, Boundaries Run-length encoding Component Labeling Recursive algorithm Two-scan algorithm Chain
More informationDigital Image Processing Fundamentals
Ioannis Pitas Digital Image Processing Fundamentals Chapter 7 Shape Description Answers to the Chapter Questions Thessaloniki 1998 Chapter 7: Shape description 7.1 Introduction 1. Why is invariance to
More informationDesign and Implementation of TARF: A Trust-Aware Routing Framework for WSNs
IEEE 2012 Transactions on Dependable and Secure Computing, Volume: 9, Issue: 2 Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs Abstract The multi-hop routing in wireless sensor
More informationJie Gao Computer Science Department Stony Brook University
Localization of Sensor Networks II Jie Gao Computer Science Department Stony Brook University 1 Rigidity theory Given a set of rigid bars connected by hinges, rigidity theory studies whether you can move
More informationA Cluster-Based Energy Balancing Scheme in Heterogeneous Wireless Sensor Networks
A Cluster-Based Energy Balancing Scheme in Heterogeneous Wireless Sensor Networks Jing Ai, Damla Turgut, and Ladislau Bölöni Networking and Mobile Computing Research Laboratory (NetMoC) Department of Electrical
More information3D Wireless Sensor Networks: Challenges and Solutions
3D Wireless Sensor Networks: Challenges and Solutions Hongyi Wu Old Dominion University Ph.D., CSE, UB, 2002 This work is partially supported by NSF CNS-1018306 and CNS-1320931. 2D PLANE, 3D VOLUME, AND
More informationWireless Sensor Networks 22nd Lecture
Wireless Sensor Networks 22nd Lecture 24.01.2007 Christian Schindelhauer schindel@informatik.uni-freiburg.de 1 Options for topology control Topology control Control node activity deliberately turn on/off
More informationSweeps Over Sensor Networks. Primoz Skraba, An Nguyen, Qing Fang, Leonidas Guibas AHPCRC Stanford University August 3, 2007
Sweeps Over Sensor Networks Primoz Skraba, An Nguyen, Qing Fang, Leonidas Guibas AHPCRC Stanford University August 3, 2007 Data aggregation over entire network - Exact aggregate - Only a few nodes need
More informationScienceDirect. Analogy between immune system and sensor replacement using mobile robots on wireless sensor networks
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 35 (2014 ) 1352 1359 18 th International Conference in Knowledge Based and Intelligent Information & Engineering Systems
More informationFREE REGIONS OF SENSOR NODES. Howard R. Hughes College of Engineering. University of Nevada, Las Vegas, NV ABSTRACT
FREE REGIONS OF SENSOR NODES Laxmi Gewali 1, Navin Rongatana 2, Henry Selvaraj 3, Jan B. Pedersen 4 Howard R. Hughes College of Engineering University of Nevada, Las Vegas, NV 89154-4026 1 laxmi@cs.unlv.edu,
More informationComputer Vision. Image Segmentation. 10. Segmentation. Computer Engineering, Sejong University. Dongil Han
Computer Vision 10. Segmentation Computer Engineering, Sejong University Dongil Han Image Segmentation Image segmentation Subdivides an image into its constituent regions or objects - After an image has
More informationThe Curse of Dimensionality
The Curse of Dimensionality ACAS 2002 p1/66 Curse of Dimensionality The basic idea of the curse of dimensionality is that high dimensional data is difficult to work with for several reasons: Adding more
More informationCut Graph Based Information Storage and Retrieval in 3D Sensor Networks with General Topology
213 Proceedings IEEE INFOCOM Cut Graph Based Information Storage and Retrieval in 3D Sensor Networks with General Topology Yang Yang, Miao Jin, Yao Zhao, and Hongyi Wu Abstract We address the problem of
More informationExploration of Path Space using Sensor Network Geometry
Exploration of Path Space using Sensor Network Geometry Ruirui Jiang, Xiaomeng Ban Computer Science Stony Brook University {jiang,xban}@cs.sunysb.edu Mayank Goswami Applied Math & Statistics Stony Brook
More informationNetworks: A Deterministic Approach with Constant Overhead
Trace-Routing in 3D Wireless Sensor Networks: A Deterministic Approach with Constant Overhead Su Xia, Hongyi Wu, and Miao Jin! School of Computing and Informatics! University of Louisiana at Lafayette
More informationDetection of Attacks on Application and Routing Layer in Tactical MANETs
communication systems group Detection of Attacks on Application and Routing Layer in Tactical MANETs Elmar Gerhards-Padilla, Nils Aschenbruck 1 Structure Mobile Ad-hoc Network (MANET) Tactical MANET Reference
More informationLECT-05, S-1 FP2P, Javed I.
A Course on Foundations of Peer-to-Peer Systems & Applications LECT-, S- FPP, javed@kent.edu Javed I. Khan@8 CS /99 Foundation of Peer-to-Peer Applications & Systems Kent State University Dept. of Computer
More informationEuropean Network on New Sensing Technologies for Air Pollution Control and Environmental Sustainability - EuNetAir COST Action TD1105
European Network on New Sensing Technologies for Air Pollution Control and Environmental Sustainability - EuNetAir COST Action TD1105 A Holistic Approach in the Development and Deployment of WSN-based
More informationWe noticed that the trouble is due to face routing. Can we ignore the real coordinates and use virtual coordinates for routing?
Geographical routing in practice We noticed that the trouble is due to face routing. Is greedy routing robust to localization noise? Can we ignore the real coordinates and use virtual coordinates for routing?
More informationDistributed Algorithms 6.046J, Spring, Nancy Lynch
Distributed Algorithms 6.046J, Spring, 205 Nancy Lynch What are Distributed Algorithms? Algorithms that run on networked processors, or on multiprocessors that share memory. They solve many kinds of problems:
More informationBoundary Recognition in Sensor Networks by Topological Methods
Boundary Recognition in Sensor Networks by Topological Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B. Mitchell Dept. of Applied Math. and Statistics
More informationEnergy Efficient Broadcasting Using Network Coding Aware Protocol in Wireless Ad hoc Network
Energy Efficient Broadcasting Using Network Coding Aware Protocol in Wireless Ad hoc Network 1 Shuai Wang 2 Athanasios Vasilakos 1 Hongbo Jiang 1 Xiaoqiang Ma 1 Wenyu Liu 1 Kai Peng 1 Bo Liu 1 Yan Dong
More informationGeographic Routing in Simulation: GPSR
Geographic Routing in Simulation: GPSR Brad Karp UCL Computer Science CS M038/GZ06 23 rd January 2013 Context: Ad hoc Routing Early 90s: availability of off-the-shelf wireless network cards and laptops
More informationLORP : A Load-balancing Based Optimal Routing Protocol for Sensor Networks with Bottlenecks
LORP : A Load-balancing Based Optimal Routing Protocol for Sensor Networks with Bottlenecks Liie Xu, Guihai Chen, Xinchun Yin, Panlong Yang and Baiian Yang Institute of Information Engineering, Yangzhou
More informationDynamic Design of Cellular Wireless Networks via Self Organizing Mechanism
Dynamic Design of Cellular Wireless Networks via Self Organizing Mechanism V.Narasimha Raghavan, M.Venkatesh, Divya Sridharabalan, T.Sabhanayagam, Nithin Bharath Abstract In our paper, we are utilizing
More informationA Hybrid Approach for Misbehavior Detection in Wireless Ad-Hoc Networks
A Hybrid Approach for Misbehavior Detection in Wireless Ad-Hoc Networks S. Balachandran, D. Dasgupta, L. Wang Intelligent Security Systems Research Lab Department of Computer Science The University of
More informationFine-Grained Boundary Recognition in Wireless Ad Hoc and Sensor Networks By Topological Methods
Fine-Grained Boundary Recognition in Wireless Ad Hoc and Sensor Networks By Topological Methods Dezun Dong Yunhao Liu Xiangke Liao School of Computer, National University of Defense Technology, Changsha,
More informationA Real-Time Directed Routing Protocol Based on Projection of Convex Holes on Underwater Acoustic Networks
I.J. Wireless and Microwave Technologies, 01,, 65-73 Published Online April 01 in MECS (http://www.mecs-press.net) DOI: 10.5815/ijwmt.01.0.10 Available online at http://www.mecs-press.net/ijwmt A Real-Time
More informationDigital Image Processing
Digital Image Processing Third Edition Rafael C. Gonzalez University of Tennessee Richard E. Woods MedData Interactive PEARSON Prentice Hall Pearson Education International Contents Preface xv Acknowledgments
More informationPregel. Ali Shah
Pregel Ali Shah s9alshah@stud.uni-saarland.de 2 Outline Introduction Model of Computation Fundamentals of Pregel Program Implementation Applications Experiments Issues with Pregel 3 Outline Costs of Computation
More informationIan Mitchell. Department of Computer Science The University of British Columbia
CPSC 542D: Level Set Methods Dynamic Implicit Surfaces and the Hamilton-Jacobi Equation or What Water Simulation, Robot Path Planning and Aircraft Collision Avoidance Have in Common Ian Mitchell Department
More informationMorphological Image Processing
Morphological Image Processing Morphology Identification, analysis, and description of the structure of the smallest unit of words Theory and technique for the analysis and processing of geometric structures
More informationADAPTIVE TRAFFIC LIGHT IN IMAGE PROCESSING BASED- INTELLIGENT TRANSPORTATION SYSTEM: A REVIEW
ADAPTIVE TRAFFIC LIGHT IN IMAGE PROCESSING BASED- INTELLIGENT TRANSPORTATION SYSTEM: A REVIEW 1 Mustafa Mohammed Hassan Mustafa* 2 Atika Malik * 3 Amir Mohammed Talib Faculty of Engineering, Future University,
More informationLoad Balanced Short Path Routing in Wireless Networks Jie Gao, Stanford University Li Zhang, Hewlett-Packard Labs
Load Balanced Short Path Routing in Wireless Networks Jie Gao, Stanford University Li Zhang, Hewlett-Packard Labs Aravind Ranganathan University of Cincinnati February 22, 2007 Motivation Routing in wireless
More informationLocating and Bypassing Holes in Sensor Networks
Mobile Networks and Applications 11, 187 200, 2006 C 2006 Springer Science + Business Media, LLC. Manufactured in The Netherlands. DOI: 10.1007/s11036-006-4471-y Locating and Bypassing Holes in Sensor
More informationFERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions
FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee, and Young-Bae Ko College of Information and Communication, Ajou University,
More informationLocating and Bypassing Holes in Sensor Networks
Locating and Bypassing Holes in Sensor Networks Qing Fang Jie Gao Leonidas J. Guibas April 8, 2005 Abstract In real sensor network deployments, spatial distributions of sensors are usually far from being
More informationMorphological Image Processing
Morphological Image Processing Binary image processing In binary images, we conventionally take background as black (0) and foreground objects as white (1 or 255) Morphology Figure 4.1 objects on a conveyor
More informationGenetic-Algorithm-Based Construction of Load-Balanced CDSs in Wireless Sensor Networks
Genetic-Algorithm-Based Construction of Load-Balanced CDSs in Wireless Sensor Networks Jing He, Shouling Ji, Mingyuan Yan, Yi Pan, and Yingshu Li Department of Computer Science Georgia State University,
More informationIn this lecture. Background. Background. Background. PAM3012 Digital Image Processing for Radiographers
PAM3012 Digital Image Processing for Radiographers Image Enhancement in the Spatial Domain (Part I) In this lecture Image Enhancement Introduction to spatial domain Information Greyscale transformations
More informationCS 532: 3D Computer Vision 14 th Set of Notes
1 CS 532: 3D Computer Vision 14 th Set of Notes Instructor: Philippos Mordohai Webpage: www.cs.stevens.edu/~mordohai E-mail: Philippos.Mordohai@stevens.edu Office: Lieb 215 Lecture Outline Triangulating
More informationCapturing an Evader in a Polygonal Environment with Obstacles
Capturing an Evader in a Polygonal Environment with Obstacles Deepak Bhadauria and Volkan Isler Department of Computer Science and Engineering University of Minnesota {bhadau,isler}@cs.umn.edu Abstract
More informationA Cross-Layer Perspective of Routing. Taming the Underlying Challenges of Reliable Routing in Sensor Networks. Underlying Connectivity in Reality
Taming the Underlying Challenges of Reliable Routing in Sensor Networks Alec Woo, Terence Tong, and David Culler UC Berkeley and Intel Research Berkeley A Cross-Layer Perspective of Routing How to get
More informationA Low-Overhead Hybrid Routing Algorithm for ZigBee Networks. Zhi Ren, Lihua Tian, Jianling Cao, Jibi Li, Zilong Zhang
A Low-Overhead Hybrid Routing Algorithm for ZigBee Networks Zhi Ren, Lihua Tian, Jianling Cao, Jibi Li, Zilong Zhang Chongqing Key Lab of Mobile Communications Technology, Chongqing University of Posts
More informationScalar Algorithms: Contouring
Scalar Algorithms: Contouring Computer Animation and Visualisation Lecture tkomura@inf.ed.ac.uk Institute for Perception, Action & Behaviour School of Informatics Contouring Scaler Data Last Lecture...
More informationProcessing of binary images
Binary Image Processing Tuesday, 14/02/2017 ntonis rgyros e-mail: argyros@csd.uoc.gr 1 Today From gray level to binary images Processing of binary images Mathematical morphology 2 Computer Vision, Spring
More informationBackbone Discovery In Thick Wireless Linear Sensor Netorks
Backbone Discovery In Thick Wireless Linear Sensor Netorks October 28, 2014 Imad Jawhar1, Xin Li2, Jie Wu3, and Nader Mohamed1 1 College of Information Technology, United Arab Emirates University, Al Ain,
More informationThomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6
More informationFrom Shared Memory to Message Passing
Message Passing From Shared Memory to Message Passing but pass messages along networks: classic social networks Stefan Schmid T-Labs & TU Berlin Some parts of the lecture (e.g., Skript and exercises) are
More informationCITS 4402 Computer Vision
CITS 4402 Computer Vision A/Prof Ajmal Mian Adj/A/Prof Mehdi Ravanbakhsh, CEO at Mapizy (www.mapizy.com) and InFarm (www.infarm.io) Lecture 02 Binary Image Analysis Objectives Revision of image formation
More informationIso-surface cell search. Iso-surface Cells. Efficient Searching. Efficient search methods. Efficient iso-surface cell search. Problem statement:
Iso-Contouring Advanced Issues Iso-surface cell search 1. Efficiently determining which cells to examine. 2. Using iso-contouring as a slicing mechanism 3. Iso-contouring in higher dimensions 4. Texturing
More informationA Review: Optimization of Energy in Wireless Sensor Networks
A Review: Optimization of Energy in Wireless Sensor Networks Anjali 1, Navpreet Kaur 2 1 Department of Electronics & Communication, M.Tech Scholar, Lovely Professional University, Punjab, India 2Department
More informationQoS-Enabled Video Streaming in Wireless Sensor Networks
QoS-Enabled Video Streaming in Wireless Sensor Networks S. Guo and T.D.C. Little Department of Electrical and Computer Engineering Boston University, Boston, MA 02215 {guosong, tdcl}@bu.edu MCL Technical
More informationChapter 10 Image Segmentation. Yinghua He
Chapter 10 Image Segmentation Yinghua He The whole is equal to the sum of its parts. -Euclid The whole is greater than the sum of its parts. -Max Wertheimer The Whole is Not Equal to the Sum of Its Parts:
More informationInsecure Provable Secure Network Coding
Insecure Provable Secure Network Coding Yongge Wang UNC Charlotte, USA yonwang@uncc.edu October 18, 2009 Abstract Network coding allows the routers to mix the received information before forwarding them
More informationGeographic Routing Without Location Information. AP, Sylvia, Ion, Scott and Christos
Geographic Routing Without Location Information AP, Sylvia, Ion, Scott and Christos Routing in Wireless Networks Distance vector DSDV On-demand DSR, TORA, AODV Discovers and caches routes on demand Geographic
More informationSmall-scale objects extraction in digital images
102 Int'l Conf. IP, Comp. Vision, and Pattern Recognition IPCV'15 Small-scale objects extraction in digital images V. Volkov 1,2 S. Bobylev 1 1 Radioengineering Dept., The Bonch-Bruevich State Telecommunications
More informationImage Segmentation. Ross Whitaker SCI Institute, School of Computing University of Utah
Image Segmentation Ross Whitaker SCI Institute, School of Computing University of Utah What is Segmentation? Partitioning images/volumes into meaningful pieces Partitioning problem Labels Isolating a specific
More informationImage Acquisition + Histograms
Image Processing - Lesson 1 Image Acquisition + Histograms Image Characteristics Image Acquisition Image Digitization Sampling Quantization Histograms Histogram Equalization What is an Image? An image
More informationConnectivity-based Localization of Large Scale Sensor Networks with Complex Shape
Connectivity-based Localization of Large Scale Sensor Networks with Complex Shape Sol Lederer and Yue Wang and Jie Gao We study the problem of localizing a large sensor network having a complex shape,
More information