Fast gradient algorithm for complex ICA and its application to the MIMO systems

This paper proposes a new gradient-descent algorithm for complex independent component analysis and presents its application to the Multiple-Input Multiple-Output communication systems. Algorithm uses the Lie structure of optimization landscape and toral decomposition of gradient matrix. The theoretical results are validated by computer simulation and compared to several classes of algorithms, gradient descent, quasi-Newton as well as complex JADE. The simulations performed showed excellent results of the algorithm in terms of speed, stability of operation and the quality of separation. A characteristic feature of gradient methods is their quick response to changes in the input signal. The good results of the proposed algorithm indicate potential use in on-line applications.

Blind recovery of sources for multivariate space-time random fields

With advances in modern worlds technology, huge datasets that show dependencies in space as well as in time occur frequently in practice. As an example, several monitoring stations at different geographical locations track hourly concentration measurements of a number of air pollutants for several years. Such a dataset contains thousands of multivariate observations, thus, proper statistical analysis needs to account for dependencies in space and time between and among the different monitored variables. To simplify the consequent multivariate spatio-temporal statistical analysis it might be of interest to detect linear transformations of the original observations that result in straightforward interpretative, spatio-temporally uncorrelated processes that are also highly likely to have a real physical meaning. Blind source separation (BSS) represents a statistical methodology which has the aim to recover so-called latent processes, that exactly meet the former requirements. BSS was already successfully used in sole temporal and sole spatial applications with great success, but, it was not yet introduced for the spatio-temporal case. In this contribution, a reasonable and innovative generalization of BSS for multivariate space-time random fields (stBSS), under second-order stationarity, is proposed, together with two space-time extensions of the well-known algorithms for multiple unknown signals extraction (stAMUSE) and the second-order blind identification (stSOBI) which solve the formulated problem. Furthermore, symmetry and separability properties of the model are elaborated and connections to the space-time linear model of coregionalization and to the classical principal component analysis are drawn. Finally, the usefulness of the new methods is shown in a thorough simulation study and on a real environmental application.

A review of second-order blind identification methods

Second-order source separation (SOS) is a data analysis tool which can be used for revealing hidden structures in multivariate time series data or as a tool for dimension reduction. Such methods are nowadays increasingly important as more and more high-dimensional multivariate time series data are measured in numerous fields of applied science. Dimension reduction is crucial, as modeling such high-dimensional data with multivariate time series models is often impractical as the number of parameters describing dependencies between the component time series is usually too high. SOS methods have their roots in the signal processing literature, where they were first used to separate source signals from an observed signal mixture. The SOS model assumes that the observed time series (signals) is a linear mixture of latent time series (sources) with uncorrelated components. The methods make use of the second-order statistics-hence the name "second-order source separation." In this review, we discuss the classical SOS methods and their extensions to more complex settings. An example illustrates how SOS can be performed. This article is categorized under:Statistical Models > Time Series ModelsStatistical and Graphical Methods of Data Analysis > Dimension ReductionData: Types and Structure > Time Series, Stochastic Processes, and Functional Data.

Fast tensorial JADE

We propose a novel method for tensorial-independent component analysis. Our approach is based on TJADE and k-JADE, two recently proposed generalizations of the classical JADE algorithm. Our novel method achieves the consistency and the limiting distribution of TJADE under mild assumptions and at the same time offers notable improvement in computational speed. Detailed mathematical proofs of the statistical properties of our method are given and, as a special case, a conjecture on the properties of k-JADE is resolved. Simulations and timing comparisons demonstrate remarkable gain in speed. Moreover, the desired efficiency is obtained approximately for finite samples. The method is applied successfully to large-scale video data, for which neither TJADE nor k-JADE is feasible. Finally, an experimental procedure is proposed to select the values of a set of tuning parameters. Supplementary material including the R-code for running the examples and the proofs of the theoretical results is available online.

Sampling Properties of color Independent Component Analysis

Independent Component Analysis (ICA) offers an effective data-driven approach for blind source extraction encountered in many signal and image processing problems. Although many ICA methods have been developed, they have received relatively little attention in the statistics literature, especially in terms of rigorous theoretical investigation for statistical inference. The current paper aims at narrowing this gap and investigates the statistical sampling properties of the colorICA (cICA) method. The cICA incorporates the correlation structure within sources through parametric time series models in the frequency domain and outperforms several existing ICA alternatives numerically. We establish the consistency and asymptotic normality of the cICA estimates, which then enables statistical inference based on the estimates. These asymptotic properties are further validated using simulation studies.

Extracting Conditionally Heteroskedastic Components using Independent Component Analysis

In the independent component model, the multivariate data are assumed to be a mixture of mutually independent latent components. The independent component analysis (ICA) then aims at estimating these latent components. In this article, we study an ICA method which combines the use of linear and quadratic autocorrelations to enable efficient estimation of various kinds of stationary time series. Statistical properties of the estimator are studied by finding its limiting distribution under general conditions, and the asymptotic variances are derived in the case of ARMA-GARCH model. We use the asymptotic results and a finite sample simulation study to compare different choices of a weight coefficient. As it is often of interest to identify all those components which exhibit stochastic volatility features we suggest a test statistic for this problem. We also show that a slightly modified version of the principal volatility component analysis can be seen as an ICA method. Finally, we apply the estimators in analysing a data set which consists of time series of exchange rates of seven currencies to US dollar. Supporting information including proofs of the theorems is available online.

Joint and Individual Representation of Domains of Physical Activity, Sleep, and Circadian Rhythmicity

Developments in wearable technology have enabled researchers to continuously and objectively monitor various aspects and physiological domains of real-life including levels of physical activity, quality of sleep, and strength of circadian rhythm in many epidemiological and clinical studies. Current analytical practice is to summarize each of these three domains individually via a standard inventory of interpretable features, and explore individual associations between the features and clinical variables. However, the features often exhibit significant interaction and correlation both within and between domains. Integration of features across multiple domains remains methodologically challenging. To address this problem, we propose to use joint and individual variation explained (JIVE), a dimension reduction technique that efficiently deals with multivariate data representing multiple domains. In this paper, we review the most frequently used features to characterize the domains of physical activity, sleep, and circadian rhythniicity and illustrate the approach using wrist-worn actigraphy data from 198 participants of the Baltimore Longitudinal Study of Aging.

Subgroup detection in genotype data using invariant coordinate selection

BACKGROUND

The current gold standard in dimension reduction methods for high-throughput genotype data is the Principle Component Analysis (PCA). The presence of PCA is so dominant, that other methods usually cannot be found in the analyst's toolbox and hence are only rarely applied.

RESULTS

We present a modern dimension reduction method called 'Invariant Coordinate Selection' (ICS) and its application to high-throughput genotype data. The more commonly known Independent Component Analysis (ICA) is in this framework just a special case of ICS. We use ICS on both, a simulated and a real dataset to demonstrate first some deficiencies of PCA and how ICS is capable to recover the correct subgroups within the simulated data. Second, we apply the ICS method on a chicken dataset and also detect there two subgroups. These subgroups are then further investigated with respect to their genotype to provide further evidence of the biological relevance of the detected subgroup division. Further, we compare the performance of ICS also to five other popular dimension reduction methods.

CONCLUSION

The ICS method was able to detect subgroups in data where the PCA fails to detect anything. Hence, we promote the application of ICS to high-throughput genotype data in addition to the established PCA. Especially in statistical programming environments like e.g. R, its application does not add any computational burden to the analysis pipeline.