Marcio Lobo Netto

Prof. Dr. Marcio Lobo Netto

orcid

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

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

Representative Publications

View All Publications
29 October 2023 in Sensors
Verified
Journal Article
Open access
PDF file
RDRodrigo F. Daguano
Rodrigo F. Daguano
LYLeopoldo Yoshioka
Leopoldo Yoshioka
MNMarcio Lobo Netto
Marcio Lobo Netto
CMClaudio L. Marte
Claudio L. Marte
Cassiano Augusto IslerCassiano Augusto Isler
Cassiano Augusto Isler
JJJoao F. Justo
Joao F. Justo
Traffic simulations are valuable tools for urban mobility planning and operation, particularly in large cities. Simulation-based microscopic models have enabled traffic engineers to understand local transit and transport behaviors more deeply and manage urban mobility. However, for the simulations to be effective, the transport network and user behavior parameters must be calibrated to mirror real scenarios. In general, calibration is performed manually by traffic engineers who use their knowledge and experience to adjust the parameters of the simulator. Unfortunately, there is still no systematic and automatic process for calibrating traffic simulation networks, although some methods have been proposed in the literature. This study proposes a methodology that facilitates the calibration process, where an artificial neural network (ANN) is trained to learn the behavior of the transport network of interest. The ANN used is the Multi-Layer Perceptron (MLP), trained with back-propagation methods. Based on this learning procedure, the neural network can select the optimized values of the simulation parameters that best mimic the traffic conditions of interest. Experiments considered two microscopic models of traffic and two psychophysical models (Wiedemann 74 and Wiedemann 99). The microscopic traffic models are located in the metropolitan region of São Paulo, Brazil. Moreover, we tested the different configurations of the MLP (layers and numbers of neurons) as well as several variations of the backpropagation training method: Stochastic Gradient Descent (SGD), Adam, Adagrad, Adadelta, Adamax, and Nadam. The results of the experiments show that the proposed methodology is accurate and efficient, leading to calibration with a correlation coefficient greater than 0.8, when the calibrated parameters generate more visible effects on the road network, such as travel times, vehicle counts, and average speeds. For the psychophysical parameters, in the most simplified model (W74), the correlation coefficient was greater than 0.7. The advantage of using ANN for the automatic calibration of simulation parameters is that it allows traffic engineers to carry out comprehensive studies on a large number of future scenarios, such as at different times of the day, as well as on different days of the week and months of the year.

22 July 2019 in EURASIP Journal on Advances in Signal Processing
Verified
Journal Article
Open access
PDF file
SPSergio R. M. Penedo
Sergio R. M. Penedo
MNMarcio Lobo Netto
Marcio Lobo Netto
JJJoao F. Justo
Joao F. Justo
In digital filters theory, filtering techniques generally deal with pole-zero structures. In this context, filtering schemes, such as infinite impulse response (IIR) filters, are described by linear differential equations or linear transformations, in which the impulse response of each filter provides its complete characterization, under filter design specifications. On the other hand, finite impulse response (FIR) digital filters are more flexible than the analog ones, yielding higher quality factors. Since many approaches to the circuit synthesis using the wavelet transform have been recently proposed, here we present a digital filter design algorithm, based on signal wavelet decomposition, which explores the energy partitioning among frequency sub-bands. Exploring such motivation, the method involves the design of a perfect reconstruction wavelet filter bank, of a suitable choice of roots in the Z-plane, through a spectral factorization, exploring the orthogonality and localization property of the wavelet functions. This approach resulted in an energy partitioning across scales of the wavelet transform that enabled a superior filtering performance, in terms of its behavior on the pass and stop bands. This algorithm presented superior results when compared to windowed FIR digital filter design, in terms of the intended behavior in its transition band. Simulations of the filter impulse response for the proposed method are presented, displaying the good behavior of the method with respect to the transition bandwidth of the involved filters.

31 December 2001 in Computers & Graphics
Verified
Journal Article
Closed access
FMFábio Roberto Miranda
Fábio Roberto Miranda
JKJoão Eduardo Kögler
João Eduardo Kögler
EHEmı́lio Del Moral Hernandez
Emı́lio Del Moral Hernandez
MNMarcio Lobo Netto
Marcio Lobo Netto

1 January 2010 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
OGOsvaldo Guimarães
Osvaldo Guimarães
JPJosé Roberto C. Piqueira
José Roberto C. Piqueira
MNMarcio Lobo Netto
Marcio Lobo Netto
Several numerical methods for boundary value problems use integral and differential operational matrices, expressed in polynomial bases in a Hilbert space of functions. This work presents a sequence of matrix operations allowing a direct computation of operational matrices for polynomial bases, orthogonal or not, starting with any previously known reference matrix. Furthermore, it shows how to obtain the reference matrix for a chosen polynomial base. The results presented here can be applied not only for integration and differentiation, but also for any linear operation.

1 January 2011 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
OGOsvaldo Guimarães
Osvaldo Guimarães
JPJosé Roberto C. Piqueira
José Roberto C. Piqueira
MNMarcio Lobo Netto
Marcio Lobo Netto
This work develops a method for solving ordinary differential equations, that is, initial‐value problems, with solutions approximated by using Legendre′s polynomials. An iterative procedure for the adjustment of the polynomial coefficients is developed, based on the genetic algorithm. This procedure is applied to several examples providing comparisons between its results and the best polynomial fitting when numerical solutions by the traditional Runge‐Kutta or Adams methods are available. The resulting algorithm provides reliable solutions even if the numerical solutions are not available, that is, when the mass matrix is singular or the equation produces unstable running processes.

1 October 2008 in 2008 10th Brazilian Symposium on Neural Networks
Verified
Conference Paper
Closed access
CMCesar Gomes Miguel
Cesar Gomes Miguel
CSCarolina Feher da Silva
Carolina Feher da Silva
MNMarcio Lobo Netto
Marcio Lobo Netto
Neuroevolution comprehends the class of methods responsible for evolving neural network topologies and weights by means of evolutionary algorithms. Despite their good performance in several control tasks, most of these methods use variations of simple sigmoidal neurons. Recent investigations have shown the potential applicability of more realistic neuron models, opening new perspectives for the next generation of neuroevolutionary methods. This work aims to extend a recent method known as NEAT to evolve continuous-time recurrent neural networks (CTRNNs). The proposed model is compared with previous methods on a control benchmark test. Preliminary results reveal some advantages when evolving general CTRNNs over traditional models.