Search

Brain machine interfaces (BMIs) can substantially improve the quality of life of elderly or disabled people. However, performing complex action sequences with a BMI system is onerous because it requires issuing commands sequentially. Fundamentally different from this, we have designed a BMI system that reads out mental planning activity and issues commands in a proactive manner. To demonstrate this, we recorded brain activity from freely-moving monkeys performing an instructed task and decoded it with an energy-efficient, small and mobile field-programmable gate array hardware decoder triggering real-time action execution on smart devices. Core of this is an adaptive decoding algorithm that can compensate for the day-by-day neuronal signal fluctuations with minimal re-calibration effort. We show that open-loop planning-ahead control is possible using signals from primary and pre-motor areas leading to significant time-gain in the execution of action sequences. This novel approach provides, thus, a stepping stone towards improved and more humane control of different smart environments with mobile brain machine interfaces. [ABSTRACT FROM AUTHOR]

Brain machine interfaces (BMIs) can substantially improve the quality of life of elderly or disabled people. However, performing complex action sequences with a BMI system is onerous because it requires issuing commands sequentially. Fundamentally different from this, we have designed a BMI system that reads out mental planning activity and issues commands in a proactive manner. To demonstrate this, we recorded brain activity from freely-moving monkeys performing an instructed task and decoded it with an energy-efficient, small and mobile field-programmable gate array hardware decoder triggering real-time action execution on smart devices. Core of this is an adaptive decoding algorithm that can compensate for the day-by-day neuronal signal fluctuations with minimal re-calibration effort. We show that open-loop planning-ahead control is possible using signals from primary and pre-motor areas leading to significant time-gain in the execution of action sequences. This novel approach provides, thus, a stepping stone towards improved and more humane control of different smart environments with mobile brain machine interfaces. [ABSTRACT FROM AUTHOR]

An adaptively hybrid method was proposed to improve the performance of fractal coding methods. First, it is found that the range blocks with large variances (RBLVs) play a crucial role in degrading decoded images, and the effect of the remaining range blocks with small variances (RBSVs) can be ignored. Then, an adaptive method was proposed to divide the range blocks into the above two categories: RBLVs and RBSVs. Second, RBLVs were designed to be encoded in an extended domain block pool (EDBP). Then, better block‐matching effect can be obtained, which will result in better decoded image quality. Further, the no‐search fractal encoding method is adopted for RBSVs to achieve faster encoding speed and fewer bits per pixel (bpp). Finally, four fractal coding methods were adopted to assess the performance of the proposed method. Experimental results show that compared with the previous methods, the PSNR quality of decoded images in the proposed method can be improved by about 0.15–0.4 dB, about 20%–35% of the total computations in encoding process can be saved, and about 0.2 bpp can be saved. Moreover, under the same decoding time, the proposed method can achieve comparable or smaller deviations regarding the decoded image. [ABSTRACT FROM AUTHOR]

In this paper, we consider a downlink non-orthogonal multiple access (NOMA) system over Nakagami-m channels. The single-antenna base station serves two single-antenna NOMA users based on statistical channel state information (CSI). We derive the closed-form expression of the exact outage probability under a given decoding order, and we also deduce the asymptotic outage probability and diversity order in a high-SNR regime. Then, we analyze all the possible power allocation ranges and theoretically prove the optimal power allocation range under the corresponding decoding order. The demarcation points of the optimal power allocation ranges are affected by target data rates and total power, without an effect from the CSI. In particular, the values of the demarcation points are proportional to the total power. Furthermore, we formulate a joint decoding order and power allocation optimization problem to maximize the sum throughput, which is solved by efficiently searching in our obtained optimal power allocation ranges. Finally, Monte Carlo simulations are conducted to confirm the accuracy of our derived exact outage probability. Numerical results show the accuracy of our deduced demarcation points of the optimal power allocation ranges. And the optimal decoding order is not constant at different total transmit power levels. [ABSTRACT FROM AUTHOR]

The rapid serial visual presentation-based brain–computer interface (RSVP-BCI) system achieves the recognition of target images by extracting event-related potential (ERP) features from electroencephalogram (EEG) signals and then building target classification models. Currently, how to reduce the training and calibration time for classification models across different subjects is a crucial issue in the practical application of RSVP. To address this issue, a zero-calibration (ZC) method termed Attention-ProNet, which involves meta-learning with a prototype network integrating multiple attention mechanisms, was proposed in this study. In particular, multiscale attention mechanisms were used for efficient EEG feature extraction. Furthermore, a hybrid attention mechanism was introduced to enhance model generalization, and attempts were made to incorporate suitable data augmentation and channel selection methods to develop an innovative and high-performance ZC RSVP-BCI decoding model algorithm. The experimental results demonstrated that our method achieved a balance accuracy (BA) of 86.33% in the decoding task for new subjects. Moreover, appropriate channel selection and data augmentation methods further enhanced the performance of the network by affording an additional 2.3% increase in BA. The model generated by the meta-learning prototype network Attention-ProNet, which incorporates multiple attention mechanisms, allows for the efficient and accurate decoding of new subjects without the need for recalibration or retraining. [ABSTRACT FROM AUTHOR]

The prediction of molecular interactions is vital for drug discovery. Existing methods often focus on individual prediction tasks and overlook the relationships between them. Additionally, certain tasks encounter limitations due to insufficient data availability, resulting in limited performance. To overcome these limitations, we propose KGE-UNIT, a unified framework that combines knowledge graph embedding (KGE) and multi-task learning, for simultaneous prediction of drug–target interactions (DTIs) and drug–drug interactions (DDIs) and enhancing the performance of each task, even when data availability is limited. Via KGE, we extract heterogeneous features from the drug knowledge graph to enhance the structural features of drug and protein nodes, thereby improving the quality of features. Additionally, employing multi-task learning, we introduce an innovative predictor that comprises the task-aware Convolutional Neural Network-based (CNN-based) encoder and the task-aware attention decoder which can fuse better multimodal features, capture the contextual interactions of molecular tasks and enhance task awareness, leading to improved performance. Experiments on two imbalanced datasets for DTIs and DDIs demonstrate the superiority of KGE-UNIT, achieving high area under the receiver operating characteristics curves (AUROCs) (0.942, 0.987) and area under the precision-recall curve (AUPRs) (0.930, 0.980) for DTIs and high AUROCs (0.975, 0.989) and AUPRs (0.966, 0.988) for DDIs. Notably, on the LUO dataset where the data were more limited, KGE-UNIT exhibited a more pronounced improvement, with increases of 4.32 |$\%$| in AUROC and 3.56 |$\%$| in AUPR for DTIs and 6.56 |$\%$| in AUROC and 8.17 |$\%$| in AUPR for DDIs. The scalability of KGE-UNIT is demonstrated through its extension to protein–protein interactions prediction, ablation studies and case studies further validate its effectiveness. [ABSTRACT FROM AUTHOR]

