Konstantin USEVICH
Post-doctorant CNRS
Equipe Communication and Information in Complex Systems
Département Images et Signal
ME CONTACTER / CONTACT ME
Mail : konstantin.usevich@gipsa-lab.grenoble-inp.fr

11 rue des mathématiques
Domaine Universitaire
BP 46
38402 Saint Martin d'Hères cedex

Bureau D1119
Tél.33 (0)4 76 82 63 04
Fax : 33 (0)4 76 57 47 90
PUBLICATIONS RECENTES / RECENT PUBLICATIONS
Les derniéres publications de la collection Gipsa dans HAL

Multidimensional ESPRIT for Damped and Undamped Signals: Algorithm, Computations and Perturbation Analysis

Souleymen Sahnoun, Konstantin Usevich, Pierre Comon. Multidimensional ESPRIT for Damped and Undamped Signals: Algorithm, Computations and Perturbation Analysis. Accepted version. 2017. <hal-01360438v3>

High-Resolution Subspace-Based Methods: Eigenvalue- or Eigenvector-Based Estimation?

Konstantin Usevich, Souleymen Sahnoun, Pierre Comon. High-Resolution Subspace-Based Methods: Eigenvalue- or Eigenvector-Based Estimation?. Petr Tichavský, Massoud Babaie-Zadeh, Olivier J.J. Michel, Nadège Thirion-Moreau. 13th International Conference on Latent Variable Analysis and Signal Separation (LVA-ICA 2017), Feb 2017, Grenoble, France. Springer, Lecture Notes in Computer Science 10169, pp.47-56, 2017, Latent Variable Analysis and Signal Separation 13th International Conference, LVA/ICA 20

Optimal choice of Hankel-block-Hankel matrix shape in 2-D parameter estimation: the rank-one case

Souleymen Sahnoun, Konstantin Usevich, Pierre Comon. Optimal choice of Hankel-block-Hankel matrix shape in 2-D parameter estimation: the rank-one case. 24th European Signal Processing Conference (EUSIPCO 2016), Aug 2016, Budapest, Hungary. 2016. <hal-01288994v2>

Hankel low-rank matrix completion: performance of the nuclear norm relaxation

Konstantin Usevich, Pierre Comon. Hankel low-rank matrix completion: performance of the nuclear norm relaxation. IEEE Journal of Selected Topics in Signal Processing, IEEE, 2016, <10.1109/JSTSP.2016.2535182>. <hal-01130631v3>

A Tour of Constrained Tensor Canonical Polyadic Decomposition

Jérémy E. Cohen, Konstantin Usevich, Pierre Comon. A Tour of Constrained Tensor Canonical Polyadic Decomposition. [Research Report] GIPSA-lab. 2016. <hal-01311795>

Structured Matrix Completion: a Convex Relaxation

Konstantin Usevich, Pierre Comon. Structured Matrix Completion: a Convex Relaxation. XXVème colloque GRETSI (GRETSI 2015), Sep 2015, Lyon, France. Lavoisier, pp.4, XXVeme Colloque Gretsi. <http://www.gretsi.fr/colloque2015/bienvenue.html>. <hal-01168981>

Adjusted least squares fitting of algebraic hypersurfaces

Konstantin Usevich, Ivan Markovsky. Adjusted least squares fitting of algebraic hypersurfaces. Linear Algebra and Applications, Elsevier - Academic Press, 2015, <10.1016/j.laa.2015.07.023>. <hal-01093214>

A polynomial formulation for joint decomposition of symmetric tensors of different orders

Pierre Comon, Yang Qi, Konstantin Usevich. A polynomial formulation for joint decomposition of symmetric tensors of different orders. 12th International Conference on Latent Variable Analysis and Signal Separation (LVA/ICA 2015), Aug 2015, Liberec, Czech Republic. pp.8, 2015, Proceedings of LVA/ICA 2015. <http://amca.cz/lva2015/>. <hal-01168992>

Variable projection methods for approximate (greatest) common divisor computations

Konstantin Usevich, Ivan Markovsky. Variable projection methods for approximate (greatest) common divisor computations. [Research Report] GIPSA-lab. 2015. <hal-01226429>

A Recursive Restricted Total Least-squares Algorithm

Stephan Rhode, Konstantin Usevich, Ivan Markovsky, Frank Gauterin. A Recursive Restricted Total Least-squares Algorithm. IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2014, 62 (21), pp.5652-5662. <10.1109/TSP.2014.2350959>. <hal-01067938>

Grenoble Images Parole Signal Automatique laboratoire

UMR 5216 CNRS - Grenoble INP - Université Joseph Fourier - Université Stendhal