Skip to main content

Approximate Joint Diagonalization According to the Natural Riemannian Distance

  • Conference paper
  • First Online:
Latent Variable Analysis and Signal Separation (LVA/ICA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10169))

Abstract

In this paper, we propose for the first time an approximate joint diagonalization (AJD) method based on the natural Riemannian distance of Hermitian positive definite matrices. We turn the AJD problem into an optimization problem with a Riemannian criterion and we developp a framework to optimize it. The originality of this criterion arises from the diagonal form it targets. We compare the performance of our Riemannian criterion to the classical ones based on the Frobenius norm and the log-det divergence, on both simulated data and real electroencephalographic (EEG) signals. Simulated data show that the Riemannian criterion is more accurate and allows faster convergence in terms of iterations. It also performs well on real data, suggesting that this new approach may be useful in other practical applications.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Comon, P., Jutten, C.: Handbook of Blind Source Separation: Independent Component Analysis and Applications, 1st edn. Academic Press, New York (2010)

    Google Scholar 

  2. Afsari, B.: Sensitivity analysis for the problem of matrix joint diagonalization. SIAM J. Matrix Anal. Appl. 30(3), 1148–1171 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alyani, K., Congedo, M., Moakher, M.: Diagonality measures of Hermitian positive-definite matrices with application to the approximate joint diagonalization problem. Linear Algebra its Appl. to be published

    Google Scholar 

  4. Tichavskỳ, P., Yeredor, A.: Fast approximate joint diagonalization incorporating weight matrices. IEEE Trans. Signal Process. 57(3), 878–891 (2009)

    Article  MathSciNet  Google Scholar 

  5. Flury, B.N., Gautschi, W.: An algorithm for simultaneous orthogonal transformation of several positive definite symmetric matrices to nearly diagonal form. SIAM J. Sci. Stat. Comput. 7(1), 169–184 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  6. Pham, D.-T.: Joint approximate diagonalization of positive definite Hermitian matrices. SIAM J. Matrix Anal. Appl. 22(4), 1136–1152 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bhatia, R.: Positive Definite Matrices. Princeton University Press, Princeton (2009)

    Book  MATH  Google Scholar 

  8. Moakher, M.: A differential geometric approach to the geometric mean of symmetric positive-definite matrices. SIAM J. Matrix Anal. Appl. 26(3), 735–747 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008)

    Book  MATH  Google Scholar 

  10. Bouchard, F., Korczowski, L., Malick, J., Congedo, M.: Approximate joint diagonalization within the Riemannian geometry framework. In: 24th European Signal Processing Conference (EUSIPCO-2016), pp. 210–214 (2016)

    Google Scholar 

  11. Carlson, B.C., Keller, J.M.: Orthogonalization procedures and the localization of wannier functions. Phys. Rev. 105, 102–103 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  12. Boumal, N., Mishra, B., Absil, P.-A., Sepulchre, R.: Manopt, a Matlab toolbox for optimization on manifolds. J. Mach. Learn. Res. 15, 1455–1459 (2014)

    MATH  Google Scholar 

  13. Congedo, M., Phlypo, R., Barachant, A.: A fixed-point algorithm for estimating power means of positive definite matrices. In: 24th European Signal Processing Conference (EUSIPCO-2016), pp. 2106–2110 (2016)

    Google Scholar 

  14. Moreau, E., Macchi, O.: New self-adaptative algorithms for source separation based on contrast functions. In: IEEE Signal Processing Workshop on Higher-Order Statistics, pp. 215–219. IEEE (1993)

    Google Scholar 

  15. Congedo, M., Gouy-Pailler, C., Jutten, C.: On the blind source separation of human electroencephalogram by approximate joint diagonalization of second order statistics. Clin. Neurophysiol. 119(12), 2677–2686 (2008)

    Article  Google Scholar 

Download references

Acknowledgment

This work has been partially supported by the LabEx PERSYVAL-Lab (ANR-11-LABX-0025-01) funded by the French program “Investissement d’avenir” and the European Research Council, project CHESS 2012-ERC-AdG-320684.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Florent Bouchard .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Bouchard, F., Malick, J., Congedo, M. (2017). Approximate Joint Diagonalization According to the Natural Riemannian Distance. In: Tichavský, P., Babaie-Zadeh, M., Michel, O., Thirion-Moreau, N. (eds) Latent Variable Analysis and Signal Separation. LVA/ICA 2017. Lecture Notes in Computer Science(), vol 10169. Springer, Cham. https://doi.org/10.1007/978-3-319-53547-0_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-53547-0_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-53546-3

  • Online ISBN: 978-3-319-53547-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics