Domain Classification Research Articles

Hyperspectral Image Classification Algorithm for Forest Analysis Based on a Group-Sensitive Selective Perceptual Transformer

Substantial advancements have been achieved in hyperspectral image (HSI) classification through contemporary deep learning techniques. Nevertheless, the incorporation of an excessive number of irrelevant tokens in large-scale remote sensing data results in inefficient long-range modeling. To overcome this hurdle, this study introduces the Group-Sensitive Selective Perception Transformer (GSAT) framework, which builds upon the Vision Transformer (ViT) to enhance HSI classification outcomes. The innovation of the GSAT architecture is primarily evident in several key aspects. Firstly, the GSAT incorporates a Group-Sensitive Pixel Group Mapping (PGM) module, which organizes pixels into distinct groups. This allows the global self-attention mechanism to function within these groupings, effectively capturing local interdependencies within spectral channels. This grouping tactic not only boosts the model’s spatial awareness but also lessens computational complexity, enhancing overall efficiency. Secondly, the GSAT addresses the detrimental effects of superfluous tokens on model efficacy by introducing the Sensitivity Selection Framework (SSF) module. This module selectively identifies the most pertinent tokens for classification purposes, thereby minimizing distractions from extraneous information and bolstering the model’s representational strength. Furthermore, the SSF refines local representation through multi-scale feature selection, enabling the model to more effectively encapsulate feature data across various scales. Additionally, the GSAT architecture adeptly represents both global and local features of HSI data by merging global self-attention with local feature extraction. This integration strategy not only elevates classification precision but also enhances the model’s versatility in navigating complex scenes, particularly in urban mapping scenarios where it significantly outclasses previous deep learning methods. The advent of the GSAT architecture not only rectifies the inefficiencies of traditional deep learning approaches in processing extensive remote sensing imagery but also markededly enhances the performance of HSI classification tasks through the deployment of group-sensitive and selective perception mechanisms. It presents a novel viewpoint within the domain of hyperspectral image classification and is poised to propel further advancements in the field. Empirical testing on six standard HSI datasets confirms the superior performance of the proposed GSAT method in HSI classification, especially within urban mapping contexts, where it exceeds the capabilities of prior deep learning techniques. In essence, the GSAT architecture markedly refines HSI classification by pioneering group-sensitive pixel group mapping and selective perception mechanisms, heralding a significant breakthrough in hyperspectral image processing.

Offline English Handwritten Character Recognition using Sequential Convolutional Neural Network

Handwritten Character recognition falls under the domain of image classification that has been under research for years. The idea is to make the machine recognize handwritten human characters. The language focused in this research paper is English while using offline handwritten character recognition for identifying English characters. There are many publically available datasets from which EMNIST is the most challenging one. The main idea of this research paper is to propose a deep learning CNN method to help recognize English characters. This research paper proposes a deep learning convolutional neural network that is tested and compared with renowned pre-trained models using transfer learning. These parametric settings address multiple issues and are finalized after experimentation. The same hyper-parametric settings were used for all the models under test and E-Character with the same data augmentation settings. The proposed model named the E-Character recognizer was able to produce 87.31% accuracy. It was better than most of the tested pre-trained models and other proposed methods by other researchers. This research paper further highlighted some of the problems like misclassification due to the similar structure of characters.

Performance Evaluation of Deep Learning Architectures for Blood Pressure Estimation Using Photoplethysmography

