Search

JPEG is the international standard for still image encoding and is the most widely used compression algorithm because of its simple encoding process and low computational complexity. Recently, many methods have been developed to improve the quality of JPEG images by using deep learning. However, these methods require the use of high-performance devices since they need to perform neural network computation for decoding images. In this paper, we propose a method to generate high-quality images using deep learning without changing the decoding algorithm. The key idea is to reduce and smooth colors and gradient regions in the original images before JPEG compression. The reduction and smoothing can suppress red block noise and pseudo-contour in the compressed images. Furthermore, high-performance devices are unnecessary for decoding. The proposed method consists of two components: a color transformation network using deep learning and a pseudo-contour suppression model using signal processing. The experimental results showed that the proposed method outperforms standard JPEG in quality measurements correlated with human perception. [ABSTRACT FROM AUTHOR]

In the field of intelligent vehicle technology, there is a high dependence on images captured under challenging conditions to develop robust perception algorithms. However, acquiring these images can be both time-consuming and dangerous. To address this issue, unpaired image-to-image translation models offer a solution by synthesizing samples of the desired domain, thus eliminating the reliance on ground truth supervision. However, the current methods predominantly focus on single projections rather than multiple solutions, not to mention controlling the direction of generation, which creates a scope for enhancement. In this study, we propose a generative adversarial network (GAN)–based model, which incorporates both a style encoder and a content encoder, specifically designed to extract relevant information from an image. Further, we employ a decoder to reconstruct an image using these encoded features, while ensuring that the generated output remains within a permissible range by applying a self-regression module to constrain the style latent space. By modifying the hyperparameters, we can generate controllable outputs with specific style codes. We evaluate the performance of our model by generating snow scenes on the Cityscapes and the EuroCity Persons datasets. The results reveal the effectiveness of our proposed methodology, thereby reinforcing the benefits of our approach in the ongoing evolution of intelligent vehicle technology. [ABSTRACT FROM AUTHOR]

EEG decoding based on motor imagery is an important part of brain–computer interface technology and is an important indicator that determines the overall performance of the brain–computer interface. Due to the complexity of motor imagery EEG feature analysis, traditional classification models rely heavily on the signal preprocessing and feature design stages. End-to-end neural networks in deep learning have been applied to the classification task processing of motor imagery EEG and have shown good results. This study uses a combination of a convolutional neural network (CNN) and a long short-term memory (LSTM) network to obtain spatial information and temporal correlation from EEG signals. The use of cross-layer connectivity reduces the network gradient dispersion problem and enhances the overall network model stability. The effectiveness of this network model is demonstrated on the BCI Competition IV dataset 2a by integrating CNN, BiLSTM and ResNet (called CLRNet in this study) to decode motor imagery EEG. The network model combining CNN and BiLSTM achieved 87.0% accuracy in classifying motor imagery patterns in four classes. The network stability is enhanced by adding ResNet for cross-layer connectivity, which further improved the accuracy by 2.0% to achieve 89.0% classification accuracy. The experimental results show that CLRNet has good performance in decoding the motor imagery EEG dataset. This study provides a better solution for motor imagery EEG decoding in brain–computer interface technology research. [ABSTRACT FROM AUTHOR]

Zero-shot neural decoding aims to decode image categories, which were not previously trained, from functional magnetic resonance imaging (fMRI) activity evoked when a person views images. However, having insufficient training data due to the difficulty in collecting fMRI data causes poor generalization capability. Thus, models suffer from the projection domain shift problem when novel target categories are decoded. In this paper, we propose a zero-shot neural decoding approach with semi-supervised multi-view embedding. We introduce the semi-supervised approach that utilizes additional images related to the target categories without fMRI activity patterns. Furthermore, we project fMRI activity patterns into a multi-view embedding space, i.e., visual and semantic feature spaces of viewed images to effectively exploit the complementary information. We define several source and target groups whose image categories are very different and verify the zero-shot neural decoding performance. The experimental results demonstrate that the proposed approach rectifies the projection domain shift problem and outperforms existing methods. [ABSTRACT FROM AUTHOR]

