No abstract

-This paper proposes an image encryption scheme based on chaotic system with changeable parameters depending on plain-image. A generalized Arnold map, whose control parameters are changeable and image-dependent during the iteration procedure, is utilized to generate chaotic orbits applied to permute the pixel positions. A diffusion function is also designed to realize the diffusion effect by piece-wise linear chaotic map. In both the permutation process and the diffusion process, the keystreams generated by chaotic maps are all strongly dependent on plain-image, and thereby can improve the encryption security efficiently. The major merits of the proposed image encryption scheme include a huge key space, good statistical nature resisting statistical analysis attack, differential attack, and good resistance against known-plaintext attack and chosenplaintext attack, etc. Experimental results have been carried out with detailed analysis to show that the proposed scheme can be a potential candidate for practical image encryption.

Object tracking is one of the most challenging problems in the field of computer vision. In challenging object tracking scenarios such as illumination variation, occlusion, motion blur and fast motion, existing algorithms can present decreased performances. To make better use of the various features of the image, we propose an object tracking method based on the self-adaptive feature selection (SAFS) algorithm, which can select the most distinguishable feature sub-template to guide the tracking task. The similarity of each feature sub-template can be calculated by the histogram of the features. Then, the distinguishability of the feature sub-template can be measured by their similarity matrix based on the maximum a posteriori (MAP). The selection task of the feature sub-template is transformed into the classification task between feature vectors by the above process and adopt modified Jeffreys’ entropy as the discriminant metric for classification, which can complete the update of the sub-template. Experiments with the eight video sequences in the Visual Tracker Benchmark dataset evaluate the comprehensive performance of SAFS and compare them with five baselines. Experimental results demonstrate that SAFS can overcome the difficulties caused by scene changes and achieve robust object tracking.

Object tracking has remained a challenging problem in recent years. Most of the trackers can not work well, especially when dealing with problems such as similarly colored backgrounds, object occlusions, low illumination, or sudden illumination changes in real scenes. A centroid iteration algorithm using multiple features and a posterior probability criterion is presented to solve these problems. The model representation of the object and the similarity measure are two key factors that greatly influence the performance of the tracker. Firstly, this paper propose using a local texture feature which is a generalization of the local binary pattern (LBP) descriptor, which we call the double center-symmetric local binary pattern (DCS-LBP). This feature shows great discrimination between similar regions and high robustness to noise. By analyzing DCS-LBP patterns, a simplified DCS-LBP is used to improve the object texture model called the SDCS-LBP. The SDCS-LBP is able to describe the primitive structural information of the local image such as edges and corners. Then, the SDCS-LBP and the color are combined to generate the multiple features as the target model. Secondly, a posterior probability measure is introduced to reduce the rate of matching mistakes. Three strategies of target model update are employed. Experimental results show that our proposed algorithm is effective in improving tracking performance in complicated real scenarios compared with some state-of-the-art methods.

China’s transportation industry has made great achievements in the past 40 years of reform and opening up. At the same time, it has gradually accumulated a series of problems. These problems have led to closer and more complex social and economic connection within and between regions of different scales. The existing research only carries out the characteristic analysis of urban network spatial connection and pattern from a single perspective such as “flow space” theory, spatial interaction model and accessibility method, and fails to accurately describe the complex socio-economic relations between regions. Based on the big data of railway passenger flow, this study selected weighted average travel time, railway network density, and the economic connection model to express the urban network spatial connection and structure of China in 2016 from the perspectives of time, space, and interaction. In 2016, the accessibility, connectivity, and total urban external economic connection of the railway network showed a trend of declining from the east to the west. The top 50 cities ranked by interurban economic connection were all located in the central and eastern regions and showed “diamond shape” distribution characteristics. The four diamond-shaped pairs were Beijing-Tianjin-Hebei, Yangtze River Delta, Pearl River Delta, and Chengyu urban agglomerations. This shape was basically in line with the T-shaped space that has existed for a long time in China’s regional development. The accessibility, connectivity, and total external economic connection of national-level urban agglomerations were greater than those of regional-level urban agglomerations, and far greater than those of local-level urban agglomerations. The results showed that there was a mismatch between the layout of the railway network and the population. It will still be necessary to focus on strengthening the construction of transportation infrastructure in urban agglomerations and densely populated areas in the future. This study enriches the “flow space” theory, more fully describes urban network spatial connection and structure in China by considering the three perspectives of time, space, and interaction, and can provides reasonable suggestions for the development of national comprehensive three-dimensional transportation network planning, regional spatial structure optimization, and sustainable development.

Artifacts are divergent strip artifacts or dark stripe artifacts in Industrial Computed Tomography (ICT) images due to large differences in density among the components of scanned objects, which can significantly distort the actual structure of scanned objects in ICT images. The presence of artifacts can seriously affect the practical application effectiveness of ICT in defect detection and dimensional measurement. In this paper, a series of convolution neural network models are designed and implemented based on preparing the ICT image artifact removal datasets. Our findings indicate that the RF (receptive field) and the spatial resolution of network can significantly impact the effectiveness of artifact removal. Therefore, we propose a dilated residual network for turbine blade ICT image artifact removal (DRAR), which enhances the RF of the network while maintaining spatial resolution with only a slight increase in computational load. Extensive experiments demonstrate that the DRAR achieves exceptional performance in artifact removal.

In recent years, thanks to the performance advantages of convolutional neural networks (CNNs), CNNs have been widely used in image denoising. However, most of the CNN-based image-denoising models cannot make full use of the redundancy of image data, which limits the expressiveness of the model. We propose a new image-denoising model that aims to extract the local features of the image through CNN and focus on the global information of the image through the attention similarity module (ASM), especially the global similarity details of the image. Furthermore, dilation convolution is used to enlarge the receptive field to better focus on the global features. Moreover, avg-pooling is used to smooth and suppress noise in the ASM to further improve model performance. In addition, through global residual learning, the effect is enhanced from shallow to deep layers. A large number of experiments show that our proposed model has a better image-denoising effect, including quantitative and visual results. It is more suitable for complex blind noise and real images.

Network information has become an important factor in today's social environment and network environment. With the large coverage of network data traffic and the new generation of network technology, illegal network data is also constantly invading the network environment, which has caused a serious network security threat. Therefore, the analysis and research of network data and the pre-judgment of feature types are of great significance. Based on the existing theoretical techniques, this paper proposes a Data Processing Algorithm Based on The Website Coding Structure (DPA) and a Multi-feature Network Construction Improvement Algorithm (MCIA), processing network data and analysis type prediction features. Experiments show that the data processing algorithm based on the website coding structure has the advantage of targeted processing of website data. It also verifies the validity of the proposed Digital Neighborhood Feature Set Algorithm (DNFA) and the improved algorithm for multi-feature network construction for data analysis. Application, compared with the existing single feature set, the pre-judgment basis for constructing multiple feature sets is more reliable, and the pre-judgment basis is more credible.