High blood pressure (BP) monitoring Blood pressure (BP) is one of the common cardiovascular diseases and therefore the early high blood pressure (hypertension) detection, management, and prevention are mandatory. One promising method of continuous, non-invasive blood pressure estimation is photoplethysmography (PPG). In this study, a novel method was proposed to introduce the AlexNet framework into the time-frequency domain for classification of BP levels based on PPG signals. The study was conducted using the publicly available Figshare dataset which offers PPG signals, and the blood pressure labels against them. Data balancing techniques were used to alleviate class imbalances. Preprocessing and Feature Extraction of PPG Signals. The PPG signals were preprocessed with noise filtering and signals were then transformed from 1D-time to image to facilitate robust feature extraction. The proposed classification model, based on AlexNet showed the best result, with 98.89% accuracy, recall, and precision, and 99.44% specificity. This model outperformed alternative models (VGG16, DenseNet, ResNet50, GoogleNet) for classifying BP levels into the JNC 7 report standard categories normotension, prehypertension and hypertension. This study has two primary contributions. Initially, it demonstrates the efficacy of AlexNet model to extract meaningful features from PPG signals by its hierarchical convolutional and max-pooling layers thereby enabling accurate classification of BP levels. This study underscores the potential of deep learning and PPG signals for developing a highly accurate and truly non-invasive BP monitoring system. In the second aspect, the study offers a systematic assessment and comparison of the proposed over other well-known deep-learning networks, presenting the effectiveness of the AlexNet-based one. These results are of critical importance in the development of novel non-invasive BP monitoring modalities and optimization of cardiovascular health managements and personalized health cares.

A Hierarchically Discriminative Loss with Group Regularization for Fine-Grained Image Classification

Fine-grained visual classification targets the discrimination of subordinate categories within broader classes, such as avian species, aerial crafts, and notably, in medical diagnostics like breast cancer. In the domain of breast cancer classification, there has been an emergence of numerous fine-grained models leveraging pathological images. Elevating the interpretability of the model’s discriminative processes among these nuanced categories holds promise in enhancing the transparency of AI decision-making. However, the effective utilization of hierarchical label structures within medical data remains a crucial consideration. In this work, we explore how the label hierarchy can be used to better learn subtle feature embeddings. We observe that the semantic relationships between fine-grained categories can help to analyze the misclassified samples. To this end, with the label hierarchy, we introduce two novel losses to cultivate subtle feature representations, coordinate with feature learning, and align with the principles of Explainable AI (XAI). First, we propose hierarchically discriminative loss to enhance the interactions between fine- and coarse-level features, which can help reinforce the discriminability of fine-grained features for reducing false predictions belonging to the out-group relation. Second, we introduce the in-group regularization loss to establish the interactions between the target class and those confusing classes belonging to the in-group relation. Treating another confusing class as a distraction can regularize feature learning of the target class. Thus, it allows the network to discover more discriminative features and reduces in-group false predictions. Five commonly used datasets for fine-grained classification are extensively evaluated. Our experimental results validate the effectiveness of our proposed novel losses when compared to state-of-the-art methods that utilize hierarchical multi-granularity labels.

Customer insights for innovation: A framework and research agenda for marketing

AbstractCustomer insights play a critical role in innovation. In recent years, articles studying customer insights for innovation have risen in marketing and other fields such as innovation, strategy, and entrepreneurship. However, the literature on customer insights for innovation grew fragmented and plagued by inconsistent definitions and ambiguity. The literature also lacks a precise classification of different domains of customer insights for innovation. This article offers four key contributions. First, it clearly and consistently defines customer insights for innovation. Second, it proposes a “customer insights process” that describes the activities firms and customer insights intermediaries (e.g., market research agencies) use to generate, disseminate, and apply customer insights for innovation. Third, it offers a synthesis of the knowledge on customer insights for innovation along ten domains of customer insights for innovation: (1) crowdsourcing, (2) co-creating, (3) imagining, (4) observing, (5) testing, (6) intruding, (7) interpreting, (8) organizing, (9) deciding, and (10) tracking. Fourth, the authors qualify and quantify the managerial importance and potential for scholarly research in these domains of customer insights for innovation. They conducted 12 in-depth interviews with executives at market research agencies such as Ipsos, Kantar, Nielsen, IQVIA, and GfK to do so. They surveyed 305 managers working in innovation, marketing, strategy, and customer experience. The article concludes with a research agenda for marketing aimed at igniting knowledge development in high-priority domains for customer insights for innovation.

Feature-level Fusion vs. Score-level Fusion for Image Retrieval Based on Pre-trained Deep Neural Networks