Among numerous dynamic scheduling strategies for low‐density parity‐check codes, many of them are of high complexity due to repetitive computation and ordering of belief residuals. To address these challenges, two novel approaches are proposed: the derived informed variable‐to‐check residual belief propagation and the derived variable‐node and variable‐to‐check‐edge residual belief propagation for low‐density parity‐check codes. Simulation results show that the derived dynamic scheduling exhibits a substantial gain of approximately 0.15 dB in signal‐to‐noise ratio over the non‐derived one with considerably lower decoding complexity when targeting a bit‐error rate of 10−4. [ABSTRACT FROM AUTHOR]

In recent times, there has been notable and swift advancement in the field of image dehazing. Several deep learning techniques have demonstrated remarkable proficiency in resolving homogeneous dehazing issues. Nonetheless, the current dehazing approaches are generally formulated to deal with homogeneous haze, which is often undermined in real-world scenarios due to the uncertain haze dispersion. In this paper, we propose a dehazing model named RepDehazeNet by combining a structurally Reparameterization Encoder-Decoder subnet and a Full-Resolution Attention subnet. To be specific, the structural reparameterization idea is introduced into the encoder–decoder subnet to strengthen the feature extraction of dehazed images and improve the feature extraction speed. RepDehazeNet is compared with seven SOTA models on different datasets in terms of PSNR, SSIM, parameter quantity, and inference time. Compared to the DW-GAN model, the proposed RepDehazeNet model reduces the number of parameters by 2.7 million, and improves the inference speed by 90.3%, while achieving a higher PSNR of 0.5 dB on the NH-Haze2021 dataset. The experimental results demonstrate that the proposed RepDehazeNet model can effectively improve the real-time performance, accuracy of dehazing synthesized and nonhomogeneous haze images. [Display omitted] • Structural reparameterization dehazenet: outstanding performance, faster speed. • Replacing Tanh with ReLU leads to better results. • Transfer learning addresses the problem of insufficient samples. • Dual subnets method proves highly effective in datasets of different scales. [ABSTRACT FROM AUTHOR]

Error-correcting codes (ECCs) employed in the state-of-the-art DNA digital storage (DDS) systems suffer from a trade-off between error-correcting capability and the proportion of redundancy. To address this issue, in this study, we introduce soft-decision decoding approach into DDS by proposing a DNA-specific error prediction model and a series of novel strategies. We demonstrate the effectiveness of our approach through a proof-of-concept DDS system based on Reed-Solomon (RS) code, named as Derrick. Derrick shows significant improvement in error-correcting capability without involving additional redundancy in both in vitro and in silico experiments, using various sequencing technologies such as Illumina, PacBio and Oxford Nanopore Technology (ONT). Notably, in vitro experiments using ONT sequencing at a depth of 7× reveal that Derrick, compared with the traditional hard-decision decoding strategy, doubles the error-correcting capability of RS code, decreases the proportion of matrices with decoding-failure by 229-fold, and amplifies the potential maximum storage volume by impressive 32 388-fold. Also, Derrick surpasses 'state-of-the-art' DDS systems by comprehensively considering the information density and the minimum sequencing depth required for complete information recovery. Crucially, the soft-decision decoding strategy and key steps of Derrick are generalizable to other ECCs' decoding algorithms. [ABSTRACT FROM AUTHOR]

Many families of binary nonlinear codes (e.g., Kerdock, Goethals, Delsarte–Goethals, Preparata) can be very simply constructed from linear codes over the Z 4 ring (ring of integers modulo 4), by applying the Gray map to the quaternary symbols. Generalized Kerdock codes represent an extension of classical Kerdock codes to the Z 2 S ring. In this paper, we develop two novel soft-input decoders, designed to exploit the unique structure of these codes. We introduce a novel soft-input ML decoding algorithm and a soft-input soft-output MAP decoding algorithm of generalized Kerdock codes, with a complexity of O (N S log 2 N) , where N is the length of the Z 2 S code, that is, the number of Z 2 S symbols in a codeword. Simulations show that our novel decoders outperform the classical lifting decoder in terms of error rate by some 5 dB. [ABSTRACT FROM AUTHOR]

Motivation While large language models (LLMs) have been successfully applied to various tasks, they still face challenges with hallucinations. Augmenting LLMs with domain-specific tools such as database utilities can facilitate easier and more precise access to specialized knowledge. In this article, we present GeneGPT, a novel method for teaching LLMs to use the Web APIs of the National Center for Biotechnology Information (NCBI) for answering genomics questions. Specifically, we prompt Codex to solve the GeneTuring tests with NCBI Web APIs by in-context learning and an augmented decoding algorithm that can detect and execute API calls. Results Experimental results show that GeneGPT achieves state-of-the-art performance on eight tasks in the GeneTuring benchmark with an average score of 0.83, largely surpassing retrieval-augmented LLMs such as the new Bing (0.44), biomedical LLMs such as BioMedLM (0.08) and BioGPT (0.04), as well as GPT-3 (0.16) and ChatGPT (0.12). Our further analyses suggest that: First, API demonstrations have good cross-task generalizability and are more useful than documentations for in-context learning; second, GeneGPT can generalize to longer chains of API calls and answer multi-hop questions in GeneHop, a novel dataset introduced in this work; finally, different types of errors are enriched in different tasks, providing valuable insights for future improvements. Availability and implementation The GeneGPT code and data are publicly available at https://github.com/ncbi/GeneGPT. [ABSTRACT FROM AUTHOR]