In this paper, we consider a slot-controlled coded compressed sensing protocol for unsourced massive random access (URA) that concatenates a shared patterned Reed–Muller (PRM) inner codebook to an outer error-correction code. Due to the limitations of the geometry-based decoding algorithm in single-sequence settings and due to the message interference that may result in decreased decoding performance under multi-sequence circumstances, a list PRM projection algorithm and an iterative list PRM projection algorithm are proposed to supplant the signal detector associated with the inner PRM sequences in this paper. In detail, we first propose an enhanced path-saving algorithm, called list PRM projection detection, for use in single-user scenarios that maintains multiple candidates during the first few layers so as to remedy the risk of spreading errors. On this basis, we further propose an iterative list PRM projection algorithm for use in multi-user scenarios. The vectors for PRM codes and channel coefficients are jointly detected in an iterative manner, which offers significant improvements regarding the convergence rate for signal recovery. Furthermore, the performances of the proposed algorithms are analyzed mathematically, and we verify that the theoretical simulations are consistent with the numerical simulations. Finally, we concatenate the inner PRM codes that employ iterative list detection in two practical error-correction outer codes. According to the simulation results, we conclude that the packetized URA with the proposed iterative list projection detection works better than benchmarks in terms of the number of active users it can support in each slot and the amount of energy needed per bit to meet an expected error probability. [ABSTRACT FROM AUTHOR]

Steady-state visual evoked potential (SSVEP)-based brain–computer interface (BCI) systems have been extensively researched over the past two decades, and multiple sets of standard datasets have been published and widely used. However, there are differences in sample distribution and collection equipment across different datasets, and there is a lack of a unified evaluation method. Most new SSVEP decoding algorithms are tested based on self-collected data or offline performance verification using one or two previous datasets, which can lead to performance differences when used in actual application scenarios. To address these issues, this paper proposed a SSVEP dataset evaluation method and analyzed six datasets with frequency and phase modulation paradigms to form an SSVEP algorithm evaluation dataset system. Finally, based on the above datasets, performance tests were carried out on the four existing SSVEP decoding algorithms. The findings reveal that the performance of the same algorithm varies significantly when tested on diverse datasets. Substantial performance variations were observed among subjects, ranging from the best-performing to the worst-performing. The above results demonstrate that the SSVEP dataset evaluation method can integrate six datasets to form a SSVEP algorithm performance testing dataset system. This system can test and verify the SSVEP decoding algorithm from different perspectives such as different subjects, different environments, and different equipment, which is helpful for the research of new SSVEP decoding algorithms and has significant reference value for other BCI application fields. [ABSTRACT FROM AUTHOR]

We propose a novel slot-pattern-control based coded compressed sensing for unsourced random access with an outer A-channel code capable of correcting t errors. Specifically, an RM extension code called patterned Reed–Muller (PRM) code is proposed. We demonstrate the high spectral efficiency due to its enormous sequence space and prove the geometry property in the complex domain that enhances the reliability and efficiency of detection. Accordingly, a projective decoder based on its geometry theorem is also proposed. Next, the "patterned" property of the PRM code, which partitions the binary vector space into several subspaces, is further extended as the primary principle for designing a slot control criterion that reduces the number of simultaneous transmissions in each slot. The factors affecting the chance of sequence collisions are identified. Finally, the proposed scheme is implemented in two practical outer A-channel codes: (i) the t-tree code and (ii) the Reed–Solomon code with Guruswami–Sudan list decoding, and the optimal setups are determined to minimize SNR by optimizing the inner and outer codes jointly. In comparison with the existing counterpart, our simulation results confirm that the proposed scheme compares favorably with benchmark schemes regarding the energy-per-bit requirement to meet a target error probability as well as the number of accommodated active users in the system. [ABSTRACT FROM AUTHOR]

The use of Riemannian geometry decoding algorithms in classifying electroencephalography-based motor-imagery brain–computer interfaces (BCIs) trials is relatively new and promises to outperform the current state-of-the-art methods by overcoming the noise and nonstationarity of electroencephalography signals. However, the related literature shows high classification accuracy on only relatively small BCI datasets. The aim of this paper is to provide a study of the performance of a novel implementation of the Riemannian geometry decoding algorithm using large BCI datasets. In this study, we apply several Riemannian geometry decoding algorithms on a large offline dataset using four adaptation strategies: baseline, rebias, supervised, and unsupervised. Each of these adaptation strategies is applied in motor execution and motor imagery for both scenarios 64 electrodes and 29 electrodes. The dataset is composed of four-class bilateral and unilateral motor imagery and motor execution of 109 subjects. We run several classification experiments and the results show that the best classification accuracy is obtained for the scenario where the baseline minimum distance to Riemannian mean has been used. The mean accuracy values up to 81.5% for motor execution, and up to 76.4% for motor imagery. The accurate classification of EEG trials helps to realize successful BCI applications that allow effective control of devices. [ABSTRACT FROM AUTHOR]

