The Vector Control Program in Mexico has developed operational research strategies to identify entomological and sociodemographic parameters associated with dengue transmission in order to direct targeted actions and reduce transmission. However, these strategies have limitations in establishing their relationship with landscape analysis and dengue transmission. This study provides a proof of concept of the use of unmanned aerial vehicle technology as a possible way to collect spatial information of the landscape in real time through multispectral images for the generation of a multivariate predictive model that allows for the establishment of a risk index relating sociodemographic variables with the presence of the vector in its different larval, pupal, and adult stages. With flight times of less than 30 min, RGB orthomosaics were built, where houses, roads, highways, rivers, and trails are observed in detail, as well as in areas with a strong influence of vegetation, detailing the location of the roofs or the infrastructure of the house, grass, bushes, and trees of different dimensions, with a pixel resolution level of 5 centimeters. For the risk index, we developed a methodology based on partial least squares (PLS), which takes into account the different type of variables are involved and the geographic distribution of the houses as well. Results show the spatial pattern of downtown low-risk housing, which increases as we approach the outskirts of the town. The predictive model of dengue transmission risk developed through orthomosaics can help decision makers to plan control and public health activities.
24 February 2020 in International Journal of Remote Sensing
Many works have been implemented to describe how seismic vertical displacement maps can be generated from synthetic aperture radar (SAR) images. The theory that supports these works is a very interesting field in remote sensing which is called differential interferometric SAR (DInSAR). However, behind this theory, there are many limitations and ambiguities that should be clarified before concluding specific results from the interpretation of subsidence maps. In this work, some of these drawbacks will be discussed, by following a typical subsidence map reconstruction with Sentinel-1 satellite images of a seismic region in Mexico. Particularly, the correct estimation of the unwrapped phase, is a crucial step for future analysis, like in time-series studies on subsidence ratios. In order to do this, a sophisticated routine called statistical-cost network-flow phase-unwrapping algorithm (SNAPHU), provided by the European Space Agency (ESA) in free software tools, is commonly applied to general SAR interferograms. However, in this particular study case, focused on simple dual-pair interferometry, atypical outputs obtained from SNAPHU were observed. Due to this inconsistency, the alternate solution proposed here is based on the so-called phase unwrapping by an accumulation of residual maps (ARM) algorithm. Our comparative analysis suggests that ARM outperforms SNAPHU and other tested methods in terms of unwrapped estimates.
Phase unwrapping is an important problem in the areas of optical metrology, synthetic aperture radar (SAR) image analysis, and magnetic resonance imaging (MRI) analysis. These images are becoming larger in size and, particularly, the availability and need for processing of SAR and MRI data have increased significantly with the acquisition of remote sensing data and the popularization of magnetic resonators in clinical diagnosis. Therefore, it is important to develop faster and accurate phase unwrapping algorithms. We propose a parallel multigrid algorithm of a phase unwrapping method named accumulation of residual maps, which builds on a serial algorithm that consists of the minimization of a cost function; minimization achieved by means of a serial Gauss–Seidel kind algorithm. Our algorithm also optimizes the original cost function, but unlike the original work, our algorithm is a parallel Jacobi class with alternated minimizations. This strategy is known as the chessboard type, where red pixels can be updated in parallel at same iteration since they are independent. Similarly, black pixels can be updated in parallel in an alternating iteration. We present parallel implementations of our algorithm for different parallel multicore architecture such as CPU-multicore, Xeon Phi coprocessor, and Nvidia graphics processing unit. In all the cases, we obtain a superior performance of our parallel algorithm when compared with the original serial version. In addition, we present a detailed comparative performance of the developed parallel versions.
22 September 2022 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Registration of remote sensing images has been approached using different strategies; one of the most popular is based on similarity measures. There are different measures of similarity in the literature: Normalized Cross-Correlation (NCC), Mutual Information (MI), etc. Normalized Mutual Information (NMI) has received the most attention in image processing; among the most important limitations are its high computational cost and lack of robustness to strong radiometric changes. For this reason, in this work, we introduce a co-registration approach based on the Histogram Kernel Predictability (HKP). This formulation reduces numerical errors and requires less computing time in comparison to NMI. To the best of our knowledge, this is the first work for registering any remote sensing images by using HKP. Additionally, we propose to use an algorithm based on meta-heuristics called Evolutionary Centers Algorithm (ECA), which allows having fewer iterations to solve the registration problem. In addition, we incorporate a parallelization scheme that permits reducing processing times. The results show that our proposal can solve co-registration problems that the NMI cannot solve while obtaining competitive computational times and registration errors comparable with other existing works in the literature. The HKP approach solves most of all the transformations of a set of simulated registration problems, while the NMI, in some cases, only solves half of the registration problems. Moreover, we compare our approach with feature-based methods in real datasets. This research presents an alternative to remote sensing problems where MI has traditionally been used.