Background: Degenerative spinal pathologies are highly prevalent among the elderly population. Timely diagnosis of osteoporotic fractures and other degenerative deformities enables proactive measures to mitigate the risk of severe back pain and disability. Methods: We explore the use of shape auto-encoders for vertebrae, advancing the state of the art through robust automatic segmentation models trained without fracture labels and recent geometric deep learning techniques. Our shape auto-encoders are pre-trained on a large set of vertebrae surface patches. This pre-training step addresses the label scarcity problem faced when learning the shape information of vertebrae for fracture detection from image intensities directly. We further propose a novel shape decoder architecture: the point-based shape decoder. Results: Employing segmentation masks that were generated using the TotalSegmentator, our proposed method achieves an AUC of 0.901 on the VerSe19 testset. This outperforms image-based and surface-based end-to-end trained models. Our results demonstrate that pre-training the models in an unsupervised manner enhances geometric methods like PointNet and DGCNN. Conclusion: Our findings emphasize the advantages of explicitly learning shape features for diagnosing osteoporotic vertebrae fractures. This approach improves the reliability of classification results and reduces the need for annotated labels. [ABSTRACT FROM AUTHOR]

Given an observed low frame rate video, video frame interpolation (VFI) aims to generate a high frame rate video, which has smooth video frames with higher frames per second (FPS). Most existing VFI methods often focus on generating one frame at a specific timestep, e.g., 0.5, between every two frames, thus lacking the flexibility to increase the video's FPS by an arbitrary scale, e.g., 3. To better address this issue, in this paper, we propose an arbitrary timestep video frame interpolation (ATVFI) network with time-dependent decoding. Generally, the proposed ATVFI is an encoder–decoder architecture, where the interpolation timestep is an extra input added to the decoder network; this enables ATVFI to interpolate frames at arbitrary timesteps between input frames and to increase the video's FPS at any given scale. Moreover, we propose a data augmentation method, i.e., multi-width window sampling, where video frames can be split into training samples with multiple window widths, to better leverage training frames for arbitrary timestep interpolation. Extensive experiments were conducted to demonstrate the superiority of our model over existing baseline models on several testing datasets. Specifically, our model trained on the GoPro training set achieved 32.50 on the PSNR metric on the commonly used Vimeo90k testing set. [ABSTRACT FROM AUTHOR]

Each brain response to a stimulus is, to a large extent, unique. However this variability, our perceptual experience feels stable. Standard decoding models, which utilise information across several areas to tap into stimuli representation and processing, are fundamentally based on averages. Therefore, they can focus precisely on the features that are most stable across stimulus presentations. But which are these features exactly is difficult to address in the absence of a generative model of the signal. Here, I introduce genephys, a generative model of brain responses to stimulation publicly available as a Python package that, when confronted with a decoding algorithm, can reproduce the structured patterns of decoding accuracy that we observe in real data. Using this approach, I characterise how these patterns may be brought about by the different aspects of the signal, which in turn may translate into distinct putative neural mechanisms. In particular, the model shows that the features in the data that support successful decoding—and, therefore, likely reflect stable mechanisms of stimulus representation—have an oscillatory component that spans multiple channels, frequencies, and latencies of response; and an additive, slower response with a specific (cross-frequency) relation to the phase of the oscillatory component. At the individual trial level, still, responses are found to be highly variable, which can be due to various factors including phase noise and probabilistic activations. [ABSTRACT FROM AUTHOR]

Brain machine interfaces (BMI) connect brains directly to the outside world, bypassing natural neural systems and actuators. Neuronal-activity-to-motion transformation algorithms allow applications such as control of prosthetics or computer cursors. These algorithms lie within a spectrum between bio-mimetic control and bio-feedback control. The bio-mimetic approach relies on increasingly complex algorithms to decode neural activity by mimicking the natural neural system and actuator relationship while focusing on machine learning: the supervised fitting of decoder parameters. On the other hand, the bio-feedback approach uses simple algorithms and relies primarily on user learning, which may take some time, but can facilitate control of novel, non-biological appendages. An increasing amount of work has focused on the arguably more successful bio-mimetic approach. However, as chronic recordings have become more accessible and utilization of novel appendages such as computer cursors have become more universal, users can more easily spend time learning in a bio-feedback control paradigm. We believe a simple approach which leverages user learning and few assumptions will provide users with good control ability. To test the feasibility of this idea, we implemented a simple firing-rate-to-motion correspondence rule, assigned groups of neurons to virtual "directional keys" for control of a 2D cursor. Though not strictly required, to facilitate initial control, we selected neurons with similar preferred directions for each group. The groups of neurons were kept the same across multiple recording sessions to allow learning. Two Rhesus monkeys used this BMI to perform a center-out cursor movement task. After about a week of training, monkeys performed the task better and neuronal signal patterns changed on a group basis, indicating learning. While our experiments did not compare this bio-feedback BMI to bio-mimetic BMIs, the results demonstrate the feasibility of our control paradigm and paves the way for further research in multi-dimensional bio-feedback BMIs. [ABSTRACT FROM AUTHOR]

A power line carrier (PLC) communication characteristics‐based method is proposed for single‐phase‐to‐ground fault location in neutral isolated medium voltage meshed distribution networks in this paper. The carrier signals with a time‐varying frequency and constant amplitude are processed by a set of PLC transmitters and receivers, whose placement is optimized by regarding the power network as an undirected graph. Two signal encoding and decoding algorithms for the PLC terminals are proposed to avoid using expensive timing systems between the terminals. The fault location technique is implemented by comparing the cosine similarity of amplitude attenuation and phase offset between the fault and a feature library. The node corresponding to the maximum cosine similarity of the characteristics between the present fault and the library is selected as the location of the current fault. Only one set of low‐cost PLC communication terminals and the widely available power lines are needed in the fault location system, making this approach highly practical. Numerical simulations using MATLAB/Simulink have been performed to verify the technique's feasibility. The results show that the method can accurately locate faults in neutral isolated medium voltage meshed distribution networks. Besides, the presented approach achieves a high level of accuracy in estimating transition resistance values. [ABSTRACT FROM AUTHOR]

