The exponential growth of geographic data reveals limitations in traditional spatial indices. Spatial learned indices that incorporate machine learning models have been proposed to enhance index performance. However, due to the considerable overhead of fine-grained data partitioning and the complexity of hierarchical model structures, existing spatial learned indices still exhibit bottlenecks in index construction and query processing. To address the aforementioned issues, we propose TBSI, an in-memory Transformer-based spatial learned index with an end-to-end structure. TBSI employs an enhanced quadtree to optimize data partitioning and utilizes a Transformer-based position prediction model to manage each data partition, preserving a simple yet effective index structure. TBSI exhibits superior performance in both index construction and query processing. We also design spatial query algorithms based on a filtering-refinement mechanism and data update algorithms based on buffers and flag arrays to support efficient query processing and index maintenance. Extensive experiments on real-world and synthetic datasets demonstrated that, compared to baselines, TBSI achieved up to 23.4 times speedup in build time, up to 24.3 times reduction in index size, up to 5.9 times improvement in range queries, and up to 4.5 times improvement in kNN queries. Also, TBSI exhibited robust adaptability to dynamic data updates.

Spatial databases are the main means to manage geo-big data, and learned spatial indices are a novel approach to improve the spatial retrieval performance of spatial databases by modeling the data distribution. However, the complex hierarchical structures in current learning models pose significant limitations, including prolonged construction times, slow data updates, and suboptimal dynamic query performance. Consequently, improving the efficiency of both index construction and updates is essential. We addressed these challenges by introducing a new method, the Spatial Uniform Partition Learned Index (SUPLI). SUPLI utilizes an iterative uniform partitioning algorithm that simplifies data distribution by uniformly segmenting space and applies a linear regression function—instead of a neural network model—to enable efficient index construction. Additionally, SUPLI incorporates query load optimization and historical query learning strategies, which dynamically adjust the spatial query algorithm to enhance query efficiency. Furthermore, a buffer structure is employed to store change information, facilitating efficient updates. Comparative evaluations conducted on three synthetic datasets and two real-world datasets show that SUPLI outperforms the classic R-tree by an order of magnitude in construction, query, and update performance, and demonstrates additional advantages over similar spatial learned indices, such as SPRIG and LISA.

The cross-fertilization of the fast-developing AI technology and spatial indexing has given rise to spatial learned indexes. However, these indexes rely on historical data distributions to build models, which limits their ability to anticipate data that has not yet arrived. To address this, we propose a novel Spatio-Temporal Update Method (STUM) that enhances conventional spatial learned indexes by introducing a Spatial Delta Area (SDA) for updates without altering their hierarchical structure. STUM learns spatio-temporal auto-correlation from historical data and integrates predicted future distributions. We apply STUM to the Spatial Learned Block Range INdex (SLBRIN), resulting in the development of the Spatio-Temporal Updatable learned Block Range INdex (STUBRIN), which adopts Revmap to integrate spatio-temporal sequence predictions with the spatial block range. STUBRIN optimizes the retraining process by learning the temporal continuity from spatial distribution and fusing it into the error threshold control mechanism and historical delta learning mechanism. Our results show that STUBRIN achieves 1.9-2.4×, 1.8-13.3×, 3.4-6.7× better build, query and update performance compared to state-ofthe-art methods. Additionally, STUBRIN offers superior query and update stability. For concurrent learned indexes, we have also designed parallel scheduling for STUBRIN, which improves build, query and update performance by 6.2-6.8×, 0.3-4.2×, 2.6-5.5×, without increasing the index size.

Conventional deep learning-based methods for single remote sensing image super-resolution (SRSISR) have made remarkable progress. However, the super-resolution (SR) outputs of these methods are yet to become sufficiently satisfactory in visual quality. Recent diffusion model-based generative deep learning models are capable to enhance the visual quality of output images, but this capability is limited due to their sampling efficiency. In this article, we propose FastDiffSR, an SRSISR method based on a conditional diffusion model. Specifically, we devise a novel sampling strategy to reduce the number of sampling steps required by the diffusion model while ensuring the sampling quality. Meanwhile, the residual image is adopted to reduce computational costs, demonstrating that integrating channel attention and spatial attention begets a further improvement in the visual quality of output images. Compared to the state-of-the-art (SOTA) convolutional neural network (CNN)-based, GAN-based, and Transformer-based SR methods, our FastDiffSR improves the learned perceptual image patch similarity (LPIPS) by 0.1–0.2 and achieves better visual results in some real-world scenes. Compared with existing diffusion-based SR methods, our FastDiffSR achieves significant improvements in pixel-level evaluation metric peak signal-noise ratio (PSNR) while having smaller model parameters and obtaining better SR results on Vaihingen data with faster inference time by 2.8–28 times, showing excellent generalization ability and time efficiency. Our code will be open source athttps://github.com/Meng-333/FastDiffSR.