Today’s complex multimedia content made retrieving images similar to the user’s query from the database a challenging task. The performance of a Content-Based Image Retrieval System (CBIR) system highly depends on the image representation in a form of low-level features and similarity measurement. The traditional visual descriptors that do not provide good prior domain knowledge could lead to poor performance retrieval results. On the other hand, Deep Convolutional Neural Networks (DCNNs) have recently achieved a remarkable success as methods for image classification in various domains. Recently, pre-trained deep convolution neural networks on thousands of classes have the ability to extract very accurate and representative features which, in addition to classification, can also be successfully used in image retrieval systems. ResNet152, GoogLeNet and InceptionV3 are some of the effective and successful examples of pre-trained DCNNs recently applied in a computer vision tasks such as object recognition, clustering, and classification. In this paper, two approaches for a CBIR system, namely early fusion and late fusion, have been presented and compared. The early fusion utilizes concatenation of the features extracted by each possible pair of DCNNs, that is ResNet152-GoogLeNet, ResNet152-InceptionV3, and GoogLeNet-InceptionV3, and the late fusion apply CombSum method with Z-Score standardization to combine the score results provided by each DCNN of the aforementioned pairs. In the experiments on a popular WANG dataset it has been shown that late fusion approach slightly outperforms early fusion approach. The best performance of our experiments in terms of Average Precision (AP) for the top 20 results reaches 96.82%.

Alignable kernel network

To enhance the adaptability and performance of Convolutional Neural Networks (CNN), we present an adaptable mechanism called Alignable Kernel (AliK) unit, which dynamically adjusts the receptive field (RF) dimensions of a model in response to varying stimuli. The branches of AliK unit are integrated through a novel align transformation softmax attention, incorporating prior knowledge through rank ordering constraints. The attention weightings across the branches establish the effective RF scales, leveraged by neurons in the fusion layer. This mechanism is inspired by neuroscientific observations indicating that the RF dimensions of neurons in the visual cortex vary with the stimulus, a feature often overlooked in CNN architectures. By aggregating successive AliK ensembles, we develop a deep network architecture named the Alignable Kernel Network (AliKNet). AliKNet with interdisciplinary design improves the network’s performance and interpretability by taking direct inspiration from the structure and function of human neural systems, especially the visual cortex. Empirical evaluations in the domains of image classification and semantic segmentation have demonstrated that AliKNet excels over numerous state-of-the-art architectures, achieving this without increasing model complexity. Furthermore, we demonstrate that AliKNet can identify target objects across various scales, confirming their ability to dynamically adapt their RF sizes in response to the input data.

Cross-Subject Seizure Detection via Unsupervised Domain-Adaptation.

Automatic seizure detection from Electroencephalography (EEG) is of great importance in aiding the diagnosis and treatment of epilepsy due to the advantages of convenience and economy. Existing seizure detection methods are usually patient-specific, the training and testing are carried out on the same patient, limiting their scalability to other patients. To address this issue, we propose a cross-subject seizure detection method via unsupervised domain adaptation. The proposed method aims to obtain seizure specific information through shallow and deep feature alignments. For shallow feature alignment, we use convolutional neural network (CNN) to extract seizure-related features. The distribution gap of the shallow features between different patients is minimized by multi-kernel maximum mean discrepancies (MK-MMD). For deep feature alignment, adversarial learning is utilized. The feature extractor tries to learn feature representations that try to confuse the domain classifier, making the extracted deep features more generalizable to new patients. The performance of our method is evaluated on the CHB-MIT and Siena databases in epoch-based experiments. Additionally, event-based experiments are also conducted on the CHB-MIT dataset. The results validate the feasibility of our method in diminishing the domain disparities among different patients.

Semantic Mapping of Landscape Morphologies: Tuning ML/DL Classification Approaches for Airborne LiDAR Data

The interest in the enhancement of innovative solutions in the geospatial data classification domain from integrated aerial methods is rapidly growing. The transition from unstructured to structured information is essential to set up and arrange geodatabases and cognitive systems such as digital twins capable of monitoring territorial, urban, and general conditions of natural and/or anthropized space, predicting future developments, and considering risk prevention. This research is based on the study of classification methods and the consequent segmentation of low-altitude airborne LiDAR data in highly forested areas. In particular, the proposed approaches investigate integrating unsupervised classification methods and supervised Neural Network strategies, starting from unstructured point-based data formats. Furthermore, the research adopts Machine Learning classification methods for geo-morphological analyses derived from DTM datasets. This paper also discusses the results from a comparative perspective, suggesting possible generalization capabilities concerning the case study investigated.

