Search

For covert communication in lossy channels, it is necessary to consider that the carrier of the hidden watermark will undergo multiple image-processing attacks. In order to ensure that secret information can be extracted without distortion from the watermarked images that have undergone attacks, in this paper, we design a novel fragmented secure communication system. The sender will fragment the secret data to be transmitted and redundantly hide it in a large number of multimodal carriers of messenger accounts on multiple social platforms. The receiver receives enough covert carriers, extracts each fragment, and concatenates the transmitted secret data. This article uses the image carrier as an example to fragment the text file intended for transmission and embeds it into a large number of images, with each fragment being redundant and embedded into multiple images. In this way, at the receiving end, only enough stego images need to be received to extract the information in each image, and then concatenate the final secret file. In order to resist various possible attacks during image transmission, we propose a strong robust image watermarking method. This method adopts a watermark layer based on DFT, which has high embedding and detection efficiency and good invisibility. Secondly, a watermark layer based on DCT is adopted, which can resist translation attacks, JPEG attacks, and other common attacks. Experiments have shown that our watermarking method is very fast; both the embedding time and the extraction time are less than 0.15 s for images not larger than 2000 × 2000 . Our watermarking method has very good invisibility with 41 dB PSNR on average. And our watermarking method is more robust than existing schemes and robust to nearly all kinds of attacks. Based on this strong robust image watermarking method, the scheme of fragmenting and hiding redundant transmission content into a large number of images is effective and practical. Our scheme can 100% restore the secret file completely under different RST or hybrid attacks, such as rotation by 1 degree and 5 degrees, scaling by 1.25 and 0.8, and cropping by 10% and 25%. Our scheme can successfully restore the secret file completely even if 30% of received images are lost. When 80% of received images are lost, our scheme can still restore 61.1% of the secret file. If all stego images can be obtained, the original text file can be completely restored. [ABSTRACT FROM AUTHOR]

Watermarking is an excellent solution to protect multimedia privacy but will be damaged by attacks such as noise adding, image filtering, compression, and especially scaling and cutting. In this paper, we propose a watermarking scheme to embed the watermark in the DWT-DCT composite transform coefficients, which is robust against normal image processing operations and geometric attacks. To make our scheme robust to scaling operations, a resampling detection network is trained to detect the scaling factor and then rescale the scaling-attacked image before watermark detection. To make our scheme robust to cutting operations, a template watermark is embedded in the Y channel to locate the cutting position. Experiments for various low- and high-resolution images reveal that our scheme has excellent performance in terms of imperceptibility and robustness. [ABSTRACT FROM AUTHOR]

Portable document format (PDF) files are widely used in file transmission, exchange, and circulation because of their platform independence, small size, good browsing quality, and the ability to place hyperlinks. However, their security issues are also more thorny. It is common to distribute printed PDF files to different groups and individuals after printing. However, most PDF watermarking algorithms currently cannot resist print–scan attacks, making it difficult to apply them in leak tracing of both paper and scanned versions of PDF documents. To tackle this issue, we propose an invisible digital watermarking technology based on modifying the edge pixels of text strokes to hide information in PDFs, which achieves high robustness to print–scan attacks. Moreover, it cannot be detected by human perception systems. This method focuses on the representation of text by embedding watermarks by changing the features of the text to ensure that changes in these features can be reflected in the scanned PDF after printing. We first segment each text line into two sub-blocks, then select the row of pixels with the most black pixels, and flip the edge pixels closest to this row. This method requires the participation of original PDF documents in detection. The experimental results show that all peak signal-to-noise ratio (PSNR) values of our proposed method exceed 32 dB, which indicates satisfactory invisibility. Meanwhile, this method can extract the hidden information with 100% accuracy under the JPEG compression attack, and has high robustness against noise attacks and print–scan attacks. In the case of no attacks, the watermark can be recovered without any loss. In terms of practical applications, our method can be applied in the practical leak tracing of official paper documents after distribution. [ABSTRACT FROM AUTHOR]

In order to more effectively monitor and interfere with enemy signals, it is particularly important to accurately and efficiently identify the intercepted signals and estimate their parameters in the increasingly complex electromagnetic environment. Therefore, in non-cooperative situations, it is of great practical significance to study how to accurately detect direct sequence spread spectrum (DSSS) signals in real time and estimate their parameters. The traditional time-delay correlation algorithm encounters the challenges such as peak energy leakage and false peak interference. As an alternative, this paper introduces a Pseudo-Noise (PN) code period estimation method utilizing a one-dimensional (1D) convolutional neural network based on the residual network (CNN-ResNet). This method transforms the problem of spread spectrum code period estimation into a multi-classification problem of spread spectrum code length estimation. Firstly, the In-phase/Quadrature(I/Q) two-way of the received DSSS signals is directly input into the CNN-ResNet model, which will automatically learn the characteristics of the DSSS signal with different PN code lengths and then estimate the PN code length. Simulation experiments are conducted using a data set with DSSS signals ranging from −20 to 10 dB in terms of signal-to-noise ratios (SNRs). Upon training and verifying the model using BPSK modulation, it is then put to the test with QPSK-modulated signals, and the estimation performance was analyzed through metrics such as loss function, accuracy rate, recall rate, and confusion matrix. The results demonstrate that the 1D CNN-ResNet proposed in this paper is capable of effectively estimating the PN code period of the non-cooperative DSSS signal, exhibiting robust generalization abilities. [ABSTRACT FROM AUTHOR]

