An efficient algorithm for dempster's completion of block-circulant covariance matrices

The present paper deals with maximum entropy completion of partially specified banded block-circulant matrices. This problem has many applications in signal processing since circulants happen to be covariance matrices of stationary periodic processes and maximum entropy completion (i.e. the completion which has maximal determinant) is in fact maximum likelihood estimation subject to conditional independence constraints. Moreover, the maximal determinant completion has the meaning of covariance matrix of stationary reciprocal processes ([18], [20], [21]), a class of stochastic processes which extends Markov processes and is particularly useful for modeling signals indexed by space instead of time (think for example of an image). The maximum entropy completion problem for circulant matrices has been solved in [5] and some generalizations are brougth forth in [6]. The main contribution of this paper is an efficient algorithm for its solution.

[1]  Charles R. Johnson,et al.  Positive definite completions of partial Hermitian matrices , 1984 .

[2]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[3]  Michael I. Jordan.  Graphical Models , 2003 .

[4]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[5]  T. Speed,et al.  Gaussian Markov Distributions over Finite Graphs , 1986 .

[6]  S. R. Simanca,et al.  On Circulant Matrices , 2012 .

[7]  L. Satyanarayan,et al.  Cellular polypropylene polymer foam as air-coupled ultrasonic transducer materials , 2010, IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control.

[8]  M. A. Kaashoek,et al.  Classes of Linear Operators Vol. I , 1990 .

[9]  A. Krener,et al.  Modeling and estimation of discrete-time Gaussian reciprocal processes , 1990 .

[10]  Kazuo Murota,et al.  Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework , 2000, SIAM J. Optim..

[11]  Dante C. Youla,et al.  Bauer-type factorization of positive matrices and the theory of matrix polynomials orthogonal on the unit circle , 1978 .

[12]  Nanny Wermuth,et al.  Algorithm AS 105: Fitting a Covariance Selection Model to a Matrix , 1977 .

[13]  Charles R. Johnson,et al.  Determinantal formulae for matrix completions associated with chordal graphs , 1989 .

[14]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[15]  Francesca P. Carli,et al.  A Maximum Entropy Solution of the Covariance Extension Problem for Reciprocal Processes , 2011, IEEE Transactions on Automatic Control.

[16]  P. Whittle.  On the fitting of multivariate autoregressions, and the approximate canonical factorization of a spectral density matrix , 1963 .

[17]  BronCoen,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[18]  Y. Kamp,et al.  Orthogonal polynomial matrices on the unit circle , 1978 .

[19]  Vwani P. Roychowdhury,et al.  Covariance selection for nonchordal graphs via chordal embedding , 2008, Optim. Methods Softw..

[20]  H. Dym,et al.  Extensions of band matrices with band inverses , 1981 .

[21]  I. Csiszár.  $I$-Divergence Geometry of Probability Distributions and Minimization Problems , 1975 .

[22]  B. Jamison,et al.  Reciprocal Processes: The Stationary Gaussian Case , 1970 .

[23]  P. Whittle.  On the fitting of multivariate autoregressions, and approximate factorization of a spectral density matrix , 1963 .

[24]  Francesca P. Carli,et al.  On the Covariance Completion Problem Under a Circulant Structure , 2011, IEEE Transactions on Automatic Control.

[25]  Francesca P. Carli,et al.  An Efficient Algorithm for Maximum-Entropy Extension of Block-Circulant Covariance Matrices , 2011, ArXiv.