A two-layer regression network for robust and accurate domain adaptation

Naturally, classification models suffer from severe performance degradation when they are tested on datasets different from the ones used in training. Unsupervised domain adaptation helps to improve the generalizability of a pre-trained model by transferring knowledge from the labeled source domain (i.e., training dataset) to the unlabeled target domain (i.e., test dataset). The typical way of domain adaptation is to align the data distributions in embedding spaces between source and target domains. However, most existing works only enhance cross-domain consistency in the latent space disregarding the impact of source samples on the target classification task. Besides, discovering a subspace shared by two domains first and then training a transfer classifier separately hardly ensures that the obtained target features are suited for the classification model. To address these issues, in this work, we propose a two-layer regression network for domain adaptation (TRN-DA). TRN-DA learns class-wise domain invariant feature representations by jointly optimizing three tasks: supervised classification of source domain, unsupervised reconstruction of target domain, and alignment of cross-domain distributions. Furthermore, we introduce the concept of weight (importance) for source instances so that the resulting classifier can adapt well to the target domain. We formulate the domain adaptation problem as a unified optimization problem and solve it in an iterative way. Experimental results on different cross-domain image classification tasks demonstrate the encouraging performance of our TRN-DA compared to several recent state-of-the-art methods.

Comprehensive genomic analysis and expression profiling of the cytochrome P450 genes during abiotic stress and flavonoid biosynthesis in potato (Solanum tuberosum)

The research focused on the cytochrome P450 (CYP) superfamily, a prominent enzyme family involved in plant metabolism. A total of 253 StCYP genes from the potato genome were investigated and characterized through various methods, including phylogentic analysis, physical and chemical characterization, chromosome localization, gene structure and conserved protein domain classification, gene duplication occurrences, collinearity and expression pattern analysis. The 253 StCYPs were classified into seven clans and 33 families, distributed unevenly across 12 chromosomes. Collinearity analysis revealed 28 pairs of orthologous genes between potato StCYPs and Arabidopsis AtCYPs. Moreover, the expression of the StCYPs in various tissue parts of doubled haploid (DM) potatoes under abiotic stress and exogenous hormone treatment was investigated by using RNA-seq data from the PGSC database. It was discovered that one StCYP gene likely contributes to drought stress response through the ABA-dependent pathway. Furthermore, RNA-seq analysis of pigmented tuber flesh from three potato clones at three developmental stages enabled the identification of StCYPs potentially implicated in the flavonoid biosynthesis in potato tubers. In particular, StCYP705A-like was further validated for its potential role in this process. Employing Gfanno software in conjunction with RNA-seq data, seven StCYP genes (Two StC4H, three StF3′H, one StFNS Ⅱ and one StF3′5′H) were identified as flavonoid biosynthetic pathway genes in potato. Additionally, five StCYPs in CYP 71 clan demonstrated a strong association with flavonoid biosynthesis. These findings lay a groundwork for a more comprehensive understanding of the StCYP gene family and further exploration of the functions of StCYP genes in potato abiotic stress tolerance and flavonoids biosynthesis.

Multiscale Conditional Adversarial Networks based domain-adaptive method for rotating machinery fault diagnosis under variable working conditions

Deep learning has been increasingly used in health management and maintenance decision-making for rotating machinery. However, some challenges must be addressed to make this technology more effective. For example, the collected data is assumed to follow the same feature distribution, and sufficient labeled training data are available. Unfortunately, domain shifts occur inevitably in real-world scenarios due to different working conditions, and acquiring sufficient labeled samples is time-consuming and expensive in complex environments. This study proposes a novel domain adaptive framework called deep Multiscale Conditional Adversarial Networks (MCAN) for machinery fault diagnosis to address these shortcomings. The MCAN model comprises two key components. Constructed by a novel multiscale module with an attention mechanism, the first component is a shared feature generator that captures rich features at different internal perceptual scales, and the attention mechanism determines the weights assigned to each scale, enhancing the model’s dynamic adjustment and self-adaptation capabilities. The second component consists of two domain classifiers based on Bidirectional Long Short-Term Memory (BiLSTM) leveraging spatiotemporal features at various levels to achieve domain adaptation in the output space. The deep domain classifier also captures the cross-covariance dependencies between feature representations and classifier predictions, thereby improving the predictions’ discriminability. The proposed method has been evaluated using two publicly available fault diagnosis datasets and one condition monitoring experiment. The results of cross-domain transfer tasks demonstrated that the proposed method outperformed several state-of-the-art methods in terms of transferability and stability. This result is a significant step forward in deep learning for health management and maintenance decision-making for rotating machinery, and it has the potential to revolutionize its future application.

