Giter Site home page Giter Site logo

buddhikaum / greedy-sensor-selection-for-a-probabilistic-graph-signal Goto Github PK

View Code? Open in Web Editor NEW
7.0 2.0 0.0 9 KB

Code for my publication "Efficient Sensor Selection with Application to Time Varying Graphs", in the 7th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)

Python 96.80% Shell 3.20%
greedy-algorithms signal-processing sensor-selection laplacian graph

greedy-sensor-selection-for-a-probabilistic-graph-signal's Introduction

Greedy-Sensor-Selection-for-a-Probabilistic-Graph-Signal

Implementation of the algorithms in "Efficient Sensor Selection with Application to Time Varying Graphs", in the 7th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP) (IEEE CAMSAP 2017)

First algorithm imporoves the time complexity of the existing greedy sensor selection algorithm in [1].

Next two algorithms for efficient selection of sensors for estimating a probabilistic graph signal. First algorithm (SelectOriginalOnly in SelectTimeVarying.py) provides an efficent algorithm for computing trace of the posterior covariance matrix in ordere to select sensors using a greedy approach such that the mean squared error will be minimized. The second algorithm (main method in SelectTimeVarying.py) provides an algorithm to update the sensors when there is a change in a single edge in the original graph. Based on provious computations this algorithm selects sensors efficiently compared to selecting sensors from scratch.

Laplacian.py generates the unnormalized laplacian from a random graph on which the covariance of the graph signal depeneds on.

The proposed algorithm has a time complexity of O(n^3) compared to previously published greedy algorithm by Liu et. al. [1].

Usage :

For algorithm 1 run the script file

bash algo1_script.sh

For algorithms 2 and 3 in the paper

python Laplacian.py [random seed] [number of vertices] [b]

#b is 1,-1 indicating whether we are removing an edge or adding an edge.

To compute sensors python SelectTimeVarying.py [random seed] [number of vertices] [fraction observed] [b]

#fraction observed is a value less than 1.

Eg.

python Laplacian.py 1 400 1

python SelectTimeVarying.py 1 400 .5 1

[1] S. Liu, S. P. Chepuri, M. Fardad, E. Maşazade, G. Leus and P. K. Varshney, "Sensor Selection for Estimation with Correlated Measurement Noise," in IEEE Transactions on Signal Processing, vol. 64, no. 13, pp. 3509-3522, July1, 1 2016.

greedy-sensor-selection-for-a-probabilistic-graph-signal's People

Contributors

buddhikaum avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.