Objective: Seventy-five percent of stroke survivors, caregivers, and health care professionals (HCP) believe current therapy practices are insufficient, specifically calling out the upper extremity as an area where innovation is needed to develop highly usable prosthetics/orthotics for the stroke population. A promising method for controlling upper extremity technologies is to infer movement intention non-invasively from surface electromyography (EMG). However, existing technologies are often limited to research settings and struggle to meet user needs. Approach: To address these limitations, we have developed the NeuroLife® EMG System, an investigational device which consists of a wearable forearm sleeve with 150 embedded electrodes and associated hardware and software to record and decode surface EMG. Here, we demonstrate accurate decoding of 12 functional hand, wrist, and forearm movements in chronic stroke survivors, including multiple types of grasps from participants with varying levels of impairment. We also collected usability data to assess how the system meets user needs to inform future design considerations. Main results: Our decoding algorithm trained on historical- and within-session data produced an overall accuracy of 77.1 ± 5.6% across 12 movements and rest in stroke participants. For individuals with severe hand impairment, we demonstrate the ability to decode a subset of two fundamental movements and rest at 85.4 ± 6.4% accuracy. In online scenarios, two stroke survivors achieved 91.34 ± 1.53% across three movements and rest, highlighting the potential as a control mechanism for assistive technologies. Feedback from stroke survivors who tested the system indicates that the sleeve's design meets various user needs, including being comfortable, portable, and lightweight. The sleeve is in a form factor such that it can be used at home without an expert technician and can be worn for multiple hours without discomfort. Significance: The NeuroLife EMG System represents a platform technology to record and decode high-resolution EMG for the real-time control of assistive devices in a form factor designed to meet user needs. The NeuroLife EMG System is currently limited by U.S. federal law to investigational use. [ABSTRACT FROM AUTHOR]

Context and Background: This paper addresses the challenge of encoding and decoding numerical data by introducing innovative algorithms utilizing Neutrosophic ASCII codes and ASCII Neutrosophic codes. These codes serve to represent uncertain or imprecise character values through the incorporation of neutrosophic numbers, encompassing degrees of truth, falsity, and indeterminacy. Motivation: The study stems from the necessity to effectively represent uncertain or imprecise character values in numerical data. This is crucial in diverse applications where handling uncertain or ambiguous data is a prevalent concern. Hypothesis: We hypothesize that employing Neutrosophic ASCII codes and ASCII Neutrosophic codes in encoding and decoding numerical data can provide a robust solution for representing uncertain or imprecise character values. Methods: The encoding algorithm in this study transforms each character in the ASCII string into its corresponding ASCII code, utilizing either 7 or 8 bits based on the code type. This algorithm calculates the degree of truth, falsity, and indeterminacy for each bit, considering the uncertainty or ambiguity associated with the character. The resulting neutrosophic numbers are appended to create the Neutrosophic ASCII code or ASCII Neutrosophic code. The decoding algorithm partitions the code into groups of neutrosophic numbers, calculates the associated degrees of truth, falsity, and indeterminacy for each ASCII bit, and converts the neutrosophic numbers back to ASCII codes, reconstructing the original ASCII character string. Results: Our study yields a novel and effective approach for encoding and decoding numerical data, demonstrating the potential of Neutrosophic ASCII codes and ASCII Neutrosophic codes in representing uncertain or imprecise character values. Conclusions: The proposed algorithms offer a promising solution for handling uncertain or ambiguous data in numerical encoding and decoding. The specific and quantitative results highlight the efficacy of Neutrosophic ASCII codes and ASCII Neutrosophic codes, showcasing their potential applicability in various domains requiring robust solutions for uncertain or imprecise character representation in numerical data. [ABSTRACT FROM AUTHOR]

Encoding a dictionary into another representation means that all the words can be stored in the dictionary in a more efficient way. In this way, we can complete common operations in dictionaries, such as (1) searching for a word in the dictionary, (2) adding some words to the dictionary, and (3) removing some words from the dictionary, in a shorter time. Binary decision diagrams (BDDs) are one of the most famous representations of such encoding and are widely popular due to their excellent properties. Recently, some people have proposed encoding dictionaries into BDDs and some variants of BDDs and showed that it is feasible. Hence, we further investigate the topic of encoding dictionaries into decision diagrams. Tagged sentential decision diagrams (TSDDs), as one of these variants based on structured decomposition, exploit both the standard and zero-suppressed trimming rules. In this paper, we first introduce how to use Boolean functions to represent dictionary files and then design an algorithm that encodes dictionaries into TSDDs with the help of tries and a decoding algorithm that restores TSDDs to dictionaries. We utilize the help of tries in the encoding algorithm, which greatly accelerates the encoding process. Considering that TSDDs integrate two trimming rules, we believe that using TSDDs to represent dictionaries would be more effective, and the experiments also show this. [ABSTRACT FROM AUTHOR]

The residual belief propagation (RBP) algorithm, which is the most classic informed dynamic scheduling strategy, achieves outstanding performance in error correction and can drastically accelerate convergence speed. However, the greedy algorithmic property of this iterative decoding will inevitably cause loss of decoding performance. To address this, a novel algorithm called the partial average bundle residual belief propagation (PABRBP) is proposed in this paper. According to the construction characteristics of a base matrix of protograph‐LDPC codes, informed dynamic scheduling (IDS) strategies are applied to an edge bundle of base matrices for the first time. This edge bundle of the base matrix can be applied to a corresponding cyclic permutation matrix. Furthermore, the update level of each bundle is determined by the value of the Partially Average Bundle Residual (PABR). Therefore, the edge message with the maximum residual in each bundle is updated in order, and the process of iterative decoding is less likely to become trapped in a local optimum. Additionally, the generation of silent nodes is reduced as much as possible. To further improve the PABRBP decoding performance for medium and long codes over the fading channel, the adjusted compensation term is periodically introduced. Analysis and simulation results show that PABRBP demonstrates a notable convergence quality and decoding performance improvement over the fading channels compared to existing state‐of‐art IDS algorithms. [ABSTRACT FROM AUTHOR]

