Decentralized and coordinate-free computation of critical points and surface networks in a discretized scalar field

This article provides a decentralized and coordinate-free algorithm, called decentralized gradient field (DGraF), to identify critical points (peaks, pits, and passes) and the topological structure of the surface network connecting those critical points. Algorithms that can operate in the network without centralized control and without coordinates are important in emerging resource-constrained spatial computing environments, in particular geosensor networks. Our approach accounts for the discrepancies between finite granularity sensor data and the underlying continuous field, ignored by previous work. Empirical evaluation shows that our DGraF algorithm can improve the accuracy of critical points identification when compared with the current state-of-the-art decentralized algorithm and matches the accuracy of a centralized algorithm for peaks and pits. The DGraF algorithm is efficient, requiring O(n) overall communication complexity, where n is the number of nodes in the geosensor network. Further, empirical investigations of our algorithm across a range of simulations demonstrate improved load balance of DGraF when compared with an existing decentralized algorithm. Our investigation highlights a number of important issues for future research on the detection of holes and the monitoring of dynamic events in a field.

[1]  R. Ayala,et al.  The number of critical elements of discrete Morse functions on non-compact surfaces , 2010 .

[2]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[3]  Jie Gao,et al.  Topological Data Processing for Distributed Sensor Networks with Morse-Smale Decomposition , 2009, IEEE INFOCOM 2009.

[4]  B. Schneider,et al.  Construction of Metric Surface Networks from Raster‐Based DEMs , 2006 .

[5]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[6]  Gaurav S. Sukhatme,et al.  Connecting the Physical World with Pervasive Networks , 2002, IEEE Pervasive Comput..

[7]  R.N. Murty,et al.  CitySense: An Urban-Scale Wireless Sensor Network and Testbed , 2008, 2008 IEEE Conference on Technologies for Homeland Security.

[8]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[9]  Günter Rote,et al.  Simple and optimal output-sensitive construction of contour trees using monotone paths , 2005, Comput. Geom..

[10]  Jack Snoeyink,et al.  Computing contour trees in all dimensions , 2000, SODA '00.

[11]  Tom Fawcett,et al.  An introduction to ROC analysis , 2006, Pattern Recognit. Lett..

[12]  S. Smale.  Morse inequalities for a dynamical system , 1960 .

[13]  Emanuele Danovaro,et al.  A Multi-resolution Representation for Terrain Morphology , 2006, GIScience.

[14]  M. Spagnuolo,et al.  Surface Shape Understanding Based on Extended Reeb Graphs , 2006 .

[15]  U. Netlogo Wilensky,et al.  Center for Connected Learning and Computer-Based Modeling , 1999 .

[16]  Chandrajit L. Bajaj,et al.  Topology preserving data simplification with error bounds , 1998, Comput. Graph..

[17]  Wolfgang Böhm,et al.  A survey of curve and surface methods in CAGD , 1984, Comput. Aided Geom. Des..

[18]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[19]  Mark Goadrich,et al.  The relationship between Precision-Recall and ROC curves , 2006, ICML.

[20]  Naomi Ehrich Leonard,et al.  Collective Motion, Sensor Networks, and Ocean Sampling , 2007, Proceedings of the IEEE.

[21]  S. Rana,et al.  Topological data structures for surfaces: an introduction to geographical information science. , 2006 .

[22]  R. Shibasaki,et al.  An Implementation of Mobile Sensing for Large-Scale Urban Monitoring , 2008 .

[23]  Thomas Lewiner,et al.  Applications of Forman's discrete Morse theory to topology visualization and mesh compression , 2004, IEEE Transactions on Visualization and Computer Graphics.

[24]  Thomas Lewiner,et al.  Critical sets in discrete Morse theories: Relating Forman and piecewise-linear approaches , 2013, Comput. Aided Geom. Des..

[25]  Fredric C. Gey,et al.  The Relationship between Recall and Precision , 1994, J. Am. Soc. Inf. Sci..

[26]  R. Forman.  Morse Theory for Cell Complexes , 1998 .

[27]  L. Guibas,et al.  Sweeps over wireless sensor networks , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[28]  J. Maxwell,et al.  On Hills and Dales , 2011 .

[29]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[30]  Éric Gaussier,et al.  A Probabilistic Interpretation of Precision, Recall and F-Score, with Implication for Evaluation , 2005, ECIR.

[31]  Leonidas J. Guibas,et al.  Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[32]  Matt Duckham,et al.  Decentralized Spatial Computing: Foundations of Geosensor Networks , 2012 .

[33]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[34]  R. Forman.  A USER'S GUIDE TO DISCRETE MORSE THEORY , 2002 .

[35]  Yi-Jen Chiang,et al.  Simple and Optimal Output-Sensitive Computation of Contour Trees , 2000 .

[36]  Tosiyasu L. Kunii,et al.  Surface coding based on Morse theory , 1991, IEEE Computer Graphics and Applications.

[37]  Valerio Pascucci,et al.  Time-varying reeb graphs for continuous space-time data , 2004, SCG '04.

[38]  Valerio Pascucci,et al.  Contour trees and small seed sets for isosurface traversal , 1997, SCG '97.

[39]  Silvia Nittel,et al.  A Survey of Geosensor Networks: Advances in Dynamic Environmental Monitoring , 2009, Sensors.

[40]  Andrea Vitaletti,et al.  First experiences using wireless sensor networks for noise pollution monitoring , 2008, REALWSN '08.

[41]  Daniela Giorgi,et al.  Describing shapes by geometrical-topological properties of real functions , 2008, CSUR.

[42]  T. Banchoff.  Critical Points and Curvature for Embedded Polyhedral Surfaces , 1970 .

[43]  M. Greiner,et al.  Principles and practical application of the receiver-operating characteristic analysis for diagnostic tests. , 2000, Preventive veterinary medicine.

[44]  J. Maxwell.  L. On hills and dales: To the editors of the Philosophical Magazine and Journal , 1870 .

[45]  Hans-Christian Hege,et al.  TADD: A Computational Framework for Data Analysis Using Discrete Morse Theory , 2010, ICMS.

[46]  松本 幸夫.  An introduction to Morse theory , 2002 .

[47]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[48]  Andrew P. Bradley,et al.  The use of the area under the ROC curve in the evaluation of machine learning algorithms , 1997, Pattern Recognit..

[49]  Murat Demirbas,et al.  The impact of data aggregation on the performance of wireless sensor networks , 2008, Wirel. Commun. Mob. Comput..

[50]  Tosiyasu L. Kunii,et al.  Algorithms for Extracting Correct Critical Points and Constructing Topological Graphs from Discrete Geographical Elevation Data , 1995, Comput. Graph. Forum.

[51]  Jesse Freeman,et al.  in Morse theory, , 1999 .

[52]  Nicola Santoro,et al.  Design and analysis of distributed algorithms , 2006, Wiley series on parallel and distributed computing.

[53]  Herbert Edelsbrunner,et al.  Hierarchical Morse—Smale Complexes for Piecewise Linear 2-Manifolds , 2003, Discret. Comput. Geom..