Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

A sparse signal reconstruction perspective for source localization with sensor arrays

- D. Malioutov, M. Çetin, A. Willsky
- Computer Science, Mathematics
- IEEE Transactions on Signal Processing
- 1 August 2005

We present a source localization method based on a sparse representation of sensor measurements with an overcomplete basis composed of samples from the array manifold. We enforce sparsity by imposing… Expand

The Convex Geometry of Linear Inverse Problems

- V. Chandrasekaran, B. Recht, P. Parrilo, A. Willsky
- Mathematics, Computer Science
- Found. Comput. Math.
- 3 December 2010

In applications throughout science and engineering one is often faced with the challenge of solving an ill-posed inverse problem, where the number of available measurements is smaller than the… Expand

Rank-Sparsity Incoherence for Matrix Decomposition

- V. Chandrasekaran, S. Sanghavi, P. Parrilo, A. Willsky
- Computer Science, Mathematics
- SIAM J. Optim.
- 11 June 2009

Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-rank components. Suc...

A shape-based approach to the segmentation of medical imagery using level sets

- Andy Tsai, A. Yezzi, +5 authors A. Willsky
- Computer Science, Medicine
- IEEE Transactions on Medical Imaging
- 22 April 2003

We propose a shape-based approach to curve evolution for the segmentation of medical images containing known object types. In particular, motivated by the work of Leventon, Grimson, and Faugeras… Expand

MAP estimation via agreement on trees: message-passing and linear programming

- M. Wainwright, T. Jaakkola, A. Willsky
- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 1 November 2005

We develop and analyze methods for computing provably optimal maximum a posteriori probability (MAP) configurations for a subclass of Markov random fields defined on graphs with cycles. By… Expand

A new class of upper bounds on the log partition function

- M. Wainwright, T. Jaakkola, A. Willsky
- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 1 August 2002

We introduce a new class of upper bounds on the log partition function of a Markov random field (MRF). This quantity plays an important role in various contexts, including approximating marginal… Expand

A survey of design methods for failure detection in dynamic systems

- A. Willsky
- Computer Science, Mathematics
- Autom.
- 1 November 1976

In this paper we survey a number of methods for the detection of abrupt changes (such as failures) in stochastic dynamical systems. We concentrate on the class of linear systems, but the basic… Expand

A Sticky HDP-HMM With Application to Speaker Diarization

- E. Fox, Erik B. Sudderth, Michael I. Jordan, A. Willsky
- Mathematics, Engineering
- 15 May 2009

We consider the problem of speaker diarization, the problem of segmenting an audio recording of a meeting into temporal segments corresponding to individual speakers. The problem is rendered… Expand

Analytical redundancy and the design of robust failure detection systems

- E. Chow, A. Willsky
- Mathematics
- 1 July 1984

The failure detection and identification (FDI) process is viewed as consisting of two stages: residual generation and decision making. It is argued that a robust FDI system can be achieved by… Expand

Nonparametric belief propagation for self-localization of sensor networks

- A. Ihler, J. Fisher, R. Moses, A. Willsky
- Computer Science
- IEEE Journal on Selected Areas in Communications
- 4 April 2005

Automatic self-localization is a critical need for the effective use of ad hoc sensor networks in military or civilian applications. In general, self-localization involves the combination of absolute… Expand