A New Spatial Approach for Efficient Transformation of Equality - Generalized TSP to TSP

The Equality - Generalized Travelling Salesman Problem (E-GTSP) asks to find a Hamiltonian cycle visiting each group exactly once, where each group represents a type of visiting node. This can represent a range of combinatorial optimization problem of NP-hard type like planning, logistics, etc. Its solution requires transformation of E-GTSP to TSP before solving it using a given TSP solver. This paper presents 5 different search-algorithms for optimal transformation which considers spatial spread of nodes of each group. Algorithms are tested over 15 cities with different street-network’s fractal-dimension for 5 instances of group-counts each. It’s observed that the R-Search algorithm, which selects nodes from each group depending upon their radial separation with respect to the start-end point, is the optimal search criterion among all other algorithms with a mean length error of 8.8%. This study will help developers and researchers to answer complex routing problems from a spatial perspective

New MS lesion segmentation with deep residual attention gate U-Net utilizing 2D slices of 3D MR images

Multiple sclerosis (MS) is an autoimmune disease that causes lesions in the central nervous system of humans due to demyelinating axons. Magnetic resonance imaging (MRI) is widely used for monitoring and measuring MS lesions. Automated methods for MS lesion segmentation have usually been performed on individual MRI scans. Recently, tracking lesion activity for quantifying and monitoring MS disease progression, especially detecting new lesions, has become an important biomarker. In this study, a unique pipeline with a deep neural network that combines U-Net, attention gate, and residual learning is proposed to perform better new MS lesion segmentation using baseline and follow-up 3D FLAIR MR images. The proposed network has a similar architecture to U-Net and is formed from residual units which facilitate the training of deep networks. Networks with fewer parameters are designed with better performance through the skip connections of U-Net and residual units, which facilitate information propagation without degradation. Attention gates also learn to focus on salient features of the target structures of various sizes and shapes. The MSSEG-2 dataset was used for training and testing the proposed pipeline, and the results were compared with those of other proposed pipelines of the challenge and experts who participated in the same challenge. According to the results over the testing set, the lesion-wise F1 and dice scores were obtained as a mean of 48 and 44.30%. For the no-lesion cases, the number of tested and volume of tested lesions were obtained as a mean of 0.148 and 1.488, respectively. The proposed pipeline outperformed 22 proposed pipelines and ranked 8th in the challenge

A Residual-Inception U-Net (RIU-Net) Approach and Comparisons with U-Shaped CNN and Transformer Models for Building Segmentation from High-Resolution Satellite Images

Building segmentation is crucial for applications extending from map production to urban planning. Nowadays, it is still a challenge due to CNNs’ inability to model global context and Transformers’ high memory need. In this study, 10 CNN and Transformer models were generated, and comparisons were realized. Alongside our proposed Residual-Inception U-Net (RIU-Net), U-Net, Residual U-Net, and Attention Residual U-Net, four CNN architectures (Inception, Inception-ResNet, Xception, and MobileNet) were implemented as encoders to U-Net-based models. Lastly, two Transformer-based approaches (Trans U-Net and Swin U-Net) were also used. Massachusetts Buildings Dataset and Inria Aerial Image Labeling Dataset were used for training and evaluation. On Inria dataset, RIU-Net achieved the highest IoU score, F1 score, and test accuracy, with 0.6736, 0.7868, and 92.23%, respectively. On Massachusetts Small dataset, Attention Residual U-Net achieved the highest IoU and F1 scores, with 0.6218 and 0.7606, and Trans U-Net reached the highest test accuracy, with 94.26%. On Massachusetts Large dataset, Residual U-Net accomplished the highest IoU and F1 scores, with 0.6165 and 0.7565, and Attention Residual U-Net attained the highest test accuracy, with 93.81%. The results showed that RIU-Net was significantly successful on Inria dataset. On Massachusetts datasets, Residual U-Net, Attention Residual U-Net, and Trans U-Net provided successful results

Designing Weather Forecasting Model Using Computational Intelligence Tools

Climate changes on Iraq characterized by increasing droughts and desertification cause many environmental problems especially in the last decade. In this study, a model was designed to forecast selected weather variables in Nineveh province which is located in northwestern of Iraq based on artificial neural networks consisting radial basis function, Fuzzy C-Means, and Nonlinear Autoregressive Network with Exogenous inputs. The performance accuracy of this developed model gives very close predicted results with very small statistic errors for predicted period years from 2015 till the year 2050 then the model begins to collapse and its results are irrational. An interface window was designed to be an easy facility to work on this model without any difficulty or complexity. This model is a very useful tool for decision-makers for developing future plans to address the rapid climate changes in the study area

Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem

The Equality-Generalized Travelling Salesman Problem (E-GTSP), which is an extension of the Travelling Salesman Problem (TSP), is stated as follows: given groups of points within a city, like banks, supermarkets, etc., find a minimum cost Hamiltonian cycle that visits each group exactly once. It can model many real-life combinatorial optimization scenarios more efficiently than TSP. This study presents five spatially driven search-algorithms for possible transformation of E-GTSP to TSP by considering the spatial spread of points in a given urban city. Presented algorithms are tested over 15 different cities, classified by their street-network’s fractal-dimension. Obtained results denote that the R-Search algorithm, which selects the points from each group based on their radial separation with respect to the start–end point, is the best search criterion for any E-GTSP to TSP conversion modelled for a city street network. An 8.8% length error has been reported for this algorithm

Turkey OpenStreetMap Dataset - Spatial Analysis of Development and Growth Proxies

Number of studies covering major data aspects of OpenStreetMap (OSM) for developed cities and countries are available in scientific literature. However, this is not the case for developing ones mainly because of low data availability in OSM. This study presents a time-series spatial analysis of Turkey OSM dataset, a developing country, between the year 2007 and 2015 to understand how the dataset has developed with time and space. Five different socio-economic factors of the region are tested to find their relationship, if any, with dataset growth. An east-west spatial trend in data density is observed within the country. Population Density and Literacy Level of the region are found be the factors controlling it. It has also been observed that the street network of the region has followed the Exploration and Densification evolutionary model. High participation inequality is found within the OSM mappers, with only 5 of them responsible for the country’s 50% geo-data upload. Furthermore, it is found that these mappers use other Volunteered Geographic Information (VGI) and government open-dataset to feed into OSM. This study is believed to bring some high level insights of OSM for a developing country which would be useful for geographers, open-data policy makers, VGI projects planners and data-curators to structure and deploy similar future projects

Location-Based Analyses for Electronic Monitoring of Parolees

This study analyses the spatio-temporal pattern of parolees using electronic monitoring, where the developed spatial framework supports the Environmental Criminology concepts such as crime patterns or crime attractive locations. A grid-based solution for spatio-temporal analyses is introduced to ensure the anonymity of the parolees. In order to test these developed concepts, the Istanbul Metropolitan Area was selected as the pilot study area. Following the developed concepts of the Crime Pattern Theory, a spatial framework was designed. A novel grid-based weighted algorithm for the most attractive areas was generated via spatial point-of-interest data and a conducted survey among police officers. The designed framework and the spatio-temporal analyses were carried out for 77 parolees using geostatistical methods. The major findings of the study are (a) 24-hour trajectories of each parolee was monitored; (b) the most attractive grids within the city were defined; and (c) for each parolee, the entrance time to the grid and the time spent within that grid were reported and analyzed. This study is a preliminary study for spatio-temporal detection of parolees’ trajectories, where location-based analyses serve well. This study aims to aid decision-makers to better monitor the parolees and justify the benefits of surveillance