With the growing number of cars in cities, smart parking is gradually becoming a strategic issue in building a smart city. As the precondition in smart parking, accurate parking prediction can reduce the time drivers spend searching for parking spaces and relieve traffic congestion. Meanwhile, VANET and the Internet-of-things (IoT) are the key elements of the current intelligent transportation system. With the IoT devices based on VANET becoming more extensively employed, a large amount of parking data is generated every day, and various methods are proposed for parking prediction, therefore, it is time to systematically summarize the parking prediction issues and the state-of-the-art prediction methods. In this survey, we first provide a comprehensive review of the existing methods used for parking prediction ranging from conventional statistical methods to the latest graph neural network methods. Then, we classify a variety of parking problems such as parking availability prediction, parking behavior prediction, and parking demand prediction. We also compile all the evaluation metrics, open data, and open-source code of the surveyed literature. Finally, we present the challenges and future directions of the parking prediction technique. As far as we know, this is the first survey exploring parking prediction methods, which will be of interest to both researchers and practitioners engaging in intelligent transportation systems (ITS) and smart cities.

With the development of sensors and of the Internet of Things (IoT), smart cities can provide people with a variety of information for a more convenient life. Effective on-street parking availability prediction can improve parking efficiency and, at times, alleviate city congestion. Conventional methods of parking availability prediction often do not consider the spatial–temporal features of parking duration distributions. To this end, we propose a parking space prediction scheme called the hybrid spatial–temporal graph convolution networks (HST-GCNs). We use graph convolutional networks and gated linear units (GLUs) with a 1D convolutional neural network to obtain the spatial features and the temporal features, respectively. Then, we construct a spatial–temporal convolutional block to obtain the instantaneous spatial–temporal correlations. Based on the similarity of the parking duration distributions, we propose an attention mechanism called $distAtt$ to measure the similarity of parking duration distributions. Through the $distAtt$ mechanism, we add the long-term spatial–temporal correlations to our spatial–temporal convolutional block, and thus, we can capture complex hybrid spatial–temporal correlations to achieve a higher accuracy of parking availability prediction. Based on real-world datasets, we compare the proposed scheme with the benchmark models. The experimental results show that the proposed scheme has the best performance in predicting the parking occupancy rate.

To the best of our knowledge, applying adaptive three-dimensional lookup tables (3D LUTs) to underwater image enhancement is an unprecedented attempt. It can achieve excellent enhancement results compared to some other methods. However, in the image weight prediction process, the model uses the normalization method of Instance Normalization, which will significantly reduce the standard deviation of the features, thus degrading the performance of the network. To address this issue, we propose an Instance Normalization Adaptive Modulator (INAM) that amplifies the pixel bias by adaptively predicting modulation factors and introduce the INAM into the learning image-adaptive 3D LUTs for underwater image enhancement. The bias amplification strategy in INAM makes the edge information in the features more distinguishable. Therefore, the adaptive 3D LUTs with INAM can substantially improve the performance on underwater image enhancement. Extensive experiments are undertaken to demonstrate the effectiveness of the proposed method.

Many real-world ubiquitous applications, such as parking recommendations and air pollution monitoring, benefit significantly from accurate long-term spatio-temporal forecasting (LSTF). LSTF makes use of long-term dependency between spatial and temporal domains, contextual information, and inherent pattern in the data. Recent studies have revealed the potential of multi-graph neural networks (MGNNs) to improve prediction performance. However, existing MGNN methods cannot be directly applied to LSTF due to several issues: the low level of generality, insufficient use of contextual information, and the imbalanced graph fusion approach. To address these issues, we construct new graph models to represent the contextual information of each node and the long-term spatio-temporal data dependency structure. To fuse the information across multiple graphs, we propose a new dynamic multi-graph fusion module to characterize the correlations of nodes within a graph and the nodes across graphs via the spatial attention and graph attention mechanisms. Furthermore, we introduce a trainable weight tensor to indicate the importance of each node in different graphs. Extensive experiments on two large-scale datasets demonstrate that our proposed approaches significantly improve the performance of existing graph neural network models in LSTF prediction tasks.

The importance of precise long-term forecasting in practical applications continues to rise. Extensive scenarios, including parking resource prediction and environmental quality monitoring, rely significantly on LSTF’s accurate spatio-temporal forecasting capabilities. This technology strengthens prediction effectiveness by combining interaction relationships between spatial-temporal dimensions with contextual data integration. Over time, graph neural networks (GNNs) have proven highly effective in capturing spatial interdependencies. Recent advances have introduced multi-GNNs (MGNNs), which incorporate more contextual insights to improve predictive accuracy. However, when MGNNs are applied to long-term spatio-temporal forecasting (LSTF), they encounter challenges such as limited generality, under-utilization of context, static graph merging methods, and overlooking dynamic interrelations. To address these issues, we propose novel graph structures that encode each node’s contextual information while fully exploiting long-term spatio-temporal dependencies. Furthermore, this research designs a dynamic multigraph fusion architecture that integrates spatial dimensions, temporal features, and graph attention mechanisms to simultaneously capture intragraph node correlations and cross-graph interactions. To strengthen relational analysis, trainable weight tensors are employed for quantitative evaluation of node importance across graphs. Systematic experiments on three large-scale benchmark datasets confirm that this approach achieves significant performance enhancement for existing GNNs in LSTF tasks.