2018 IEEE Statistical Signal Processing Workshop (SSP) 2018
DOI: 10.1109/ssp.2018.8450858
|View full text |Cite
|
Sign up to set email alerts
|

Independent Component Analysis Using Semi-Parametric Density Estimation Via Entropy Maximization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
2
2
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…However, the probability density distribution of the actual signal does not necessarily satisfy this assumption. Only when the probability density of the signal is close to the estimated probability density can the algorithm achieve better separation performance [ 38 ]. Considering that the signal characteristics of the source signal in the simulated signal are known, the proposed algorithm adopts the following flow to process the simulated signal.…”
Section: Simulation Analysis Of Algorithm Performancementioning
confidence: 99%
See 2 more Smart Citations
“…However, the probability density distribution of the actual signal does not necessarily satisfy this assumption. Only when the probability density of the signal is close to the estimated probability density can the algorithm achieve better separation performance [ 38 ]. Considering that the signal characteristics of the source signal in the simulated signal are known, the proposed algorithm adopts the following flow to process the simulated signal.…”
Section: Simulation Analysis Of Algorithm Performancementioning
confidence: 99%
“…Next, we discuss the influence of the probability distribution type of the estimated source signal on the performance of the algorithm from two aspects: The algorithm employs different PDFs corresponding to those in Table 2 for the simulated signals of the sub-Gaussian distribution, aiming to verify the performance of the proposed algorithm under the model mismatch condition. The algorithm for selecting the sub-Gaussian distribution is compared with ICA-EBM [ 9 ] and ICA-EMK [ 38 ] to verify the effectiveness of the proposed algorithm. …”
Section: Simulation Analysis Of Algorithm Performancementioning
confidence: 99%
See 1 more Smart Citation
“…From (13), we can achieve perfect source recovery as long as the assumed model PDF matches the true latent multivariate density of the nth SCV, i.e., f (p(yn),p(yn)) = 0. Motivated by the flexibility and superior performance of ICA-EMK [27] in the univariate case, we use M-EMK to derive a novel IVA algorithm, IVA-M-EMK, which takes advantage of the accurate estimation capability of M-EMK to greatly improve separation performance. To achieve this, we use a decoupling procedure [27][28][29], to minimize (2) with respect to each row vector w…”
Section: Iva-m-emkmentioning
confidence: 99%