skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Oblivious Sensor Fusion via Secure Multi-Party Combinatorial Filter Evaluation
Given sensor units distributed throughout an environment, we consider the problem of consolidating readings into a single coherent view when sensors wish to limit knowledge of their specific readings. Standard fusion methods make no guarantees about what curious participants may learn. For applications where privacy guarantees are required, we introduce a fusion approach that limits what can be inferred. First, it forms an aggregate stream, oblivious to the underlying sensor data, and then evaluates that stream on a combinatorial filter. This is achieved via secure multi-party computation techniques built on cryptographic primitives, which we extend and apply to the problem of fusing discrete sensor signals. We prove that the extensions preserve security under the model of semi-honest adversaries. Also, for a simple target tracking case study, we examine a proof-of-concept implementation: analyzing the (empirical) running times for components in the architecture and suggesting directions for future improvement.  more » « less
Award ID(s):
2034123 2024733 2034097
PAR ID:
10344689
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
2021 60th IEEE Conference on Decision and Control (CDC)
Page Range / eLocation ID:
5620 to 5627
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, Springer)
    Avidan, S. (Ed.)
    In this paper, we tackle the problem of RGB-D Semantic Segmentation. The key challenges in solving this problem lie in 1) how to extract features from depth sensor data and 2) how to effectively fuse the features extracted from the two modalities. For the first challenge, we found that the depth information obtained from the sensor is not always reliable (e.g. objects with reflective or dark surfaces typically have inaccurate or void sensor readings), and existing methods that extract depth features using ConvNets did not explicitly consider the reliability of depth value at different pixel locations. To tackle this challenge, we propose a novel mechanism, namely Uncertainty-Aware Self-Attention that explicitly controls the information flow from unreliable depth pixels to confident depth pixels during feature extraction. For the second challenge, we propose an effective and scalable fusion module based on Cross-Attention that can adaptively fuse and exchange information between the RGB encoder and depth encoder. Our proposed framework, namely UCTNet, is an encoder-decoder network that naturally incorporates these two key designs for robust and accurate RGB-D Segmentation. Experimental results show that UCTNet outperforms existing works and achieves state-of-the-art performances on two RGB-D Semantic Segmentation benchmarks. 
    more » « less
  2. (, American Control Conference)
    We consider a dynamic sensor fusion problem where a large number of remote sensors observe a common Gauss-Markov process and the observations are transmitted to a fusion center over a resource constrained communication network. The design objective is to allocate an appropriate data rate to each sensor in such a way that the total data traffic to the fusion center is minimized, subject to a constraint on the fusion center's state estimation error covariance. We show that the problem can be formulated as a difference-of-convex program, to which we apply the convex-concave procedure (CCP) and the alternating direction method of multiplier (ADMM). Through a numerical study on a truss bridge sensing system, we observe that our algorithm tends to allocate zero data rate to unneeded sensors, implying that the proposed method is an effective heuristic for sensor selection. 
    more » « less
  3. ; ; ; (, International journal of robust and nonlinear control)
    This article presents a new method to solve a dynamic sensor fusion problem. We consider a large number of remote sensors which measure a common Gauss–Markov process. Each sensor encodes and transmits its measurement to a data fusion center through a resource restricted communication network. The communication cost incurred by a given sensor is quantified as the expected bitrate from the sensor to the fusion center. We propose an approach that attempts to minimize a weighted sum of these communication costs subject to a constraint on the state estimation error at the fusion center. We formulate the problem as a difference-of-convex program and apply the convex-concave procedure (CCP) to obtain a heuristic solution. We consider a 1D heat transfer model and a model for 2D target tracking by a drone swarm for numerical studies. Through these simulations, we observe that our proposed approach has a tendency to assign zero data rate to unnecessary sensors indicating that our approach is sparsity-promoting, and an effective sensor selection heuristic. 
    more » « less
  4. ; ; ; ; (, Proceedings of the 6th International Conference on Sensor Networks (SENSORNETS 2017), Porto, Portugal, February 19-21, 2017)
    We address the problem of in-network processing of k-Maximizing Range Sum (k-MaxRS) queries inWireless Sensor Networks (WSN). The traditional, Computational Geometry version of the MaxRS problem considers the setting in which, given a set of (possibly weighted) 2D points, the goal is to determine the optimal location for a given (axes-parallel) rectangle R to be placed so that the sum of the weights (or, a simple count) of the input points in R’s interior is maximized. In WSN, this corresponds to finding the location of region R such that the sum of the sensors’ readings inside R is maximized. The k-MaxRS problem deals with maximizing the overall sum over k such rectangular regions. Since centralized processing – i.e., transmitting the raw readings and subsequently determining the k-MaxRS in a dedicated sink – incur communication overheads, we devised an efficient distributed algorithm for in-network computation of k-MaxRS. Our experimental observations show that the novel algorithm provides significant energy/communication savings when compared to the centralized approach. 
    more » « less
  5. ; (, IEEE Transactions on Emerging Topics in Computing)
    Activity recognizers are challenging to design for continuous, in-home settings. However, they are notoriously difficult to create when there is more than one resident in the home. Despite recent efforts, there remains a need for an algorithm that can estimate the number of residents in the house, split a time series stream into separate substreams, and accurately identify each resident's activities. To address this challenge, we introduce Gamut . This novel unsupervised method jointly estimates the number of residents and associates sensor readings with those residents, based on a multi-target Gaussian mixture probability hypothesis density filter. We hypothesize that the proposed method will offer robust recognition for homes with two or more residents. In experiments with labeled data collected from 50 single-resident and 11 multi-resident homes, we observe that Gamut outperforms previous unsupervised and supervised methods, offering a robust strategy to track behavioral routines in complex settings. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email