With the wide application of direct sequence spread spectrum (DSSS) signals, the comprehensive performance of DSSS communication systems has been continuously improved, making the electronic reconnaissance link in communication countermeasures more difficult. Electronic reconnaissance technology, as the fundamental means of modern electronic warfare, mainly includes signal detection, recognition, and parameter estimation. At present, research on DSSS detection algorithms is mostly based on the correlation characteristics of DSSS signals, and autocorrelation algorithm is the most mature and widely used method in practical engineering. With the continuous development of deep learning, deep-learning-based methods have gradually been introduced to replace traditional algorithms in the field of signal processing. This paper proposes a spread spectrum signal detection method based on convolutional neural network (CNN). Through experimental analysis, the detection performance of the CNN model proposed in this paper on DSSS signals in various situations has been compared and analyzed with traditional autocorrelation detection methods for different signal-to-noise ratios. The experiments verified the estimation performance of the model in this paper under different signal-to-noise ratios, different spreading code lengths, different spreading code types, and different modulation methods and compared it with the autocorrelation detection algorithm. It was found that the detection performance of the model in this paper was higher than that of the autocorrelation detection method, and the overall performance was improved by 4 dB. [ABSTRACT FROM AUTHOR]

The purpose of image dehazing is to remove the interference from weather factors in degraded images and enhance the clarity and color saturation of images to maximize the restoration of useful features. Single image dehazing is one of the most important tasks in the field of image restoration. In recent years, due to the progress of deep learning, single image dehazing has made great progress. With the success of Transformer in advanced computer vision tasks, some research studies also began to apply Transformer to image dehazing tasks and obtained surprising results. However, both the deconvolution-neural-network-based dehazing algorithm and Transformer based dehazing algorithm magnify their advantages and disadvantages separately. Therefore, this paper proposes a novel Transformer–Convolution fusion dehazing network (TCFDN), which uses Transformer's global modeling ability and convolutional neural network's local modeling ability to improve the dehazing ability. In the Transformer–Convolution fusion dehazing network, the classic self-encoder structure is used. This paper proposes a Transformer–Convolution hybrid layer, which uses an adaptive fusion strategy to make full use of the Swin-Transformer and convolutional neural network to extract and reconstruct image features. On the basis of previous research, this layer further improves the ability of the network to remove haze. A series of contrast experiments and ablation experiments not only proved that the Transformer–Convolution fusion dehazing network proposed in this paper exceeded the more advanced dehazing algorithm, but also provided solid and powerful evidence for the basic theory on which it depends. [ABSTRACT FROM AUTHOR]

At many construction sites, whether to wear a helmet is directly related to the safety of the workers. Therefore, the detection of helmet use has become a crucial monitoring tool for construction safety. However, most of the current helmet wearing detection algorithms are only dedicated to distinguishing pedestrians who wear helmets from those who do not. In order to further enrich the detection in construction scenes, this paper builds a dataset with six cases: not wearing a helmet, wearing a helmet, just wearing a hat, having a helmet, but not wearing it, wearing a helmet correctly, and wearing a helmet without wearing the chin strap. On this basis, this paper proposes a practical algorithm for detecting helmet wearing states based on the improved YOLOv5s algorithm. Firstly, according to the characteristics of the label of the dataset constructed by us, the K-means method is used to redesign the size of the prior box and match it to the corresponding feature layer to increase the accuracy of the feature extraction of the model; secondly, an additional layer is added to the algorithm to improve the ability of the model to recognize small targets; finally, the attention mechanism is introduced in the algorithm, and the CIOU_Loss function in the YOLOv5 method is replaced by the EIOU_Loss function. The experimental results indicate that the improved algorithm is more accurate than the original YOLOv5s algorithm. In addition, the finer classification also significantly enhances the detection performance of the model. [ABSTRACT FROM AUTHOR]

Inventory is the basis of business activities; inventory management helps industries keep their inventories stocked with reasonable quantities, which ensures consumers demand while minimizing storage costs. The traditional manual inventory management has low efficiency and a high labor cost. In this paper, we used improved YOLOv3 to detect the cups stored on the warehouse shelves and counted their numbers to realize automated inventory management. The warehouse images are collected by the camera and transmitted to the industrial computer, which runs the YOLOv3 network. There are three feature maps in YOLOv3, the two smaller feature maps and the structure behind them are removed, and the k-means algorithm is used to optimize the default anchor size. Moreover, the detection range is limited to a specified area. Experiments show that, by eliminating those two feature maps, the network parameter is reduced from 235 MB to 212 MB, and detection FPS is improved from 48.15 to 54.88 while mAP is improved from 95.65% to 96.65% on our test dataset. The new anchors obtained by the k-means algorithm further improve the mAP to 96.82%. With those improvements, the average error rate of detection is reduced to 1.61%. Restricted detection areas eliminate irrelevant items to ensure the high accuracy of the detection result. The accurately counted number of cups and its change provide significant data for inventory management. [ABSTRACT FROM AUTHOR]