Zobrazeno 1 - 10
of 18
pro vyhledávání: '"José Henrique de Morais Goulart"'
Publikováno v:
Biblioteca Digital de Teses e Dissertações da USPUniversidade de São PauloUSP.
O modelamento matemático de sistemas físicos é fundamental para diversas aplicações de processamento digital de sinais (PDS). Em muitos dos problemas enfrentados nesse contexto, para que um modelo seja útil, é necessário que ele represente se
Publikováno v:
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing, 2023, 71, pp.1435-1447. ⟨10.1109/TSP.2023.3266939⟩
IEEE Transactions on Signal Processing, 2023, 71, pp.1435-1447. ⟨10.1109/TSP.2023.3266939⟩
This article introduces new multiplicative updates for nonnegative matrix factorization with the $\beta$-divergence and sparse regularization of one of the two factors (say, the activation matrix). It is well known that the norm of the other factor (
Autor:
Laureen Coic, Raffaele Vitale, Myriam Moreau, David Rousseau, José Henrique de Morais Goulart, Nicolas Dobigeon, Cyril Ruckebusch
In the context of multivariate curve resolution (MCR) and spectral unmixing, essential information (EI) corresponds to the most linearly dissimilar rows or/and columns of a two-way data matrix. These rows/columns are called essential because they are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a76756f157c7f2c7756547b065253ca1
https://doi.org/10.26434/chemrxiv-2023-0m36t
https://doi.org/10.26434/chemrxiv-2023-0m36t
Publikováno v:
IEEE Signal Processing Letters. 29:1492-1496
Publikováno v:
Signal Processing
Signal Processing, In press, 209, pp.109048. ⟨10.1016/j.sigpro.2023.109048⟩
Signal Processing, In press, 209, pp.109048. ⟨10.1016/j.sigpro.2023.109048⟩
International audience; This article proposes new multiplicative updates for nonnegative matrix factorization (NMF) with the $\beta$-divergence objective function. Our new updates are derived from a joint majorization-minimization (MM) scheme, in whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6cb7c9dda35821f15b764c59525fc06
http://arxiv.org/abs/2106.15214
http://arxiv.org/abs/2106.15214
Autor:
José Henrique de Morais Goulart, Pedro Marinho R. de Oliveira, Pierre Comon, Rodrigo Cabral Farias, Vicente Zarzoso
Publikováno v:
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2020, 68, pp.2682-2696. ⟨10.1109/TSP.2020.2985591⟩
IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2020, 68, pp.2682-2696. ⟨10.1109/TSP.2020.2985591⟩
International audience; 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 stru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15fd8900e3fed20a91207367024ebcf5
https://hal.archives-ouvertes.fr/hal-01899469v3/document
https://hal.archives-ouvertes.fr/hal-01899469v3/document
Publikováno v:
SIAM Journal on Scientific Computing
SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2017, 39 (3), pp.A860-A889. ⟨10.1137/16M1062089⟩
SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2017, 39 (3), pp.A860-A889. ⟨10.1137/16M1062089⟩
© 2017, Society for Industrial and Applied Mathematics; International audience; Iterative hard thresholding (IHT) is a simple and effective approach to parsimonious data recovery. Its multilinear rank (mrank)-based application to low-rank tensor rec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::efe3a5720798633dbd08daacd9e28906
https://hal.archives-ouvertes.fr/hal-01387529v2/document
https://hal.archives-ouvertes.fr/hal-01387529v2/document
Publikováno v:
Linear Algebra and its Applications
Linear Algebra and its Applications, Elsevier, 2019, 561, pp.161-186. ⟨10.1016/j.laa.2018.09.031⟩
Linear Algebra and its Applications, 2019, 561, pp.161-186. ⟨10.1016/j.laa.2018.09.031⟩
Linear Algebra and its Applications, Elsevier, 2019, 561, pp.161-186. ⟨10.1016/j.laa.2018.09.031⟩
Linear Algebra and its Applications, 2019, 561, pp.161-186. ⟨10.1016/j.laa.2018.09.031⟩
Under the action of the general linear group with tensor structure, the ranks of matrices $A$ and $B$ forming an $m \times n$ pencil $A + \lambda B$ can change, but in a restricted manner. Specifically, with every pencil one can associate a pair of m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e50ab641ca8b968e09aa7f624937e38c
https://hal.archives-ouvertes.fr/hal-01909603
https://hal.archives-ouvertes.fr/hal-01909603
Publikováno v:
IEEE Journal of Selected Topics in Signal Processing
IEEE Journal of Selected Topics in Signal Processing, IEEE, 2016, 10 (4), pp.757-769. ⟨10.1109/JSTSP.2015.2509907⟩
IEEE Journal of Selected Topics in Signal Processing, IEEE, 2016, 10 (4), pp.757-769. ⟨10.1109/JSTSP.2015.2509907⟩
International audience; The canonical polyadic decomposition (CPD) of high-order tensors, also known as Candecomp/Parafac, is very useful for representing and analyzing multidimensional data. This paper considers a CPD model having structured matrix
Publikováno v:
EUSIPCO
EUSIPCO 2018-26th European Signal Processing Conference
EUSIPCO 2018-26th European Signal Processing Conference, Sep 2018, Rome, Italy. ⟨10.23919/EUSIPCO.2018.8553084⟩
EUSIPCO 2018-26th European Signal Processing Conference
EUSIPCO 2018-26th European Signal Processing Conference, Sep 2018, Rome, Italy. ⟨10.23919/EUSIPCO.2018.8553084⟩
International audience; In this paper we present a modification of alternating least squares (ALS) for tensor canonical polyadic approximation that takes into account mutual coherence constraints. The proposed algorithm can be used to ensure well-pos