There are six possible solutions for the surface normal vectors obtained from polarization information during 3D reconstruction. To resolve the ambiguity of surface normal vectors, scholars have introduced additional information, such as shading information. However, this makes the 3D reconstruction task too burdensome. Therefore, in order to make the 3D reconstruction more generally applicable, this paper proposes a complete framework to reconstruct the surface of an object using only polarized images. To solve the ambiguity problem of surface normal vectors, a jump-compensated U-shaped generative adversarial network (RU-Gan) based on jump compensation is designed for fusing six surface normal vectors. Among them, jump compensation is proposed in the encoder and decoder parts, and the content loss function is reconstructed, among other approaches. For the problem that the reflective region of the original image will cause the estimated normal vector to deviate from the true normal vector, a specular reflection model is proposed to optimize the dataset, thus reducing the reflective region. Experiments show that the estimated normal vector obtained in this paper improves the accuracy by about 20° compared with the previous conventional work, and improves the accuracy by about 1.5° compared with the recent neural network model, which means the neural network model proposed in this paper is more suitable for the normal vector estimation task. Furthermore, the object surface reconstruction framework proposed in this paper has the characteristics of simple implementation conditions and high accuracy of reconstructed texture. [ABSTRACT FROM AUTHOR]

We propose a distributed quasi-cyclic low-density parity-check (QC-LDPC) coded spatial modulation (D-QC-LDPCC-SM) scheme with source, relay and destination nodes. At the source and relay, two distinct QC-LDPC codes are used. The relay chooses partial source information bits for further encoding, and a distributed code corresponding to each selection is generated at the destination. To construct the best code, the optimal information bit selection algorithm by exhaustive search in the relay is proposed. However, the exhaustive-based search algorithm has large complexity for QC-LDPC codes with long block length. Then, we develop another low-complexity information bit selection algorithm by partial search. Moreover, the iterative decoding algorithm based on the three-layer Tanner graph is proposed at the destination to carry out joint decoding for the received signal. The recently developed polar-coded cooperative SM (PCC-SM) scheme does not adopt a better encoding method at the relay, which motivates us to compare it with the proposed D-QC-LDPCC-SM scheme. Simulations exhibit that the proposed exhaustive-based and partial-based search algorithms outperform the random selection approach by 1 and 1.2 dB, respectively. Because the proposed D-QC-LDPCC-SM system uses the optimized algorithm to select the information bits for further encoding, it outperforms the PCC-SM scheme by 3.1 dB. [ABSTRACT FROM AUTHOR]

With the development of smart logistics, current small distribution centers have begun to use intelligent equipment to indirectly read bar code information on courier sheets to carry out express sorting. However, limited by the cost, most of them choose relatively low-end sorting equipment in a warehouse environment that is complex. This single information identification method leads to a decline in the identification rate of sorting, affecting efficiency of the entire express sorting. Aimed at the above problems, an express recognition method based on deeper learning and multi-information fusion is proposed. The method is mainly aimed at bar code information and three segments of code information on the courier sheet, which is divided into two parts: target information detection and recognition. For the detection of target information, we used a method of deeper learning to detect the target, and to improve speed and precision we designed a target detection network based on the existing YOLOv4 network, Experiments show that the detection accuracy and speed of the redesigned target detection network were much improved. Next for recognition of two kinds of target information we first intercepted the image after positioning and used a ZBAR algorithm to decode the barcode image after interception. The we used Tesseract-OCR technology to identify the intercepted three segments code picture information, and finally output the information in the form of strings. This deeper learning-based multi-information identification method can help logistics centers to accurately obtain express sorting information from the database. The experimental results show that the time to detect a picture was 0.31 s, and the recognition accuracy was 98.5%, which has better robustness and accuracy than single barcode information positioning and recognition alone. [ABSTRACT FROM AUTHOR]

We propose a conceptually simple, general framework and end-to-end approach to point cloud completion, entitled PCA-Net. This approach differs from the existing methods in that it does not require a "simple" network, such as multilayer perceptrons (MLPs), to generate a coarse point cloud and then a "complex" network, such as auto-encoders or transformers, to enhance local details. It can directly learn the mapping between missing and complete points, ensuring that the structure of the input missing point cloud remains unchanged while accurately predicting the complete points. This approach follows the minimalist design of U-Net. In the encoder, we encode the point clouds into point cloud blocks by iterative farthest point sampling (IFPS) and k-nearest neighbors and then extract the depth interaction features between the missing point cloud blocks by the attention mechanism. In the decoder, we introduce a new trilinear interpolation method to recover point cloud details, with the help of the coordinate space and feature space of low-resolution point clouds, and missing point cloud information. This paper also proposes a method to generate multi-view missing point cloud data using a 3D point cloud hidden point removal algorithm, so that each 3D point cloud model generates a missing point cloud through eight uniformly distributed camera poses. Experiments validate the effectiveness and superiority of PCA-Net in several challenging point cloud completion tasks, and PCA-Net also shows great versatility and robustness in real-world missing point cloud completion. [ABSTRACT FROM AUTHOR]