Super-resolution (SR) methods have significantly contributed to the improvement of the spatial resolution of remote sensing (RS) images. The development of deep learning empowers novel methods to learn informative feature representation from massive low-resolution (LR) and high-resolution (HR) image pairs. Conventional RS image SR methods, however, may fail in large-scale ($\times 8$and$\times 9$) SR tasks. Specifically, a larger scale factor corresponds to less information in LR images, which is a considerable challenge to SR. To address the issue, we propose a novel method for single RS image SR (SRSISR) based on stratified dense sampling to effectively extract image features. Specifically, the proposed SR dense-sampling residual attention network (SRDSRAN) combines dense sampling and residual learning to improve multilevel feature fusion and gradient propagation and employs local and global attentions to learn important features and long-range interdependence in the channel and spatial dimensions. Meanwhile, we also devise a discriminator model using local and global attentions and with the loss function integrating${L}_{1}$pixel loss,${L}_{1}$perceptual loss, and relativistic adversarial loss to obtain the perceptually realistic images. Besides, we introduce a chain training to promote performance and expedite the training process for large-scale SR. Experimental results on UC Merced image and other multispectral data demonstrated that our SRDSRAN outperformed the current state-of-the-art methods quantitatively and in visual quality and obtained a higher classification accuracy in scene classification, proving its potential for applications with other downstream tasks. The code of SRADSGAN will be available athttps://github.com/Meng-333/SRADSGAN.

Super-resolution (SR) technology is an important way to improve spatial resolution under the condition of sensor hardware limitations. With the development of deep learning (DL), some DL-based SR models have achieved state-of-the-art performance, especially the convolutional neural network (CNN). However, considering that remote sensing images usually contain a variety of ground scenes and objects with different scales, orientations, and spectral characteristics, previous works usually treat important and unnecessary features equally or only apply different weights in the local receptive field, which ignores long-range dependencies; it is still a challenging task to exploit features on different levels and reconstruct images with realistic details. To address these problems, an attention-based generative adversarial network (SRAGAN) is proposed in this article, which applies both local and global attention mechanisms. Specifically, we apply local attention in the SR model to focus on structural components of the earth’s surface that require more attention, and global attention is used to capture long-range interdependencies in the channel and spatial dimensions to further refine details. To optimize the adversarial learning process, we also use local and global attentions in the discriminator model to enhance the discriminative ability and apply the gradient penalty in the form of hinge loss and loss function that combines$L1$pixel loss,$L1$perceptual loss, and relativistic adversarial loss to promote rich details. The experiments show that SRAGAN can achieve performance improvements and reconstruct better details compared with current state-of-the-art SR methods. A series of ablation investigations and model analyses validate the efficiency and effectiveness of our method.

Traffic guidance, traffic management and emergency vehicle traffic all require keeping abreast of traffic status. Intelligent Transportation Systems (ITS) is highly expected to provide real-time traffic condition information service. To achieve this, the capability of handling dynamic data stream collected from multi traffic monitoring sources and serving the public with information timely is essential for ITS. With the wide spread of Internet of Things technology, not only the amount, but also the spatial and temporal resolutions of real-time traffic data have explosive growth, thereby enhancing the difficulty of real-time traffic data processing in ITS. Web pyramid map tiles is wide accepted for massive spatial data service, and the latency of tile generation significantly reduces the timeliness of information transmission and the reliability of services. A Flink-based method for dynamic pyramid tile generation and updating is proposed here. Take advantages of combining grid indexes, employing data partition and window selection mechanisms, and applying iterative computational characteristics for resampling, the distributed dynamic pyramid map tile generation algorithm (DPTG), can quickly visualize real-time spatial traffic data with digital map tiles. Taking the national highway road data from China as an example, the experimental results show that the Flink-based DPTG method has high efficiency and scalability in both batch processing and stream processing mode, which highlights the capability of the proposed method to support real-time traffic monitoring data processing for timely large-scale public service in ITS.

Geographically weighted regression (GWR) and geographically and temporally weighted regression (GTWR) are classic methods for estimating non-stationary relationships. Although these methods have been widely used in geographical modeling and spatiotemporal analysis, they face challenges in adequately expressing space-time proximity and constructing a kernel with optimal weights. This probably results in an insufficient estimation of spatiotemporal non-stationarity. To address complex non-linear interactions between time and space, a spatiotemporal proximity neural network (STPNN) is proposed in this paper to accurately generate space-time distance. A geographically and temporally neural network weighted regression (GTNNWR) model that extends geographically neural network weighted regression (GNNWR) with the proposed STPNN is then developed to effectively model spatiotemporal non-stationary relationships. To examine its performance, we conducted two case studies of simulated datasets and environmental modeling in coastal areas of Zhejiang, China. The GTNNWR model was fully evaluated by comparing with ordinary linear regression (OLR), GWR, GNNWR, and GTWR models. The results demonstrated that GTNNWR not only achieved the best fitting and prediction performance but also exactly quantified spatiotemporal non-stationary relationships. Further, GTNNWR has the potential to handle complex spatiotemporal non-stationarity in various geographical processes and environmental phenomena.

