Pierre Comon

Pierre Comon

Auto-generated profile, based on publicly available information

Pierre Comon

Lab. I3S CNRS UMR6070 University of Nice F-06903 Sophia-Antipolis France

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
20 April 2009 in Journal of Chemometrics
Verified
Journal Article
Closed access
PDF file
PCP. Comon
P. Comon
XLX. Luciani
X. Luciani
AAAndré De Almeida
André De Almeida

1 June 2012 in Linear and Multilinear Algebra
Verified
Journal Article
Closed access
PCPierre Comon
Pierre Comon
GOGiorgio Ottaviani
Giorgio Ottaviani
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.

12 April 2009 in arXiv
Verified
Preprint
Open access
PDF file
LLLek-Heng Lim
Lek-Heng Lim
PCPierre Comon
Pierre Comon
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.

26 September 2009 in arXiv
Verified
Preprint
Open access
PDF file
PCPierre Comon
Pierre Comon
GOGiorgio Ottaviani
Giorgio Ottaviani
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.

24 May 2013 in arXiv
Verified
Preprint
Open access
PDF file
LLLek-Heng Lim
Lek-Heng Lim
PCPierre Comon
Pierre Comon
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.