The mistletoe Phoradendron velutinum (P. velutinum) is a pest that spreads rapidly and uncontrollably in Mexican forests, becoming a serious problem since it is a cause of the decline of 23.3 million hectares of conifers and broadleaves in the country. The lack of adequate phytosanitary control has negative social, economic, and environmental impacts. However, pest management is a challenging task due to the difficulty of early detection for proper control of mistletoe infestations. Automating the detection of this pest is important due to its rapid spread and the high costs of field identification tasks. This paper presents a Genetic Programming (GP) approach for the automatic design of an algorithm to detect mistletoe using multispectral aerial images. Our study area is located in a conservation area of Mexico City, in the San Bartolo Ameyalco community. Images of 148 hectares were acquired by means of an Unmanned Aerial Vehicle (UAV) carrying a sensor sensitive to the R, G, B, red edge, and near-infrared bands, and with an average spatial resolution of less than 10 cm per pixel. As a result, it was possible to obtain an algorithm capable of classifying mistletoe P. velutinum at its flowering stage for the specific case of the study area in conservation area with an Overall Accuracy (OA) of 96% and a value of fitness function based on weighted Cohen’s Kappa ($k_w$) equal to 0.45 in the test data set. Additionally, our method’s performance was compared with two traditional image classification methods; in the first, a classical spectral index, named Intensive Pigment Index of Structure 2 (SIPI2), was considered for the detection of P. velutinum. The second method considers the well-known Support Vector Machine classification algorithm (SVM). We also compare the accuracy of the best GP individual with two additional indices obtained during the solution analysis. According to our experimental results, our GP-based algorithm outperforms the results obtained by the aforementioned methods for the identification of P. velutinum.

<!-- *** Custom HTML *** --> Several autofocus algorithms based on the analysis of image sharpness have been proposed for microscopy applications. Since autofocus functions (AFs) are computed from several images captured at different lens positions, these algorithms are considered computationally intensive. With the aim of presenting the capabilities of dedicated hardware to speed-up the autofocus process, we discuss the implementation of four AFs using, respectively, a multicore central processing unit (CPU) architecture and a graphic processing unit (GPU) card. Throughout different experiments performed on 300 image stacks previously identified with tuberculosis bacilli, the proposed implementations have allowed for the acceleration of the computation time for some AFs up to 23 times with respect to the serial version. These results show that the optimal use of multicore CPU and GPUs can be used effectively for autofocus in real-time microscopy applications.

Morphological processing has found several applications in image analysis and pattern recognition. Some of these techniques, known as morphological reconstruction algorithms, have been employed for land cover classification in remote sensing data. In this paper, we analyse the mathematical foundations, applications, and limitations of reconstruction by dilation and by erosion oriented to urban extraction, using Sentinel-2 satellite data. Different techniques oriented to the proper determination of the marker and mask images, the basis for reconstruction, are proposed in this manuscript. In addition, in order to diminish the long computation time required for reconstruction, two parallel implementations using Multi-core and GPU, are proposed. According to our research, these algorithms can be considered as effective and non-supervised solutions for urban extraction applications based on multispectral satellite imagery.

The two-dimensional phase unwrapping problem (PHUP) has been solved with discrete Fourier transforms (FTs) and many other techniques traditionally. Nevertheless, a formal way of solving the continuous Poisson equation for the PHUP, with the use of continuous FT and based on distribution theory, has not been reported yet, to our knowledge. The well-known specific solution of this equation is given in general by a convolution of a continuous Laplacian estimate with a particular Green function, whose FT does not exist mathematically. However, an alternative Green function called the Yukawa potential, with a guaranteed Fourier spectrum, can be considered for solving an approximated Poisson equation, inducing a standard procedure of a FT-based unwrapping algorithm. Thus, the general steps for this approach are described in this work by considering some reconstructions with synthetic and real data.

By considering two differential interferometric SAR signals, recovered from synthetic aperture radar (SAR) images, it has been possible to estimate the glacier velocity vector, from a method proposed by the authors Joughin, Kwok, and Fahnestock (JKF) in 1998. Although the JKF method normally works well under certain SAR observation conditions, we found a reformulated version of the main equation of this technique that may improve this interesting methodology. Thus, we present a mathematical review of this method, and a validation of our result in terms of accuracy, with some computer simulations. The innovation proposed is a simplified way to implement JKF’s work in the Sentinel Application Platform (SNAP) software, exemplified with some images from the Canadian Arctic. Generally, a north–east–up displacement estimation is considered, by using reference orthogonal coordinates, independent of the SAR image coordinates. However, we propose a methodology to estimate this velocity vector in terms of ascending or descending image coordinates. Given the importance of the JKF work, we believe that this investigation could contribute to the improvement of this technique, beyond the existence of other modern and independent methodologies.