Geographically weighted regression (GWR) is a classic and widely used approach to model spatial non-stationarity. However, the approach makes no precise expressions of its weighting kernels and is insufficient to estimate complex geographical processes. To resolve these problems, we proposed a geographically neural network weighted regression (GNNWR) model that combines ordinary least squares (OLS) and neural networks to estimate spatial non-stationarity based on a concept similar to GWR. Specifically, we designed a spatially weighted neural network (SWNN) to represent the nonstationary weight matrix in GNNWR and developed two case studies to examine the effectiveness of GNNWR. The first case used simulated datasets, and the second case, environmental observations from the coastal areas of Zhejiang. The results showed that GNNWR achieved better fitting accuracy and more adequate prediction than OLS and GWR. In addition, GNNWR is applicable to addressing spatial non-stationarity in various domains with complex geographical processes.

Spatiotemporal kriging (STK) is recognized as a fundamental space-time prediction method in geo-statistics. Spatiotemporal regression kriging (STRK), which combines space-time regression with STK of the regression residuals, is widely used in various fields, due to its ability to take into account both the external covariate information and spatiotemporal autocorrelation in the sample data. To handle the spatiotemporal non-stationary relationship in the trend component of STRK, this paper extends conventional STRK to incorporate it with an improved geographically and temporally weighted regression (I-GTWR) model. A new geo-statistical model, named geographically and temporally weighted regression spatiotemporal kriging (GTWR-STK), is proposed based on the decomposition of deterministic trend and stochastic residual components. To assess the efficacy of our method, a case study of chlorophyll-a (Chl-a) prediction in the coastal areas of Zhejiang, China, for the years 2002 to 2015 was carried out. The results show that the presented method generated reliable results that outperform the GTWR, geographically and temporally weighted regression kriging (GTWR-K) and spatiotemporal ordinary kriging (STOK) models. In addition, employing the optimal spatiotemporal distance obtained by I-GTWR calibration to fit the spatiotemporal variograms of residual mapping is confirmed to be feasible, and it considerably simplifies the residual estimation of STK interpolation.

BACKGROUND: Transposable elements constitute an important part of the genome and are essential in adaptive mechanisms. Transposition events associated with phenotypic changes occur naturally or are induced in insertional mutant populations. Transposon mutagenesis results in multiple random insertions and recovery of most/all the insertions is critical for forward genetics study. Using genome next-generation sequencing data and appropriate bioinformatics tool, it is plausible to accurately identify transposon insertion sites, which could provide candidate causal mutations for desired phenotypes for further functional validation. RESULTS: We developed a novel bioinformatics tool, ITIS (Identification of Transposon Insertion Sites), for localizing transposon insertion sites within a genome. It takes next-generation genome re-sequencing data (NGS data), transposon sequence, and reference genome sequence as input, and generates a list of highly reliable candidate insertion sites as well as zygosity information of each insertion. Using a simulated dataset and a case study based on an insertional mutant line from Medicago truncatula, we showed that ITIS performed better in terms of sensitivity and specificity than other similar algorithms such as RelocaTE, RetroSeq, TEMP and TIF. With the case study data, we demonstrated the efficiency of ITIS by validating the presence and zygosity of predicted insertion sites of the Tnt1 transposon within a complex plant system, M. truncatula. CONCLUSION: This study showed that ITIS is a robust and powerful tool for forward genetic studies in identifying transposable element insertions causing phenotypes. ITIS is suitable in various systems such as cell culture, bacteria, yeast, insect, mammal and plant.

BACKGROUND: Higher eukaryotic genomes are typically large, complex and filled with both genes and multiple classes of repetitive DNA. The repetitive DNAs, primarily transposable elements, are a rapidly evolving genome component that can provide the raw material for novel selected functions and also indicate the mechanisms and history of genome evolution in any ancestral lineage. Despite their abundance, universality and significance, studies of genomic repeat content have been largely limited to analyses of the repeats in fully sequenced genomes. RESULTS: In order to facilitate a broader range of repeat analyses, the Assisted Automated Assembler of Repeat Families algorithm has been developed. This program, written in PERL and with numerous adjustable parameters, identifies sequence overlaps in small shotgun sequence datasets and walks them out to create long pseudomolecules representing the most abundant repeats in any genome. Testing of this program in maize indicated that it found and assembled all of the major repeats in one or more pseudomolecules, including coverage of the major Long Terminal Repeat retrotransposon families. Both Sanger sequence and 454 datasets were appropriate. CONCLUSION: These results now indicate that hundreds of higher eukaryotic genomes can be efficiently characterized for the nature, abundance and evolution of their major repetitive DNA components.