scispace - formally typeset
A

Alan S. Willsky

Researcher at Massachusetts Institute of Technology

Publications -  644
Citations -  44804

Alan S. Willsky is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Graphical model & Smoothing. The author has an hindex of 94, co-authored 643 publications receiving 43086 citations. Previous affiliations of Alan S. Willsky include Charles Stark Draper Laboratory & Schlumberger.

Papers
More filters
Journal ArticleDOI

Paper: A survey of design methods for failure detection in dynamic systems

TL;DR: This paper surveys a number of methods for the detection of abrupt changes in stochastic dynamical systems, focusing on the class of linear systems, but the basic concepts carry over to other classes of systems.
Journal ArticleDOI

A sparse signal reconstruction perspective for source localization with sensor arrays

TL;DR: This work presents a source localization method based on a sparse representation of sensor measurements with an overcomplete basis composed of samples from the array manifold that has a number of advantages over other source localization techniques, including increased resolution, improved robustness to noise, limitations in data quantity, and correlation of the sources.
Journal ArticleDOI

Analytical redundancy and the design of robust failure detection systems

TL;DR: In this article, a robust failure detection and identification (FDI) process is viewed as consisting of two stages: residual generation and decision making, and it is argued that a robust FDI system can be achieved by designing a robust residual generation process.

A survey of design methods for failure detection in dynamic systems

TL;DR: A number of methods for detecting abrupt changes (such as failures) in stochastic dynamical systems are surveyed in this paper, where tradeoffs in complexity versus performance are discussed, ranging from the design of specific failure-sensitive filters, to the use of statistical tests on filter innovations, and the development of jump process formulations.
Journal ArticleDOI

The Convex Geometry of Linear Inverse Problems

TL;DR: This paper provides a general framework to convert notions of simplicity into convex penalty functions, resulting in convex optimization solutions to linear, underdetermined inverse problems.