Skin cancer, also known as melanoma, is a deadly form of skin cancer that can significantly improve survival rates when diagnosed at an early stage. It is usually diagnosed visually from dermoscopic images, and such visual assessment of skin cancer by the naked eye is a challenging and arduous task. Therefore, the detection of melanoma from dermoscopic images using trained artificial intelligence models is of great importance today. However, since melanoma is a rare disease, existing databases of skin lesions often contain highly unbalanced numbers of benign and malignant samples. In this paper, we propose a new one‐class classification‐based skin lesion classification strategy for small and unbalanced datasets. One‐class classification (OCC) is a special case of multi‐classification. OCC aims to learn a descriptive paradigm from positive class data (true data) during training and reject pseudo data (fake data) that do not conform to the paradigm during inference. OCC has great potential for application in anomaly detection problems. We have analyzed several approaches to the OCC task in recent years and propose a new design paradigm for the OCC problem, taking into account the unbalanced data set of the melanoma classification task. We have designed an improved OCC network based on this design paradigm, where the network is based on the architecture of a residual neural network, combining the coding and decoding idea of variational self‐encoder and the adversarial training idea of an adversarial neural network, using binary cross‐entropy as the loss function and introducing the channel attention mechanism. Tests on several publicly available dermatology datasets show that this improved OCC network addresses the unbalanced dataset situation in melanoma image classification to some extent while having relatively excellent performance. Compared with some traditional networks, it can obtain more stable training results and perform more consistently on complex datasets. [ABSTRACT FROM AUTHOR]

In the systems of industrial robotics and autonomous vehicles, instance segmentation is widely employed. However, manually labelling an object outline is time‐consuming. In order to reduce annotation costs, we present a weakly supervised instance segmentation method in this article. A deeply convolutional network is first used to construct multi‐scale feature maps for each object in the input image. After that, the encoder‐decoder framework with dynamic convolution is utilised to enhance model capacity and efficiency, while avoiding the issues of anchor design, proposal selection, and RoIAlign implementation. In particular, Dynamic Heads are used in the encoder to create dynamic convolution kernels, while Instance Heads are used in the decoder to provide the global feature map. With dynamic convolution, each instance can be segmented independently, reducing interference with other instances and improving segmentation accuracy. Under the supervision of projection loss and pixel point colour pairing loss, the contours of each object are finally outlined. On the PASCAL VOC and MS COCO datasets, the proposed method is competitive with more sophisticated approaches. In the VOC dataset, segmentation performance achieved 37.6% average precision with ResNet‐101 and FPN networks. The extensively visualised results demonstrate the effectiveness of the proposed encoder‐decoder framework with dynamic convolution. [ABSTRACT FROM AUTHOR]

Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal. As a mainstream decoding algorithm for polar codes, the successive cancellation list (SCL) decoder usually improves the error correction performance by increasing the list size, but this method suffers from the problems of high decoding complexity. To address this problem, this paper proposes a layered-search bit-flipping (LS-SCLF) decoding algorithm based on SCL decoding. Firstly, a new flip-bit metric is proposed, which derives a formula to approximate the probability of an error occurring in an information bit. This formula introduces a perturbation parameter to improve the calculation accuracy. Secondly, a compromise scheme for determining the perturbation parameter is proposed. The scheme uses Monte Carlo simulation to determine an optimized parameter for the precise positioning of the first erroneous decoded bit under different decoding conditions. Finally, a layered search strategy is adopted to sequentially search the erroneous decoded bits from the low order to high order, which can correct up to multiple bits at the same time. Simulation results show that the proposed algorithm achieves improved error correction performance with a slight increase in decoding complexity compared to the generalized SCL-Flip (GSCLF) decoding algorithm. This algorithm also achieves a good balance between the error correction performance and decoding complexity. [ABSTRACT FROM AUTHOR]

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]

OPC is a very time consuming process for mask synthesis. Quick and accurate OPC using GCN with layout encoder and mask decoder is proposed. (1) GCN performs a series of aggregation with MLP for correction process. A feature of a particular polygon is aggregated with weighted features of neighbor polygons; this is a key motivation of using GCN since one polygon should be corrected while its neighbors are taken into account for more accurate correction. (2) GCN inputs are provided by a layout encoder, which extracts a feature from each layout polygon. GCN outputs, features corresponding to corrected polygons, are processed by a mask decoder to yield the final mask pattern. (3) The encoder and decoder originate from respective autoencoders. High fidelity of decoder is a key for OPC quality. This is achieved by collective training of the two autoencoders with a single loss function while the encoder and decoder are connected. Experiments demonstrate that the proposed OPC achieves 47% smaller EPE than OPC using a simple MLP model. [ABSTRACT FROM AUTHOR]

Automated guided vehicles (AGVs) are one of the core technologies for building unmanned autonomous integrated automated electric meter verification workshops in metrology centers. However, complex obstacles on the verification lines, frequent AGV charging, and multi-AGV collaboration make the scheduling problem more complicated. Aiming at the characteristics and constraints of AGV transportation scheduling for metrology verification, a multi-AGV scheduling model was established to minimize the maximum completion time and charging cost, integrating collision-avoidance constraints. An improved snake optimization algorithm was proposed that first assigns and sorts tasks based on AGV-order-address three-level mapping encoding and decoding, then searches optimal paths using an improved A* algorithm solves multi-AGV path conflicts, and finally finds the minimum-charging-cost schedule through large neighborhood search. We conducted simulations using real data, and the calculated results reduced the objective function value by 16.4% compared to the traditional first-in-first-out (FIFO) method. It also reduced the number of charges by 60.3%. In addition, the proposed algorithm is compared with a variety of cutting-edge algorithms and the results show that the objective function value is reduced by 8.7–11.2%, which verifies the superiority of the proposed algorithm and the feasibility of the model. [ABSTRACT FROM AUTHOR]