Semantic Interaction Meta-Learning Based on Patch Matching Metric.

Metric-based meta-learning methods have demonstrated remarkable success in the domain of few-shot image classification. However, their performance is significantly contingent upon the choice of metric and the feature representation for the support classes. Current approaches, which predominantly rely on holistic image features, may inadvertently disregard critical details necessary for novel tasks, a phenomenon known as "supervision collapse". Moreover, relying solely on visual features to characterize support classes can prove to be insufficient, particularly in scenarios involving limited sample sizes. In this paper, we introduce an innovative framework named Patch Matching Metric-based Semantic Interaction Meta-Learning (PatSiML), designed to overcome these challenges. To counteract supervision collapse, we have developed a patch matching metric strategy based on the Transformer architecture to transform input images into a set of distinct patch embeddings. This approach dynamically creates task-specific embeddings, facilitated by a graph convolutional network, to formulate precise matching metrics between the support classes and the query image patches. To enhance the integration of semantic knowledge, we have also integrated a label-assisted channel semantic interaction strategy. This strategy merges word embeddings with patch-level visual features across the channel dimension, utilizing a sophisticated language model to combine semantic understanding with visual information. Our empirical findings across four diverse datasets reveal that the PatSiML method achieves a classification accuracy improvement of 0.65% to 21.15% over existing methodologies, underscoring its robustness and efficacy.

A semi-supervised learning algorithm for multi-label classification and multi-assignment clustering problems based on a Multivariate Data Analysis

Classically, in classification and clustering problems, an individual is exclusively assigned to a class (labeled data) or a cluster (unlabeled data). However, the assignment to a single class or cluster may be too strict in several real-world domains. In many cases, an individual may belong to multiple classes or clusters at the same time. On the other hand, we are starting to see machine learning algorithms that solve the problem of multi-label classification and multiple cluster assignment, but there are no algorithms that solve both problems simultaneously. Classic semi-supervised algorithms can work with labeled and unlabeled data simultaneously, but these types of algorithms assign individuals to a single class or a single cluster. Today, artificial intelligence faces the challenge of developing semi-supervised learning algorithms to work with semi-labeled data that can be assigned to different classes or clusters at the same time. In particular, this paper proposes a semi-supervised learning algorithm to fill this gap, which can solve the problems of multi-label classification and multiple cluster assignment simultaneously, on a semi-labeled dataset. This proposal is based on the LAMDA algorithm (Learning Algorithm for Multivariate Data Analysis), which calculates the degree of membership of a data to a group/class. In this work, a membership threshold is defined, which allows individuals to be assigned to classes or clusters that have a membership greater than this membership threshold. Thus, the main contribution of this work is the development of a semi-supervised algorithm that can process semi-labeled datasets to assign them to multiple classes and/or clusters. Furthermore, the work defines a metric to evaluate its efficiency in a semi-supervised context, called Multi Label-Cluster Index (MULCI). This proposal is tested on several datasets from the domains of multi-label classification or multi-assignment clustering, or a combination of both, showing very encouraging results. Very good quality metrics results are achieved in multiclass and multicluster tasks.

A source free robust domain adaptation approach with pseudo-labels uncertainty estimation for rolling bearing fault diagnosis under limited sample conditions

