Robust blind separation of smooth graph signals using minimization of graph regularized mutual information-Reference-Cited by-同舟云学术

Robust blind separation of smooth graph signals using minimization of graph regularized mutual information

Published:2022-12 Issue: Volume:132 Page:103792
ISSN:1051-2004
Container-title:Digital Signal Processing
language:en
Short-container-title:Digital Signal Processing

Author:

Einizade Aref^ORCID,Hajipour Sardouie Sepideh

Funder

Shahroud University of Medical Sciences

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,Signal Processing,Artificial Intelligence,Applied Mathematics,Computer Vision and Pattern Recognition,Statistics, Probability and Uncertainty,Computational Theory and Mathematics

Reference45 articles.

1. Handbook of Blind Source Separation: Independent Component Analysis and Applications;Comon,2010

2. Independent component analysis: algorithms and applications;Hyvärinen;Neural Netw.,2000

3. Independent component analysis for biomedical signals;James;Physiol. Meas.,2004

4. Fast and robust fixed-point algorithms for independent component analysis;Hyvarinen;IEEE Trans. Neural Netw.,1999

5. A fast fixed-point algorithm for independent component analysis;Hyvärinen;Neural Comput.,1997

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Estimation of a causal directed acyclic graph process using non-gaussianity;Digital Signal Processing;2024-03

2. A New Approach for Graph Signal Separation Based on Smoothness;IEEE Transactions on Signal Processing;2024

3. Graph Signal Separation Based on Smoothness or Sparsity in the Frequency Domain;IEEE Transactions on Signal and Information Processing over Networks;2023

4. Joint Graph Learning and Blind Separation of Smooth Graph Signals Using Minimization of Mutual Information and Laplacian Quadratic Forms;IEEE Transactions on Signal and Information Processing over Networks;2023