8 accepted papers
Incomplete multi-view clustering (IMVC), based on imputation and clustering unification, has received wide attention due to its ability to exploit hidden information from missing views. However, current methods mainly consider inter/intra-view correlations, ignoring the structural information of sam…
Extensive literature exists on how to test for normality, especially for identically and independently distributed (i.i.d) processes. The case of dependent samples has also been addressed, but only for scalar random processes. For this reason, we have proposed a joint normality test for multivariate…
Stochastic Neighbour Embedding methods (SNE, t-SNE) aim at finding a faithful low-dimensional representation of a high-dimensional dataset. Despite their popularity, being solution to a non-convex optimization, the behavior of these tools is not well understood. This work provides first answers by l…
Numerous works have shown the versatility of deterministic constrained Cramér-Rao bound for estimation performance analysis and design of a system of measurements. Indeed, most of factors impacting the asymptotic estimation performance of the parameters of interest can be taken into account via equa…
We propose a novel approach for hyperspectral super-resolution that is based on low-rank tensor approximation for a coupled low-rank multilinear (Tucker) model. We show that the correct recovery holds for a wide range of multilinear ranks. For coupled tensor approximation, we propose an SVD-based al…
Our goal is to devise a wideband High-Resolution technique that does not require a priori knowledge of DoA rough estimates, and that is able to exploit multiple spatial invariances. Existing tensor array processing techniques are limited to the narrowband case. On the other hand, wideband Esprit has…
The Canonical Polyadic (CP) tensor decomposition has become an attractive mathematical tool these last ten years in various fields. Yet, efficient algorithms are still lacking to compute the full CP decomposition, whereas rank-one approximations are rather easy to compute. We propose a new deflation…
The Canonical Polyadic tensor decomposition (CPD), also known as Candecomp/Parafac, is very useful in numerous scientific disciplines. Structured CPDs, i.e. with Toeplitz, circulant, or Hankel factor matrices, are often encountered in signal processing applications. As subsequently pointed out, spec…