No abstract

The secure transmission of data within a network has received great attention. As the core of the security management mechanism, the key management scheme design needs further research. In view of the safety and energy consumption problems in recent papers, we propose a key management scheme based on the pairing-free identity based digital signature (PF-IBS) algorithm for heterogeneous wireless sensor networks (HWSNs). Our scheme uses the PF-IBS algorithm to complete message authentication, which is safer and more energy efficient than some recent schemes. Moreover, we use the base station (BS) as the processing center for the huge data in the network, thereby saving network energy consumption and improving the network life cycle. Finally, we indirectly prevent the attacker from capturing relay nodes that upload data between clusters in the network (some cluster head nodes cannot communicate directly). Through performance evaluation, the scheme we proposed reasonably sacrifices part of the storage space in exchange for entire network security while saving energy consumption.

Considerable research and surveys indicate that skin lesions are an early symptom of skin cancer. Segmentation of skin lesions is still a hot research topic. Dermatological datasets in skin lesion segmentation tasks generated a large number of parameters when data augmented, limiting the application of smart assisted medicine in real life. Hence, this paper proposes an effective feedback attention network (FAC-Net). The network is equipped with the feedback fusion block (FFB) and the attention mechanism block (AMB), through the combination of these two modules, we can obtain richer and more specific feature mapping without data enhancement. Numerous experimental tests were given by us on public datasets (ISIC2018, ISBI2017, ISBI2016), and a good deal of metrics like the Jaccard index (JA) and Dice coefficient (DC) were used to evaluate the results of segmentation. On the ISIC2018 dataset, we obtained results for DC equal to 91.19% and JA equal to 83.99%, compared with the based network. The results of these two main metrics were improved by more than 1%. In addition, the metrics were also improved in the other two datasets. It can be demonstrated through experiments that without any enhancements of the datasets, our lightweight model can achieve better segmentation performance than most deep learning architectures.

The protection of video data has become a hot topic of research. Researchers have proposed a series of coding algorithms to ensure the safe and efficient transmission of video information. We propose an encryption scheme that can protect video information with higher security by combining the video coding algorithm with encryption algorithm. The H.264/AVC encoding algorithm encodes the video into multiple slices, and the slices are independent of each other. With this feature, we encrypt each slice while using the cipher feedback (CFB) mode of the advanced encryption standard (AES) with the dynamic key. The key is generated by the pseudo-random number generator (PRNG) and updated in real time. The encryption scheme goes through three phases: constructing plaintext, encrypting plaintext, and replacing the original bitstream. In our scheme, we encrypt the code stream after encoding, so it does not affect the coding efficiency. The purpose of the CFB mode while using the AES encryption algorithm is to maintain the exact same bit rate and produce a format compatible bitstream. This paper proposes a new four-dimensional (4-D) hyperchaotic algorithm to protect data privacy in order to further improve the security of video encryption. Symmetric encryption requires that the same key is used for encryption and decoding. In this paper, the symmetry method is used to protect the privacy of video data due to the large amount of video encrypted data. In the experiment, we evaluated the proposed algorithm while using different reference video sequences containing motion, texture, and objects.

No abstract

With the development of multimedia technology, the secure image retrieval scheme has become a hot research topic. However, how to further improve algorithm performance in the ciphertext needs to be further explored. In this paper, we propose a secure image retrieval scheme based on a deep hash algorithm for index encryption and an improved 4-Dimensional(4-D)hyperchaotic system. The main contributions of this paper are as follows: (1) A novel secure retrieval scheme is proposed to control data transmission. (2) An improved 4-D hyperchaotic system is proposed to preserve privacy. (3) We propose an improved deep pairwise-supervised hashing (DPSH) algorithm and secure kNN to perform index encryption and propose an improved loss function to train the network model. (4) A secure access control scheme is shown, which aims to achieve secure access for users. The experimental results show that the proposed scheme has better retrieval efficiency and better security.

As a sub-direction of image retrieval, person re-identification (Re-ID) is usually used to solve the security problem of cross camera tracking and monitoring. A growing number of shopping centers have recently attempted to apply Re-ID technology. One of the development trends of related algorithms is using an attention mechanism to capture global and local features. We notice that these algorithms have apparent limitations. They only focus on the most salient features without considering certain detailed features. People’s clothes, bags and even shoes are of great help to distinguish pedestrians. We notice that global features usually cover these important local features. Therefore, we propose a dual branch network based on a multi-scale attention mechanism. This network can capture apparent global features and inconspicuous local features of pedestrian images. Specifically, we design a dual branch attention network (DBA-Net) for better performance. These two branches can optimize the extracted features of different depths at the same time. We also design an effective block (called channel, position and spatial-wise attention (CPSA)), which can capture key fine-grained information, such as bags and shoes. Furthermore, based on ID loss, we use complementary triplet loss and adaptive weighted rank list loss (WRLL) on each branch during the training process. DBA-Net can not only learn semantic context information of the channel, position, and spatial dimensions but can integrate detailed semantic information by learning the dependency relationships between features. Extensive experiments on three widely used open-source datasets proved that DBA-Net clearly yielded overall state-of-the-art performance. Particularly on the CUHK03 dataset, the mean average precision (mAP) of DBA-Net achieved 83.2%.

Hashing algorithm has attracted great attention in recent years. In order to improve the query speed and retrieval accuracy, this paper proposes an adaptive and asymmetric residual hash (AASH) algorithm based on residual hash, integrated learning, and asymmetric pairwise loss. The specific description of the AASH algorithm is as follows: 1) the integrated learning model is proposed based on transfer learning and multi-feature fusion strategy to learn the database hash code; 2) the residual hash model is proposed based on ResNet-50 to learn the query image hash code; 3) the asymmetric pairwise loss is proposed and the parameters of the residual hash model is optimized based on the database hash code; 4) the algorithm learns the database hash code and the query image hash code in an asymmetric manner, and integrates the feature learning part and the hash-coded part in one frame. The experimental results on three different datasets fully demonstrate that the proposed AASH method has better performance than most symmetric and asymmetric deep hash algorithms. Specifically, the optimal result of the AASH algorithm is 0.971 on Cifar10 when the hyperparameter is 100 and the hash code length is 32. The optimal result of the AASH algorithm is 0.945 on ceil images when the hyperparameter is 10 and the hash code length is 24. The optimal result of the AASH algorithm is 0.945 on FD-XJ when the hyperparameter is 15 and the hash code length is 32. In addition, the algorithm verifies convergence, time loss, and effectiveness. INDEX TERMSResidual hash, asymmetric manner, adaptive and asymmetric residual hash (AASH), information search, hash coding.