The common-reflection surface (CRS) method is a sophisticated alternative to the traditional common-midpoint stacking because its traveltime approximation allows for the use of more traces than the normal moveout. This in turn requires more parameters for the moveout description, thus increasing the computational burden of the parameter estimation. In the literature, a suboptimal strategy is often used, which decreases the complexity but, as we found in this work, compromises the accuracy of the parameters in some cases. To cope with this problem, in this work, we have devised detailed information for efficient estimation of the CRS parameters using the differential evolution (DE) global optimization algorithm. Because we used data sets with low fold and low signal-to-noise ratio, from which no reliable velocity analysis could be easily performed, we applied this algorithm in a fully automatic global search, i.e., without any velocity guide. The results for a 2D real data set from Brazil indicated that the global strategy yielded good results, both in terms of image quality as in the quality of the parameter volumes, especially the stacking velocity estimates, while keeping the computational costs relatively low. We also developed a convergence and a sensitivity analysis of the DE that shows its computational efficiency and the robustness of the optimization method with respect to the choice of the control parameters of the algorithm.

Agriculture is one of the most essential activities for humanity. Systems capable of automatically harvesting a crop using robots or performing a reasonable production estimate can reduce costs and increase production efficiency. With the advancement of computer vision, image processing methods are becoming increasingly viable in solving agricultural problems. Thus, this work aims to count green oranges directly from trees through video footage filmed in line along a row of orange trees on a plantation. For the video image processing flow, a solution was proposed integrating the YOLOv4 network with object-tracking algorithms. In order to compare the performance of the counting algorithm using the YOLOv4 network, an optimal object detector was simulated in which frame-by-frame corrected detections were used in which all oranges in all video frames were detected, and there were no erroneous detections. Being the scientific and technological innovation the possibility of distinguishing the green color of the fruits from the green color of the leaves. The use of YOLOv4 together with object detectors managed to reduce the number of double counting errors and obtained a count close to the actual number of oranges visible in the video. The results were promising, with an mAP50 of 80.16%, mAP50:95 of 53.83%, precision of 0.92, recall of 0.93, F1-score of 0.93, and average IoU of 82.08%. Additionally, the counting algorithm successfully identified and counted 204 oranges, closely approaching the actual count of 208. The study also resulted in a database with an amount of 644 images containing 43,109 orange annotations that can be used in future works.

This research aims to employ and qualify the bio-inspired algorithms: Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Differential Evolution Algorithm (DE) in the extraction of the parameters of the circuit equivalent to a photovoltaic module in the models of a diode and five parameters (1D5P) and two diodes and seven parameters (2D7P) in order to simulate the I-V characteristics curves for any irradiation and temperature scenarios. The peculiarity of this study stands in the exclusive use of information present in the module’s datasheet to carry out the full extraction and simulation process without depending on external sources of data or experimental data. To validate the methods, a comparison was made between the data obtained by the simulations with data from the module manufacturer in different scenarios of irradiation and temperature. The algorithm bound to the model with the highest accuracy was DE 1D5P, with a maximum relative error of 0.4% in conditions close to the reference and 3.61% for scenarios far from the reference. On the other hand, the algorithm that obtained the worst result in extracting parameters was the GA in the 2D7P model, which presented a maximum relative error of 9.59% in conditions far from the reference.