Pierre Comon

Dr. Pierre Comon


Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 January 2020 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
CPClemence Prevost
Clemence Prevost
KUKonstantin Usevich
Konstantin Usevich
PCPierre Comon
Pierre Comon
DBDavid Brie
David Brie
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 two SVD-based algorithms that are simple and fast, but with a performance comparable to the state-of-the-art methods. The approach is applicable to the case of unknown spatial degradation and to the pansharpening problem.

29 February 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
YQYang Qi
Yang Qi
PCPierre Comon
Pierre Comon
LLLek-Heng Lim
Lek-Heng Lim
We show that for a nonnegative tensor, a best nonnegative rank-r approximation is almost always unique, its best rank-one approximation may always be chosen to be a best nonnegative rank-one approximation, and the set of nonnegative tensors with nonunique best rank-one approximations forms an algebraic hypersurface. We show that the last part holds true more generally for real tensors and, thereby, determine a polynomial equation, so that a real or nonnegative tensor that does not satisfy this equation is guaranteed to have a unique best rank-one approximation. We also establish an analogue for real or nonnegative symmetric tensors. In addition, we prove a singular vector variant of the Perron-Frobenius theorem for positive tensors and apply it to show that a best nonnegative rank-r approximation of a positive tensor can never be obtained by deflation. As an aside, we verify that the Euclidean distance (ED) discriminants of the Segre variety and the Veronese variety are hypersurfaces and give defining equations of these ED discriminants.

27 July 2022 in Signal Processing
Verified
Journal Article
Closed access
SBSara El Bouch
Sara El Bouch
OMOlivier Michel
Olivier Michel
PCPierre Comon
Pierre Comon

10 May 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
ZLZhen Long
Zhen Long
CZCe Zhu
Ce Zhu
JLJiani Liu
Jiani Liu
PCPierre Comon
Pierre Comon
YLYipeng Liu
Yipeng Liu
With the help of auxiliary data, tensor completion may better recover a low rank multidimensional array from limited observation entries. Most existing methods, including coupled matrix-tensor factorization and coupled tensor rank minimization, mainly focus on how to extract and incorporate subspace or directly use auxiliary data for tensor completion. They are either sensitive to a given rank or lack of physical interpretations of subspace information. In addition, the shared subspace information receives little attention in current tensor completion methods, especially there is no analysis of its impact on sample complexity. In this paper, we propose to separately explore and exploit shared subspaces for tensor completion. Specifically, dictionary learning takes the subspace from auxiliary data in the first step. Then a low rank optimization model for tensor completion is provided to incorporate the trained subspace by assuming that the recovered tensor is composed of two low rank components where one shares the subspace information with auxiliary data and the other is outside the shared space. Based on this optimization model, we make a quantitative analysis to illustrate the effect of subspace information on sample complexity, and provide theoretical insights into the usefulness of subspace information. Finally, experiments on simulated data are conducted to validate the theoretical analysis on the impact of subspace information. Experiments in two real-world applications including color image and multispectral image recovery show that the proposed method outperforms state-of-the-art ones in terms of prediction accuracy and CPU time.

1 January 2020 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
JGJose Henrique de Morais Goulart
Jose Henrique de Morais Goulart
POPedro Marinho Ramos de Oliveira
Pedro Marinho Ramos de Oliveira
RFRodrigo Cabral Farias
Rodrigo Cabral Farias
VZVicente Zarzoso
Vicente Zarzoso
PCPierre Comon
Pierre Comon
In some applications, blind source separation can be performed by computing an approximate block-term tensor decomposition (BTD), under much milder constraints than matrix-based techniques. However, choosing the BTD model structure (i.e., the number of blocks and their ranks) is a difficult problem, and the standard least-squares formulation can be ill-posed. This paper proposes an alternating group lasso algorithm to compute approximate low-rank BTDs. It solves, in a provably convergent manner, a well-posed mixed-norm regularized tensor approximation problem that allows estimating the model parameters and its structure jointly. A variant is also put forward for dealing with linearly constrained blocks, motivated by the problem of blind separation of sums of complex exponentials, which can be cast as a low-rank Hankel-structured block-term tensor approximation problem. An experimental comparison with a standard nonlinear least-squares algorithm on synthetic tensor data indicates that the proposed algorithm is much more robust with respect to initialization. We also apply the constrained variant to the extraction of atrial activity from semi-synthetic and real-world electrocardiogram recordings during atrial fibrillation episodes. Our results show its ability to consistently select an adequate structure and to extract multiple signals which can be physiologically interpreted as atrial fibrillation patterns.

16 November 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
ZLZhen Long
Zhen Long
CZCe Zhu
Ce Zhu
PCPierre Comon
Pierre Comon
YRYazhou Ren
Yazhou Ren
YLYipeng Liu
Yipeng Liu
T-SVD based incomplete multi-view clustering (IMVC) has received wide attention due to its ability to capture high-order correlations. However, t-SVD suffers from rotation sensitivity, failing to fully explore both inter- and intra-view consistencies. Besides, current methods mainly consider inter- or intra-view correlations, ignoring the low-rank information of sample features within views. To address these weaknesses, we first propose a feature space recovery based IMVC (FSR-IMVC) method, where low-rank feature space recovery and low-rank tensor ring based consistency learning are considered into a unified framework. Furthermore, we extend FSR-IMVC by incorporating anchor learning on the latent feature space, resulting in a scalable FSR-IMVC (sFSR-IMVC) approach that is well-suited to large-scale data. In an iterative way, the learned inter- and intra-view correlations will guide the recovery of missing features, while the explored low-rank information from feature spaces will in turn facilitate consistency exploration, eventually achieving outstanding clustering performance. Experimental results show that FSR-IMVC provides a significant improvement over known state-of-the-art algorithms in terms of ACC, NMI and Purity. Compared with FSR-IMVC, sFSR-IMVC performs slightly worse in clustering accuracy, but offers a notable advantage in computational efficiency, particularly for large-scale datasets. The codes of FSR-IMVC and sFSR-IMVC are publicly available at https://github.com/longzhen520/sFSR-IMVC.