Phase retrieval in holographic data storage by expanded spectrum combined with dynamic sampling method is proposed, which serves to both reduce media consumption and to shorten the iterative number of phase code retrieval. Generally, high-fidelity phase retrieval requires twice Nyquist frequency in phase-modulated holographic data storage. To increase storage density, we only recorded and captured the signal with Nyquist size and used the frequency expanded method to realize high-fidelity phase retrieval. In the decoding process, the iterative Fourier transform algorithm is used to retrieve the phase information of the reconstructed beam. The expanded spectrum is dynamically sampled, which can provide a faster convergence path for the phase retrieval. We aimed to demonstrate the possibility of integrating various methods on the Fourier domain and providing a potential way to improve the performance of holographic data storage systems. The simulation and experimental results proved the combination of processing methods in frequency spectrum was benefit. [ABSTRACT FROM AUTHOR]

Aiming at effectively improving photovoltaic (PV) park operation and the stability of the electricity grid, the current paper addresses the design and development of a novel system achieving the short-term irradiance forecasting for the PV park area, which is the key factor for controlling the variations in the PV power production. First, it introduces the Xception long short-term memory (XceptionLSTM) cell tailored for recurrent neural networks (RNN). Second, it presents the novel irradiance forecasting model that consists of a sequence-to-sequence image regression NNs in the form of a spatio-temporal encoder–decoder including Xception layers in the spatial encoder, the novel XceptionLSTM in the temporal encoder and decoder and a multilayer perceptron in the spatial decoder. The proposed model achieves a forecast skill of 16.57% for a horizon of 5 min when compared to the persistence model. Moreover, the proposed model is designed for execution on edge computing devices and the real-time application of the inference on the Raspberry Pi 4 Model B 8 GB and the Raspberry Pi Zero 2W validates the results. [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]

At present, there are many semantic segmentation algorithms with excellent performance for intelligent driving vehicles, but most of them only work well on scenes with good illumination. In order to solve the problem of scene segmentation under low illumination, this paper proposes a novel semantic segmentation algorithm that combines visible and infrared images. In this algorithm, two parallel encoders are designed as the input of the images, and the decoder divides the fused images output from the encoder. The model is based on ResNet algorithm, and the residual attention module is used in each branch to mine and enhance the spatial features of multilevel channels to extract images information. Experiments are carried out on publicly available thermal infrared and visible datasets. The results show that the algorithm proposed in this paper is superior to the algorithm using only visible images in semantic segmentation of traffic environment. [ABSTRACT FROM AUTHOR]

Generating the decision map with accurate boundaries is the key to fusing multi-focus images. In this paper, we introduce edge-preservation (EP) techniques into neural networks to improve the quality of decision maps, supported by an interesting phenomenon we found: the maps generated by traditional EP techniques are similar to the feature maps in the trained network with excellent performance. Based on the manifold theory in the field of edge-preservation, we propose a novel edge-aware layer derived from isometric domain transformation and a recursive filter, which effectively eliminates burrs and pseudo-edges in the decision map by highlighting the edge discrepancy between the focused and defocused regions. This edge-aware layer is incorporated to a Siamese-style encoder and a decoder to form a complete segmentation architecture, termed Y-Net, which can contrastively learn and capture the feature differences of the sourced images with a relatively small number of training data (i.e., 10,000 image pairs). In addition, a new strategy based on randomization is devised to generate masks and simulate multi-focus images with natural images, which alleviates the absence of ground-truth and the lack of training sets in multi-focus image fusion (MFIF) task. The experimental results on four publicly available datasets demonstrate that Y-Net with the edge-aware layers is superior to other state-of-the-art fusion networks in terms of qualitative and quantitative comparison. [ABSTRACT FROM AUTHOR]

The effective integration of RGB and depth map features to improve the performance of RGB‐D salient object detection (SOD) has garnered significant research interest. The existing dual‐stream models can be used for high‐level feature fusion or unidirectionally transferring depth features to RGB features; however, they are unable to fully exploit the differences in modality. Furthermore, owing to the influence of image background information, the generated salient object is affected by background swallow. Herein, a three‐stream RGB‐D SOD method based on cross‐layer and cross‐modal dual‐attention (CMDA) fusion is proposed. In the encoding stage, the CMDA fusion module is used to fuse RGB and depth features layer by layer. Through this module, merged interactive features may be used to extract the richer features of salient objects, realize the commonality and complementarity of fusion features, and achieve effective cross‐modal fusion. In addition, for the decoding stage, a cross‐level feature fusion module that introduces global context features into the up‐sampling process, reduces the impact of salient objects being swallowed by the background, and helps to accurately detect salient areas is proposed. Three different branch features are used for simultaneous end‐to‐end training. The experimental results demonstrate that the proposed method outperforms other methods in terms of multiple evaluation metrics on four datasets. Furthermore, the authors visualize the precision–recall curve, F‐measure curve, and saliency map, which indicate that the detection effect of the proposed method is superior to those of other methods. During the testing stage, our model ran at 14 frames per second (FPS). [ABSTRACT FROM AUTHOR]

Various approaches have used neural networks as probabilistic models for the design of protein sequences. These "inverse folding" models employ different objective functions, which come with trade-offs that have not been assessed in detail before. This study introduces probabilistic definitions of protein stability and conformational specificity and demonstrates the relationship between these chemical properties and the p (structure | seq) Boltzmann probability objective. This links the Boltzmann probability objective function to experimentally verifiable outcomes. We propose a novel sequence decoding algorithm, referred to as "BayesDesign", that leverages Bayes' Rule to maximize the p (structure | seq) objective instead of the p (seq | structure) objective common in inverse folding models. The efficacy of BayesDesign is evaluated in the context of two protein model systems, the NanoLuc enzyme and the WW structural motif. Both BayesDesign and the baseline ProteinMPNN algorithm increase the thermostability of NanoLuc and increase the conformational specificity of WW. The possible sources of error in the model are analyzed. [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]

