Renato Candido
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Renato Candido has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Magno T. M. Silva
Electronic Systems Engineering Department, Escola Politcnica, University of So Paulo, So Paulo, Brazil
21 shared publications - Marcio Eisencraft
University of São Paulo
7 shared publications - Daniel Gilio Tiglea
Electronic Systems Engineering Department, Escola Politcnica, University of So Paulo, So Paulo, Brazil
6 shared publications - Vitor Heloiz Nascimento
Department of Electronic Systems Engineering, University of São Paulo, São Paulo, Brazil
5 shared publications - Eduardo P. L. Jaqueira2 shared publications
- Luis Antonio Azpicueta-Ruiz
Department of Signal Theory and Communications, Universidad Carlos III de Madrid, 28911 Leganes, Spain
2 shared publications
Latest Publications
- 9 February 2025
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 44 (6) , 4101-4132
Bias-Variance Decomposition of the Mean-Square Deviation of the LMS Algorithm: Transient and Steady-State Analysis
- 9 February 2025
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 44 (6) , 4101-4132
Bias-Variance Decomposition of the Mean-Square Deviation of the LMS Algorithm: Transient and Steady-State Analysis
- 13 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 3973-3989
On the Impact of Random Node Sampling on Adaptive Diffusion Networks
In this paper, we analyze the effects of random sampling on adaptive diffusion networks. These networks consist in a collection of nodes that can measure and process data, and that can communicate with each other to pursue a common goal of estimating an unknown system. In particular, we consider in our theoretical analysis the diffusion least-mean-squares algorithm in a scenario in which the nodes are randomly sampled. Hence, each node may or may not adapt its local estimate at a certain iteration. Our model shows that a reduction in the sampling probability leads to a noticeable deterioration in the convergence rate, and, if the nodes cooperate, to a slight decrease in the steady-state Network Mean-Square Deviation (NMSD), assuming that the environment is stationary and that all other parameters of the algorithm are kept fixed. Furthermore, we also investigate the effects of the random node sampling on the network stability.
- 13 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 3973-3989
On the Impact of Random Node Sampling on Adaptive Diffusion Networks
In this paper, we analyze the effects of random sampling on adaptive diffusion networks. These networks consist in a collection of nodes that can measure and process data, and that can communicate with each other to pursue a common goal of estimating an unknown system. In particular, we consider in our theoretical analysis the diffusion least-mean-squares algorithm in a scenario in which the nodes are randomly sampled. Hence, each node may or may not adapt its local estimate at a certain iteration. Our model shows that a reduction in the sampling probability leads to a noticeable deterioration in the convergence rate, and, if the nodes cooperate, to a slight decrease in the steady-state Network Mean-Square Deviation (NMSD), assuming that the environment is stationary and that all other parameters of the algorithm are kept fixed. Furthermore, we also investigate the effects of the random node sampling on the network stability.
- Open Access
- 1 January 2024
- Published by Sociedad Brasileira de Telecomunicacoes
Classificação de sinais de ECG sintéticos
Resumo-Neste artigo, sinais de eletrocardiograma sintéticos foram gerados utilizando dois modelos gerativos: um baseado na rede adversária gerativa e outro no autocodificador variacional. Os sinais sintéticos foram classificados por uma rede perceptron multicamada treinada com sinais reais. A taxa de acerto de classificação dos sinais sintéticos foi superior a 80%, o que indica que esses sinais podem ser usados para melhorar as métricas de classificação de arritmias cardíacas.
- 1 January 2024
- Published by Sociedad Brasileira de Telecomunicacoes
Open AccessClassificação de sinais de ECG sintéticos
Resumo-Neste artigo, sinais de eletrocardiograma sintéticos foram gerados utilizando dois modelos gerativos: um baseado na rede adversária gerativa e outro no autocodificador variacional. Os sinais sintéticos foram classificados por uma rede perceptron multicamada treinada com sinais reais. A taxa de acerto de classificação dos sinais sintéticos foi superior a 80%, o que indica que esses sinais podem ser usados para melhorar as métricas de classificação de arritmias cardíacas.
- Open Access
- 1 January 2024
- Published by Sociedad Brasileira de Telecomunicacoes
Avaliação de funções-custo na super-resolução de imagens para jogos eletrônicos
Resumo-A reconstrução de imagens em super-resolução tem sido de interesse em diversas áreas, como imagens médicas, vigilância, jogos eletrônicos, entre outras. Neste trabalho, são avaliadas diferentes funções-custo no contexto de super-resolução de imagens para jogos eletrônicos. Para isso, utiliza-se uma versão simplificada do modelo de [1], que faz uso de múltiplos quadros, seus respectivos mapas de profundidade e vetores de movimento. Além das funções-custo tradicionais como o erro quadrático médio, o erro absoluto médio e a obtida do índice de similaridade estrutural, avaliam-se a perceptual loss e a Gloss. Resultados experimentais mostram que a escolha de diferentes camadas da perceptual loss tem influência positiva no desempenho e que a combinação dessas funções-custo com ela pode resultar em detalhes que melhoram a percepção qualitativa das imagens.
- 1 January 2024
- Published by Sociedad Brasileira de Telecomunicacoes
Open AccessAvaliação de funções-custo na super-resolução de imagens para jogos eletrônicos
Resumo-A reconstrução de imagens em super-resolução tem sido de interesse em diversas áreas, como imagens médicas, vigilância, jogos eletrônicos, entre outras. Neste trabalho, são avaliadas diferentes funções-custo no contexto de super-resolução de imagens para jogos eletrônicos. Para isso, utiliza-se uma versão simplificada do modelo de [1], que faz uso de múltiplos quadros, seus respectivos mapas de profundidade e vetores de movimento. Além das funções-custo tradicionais como o erro quadrático médio, o erro absoluto médio e a obtida do índice de similaridade estrutural, avaliam-se a perceptual loss e a Gloss. Resultados experimentais mostram que a escolha de diferentes camadas da perceptual loss tem influência positiva no desempenho e que a combinação dessas funções-custo com ela pode resultar em detalhes que melhoram a percepção qualitativa das imagens.
- Open Access
- 1 January 2023
- Published by Sociedad Brasileira de Telecomunicacoes
Reconstrução de imagens em super-resolução usando redes neurais convolucionais
Resumo-São propostas duas arquiteturas residuais baseadas em rede neural convolucional para aumentar a resolução de imagens em escala de cinza. Como função custo, foi considerada função baseada no índice de similaridade estrutural. Por meio de simulações, verifica-se que as soluções propostas levam a resultados superiores aos obtidos com a interpolação bicúbica. Palavras-Chave
- 1 January 2023
- Published by Sociedad Brasileira de Telecomunicacoes
Open AccessReconstrução de imagens em super-resolução usando redes neurais convolucionais
Resumo-São propostas duas arquiteturas residuais baseadas em rede neural convolucional para aumentar a resolução de imagens em escala de cinza. Como função custo, foi considerada função baseada no índice de similaridade estrutural. Por meio de simulações, verifica-se que as soluções propostas levam a resultados superiores aos obtidos com a interpolação bicúbica. Palavras-Chave
- 1 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 29 (10709908) , 1774-1778
A Variable Step Size Adaptive Algorithm With Simple Parameter Selection
We propose a normalized least mean squares algorithm with variable step size. Unlike other solutions, it has low computational cost, only three parameters that are simple to choose, and its steady-state performance can be easily predicted. Simulations show a competitive performance in comparison with other solutions, and validate our theoretical analysis.
- 1 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 29 (10709908) , 1774-1778
A Variable Step Size Adaptive Algorithm With Simple Parameter Selection
We propose a normalized least mean squares algorithm with variable step size. Unlike other solutions, it has low computational cost, only three parameters that are simple to choose, and its steady-state performance can be easily predicted. Simulations show a competitive performance in comparison with other solutions, and validate our theoretical analysis.
- Open Access
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
An Adaptive Algorithm for Sampling Over Diffusion Networks with Dynamic Parameter Tuning and Change Detection Mechanisms
Recently, we proposed a sampling algorithm for diffusion networks that locally adapts the number of nodes sampled according to the estimation error. Thus, it reduces the computational cost associated with the learning task when the error is low in magnitude, e.g., during steady state, and maintains the sampling of the nodes otherwise, which enables fast convergence during the transient. However, its performance depends crucially on the choice of the parameter responsible for penalizing the sampling, which is a function of the variance of the measurement noise across the network. Inappropriate choices affect the tracking capability of the algorithm. In this paper, we propose a different solution, which automatically adjusts its own parameters based on the noise power estimation. Although its computational cost is slightly increased, this modification removes the need for a priori knowledge of the noise variance across the network, and increases its robustness to the presence of noisy nodes in the network. Furthermore, by implementing an adaptive reset system for the sampling mechanism, we are able to significantly improve the tracking capability of the original algorithm.
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Open AccessAn Adaptive Algorithm for Sampling Over Diffusion Networks with Dynamic Parameter Tuning and Change Detection Mechanisms
Recently, we proposed a sampling algorithm for diffusion networks that locally adapts the number of nodes sampled according to the estimation error. Thus, it reduces the computational cost associated with the learning task when the error is low in magnitude, e.g., during steady state, and maintains the sampling of the nodes otherwise, which enables fast convergence during the transient. However, its performance depends crucially on the choice of the parameter responsible for penalizing the sampling, which is a function of the variance of the measurement noise across the network. Inappropriate choices affect the tracking capability of the algorithm. In this paper, we propose a different solution, which automatically adjusts its own parameters based on the noise power estimation. Although its computational cost is slightly increased, this modification removes the need for a priori knowledge of the noise variance across the network, and increases its robustness to the presence of noisy nodes in the network. Furthermore, by implementing an adaptive reset system for the sampling mechanism, we are able to significantly improve the tracking capability of the original algorithm.
- 1 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 69 (1053587X) , 58-72
A Low-Cost Algorithm for Adaptive Sampling and Censoring in Diffusion Networks
Distributed signal processing has attracted widespread attention in the scientific community due to its several advantages over centralized approaches. Recently, graph signal processing has risen to prominence, and adaptive distributed solutions have also been proposed in the area. Both in the classical framework and in graph signal processing, sampling and censoring techniques have been topics of intense research, since the cost associated with measuring, processing and/or transmitting data throughout the entire network may be prohibitive in certain applications. In this paper, we propose a low-cost adaptive mechanism for sampling and censoring over diffusion networks that uses information from more nodes when the error in the network is high and from less nodes otherwise. It presents fast convergence during transient and a significant reduction in computational cost and energy consumption in steady state. As a censoring technique, we show that it is able to noticeably outperform other solutions. We also present a theoretical analysis to give insights about its operation, and to help the choice of suitable values for its parameters.
- 1 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 69 (1053587X) , 58-72
A Low-Cost Algorithm for Adaptive Sampling and Censoring in Diffusion Networks
Distributed signal processing has attracted widespread attention in the scientific community due to its several advantages over centralized approaches. Recently, graph signal processing has risen to prominence, and adaptive distributed solutions have also been proposed in the area. Both in the classical framework and in graph signal processing, sampling and censoring techniques have been topics of intense research, since the cost associated with measuring, processing and/or transmitting data throughout the entire network may be prohibitive in certain applications. In this paper, we propose a low-cost adaptive mechanism for sampling and censoring over diffusion networks that uses information from more nodes when the error in the network is high and from less nodes otherwise. It presents fast convergence during transient and a significant reduction in computational cost and energy consumption in steady state. As a censoring technique, we show that it is able to noticeably outperform other solutions. We also present a theoretical analysis to give insights about its operation, and to help the choice of suitable values for its parameters.
- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
An Adaptive Sampling Technique for Graph Diffusion LMS Algorithm
- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
An Adaptive Sampling Technique for Graph Diffusion LMS Algorithm
- Open Access
- 1 January 2019
- Published by Sociedad Brasileira de Telecomunicacoes in Journal of Communication and Information Systems
- Vol. 34 (1) , 55-63
Equalization in chaos-based communication systems using kernel adaptive filtering
Chaos-based communication systems have attracted attention of researchers in academy and industry in the last decades. A particular family of such systems has as basic idea to use the transmitted message to modify a known nonlinear chaotic signal generator (CSG). In the receiver, the knowledge of the employed nonlinear CSG in conjunction with chaotic synchronization permits to recover the original message. These systems are an alternative for spread spectrum communication with a possible increase in the security in the physical layer, since it is necessary to perfectly know the CSG in the receiver to decode the message. However, the lack of robustness of chaotic synchronization in relation to channel noise and intersymbol interference still poses a barrier for their practical use. The problem of equalization for such systems have been tackled for a while, and algorithms based on the normalized least-mean squares have presented auspicious results for linear channels. For nonlinear channels, Kernel Adaptive Filters (KAFs) have been used since they are able to solve nonlinear problems implicitly projecting the input vector into a larger dimension space, where they can be linearly solved. Therefore, in this paper, we propose the use of KAFs with two purposes: to equalize linear and nonlinear channels and, at the same time, decode the message without knowledge of the CSG in the receiver. Simulation results show that the proposed solution is able to perform these tasks.
- 1 January 2019
- Published by Sociedad Brasileira de Telecomunicacoes in Journal of Communication and Information Systems
- Vol. 34 (1) , 55-63
Open AccessEqualization in chaos-based communication systems using kernel adaptive filtering
Chaos-based communication systems have attracted attention of researchers in academy and industry in the last decades. A particular family of such systems has as basic idea to use the transmitted message to modify a known nonlinear chaotic signal generator (CSG). In the receiver, the knowledge of the employed nonlinear CSG in conjunction with chaotic synchronization permits to recover the original message. These systems are an alternative for spread spectrum communication with a possible increase in the security in the physical layer, since it is necessary to perfectly know the CSG in the receiver to decode the message. However, the lack of robustness of chaotic synchronization in relation to channel noise and intersymbol interference still poses a barrier for their practical use. The problem of equalization for such systems have been tackled for a while, and algorithms based on the normalized least-mean squares have presented auspicious results for linear channels. For nonlinear channels, Kernel Adaptive Filters (KAFs) have been used since they are able to solve nonlinear problems implicitly projecting the input vector into a larger dimension space, where they can be linearly solved. Therefore, in this paper, we propose the use of KAFs with two purposes: to equalize linear and nonlinear channels and, at the same time, decode the message without knowledge of the CSG in the receiver. Simulation results show that the proposed solution is able to perform these tasks.