As essential components of machinery equipment, rolling bearings directly affect the safety of the machinery equipment. The timely diagnosis of bearing faults can effectively prevent equipment lapses. However, bearings are often inconsistently distributed. This has resulted in a significant decrease in their availability. Moreover, the performances of traditional models are poor when fault samples are scarce. The unsupervised domain adaptation (UDA) model based on the transfer learning theory can solve the above problems in static scenarios. However, source domain data are often not directly accessible for privacy protection. Therefore, achieving the robustness of UDA models is significantly challenging. Source-free UDA can achieve a positive transfer from the source domain to the target domain based only on a pretrained source-domain model and unlabeled target-domain data. In this study, we built a source-free robust UDA approach with pseudo-label uncertainty estimation (SFRDA-PLUE) for diagnosing bearing faults using a limited number of samples. First, we designed a robust feature extractor (SANet) and proposed a novel binary soft-constrained information entropy. This was applied to solve the problem that standard information entropy cannot effectively estimate the uncertainty of pseudo-labels. In addition, we constructed a weighted comparison filter strategy to smoothen the fuzzy samples. Finally, we introduced an information-maximizing loss strategy to optimize the performance of the source domain classifier and the pseudo-label estimator. Thus, the robustness of the pseudo-label uncertainty estimation was significantly improved. The experimental results validated that the SFRDA-PLUE approach can achieve excellent diagnostic performance under a limited number of samples.

Bridging the Gap between Sequence and Structure Classifications of Proteins with AlphaFold Models

Classification of protein domains based on homology and structural similarity serves as a fundamental tool to gain biological insights into protein function. Recent advancements in protein structure prediction, exemplified by AlphaFold, have revolutionized the availability of protein structural data. We focus on classifying about 9000 Pfam families into ECOD (Evolutionary Classification of Domains) by using predicted AlphaFold models and the DPAM (Domain Parser for AlphaFold Models) tool. Our results offer insights into their homologous relationships and domain boundaries. More than half of these Pfam families contain DPAM domains that can be confidently assigned to the ECOD hierarchy. Most assigned domains belong to highly populated folds such as Immunoglobulin-like (IgL), Armadillo (ARM), helix-turn-helix (HTH), and Src homology 3 (SH3). A large fraction of DPAM domains, however, cannot be confidently assigned to ECOD homologous groups. These unassigned domains exhibit statistically different characteristics, including shorter average length, fewer secondary structure elements, and more abundant transmembrane segments. They could potentially define novel families remotely related to domains with known structures or novel superfamilies and folds. Manual scrutiny of a subset of these domains revealed an abundance of internal duplications and recurring structural motifs. Exploring sequence and structural features such as disulfide bond patterns, metal-binding sites, and enzyme active sites helped uncover novel structural folds as well as remote evolutionary relationships. By bridging the gap between sequence-based Pfam and structure-based ECOD domain classifications, our study contributes to a more comprehensive understanding of the protein universe by providing structural and functional insights into previously uncharacterized proteins.

APM: Adaptive parameter multiplexing for class incremental learning

In recent developments within the domain of image classification, deep neural networks (DNNs) have attracted considerable scholarly interest and have been extensively trained using data in closed environments. Such training methodologies contrast sharply with the inherently open, progressive, and adaptive processes of the natural visual system, leading to emergent challenges. Among these, catastrophic forgetting is notable, where the network acquisition of new class information precipitates the erosion of previously established knowledge. Additionally, the network encounters the stability-plasticity dilemma, necessitating a delicate equilibrium between assimilating novel classes and retaining existing ones. To address these issues, we propose a novel incremental learning model, termed Adaptive Parameter Multiplexing (APM), which incorporates a cross-class parameter adaptive incremental strategy. Central to our methodology is the conceptualization of parameter multiplexing or incremental as a learnable optimization problem, enabling the model to autonomously evaluate and decide on the necessity for parameter adjustment throughout its training lifecycle. This framework is designed to enhance the ability of the network to extract features for new class categories effectively through incremental parameters while simultaneously employing parameter multiplexing to augment storage optimization. Our model is underpinned by a dual strategy of coarse-grained and fine-grained parameter multiplexing, guided by a learnable score that dynamically assesses the appropriateness of parameter multiplexing versus incremental updates, facilitating an optimized balance for incremental model performance and storage. In addition, we have integrated a novel regularization loss mechanism for the learnable score to optimize storage efficiency. The effectiveness of APM is empirically validated through rigorous testing on benchmark datasets, including ImageNet100, CIFAR100, CIFAR10, and CUB200. The experimental outcomes indicate that, with a trace amount of parameter increase, our model achieves significant enhancements in classification performance across both new and previously established classes, thereby surpassing existing benchmarks set by state-of-the-art algorithms in the field.

