Jensen divergence based SPD matrix means and applications

Finding mean of matrices becomes increasingly important in modern signal processing problems that involve matrix-valued images. In this paper, we define the mean for a set of symmetric positive definite (SPD) matrices based on information-theoretic divergences as the unique minimizer of the averaged divergences, and compare it with the means computed using the Rieman-nian and Log-Euclidean metrics. For the class of divergences induced by the convexity gap of a matrix functional, we present a fast iterative concave-convex optimization scheme with guaranteed convergence to efficiently approximate those divergence-based means.

[1]  Nicholas Ayache,et al.  Geometric Means in a Novel Vector Space Structure on Symmetric Positive-Definite Matrices , 2007, SIAM J. Matrix Anal. Appl..

[2]  Frank Nielsen,et al.  The Burbea-Rao and Bhattacharyya Centroids , 2010, IEEE Transactions on Information Theory.

[3]  C. R. Rao,et al.  On the convexity of some divergence measures based on entropy functions , 1982, IEEE Trans. Inf. Theory.

[4]  Ulrich Eckhardt,et al.  Shape descriptors for non-rigid shapes with a single closed contour , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[5]  Fatih Murat Porikli,et al.  Human Detection via Classification on Riemannian Manifolds , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[6]  Alan L. Yuille,et al.  The Concave-Convex Procedure , 2003, Neural Computation.

[7]  Bruno Iannazzo,et al.  A note on computing matrix geometric means , 2011, Adv. Comput. Math..

[8]  Johan Wiklund,et al.  Multidimensional Orientation Estimation with Applications to Texture Analysis and Optical Flow , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Maher Moakher,et al.  A Differential Geometric Approach to the Geometric Mean of Symmetric Positive-Definite Matrices , 2005, SIAM J. Matrix Anal. Appl..

[10]  S. Cowin,et al.  Averaging Anisotropic Elastic Constant Data , 1997 .

[11]  R. Bhatia,et al.  Riemannian geometry and matrix geometric means , 2006 .

[12]  Frank Nielsen,et al.  Shape Retrieval Using Hierarchical Total Bregman Soft Clustering , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Zhizhou Wang,et al.  DTI segmentation using an information theoretic tensor dissimilarity measure , 2005, IEEE Transactions on Medical Imaging.

[14]  Simone G. O. Fiori,et al.  Learning the Fréchet Mean over the Manifold of Symmetric Positive-Definite Matrices , 2009, Cognitive Computation.

[15]  Federico Poloni,et al.  An effective matrix geometric mean satisfying the Ando-Li-Mathias properties , 2010, Math. Comput..

[16]  Frank Nielsen,et al.  Total Bregman divergence and its applications to shape retrieval , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[17]  Ying-Hua Wang,et al.  PolSAR Image Segmentation by Mean Shift Clustering in the Tensor Space , 2010 .

[18]  Frank Nielsen,et al.  This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. 1 Total Bregman Divergence and its Applications to DTI Analysis , 2022 .