Directly applying brain signals to operate a mobile manned platform, such as a vehicle, may help people with neuromuscular disorders regain their driving ability. In this paper, we developed a novel electroencephalogram (EEG) signal-based driver–vehicle interface (DVI) for the continuous and asynchronous control of brain-controlled vehicles. The proposed DVI consists of the user interface, the command decoding algorithm, and the control model. The user interface is designed to present the control commands and induce the corresponding brain patterns. The command decoding algorithm is developed to decode the control command. The control model is built to convert the decoded commands to control signals. Offline experimental results show that the developed DVI can generate a motion control command with an accuracy of 83.59% and a detection time of about 2 s, while it has a recognition accuracy of 90.06% in idle states. A real-time brain-controlled simulated vehicle based on the DVI was developed and tested on a U-turn road. Experimental results show the feasibility of the DVI for continuously and asynchronously controlling a vehicle. This work not only advances the research on brain-controlled vehicles but also provides valuable insights into driver–vehicle interfaces, multimodal interaction, and intelligent vehicles. [ABSTRACT FROM AUTHOR]

In recent years, much research has been devoted to free-space optical communication (FSO). The unregulated spectrum, low implementation costs, and robust security of FSO systems all are of great importance which lead to a wide range of applications for FSO links, from terrestrial communications to satellite communications. However, the fundamental limitation with FSO links is atmospheric turbulence (AT) caused by fading, significantly reducing link performance. Random phenomena are the best characteristic of atmospheric turbulence caused by changes in the air's refractive index over time. Numerous probability density functions of the AT models were presented to model the randomness in AT channels. The Log-Normal (LN) channel model is for weak atmospheric turbulence, while the Gamma–Gamma (G–G) channel is selected for moderate and strong atmospheric turbulence. The impacts of geometric losses, attenuation due to weather, and errors due to misalignment are addressed using LN and G–G channels. Channel coding is one of the possible solutions for mitigating such FSO channel impairments as the low-density parity check (LDPC) codes. In this article, the Weighted Bit Flipping (Algorithm (1)), Implementation Efficient Reliability Ratio Weighted Bit Flipping (Algorithm (2)), and Min-Sum (Algorithm (3)) algorithms are compared and evaluated against FSO atmospheric turbulence channels. In addition, two novel algorithms are proposed to enhance the complexity or Bit Error Rate performance of LDPC decoding over FSO channels. The results showed an impressive improvement of the coded FSO system by employing the proposed algorithms compared to the existing LDPC decoders for FSO communications from the point of all comparison parameters. [ABSTRACT FROM AUTHOR]

The indoor environment is typically a complex time-varying environment. At present, the problem of indoor modeling is still a hot research topic for scholars at home and abroad. This paper primarily studies indoor time-varying space. On the basis of the Beidou grid framework and time coding model, in the first scenario, a local space subdivision framework based on Beidou is proposed. The necessity of local space subdivision framework is analyzed. In the second scenario, based on the time coding model needle, a local temporal subdivision model, more suitable for a short time domain, is proposed. Then, for the spatial modeling of an indoor time-varying environment, an indoor time-varying mesh frame based on global subdivision, local space subdivision, and local time subdivision is proposed. Using this framework, the indoor environment is represented by the space–time grid, and the basic storage data structure is designed. Finally, the experiment of local subdivision coding in the indoor space–time grid, indoor space–time grid modeling, and an organization experiment is carried out using real data and simulation data. The experimental results verify the feasibility and correctness of the encoding and decoding algorithm of local subdivision encoding in space–time encoding and the calculation algorithm of the space–time relationship. The experimental results also verify the multi-space organization and the management ability of the indoor space–time grid model. [ABSTRACT FROM AUTHOR]

Polar codes have received widespread attention because of their excellent performance. However, although successive cancellation (SC)‐based decoding algorithms have achieved excellent error correction performance, they still encounter large time delays in decoding because a serial decoding structure is employed. At present, a cyclic redundancy check (CRC) is used to judge whether the decoding result of a frame is erroneous. To obtain such a result, the decoder has to wait until the end of decoding. In this work, a judgement strategy for error frames using frozen bits is proposed. With the proposed strategy, the recognition of erroneously decoded frames can be achieved based on the error state of the frozen bits in this frame. Accordingly, early termination of decoding can be realized. By using this mechanism, the strategy can also be applied in the SC List algorithm to prune the path. In addition, the SC Flip decoding algorithm can also use the proposed strategy to help find the first error message bit. The experimental results show that at least 85% of the frames decoded erroneously can be recognized by the proposed strategy so that decoding can be terminated in advance and computational resources can be saved. [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]

The distributed Goppa coded spatial modulation (DGC‐SM) scheme is proposed in cooperative scenarios. In the proposed DGC‐SM scheme, the relay chooses the partial information from the source by using the idea of information selection, and then re‐encodes the selected information. At the destination, a distributed Goppa code is obtained corresponding to each selection. In order to get the best possible code, an optimal information selection algorithm is proposed at the relay. In the proposed optimal algorithm, all selections and source message sequences are considered, which results in high complexity. Thus, another optimized information selection algorithm with low complexity is proposed at the relay. To further enhance the capability to get the source information, two efficient joint decoding algorithms called smart decoding algorithm and improved smart decoding algorithm are proposed. Moreover, the bit error rate (BER) performance bound of the proposed DGC‐SM scheme is derived. Through the simulations, the effectiveness of the proposed two optimized information selection algorithms is confirmed. Also, it is observed that the simulation and analytical results closely match at high signal‐to‐noise ratio (SNR). [ABSTRACT FROM AUTHOR]