This paper studies the secrecy coding analysis achieved by the self-jamming technique in the presence of an eavesdropper by considering a short-packet Full-Duplex (FD) transmission developed based on iterative blind or semi-blind channel estimation and advanced decoding algorithms. Indeed, the legitimate receiver and eavesdropper can simultaneously receive the intended signal from the transmitter and broadcast a self-jamming or jamming signal to the others. Unlike other conventional techniques without feedback, the blind or semi-blind algorithm applied at the legitimate receiver can simultaneously estimate, firstly, the Self-Interference (SI) channel to cancel the SI component and, secondly, estimate the propagation channel, then decode the intended messages by using 5G Quasi-Cyclic Low-Density Parity Check (QC-LDPC) codes. Taking into account the passive eavesdropper case, the blind channel estimation with a feedback scheme is applied, where the temporary estimation of the intended channel and the decoded message are fed back to improve both the channel estimation and the decoding processes. Only the blind algorithm needs to be implemented in the case of a passive eavesdropper because it achieves sufficient performances and does not require adding pilot symbols as the semi-blind algorithm. In the case of an active eavesdropper, based on its robustness in the low region of the Signal-to-Noise Ratio (SNR), the semi-blind algorithm is considered by trading four pilot symbols and only requiring the feedback for channel estimation processes in order to overcome the increase in noise in the legitimate receiver. The results show that the blind or semi-blind algorithms outperform the conventional algorithm in terms of Mean Square Error (MSE), Bit Error Rate (BER) and security gap ( S g ). In addition, it has been shown that the blind or semi-blind algorithms are less sensitive to high SI and self-jamming interference power levels imposed by secured FD transmission than the conventional algorithms without feedback. [ABSTRACT FROM AUTHOR]

In order to improve the performance of non-binary low-density parity check codes (LDPC) hard decision decoding algorithm and to reduce the complexity of decoding, a sum of the magnitude for hard decision decoding algorithm based on loop update detection is proposed. This will also ensure the reliability, stability and high transmission rate of 5G mobile communication. The algorithm is based on the hard decision decoding algorithm (HDA) and uses the soft information from the channel to calculate the reliability, while the sum of the variable nodes' (VN) magnitude is excluded for computing the reliability of the parity checks. At the same time, the reliability information of the variable node is considered and the loop update detection algorithm is introduced. The bit corresponding to the error code word is flipped multiple times, before this is searched in the order of most likely error probability to finally find the correct code word. Simulation results show that the performance of one of the improved schemes is better than the weighted symbol flipping (WSF) algorithm under different hexadecimal numbers by about 2.2 dB and 2.35 dB at the bit error rate (BER) of 10-5 over an additive white Gaussian noise (AWGN) channel, respectively. Furthermore, the average number of decoding iterations is significantly reduced. [ABSTRACT FROM AUTHOR]

Unsourced random access (URA) has emerged as a pragmatic framework for next-generation distributed sensor networks. Within URA, concatenated coding structures are often employed to ensure that the central base station can accurately recover the set of sent codewords during a given transmission period. Many URA algorithms employ independent inner and outer decoders, which can help reduce computational complexity at the expense of a decay in performance. In this article, an enhanced decoding algorithm is presented for a concatenated coding structure consisting of a wide range of inner codes and an outer tree-based code. It is shown that this algorithmic enhancement has the potential to simultaneously improve error performance and decrease the computational complexity of the decoder. This enhanced decoding algorithm is applied to two existing URA algorithms, and the performance benefits of the algorithm are characterized. Findings are supported by numerical simulations. [ABSTRACT FROM AUTHOR]

Multi-input multi-output (MIMO) transmission schemes have become the techniques of choice for increasing spectral efficiency in bandwidth-congested areas. However, the design of cost-effective receivers for MIMO channels remains a challenging task. The maximum likelihood detector can achieve excellent performance—usually, the best performance—but its computational complexity is a limiting factor in practical implementation. In the present work, a novel MIMO scheme using a practically feasible decoding algorithm based on the phase transmittance radial basis function (PTRBF) neural network is proposed. For some practical scenarios, the proposed scheme achieves improved receiver performance with lower computational complexity relative to the maximum likelihood decoding, thus substantially increasing the applicability of the algorithm. Simulation results are presented for MIMO-OFDM under 5G wireless Rayleigh channels so that a fair performance comparison with other reference techniques can be established. [ABSTRACT FROM AUTHOR]

