• Title/Summary/Keyword: incomplete Cholesky decomposition

Search Result 2, Processing Time 0.014 seconds

Incomplete Cholesky Decomposition based Kernel Cross Modal Factor Analysis for Audiovisual Continuous Dimensional Emotion Recognition

  • Li, Xia;Lu, Guanming;Yan, Jingjie;Li, Haibo;Zhang, Zhengyan;Sun, Ning;Xie, Shipeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.810-831
    • /
    • 2019
  • Recently, continuous dimensional emotion recognition from audiovisual clues has attracted increasing attention in both theory and in practice. The large amount of data involved in the recognition processing decreases the efficiency of most bimodal information fusion algorithms. A novel algorithm, namely the incomplete Cholesky decomposition based kernel cross factor analysis (ICDKCFA), is presented and employed for continuous dimensional audiovisual emotion recognition, in this paper. After the ICDKCFA feature transformation, two basic fusion strategies, namely feature-level fusion and decision-level fusion, are explored to combine the transformed visual and audio features for emotion recognition. Finally, extensive experiments are conducted to evaluate the ICDKCFA approach on the AVEC 2016 Multimodal Affect Recognition Sub-Challenge dataset. The experimental results show that the ICDKCFA method has a higher speed than the original kernel cross factor analysis with the comparable performance. Moreover, the ICDKCFA method achieves a better performance than other common information fusion methods, such as the Canonical correlation analysis, kernel canonical correlation analysis and cross-modal factor analysis based fusion methods.

Comparison of Preconditioned Conjugate Gradient Methods for Adaptive Finite Element Analysis (유한요소 적응분할해석을 위한 선조정 공액구배법들의 비교연구)

  • 주관정
    • Computational Structural Engineering
    • /
    • v.1 no.2
    • /
    • pp.121-130
    • /
    • 1988
  • Adaptive reinements yield a large sparse system of equations. In order to solve such a system, the core storage requirement is an important consideration. Accordingly, an iterative method which minimizes the core storage and provides a high rate of convergence is called for. In this paper the conjugate gradient algorithms with various preconditionings including the incomplete Cholesky decomposition are examined.

  • PDF