Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Reputation-based framework for high integrity sensor networks
A Bayesian formulation, specifically a beta reputation system, is employed for the algorithm steps of reputation representation, updates, integration and trust evolution in sensor networks to allow the sensor nodes to develop a community of trust.
Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video
- Jun He, L. Balzano, Arthur D. Szlam
- Computer ScienceIEEE Conference on Computer Vision and Pattern…
- 16 June 2012
This work presents GRASTA, Grassmannian Robust Adaptive Subspace Tracking Algorithm, an online algorithm for robust subspace estimation from randomly subsampled data, and considers the specific application of background and foreground separation in video.
Online identification and tracking of subspaces from highly incomplete information
- L. Balzano, R. Nowak, B. Recht
- Computer Science48th Annual Allerton Conference on Communication…
- 21 June 2010
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations that performs exceptionally well in practice both in tracking subspace and as an online algorithms for matrix completion.
Sensor network data fault types
This tutorial draws from current literature, the own experience, and data collected from scientific deployments to develop a set of commonly used features useful in detecting and diagnosing sensor faults.
Blind Calibration of Sensor Networks
It is shown that as long as the sensors slightly oversample the signals of interest, then unknown sensor gains can be perfectly recovered and neither a controlled stimulus nor a dense deployment is required.
Design, analysis, and implementation of DVSR: a fair high-performance protocol for packet rings
- V. Gambiroza, P. Yuan, L. Balzano, Yonghe Liu, Steve Sheafor, E. Knightly
- Computer ScienceIEEE/ACM Transactions on Networking
- 1 February 2004
This paper introduces a new dynamic bandwidth allocation algorithm called Distributed Virtual-time Scheduling in Rings (DVSR), and develops an idealized fairness reference model and bound the deviation in service between DVSR and the reference model, thereby bounding the unfairness.
Online Robust Subspace Tracking from Partial Information
This paper presents GRASTA (Grassmannian Robust Adaptive Subspace Tracking Algorithm), an ecient and robust online algorithm for tracking subspaces from highly incomplete information. The algorithm…
Rapid Deployment with Confidence: Calibration and Fault Detection in Environmental Sensor Networks
A procedure for calibration and a system for online fault remediation for ion selective electrodes used for water quality assists interpretation of the data are described.
Algebraic Variety Models for High-Rank Matrix Completion
This work considers a generalization of low-rank matrix completion to the case where the data belongs to an algebraic variety, i.e. each data point is a solution to a system of polynomial equations, and proposes an efficient matrix completion algorithm that minimizes a convex or non-convex surrogate of the rank of the matrix of monomial features.
High-dimensional Matched Subspace Detection when data are missing
- L. Balzano, B. Recht, R. Nowak
- Computer ScienceIEEE International Symposium on Information…
- 3 February 2010
High-dimensional testing problems in which it may be prohibitive or impossible to obtain a complete observation motivate this work, and it is shown that reliable detection is possible, under mild incoherence conditions, as long as m is slightly greater than the dimension of the subspace in question.