Cooperative communication in wireless sensor network (WSN) explores the energy efficient wireless communication schemes between multiple sensors and data gathering node (DGN) by exploiting multiple input multiple output (MIMO) and multiple input single output (MISO) configurations. In this paper, an energy efficient cooperative MIMO (C-MIMO) technique is proposed where low density parity check (LDPC) code is used as an error correcting code. The rate of LDPC code is varied by varying the length of message and parity bits. Simulation results show that the cooperative communication scheme outperforms SISO scheme in the presence of LDPC code. LDPC codes with different code rates are compared using bit error rate (BER) analysis. BER is also analyzed under different Nakagami fading scenario. Energy efficiencies are compared for different targeted probability of bit error pb. It is observed that C-MIMO performs more efficiently when the targeted pb is smaller. Also the lower encoding rate for LDPC code offers better error characteristics. [ABSTRACT FROM AUTHOR]

Ambient backscatter communication enables passive sensors to convey sensing data on ambient RF signals in the air at ultralow power consumption. To extract data bits from such signals, threshold-based decoding has generally been considered, but suffers against Wi-Fi signals due to severe fluctuation of OFDM signals. In this paper, we propose a pattern-matching-based decoding algorithm for Wi-Fi backscatter communications. The key idea is the identification of unique patterns of signal samples that arise from the inevitable smoothing of Wi-Fi signals to filter out noisy fluctuation. We provide the mathematical basis of obtaining the pattern of smoothed signal samples as the slope of a line expressed in a closed-form equation. Then, the new decoding algorithm was designed to identify the pattern of received signal samples as a slope rather than classifying their amplitude levels. Thus, it is more robust against signal fluctuation and does not need tricky threshold configuration. Moreover, for even higher reliability, the pattern was identified for a pair of adjacent bits, and the algorithm decodes a bit pair at a time rather than a single bit. We demonstrate via testbed experiments that the proposed algorithm significantly outperforms conventional threshold-based decoding variants in terms of bit error rate for various distances and data rates. [ABSTRACT FROM AUTHOR]

The number of exoskeletons providing load-lifting assistance has significantly increased over the last decade. In this field, to take full advantage of active exoskeletons and provide appropriate assistance to users, it is essential to develop control systems that are able to reliably recognize and classify the users' movement when performing various lifting tasks. To this end, the movement-decoding algorithm should work robustly with different users and recognize different lifting techniques. Currently, there are no studies presenting methods to classify different lifting techniques in real time for applications with lumbar exoskeletons. We designed a real-time two-step algorithm for a portable hip exoskeleton that can detect the onset of the lifting movement and classify the technique used to accomplish the lift, using only the exoskeleton-embedded sensors. To evaluate the performance of the proposed algorithm, 15 healthy male subjects participated in two experimental sessions in which they were asked to perform lifting tasks using four different techniques (namely, squat lifting, stoop lifting, left-asymmetric lifting, and right-asymmetric lifting) while wearing an active hip exoskeleton. Five classes (the four lifting techniques plus the class "no lift") were defined for the classification model, which is based on a set of rules (first step) and a pattern recognition algorithm (second step). Leave-one-subject-out cross-validation showed a recognition accuracy of 99.34 ± 0.85%, and the onset of the lift movement was detected within the first 121 to 166 ms of movement. [ABSTRACT FROM AUTHOR]

With the deepening of modern military reforms, information has become the key to winning modern warfare. The use of unmanned aerial vehicle (UAV) to capture image information has become an important means of reconnaissance in modern warfare and plays an irreplaceable role. The image information usually uses a wireless image transmission system, since image information is intercepted or stolen easily during the information transmission, encrypting an image is a common method for ensuring image security. However, traditional encryption algorithms have some deficiencies in terms of efficiency and security. In order to overcome these shortcomings, a new algorithm is proposed in this paper-an improved image scrambling encryption algorithm based on Fibonacci-p coding. The first new idea of the algorithm is to separate the positive and negative signs and data of the scrambled DCT coefficients, then form the symbol matrix and the data matrix respectively, perform the scrambling encryption operation on the symbol matrix. The second new idea is to encrypt the color RGB image by converting the R, G, and B colors into Y, Cb, and Cr, and converting the normal image operation into operations on Y, Cb, and Cr, thereby implementing the encryption operation. The comprehensive performance of the algorithm is optimal with different image information. Experiments results validate the favorable performance of the proposed improved encryption algorithm. [ABSTRACT FROM AUTHOR]