Inter-participant transfer learning with attention based domain adversarial training for P300 detection

A Brain-computer interface (BCI) system establishes a novel communication channel between the human brain and a computer. Most event related potential-based BCI applications make use of decoding models, which requires training. This training process is often time-consuming and inconvenient for new users. In recent years, deep learning models, especially participant-independent models, have garnered significant attention in the domain of ERP classification. However, individual differences in EEG signals hamper model generalization, as the ERP component and other aspects of the EEG signal vary across participants, even when they are exposed to the same stimuli. This paper proposes a novel One-source domain transfer learning method based Attention Domain Adversarial Neural Network (OADANN) to mitigate data distribution discrepancies for cross-participant classification tasks. We train and validate our proposed model on both a publicly available OpenBMI dataset and a Self-collected dataset, employing a leave one participant out cross validation scheme. Experimental results demonstrate that the proposed OADANN method achieves the highest and most robust classification performance and exhibits significant improvements when compared to baseline methods (CNN, EEGNet, ShallowNet, DeepCovNet) and domain generalization methods (ERM, Mixup, and Groupdro). These findings underscore the efficacy of our proposed method.

Leveraging Visual Language Model and Generative Diffusion Model for Zero-Shot SAR Target Recognition

Simulated data play an important role in SAR target recognition, particularly under zero-shot learning (ZSL) conditions caused by the lack of training samples. The traditional SAR simulation method is based on manually constructing target 3D models for electromagnetic simulation, which is costly and limited by the target’s prior knowledge base. Also, the unavoidable discrepancy between simulated SAR and measured SAR makes the traditional simulation method more limited for target recognition. This paper proposes an innovative SAR simulation method based on a visual language model and generative diffusion model by extracting target semantic information from optical remote sensing images and transforming it into a 3D model for SAR simulation to address the challenge of SAR target recognition under ZSL conditions. Additionally, to reduce the domain shift between the simulated domain and the measured domain, we propose a domain adaptation method based on dynamic weight domain loss and classification loss. The effectiveness of semantic information-based 3D models has been validated on the MSTAR dataset and the feasibility of the proposed framework has been validated on the self-built civilian vehicle dataset. The experimental results demonstrate that the first proposed SAR simulation method based on a visual language model and generative diffusion model can effectively improve target recognition performance under ZSL conditions.

In silico prediction of effector proteins in oil palm pest, Metisa plana

Metisa plana is one of the main oil palm leaf defoliators in Malaysia. Infestation of M. plana at the oil palm plantation caused severe yield loss in the past. Many control methods have been introduced to combat the infestation, but the problem persists till today. More information regarding the bagworm is needed to understand the pest-host interaction so that an effective control method can be properly designed. This study was carried out to predict the repertoire of effector proteins secreted by M. plana that could potentially suppress the host defence mechanisms. In silico screening of the secretory proteins from predicted genes was done by using several tools namely SignalP, TMHMM, TargetP and WOLFPSORT. Then, the acquired dataset was subjected to functional annotation through a similarity search against UniProt-Trembl database, gene ontology (GO) using BLAST2GO, InterPro protein domain classification, cluster of orthologous groups (COG), and KEGG pathway prediction. To determine the expression of the predicted genes, TPM value was calculated using the available transcriptomic dataset of M. plana. We identified a total of 948 secretory proteins from the initial screening of the 28,738 proteins predicted from BRAKER2 pipeline. Several proteins were classified as specific protein classes associated with effector functions in insect pests, namely detoxifying enzymes, lipases, peroxidases, Ca2+ binding proteins, and chemosensory and odorant binding proteins. This predicted effector data can be used as a reference for future works in validating the protein’s interaction and mechanisms with the oil palm defence responses.