Pierre Comon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pierre Comon has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Giorgio Ottaviani
University of Florence, Italy
2 shared publications - Lek-Heng Lim
DEPARTMENT OF MATHEMATICS UNIVERSITY OF CALIFORNIA 94720-3840 BERKELEY CA
2 shared publications - Andre Lima Ferrer de Almeida
Federal University of Ceará
1 shared publication X. Luciani
Laboratory I3S, UMR6070, University of Nice, Algorithmes/Euclide-B, 2000 route des Lucioles, BP 121, F-06903 Sophia-Antipolis Cedex
1 shared publication
Latest Publications
- Open Access
Multiarray Signal Processing: Tensor decomposition meets compressed sensing
We discuss how recently discovered techniques and tools from compressed sensing can be used in tensor decompositions, with a view towards modeling signals from multiple arrays of multiple sensors. We show that with appropriate bounds on a measure of separation between radiating sources called coherence, one could always guarantee the existence and uniqueness of a best rank-r approximation of the tensor representing the signal. We also deduce a computationally feasible variant of Kruskal's uniqueness condition, where the coherence appears as a proxy for k-rank. Problems of sparsest recovery with an infinite continuous dictionary, lowest-rank tensor representation, and blind source separation are treated in a uniform fashion. The decomposition of the measurement tensor leads to simultaneous localization and extraction of radiating sources, in an entirely deterministic manner.
Open AccessMultiarray Signal Processing: Tensor decomposition meets compressed sensing
We discuss how recently discovered techniques and tools from compressed sensing can be used in tensor decompositions, with a view towards modeling signals from multiple arrays of multiple sensors. We show that with appropriate bounds on a measure of separation between radiating sources called coherence, one could always guarantee the existence and uniqueness of a best rank-r approximation of the tensor representing the signal. We also deduce a computationally feasible variant of Kruskal's uniqueness condition, where the coherence appears as a proxy for k-rank. Problems of sparsest recovery with an infinite continuous dictionary, lowest-rank tensor representation, and blind source separation are treated in a uniform fashion. The decomposition of the measurement tensor leads to simultaneous localization and extraction of radiating sources, in an entirely deterministic manner.
- 1 June 2012
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 60 (6) , 657-667
On the typical rank of real binary forms
We determine the rank of a general real binary form of degree d = 4 or d = 5. In the case d = 5, the possible values of the rank of such general forms are 3, 4, and 5. This is the first reported case, to our knowledge, where more than two typical ranks have been found. We prove that a real binary form of degree d with d real roots has rank d.
- 1 June 2012
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 60 (6) , 657-667
On the typical rank of real binary forms
We determine the rank of a general real binary form of degree d = 4 or d = 5. In the case d = 5, the possible values of the rank of such general forms are 3, 4, and 5. This is the first reported case, to our knowledge, where more than two typical ranks have been found. We prove that a real binary form of degree d with d real roots has rank d.
- Open Access
On the typical rank of real binary forms
We determine the rank of a general real binary form of degree d=4 and d=5. In the case d=5, the possible values of the rank of such general forms are 3,4,5. The existence of three typical ranks was unexpected. We prove that a real binary form of degree d with d real roots has rank d.
Open AccessOn the typical rank of real binary forms
We determine the rank of a general real binary form of degree d=4 and d=5. In the case d=5, the possible values of the rank of such general forms are 3,4,5. The existence of three typical ranks was unexpected. We prove that a real binary form of degree d with d real roots has rank d.
- Top Cited Papers
- 20 April 2009
- Published by Wiley in Journal of Chemometrics
- Vol. 23 (7-8) , 393-405
Tensor decompositions, alternating least squares and other tales
This work was originally motivated by a classification of tensors proposed by Richard Harshman. In particular, we focus on simple and multiple ‘bottlenecks’, and on ‘swamps’. Existing theoretical results are surveyed, some numerical algorithms are described in details, and their numerical complexity is calculated. In particular, the interest in using the enhanced line search (ELS) enhancement in these algorithms is discussed. Computer simulations feed this discussion. Copyright © 2009 John Wiley & Sons, Ltd.
- 20 April 2009
- Published by Wiley in Journal of Chemometrics
- Vol. 23 (7-8) , 393-405
Top Cited PapersTensor decompositions, alternating least squares and other tales
This work was originally motivated by a classification of tensors proposed by Richard Harshman. In particular, we focus on simple and multiple ‘bottlenecks’, and on ‘swamps’. Existing theoretical results are surveyed, some numerical algorithms are described in details, and their numerical complexity is calculated. In particular, the interest in using the enhanced line search (ELS) enhancement in these algorithms is discussed. Computer simulations feed this discussion. Copyright © 2009 John Wiley & Sons, Ltd.
- Open Access
Nonnegative approximations of nonnegative tensors
We study the decomposition of a nonnegative tensor into a minimal sum of outer product of nonnegative vectors and the associated parsimonious naive Bayes probabilistic model. We show that the corresponding approximation problem, which is central to nonnegative PARAFAC, will always have optimal solutions. The result holds for any choice of norms and, under a mild assumption, even Bregman divergences.
Open AccessNonnegative approximations of nonnegative tensors
We study the decomposition of a nonnegative tensor into a minimal sum of outer product of nonnegative vectors and the associated parsimonious naive Bayes probabilistic model. We show that the corresponding approximation problem, which is central to nonnegative PARAFAC, will always have optimal solutions. The result holds for any choice of norms and, under a mild assumption, even Bregman divergences.