An improved Retinex fusion image enhancement algorithm is proposed for the traditional image denoising methods and problems of halo enlargement and image overexposure after image enhancement caused by the existing Retinex algorithm. First, a homomorphic filtering algorithm is used to enhance each RGB component of the underground coal mine surveillance image and convert the image from RGB space to HSV space. Second, bilateral filtering and multi-scale retinex with color restoration (MSRCR) fusion algorithms are used to enhance the luminance V component while keeping the hue H component unchanged. Third, adaptive nonlinear stretching transform is used for the saturation S-component. Last, the three elements are combined and converted back to RGB space. MATLAB simulation experiments verify the superiority of the improved algorithm. Based on the same dataset and experimental environment, the improved algorithm has a more uniform histogram distribution than the multi-scale Retinex (msr) algorithm and MSRCR algorithm through comparative experiments. At the same time, the peak signal-to-noise ratio (PSNR), structural similarity (SSIM), standard deviation, average gradient, mean value, and colour picture information entropy of the images were improved by 8.28, 0.15, 4.39, 7.38, 52.92 and 2.04, respectively, compared to the MSR algorithm, and 3.97, 0.02, 34.33, 60.46, 26.21, and 1.33, respectively, compared to the MSRCR algorithm. The experimental results show that the image quality, brightness and contrast of the images enhanced by the improved Retinex algorithm are significantly enhanced, and the amount of information in the photos increases, the halo and overexposure in the images are considerably reduced, and the anti-distortion performance is also improved.

No abstract

<abstract><p>Sparse mobile crowd sensing saves perception cost by recruiting a small number of users to perceive data from a small number of sub-regions, and then inferring data from the remaining sub-regions. The data collected by different people on their respective trajectories have different values, and we can select participants who can collect high-value data based on their trajectory predictions. In this paper, we study two aspects of user trajectory prediction and user recruitment. First, we propose an STGCN-GRU user trajectory prediction algorithm, which uses the STGCN algorithm to extract features related to temporal and spatial information from the trajectory map, and then inputs the feature sequences into GRU for trajectory prediction, and this algorithm improves the accuracy of user trajectory prediction. Second, an ADQN (action DQN) user recruitment algorithm is proposed.The ADQN algorithm improves the objective function in DQN on the idea of reinforcement learning. The action with the maximum input value is found from the Q network, and then the output value of the objective function of the corresponding action Q network is found. This reduces the overestimation problem that occurs in Q networks and improves the accuracy of user recruitment. The experimental results show that the evaluation metrics FDE and ADE of the STGCN-GRU algorithm proposed in this paper are better than other representative algorithms. And the experiments on two real datasets verify the effectiveness of the ADQN user selection algorithm, which can effectively improve the accuracy of data inference under budget constraints.</p></abstract>

No abstract

<abstract><p>As a public infrastructure service, remote sensing data provided by smart cities will go deep into the safety field and realize the comprehensive improvement of urban management and services. However, it is challenging to detect criminal individuals with abnormal features from massive sensing data and identify groups composed of criminal individuals with similar behavioral characteristics. To address this issue, we study two research aspects: pickpocketing individual detection and pickpocketing group identification. First, we propose an IForest-FD pickpocketing individual detection algorithm. The IForest algorithm filters the abnormal individuals of each feature extracted from ticketing and geographic information data. Through the filtered results, the factorization machines (FM) and deep neural network (DNN) (FD) algorithm learns the combination relationship between low-order and high-order features to improve the accuracy of identifying pickpockets composed of factorization machines and deep neural networks. Second, we propose a community relationship strength (CRS)-Louvain pickpocketing group identification algorithm. Based on crowdsensing, we measure the similarity of temporal, spatial, social and identity features among pickpocketing individuals. We then use the weighted combination similarity as an edge weight to construct the pickpocketing association graph. Furthermore, the CRS-Louvain algorithm improves the modularity of the Louvain algorithm to overcome the limitation that small-scale communities cannot be identified. The experimental results indicate that the IForest-FD algorithm has better detection results in Precision, Recall and F1score than similar algorithms. In addition, the normalized mutual information results of the group division effect obtained by the CRS-Louvain pickpocketing group identification algorithm are better than those of other representative methods.</p></abstract>