The nonlinear PCA criterion in blind source separation: Relations with other approaches
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The paper shows that nonlinear PCA is a versatile starting point for deriving different kinds of algorithms for blind signal processing problems, leading to computationally efficient and fast converging algorithms.
Abstract
We present new results on the nonlinear principal component analysis (PCA) criterion in blind source separation (BSS). We derive the criterion in a form that allows easy comparisons with other BSS and independent component analysis (ICA) contrast functions like cumulants, Bussgang criteria, and information theoretic contrasts. This clarifies how the nonlinearity should be chosen optimally. We also discuss the connections of the nonlinear PCA learning rule with the Bell-Sejnowski algorithm and the adaptive EASI algorithm. Furthermore, we show that a nonlinear PCA criterion can be minimized using least-squares approaches, leading to computationally efficient and fast converging algorithms. The paper shows that nonlinear PCA is a versatile starting point for deriving different kinds of algorithms for blind signal processing problems.