Industrial Internet of Things (IIoTs) has drawn significant attention in the industry. Among its rich applications, the field's video surveillance deserves particular interest due to its advantage in better understanding network control. However, existing decoding methods are limited by the video coding order, which cannot be decoded in parallel, resulting in low decoding efficiency and the inability to process the massive amount of video data in real time. In this work, a parallel decoding framework based on the speculative technique is proposed. In particular, the video is first speculatively decomposed into data blocks, and then a verification method is designed to ensure the correctness of the decomposition. After verification, the data blocks having passed the validation can be decoded concurrently in the parallel computing platform. Finally, the concurrent decoding results are concatenated in line with the original encoding order to form the output. Experiments show that compared with traditional serial decoding ones, the proposed method can improve the performance by 9 times on average in the parallel computing environment with NVIDIA Tegra 4 chips, thus significantly enhancing the real-time video data's decoding efficiency with guaranteed accuracy. Furthermore, proposed and traditional serial methods obtain almost the same peak signal-to-noise ratio (PSNR) and mean square error (MSE) metrics at different bit rates and resolutions, showing that the introduction of the speculative technique does not degrade the decoding accuracy. [ABSTRACT FROM AUTHOR]

In this article, a graph-theoretic method (taking advantage of constraints among sets associated with the corresponding parity-check matrices) is applied for the construction of a double low-density parity-check (D-LDPC) code (also known as LDPC code pair) in a joint source-channel coding (JSCC) system. Specifically, we pre-set the girth of the parity-check matrix for the LDPC code pair when jointly designing the two LDPC codes, which are constructed by following the set constraints. The constructed parity-check matrices for channel codes comprise an identity submatrix and an additional submatrix, whose column weights can be pre-set to be any positive integer numbers. Simulation results illustrate that the constructed D-LDPC codes exhibit significant performance improvement and enhanced flexible frame length (i.e., adaptability under various channel conditions) compared with the benchmark code pair. [ABSTRACT FROM AUTHOR]

Although extensive optimization of encoding and decoding schemes for joint source-channel coding (JSCC) systems has been conducted, efficient optimization schemes are still required for designing and optimizing the linking matrix between variable nodes of the source code and check nodes of the channel code. A scheme has been proposed for design and optimization of linking matrix with multi-edges by analyzing the performance of the JSCC system using the joint protograph extrinsic information transfer algorithm to calculate decoding thresholds. The proposed scheme incorporates structural constraints and is effective in designing and optimizing the multi-edges in linking matrix for the JSCC system. Experimental results have demonstrated that the designed and optimized linking matrix significantly improves the performance of the JSCC system. Furthermore, the proposed scheme reduces the complexity of the solution space for the optimized example. [ABSTRACT FROM AUTHOR]

It is well known that some harmful objects in the Tanner graph of low-density parity-check (LDPC) codes have a negative impact on their error correction performance under iterative message-passing decoding. Depending on the channel and the decoding algorithm, these harmful objects are different in nature and can be stopping sets, trapping sets, absorbing sets, or pseudocodewords. Differently from LDPC block codes, the design of spatially coupled LDPC codes must take into account the semi-infinite nature of the code, while still reducing the number of harmful objects as much as possible. We propose a general procedure, based on edge spreading, enabling the design of good quasi-cyclic spatially coupled LDPC (QC-SC-LDPC) codes. These codes are derived from quasi-cyclic LDPC (QC-LDPC) block codes and contain a considerably reduced number of harmful objects with respect to the original QC-LDPC block codes. We use an efficient way of enumerating harmful objects in QC-SC-LDPCCs to obtain a fast algorithm that spans the search space of potential candidates to select those minimizing the multiplicity of the target harmful objects. We validate the effectiveness of our method via numerical simulations, showing that the newly designed codes achieve better error rate performance than codes presented in previous literature. [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]

When a top-down method is taken to the task of human pose estimation, the accuracy of joint point localization is often limited by the accuracy of human detection. In addition, conventional algorithms commonly encode the image to generate a heat map before processing, but the systematic error in decoding the heat map back to the original image has an impact on the positioning. Therefore, to address the two problems, we propose an algorithm that uses multiple angle models to generate the human boxes and then performs lightweight decoding to recover the image. The new boxes can better fit humans and the recovery error can be reduced. First, we split the backbone network into three sub-networks, the first sub-network is responsible for generating the original human box, the second sub-network is responsible for generating a coarse pose estimation in the boxes, and the third sub-network is responsible for a high-precision pose estimation. In order to make the human box fit the human body better, with only a small number of interfering pixels inside the box, models of the human boxes with multiple rotation angles are generated. The results from the second sub-network are used to select the best human box. Using this human box as input to the third sub-network can significantly improve the accuracy of the pose estimation. Then to reduce the errors arising from image decoding, we propose a lightweight unbiased decoding strategy that differs from traditional methods by combining multiple possible offsets to select the direction and size of the final offset. On the MPII dataset and the COCO dataset, we compare the proposed algorithm with 11 state-of-the-art algorithms. The experimental results show that the algorithm achieves a large improvement in accuracy for a wide range of image sizes and different metrics. [ABSTRACT FROM AUTHOR]

This paper studies the hybrid flow shop scheduling problem with blocking constraints (BHFSP). To better understand the BHFSP, we will construct its mixed integer linear programming (MILP) model and use the Gurobi solver to demonstrate its correctness. Since the BHFSP exists parallel machines in some processing stages, different decoding strategies can obtain different makespan values for a given job sequence and multiple decoding strategies can assist the algorithm to find the optimal value. In view of this, we propose a hybrid decoding strategy that combines both forward decoding and backward decoding to select the minimal objective function value. In addition, a hybrid decoding-assisted variant iterated greedy (VIG) algorithm to solve the above MILP model. The main novelties of VIG are a new reconstruction mechanism based on the hybrid decoding strategy and a swap-based local reinforcement strategy, which can enrich the diversity of solutions and explore local neighborhoods more deeply. This evaluation is conducted against the VIG and six state-of-the-art algorithms from the literature. The 100 tests showed that the average makespan and the relative percentage increase (RPI) values of VIG are 1.00% and 89.6% better than the six comparison algorithms on average, respectively. Therefore, VIG is more suitable to solve the studied BHFSP. [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]