BGBaocheng Geng

Baocheng Geng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Baocheng Geng has a total of 34 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Copula-Guided In-Model Interpretable Neural Network for Change Detection in Heterogeneous Remote Sensing Images

    by Weiming Li, Xueqian Wang, Gang Li, Baocheng Geng, Pramod K. Varshney

    Change detection (CD) in heterogeneous remote sensing images has been widely used for disaster monitoring and land-use management. In the past decade, the heterogeneous CD problem has significantly benefited from the development of deep neural networks (DNNs). However, the purely data-driven DNNs perform like a black box where the lack of interpretability limits the trustworthiness and controllability of DNNs in most practical CD applications. As a powerful knowledge-driven tool, copula theory performs well in modeling dependence among random variables. To enhance the interpretability of existing neural networks for heterogeneous CD, we propose a knowledge-data-driven heterogeneous CD method based on a copula-guided neural network, named NN-Copula-CD. In our NN-Copula-CD, the mathematical characteristics of copula are employed as the loss functions to supervise a neural network to learn the dependence between bi-temporal heterogeneous superpixel pairs, and then the changed regions are identified via binary classification based on the degrees of dependence of all the superpixel pairs in the bi-temporal images. We conduct in-depth experiments on four datasets with heterogeneous images, including synthetic aperture radar, multispectral, and near-infrared images, where quantitative and visual results demonstrate the effectiveness and interpretability of our proposed NN-Copula-CD method.


  • Top Cited Papers
    Open Access

    Deep Multimodal Data Fusion

    by Fei Zhao, Chengcui Zhang, Baocheng Geng

    Multimodal Artificial Intelligence (Multimodal AI), in general, involves various types of data (e.g., images, texts, or data collected from different sensors), feature engineering (e.g., extraction, combination/fusion), and decision-making (e.g., majority vote). As architectures become more and more sophisticated, multimodal neural networks can integrate feature extraction, feature fusion, and decision-making processes into one single model. The boundaries between those processes are increasingly blurred. The conventional multimodal data fusion taxonomy (e.g., early/late fusion), based on which the fusion occurs in, is no longer suitable for the modern deep learning era. Therefore, based on the main-stream techniques used, we propose a new fine-grained taxonomy grouping the state-of-the-art (SOTA) models into five classes: Encoder-Decoder methods, Attention Mechanism methods, Graph Neural Network methods, Generative Neural Network methods, and other Constraint-based methods. Most existing surveys on multimodal data fusion are only focused on one specific task with a combination of two specific modalities. Unlike those, this survey covers a broader combination of modalities, including Vision + Language (e.g., videos, texts), Vision + Sensors (e.g., images, LiDAR), and so on, and their corresponding tasks (e.g., video captioning, object detection). Moreover, a comparison among these methods is provided, as well as challenges and future directions in this area.


  • Distributed Quantized Detection of Sparse Signals Under Byzantine Attacks

    by Chen Quan, Yunghsiang S. Han, Baocheng Geng, Pramod K. Varshney

    This paper investigates distributed detection of sparse stochastic signals with quantized measurements under Byzantine attacks, where sensors may send falsified data to the Fusion Center (FC) to degrade system performance. Here, the Bernoulli-Gaussian (BG) distribution is used to model sparse stochastic signals. Several detectors with significantly improved detection performance are proposed by incorporating estimates of attack parameters into the detection process. In the case of unknown sparsity degree and attack parameters, we propose the generalized likelihood ratio test with reference sensors (GLRTRS) as well as the locally most powerful test with reference sensors (LMPTRS). Our simulation results show that these detectors outperform the LMPT and GLRT detectors designed in attack-free environments and achieve detection performance close to the benchmark likelihood ratio test (LRT) detector. In the case of unknown sparsity degree and known fraction of Byzantine nodes in the network, we further propose enhanced LMPTRS (E-LMPTRS) and enhanced GLRTRS (E-GLRTRS) detectors by filtering out potential malicious sensors in the network, resulting in improved detection performance compared to GLRTRS and LMPTRS detectors.


  • On Ordered Transmission Based Distributed Gaussian Shift-in-Mean Detection Under Byzantine Attacks

    by Chen Quan, Saikiran Bulusu, Baocheng Geng, Yunghsiang S. Han, Nandan Sriranga, Pramod K. Varshney

    The ordered transmission based (OT-based) schemes reduce the number of transmissions needed in a distributed detection network without any loss in the probability of error performance. In this paper, we investigate the performance of a conventional OT-based system in the presence of additive Byzantine attacks in Gaussian shift in mean problems. In this work, by launching additive Byzantine attacks, attackers are able to alter the order as well as the data for the binary hypothesis testing problem. We also determine the optimal attack strategy for the Byzantine sensors. Furthermore, we analyze a communication efficient OT-based (CEOT-based) scheme in the presence of additive Byzantine attacks. We obtain the probabilities of error for both the OT-based system and the CEOT-based system under attack and evaluate the number of transmissions they save. We also derive analytical bounds for the number of transmissions saved in both systems under attack. Simulation results show that the additive Byzantine attacks have significant impact on the number of transmissions saved even when the signal strength is sufficiently large. A comparison of detection performance between the conventional OT-based system and the CEOT-based system reveals that the CEOT-based system is more robust to additive Byzantine attacks.


  • Efficient Ordered-Transmission Based Distributed Detection Under Data Falsification Attacks

    by Chen Quan, Nandan Sriranga, Haodong Yang, Yunghsiang S. Han, Baocheng Geng, Pramod K. Varshney

    In distributed detection systems, energy-efficient ordered transmission (EEOT) schemes are able to reduce the number of transmissions required to make a final decision. In this work, we investigate the effect of data falsification attacks on the performance of EEOT-based systems. We derive the probability of error for an EEOT-based system under attack and find an upper bound (UB) on the expected number of transmissions required to make the final decision. Moreover, we tighten this UB by solving an optimization problem via integer programming (IP). We also obtain the FC's optimal threshold which guarantees the optimal detection performance of the EEOT-based system. Numerical and simulation results indicate that it is possible to reduce transmissions while still ensuring the quality of the decision with an appropriately designed threshold.


  • Open Access

    Efficient Ordered-Transmission Based Distributed Detection under Data Falsification Attacks

    by Chen Quan, Nandan Sriranga, Haodong Yang, Yunghsiang S. Han, Baocheng Geng, Pramod K. Varshney

    In distributed detection systems, energy-efficient ordered transmission (EEOT) schemes are able to reduce the number of transmissions required to make a final decision. In this work, we investigate the effect of data falsification attacks on the performance of EEOT-based systems. We derive the probability of error for an EEOT-based system under attack and find an upper bound (UB) on the expected number of transmissions required to make the final decision. Moreover, we tighten this UB by solving an optimization problem via integer programming (IP). We also obtain the FC's optimal threshold which guarantees the optimal detection performance of the EEOT-based system. Numerical and simulation results indicate that it is possible to reduce transmissions while still ensuring the quality of the decision with an appropriately designed threshold.

  • Open Access

    Reputation and Audit Bit Based Distributed Detection in the Presence of Byzantine

    by Chen Quan, Yunghsiang S. Han, Baocheng Geng, Pramod K. Varshney

    In this paper, two reputation based algorithms called Reputation and audit based clustering (RAC) algorithm and Reputation and audit based clustering with auxiliary anchor node (RACA) algorithm are proposed to defend against Byzantine attacks in distributed detection networks when the fusion center (FC) has no prior knowledge of the attacking strategy of Byzantine nodes. By updating the reputation index of the sensors in cluster-based networks, the system can accurately identify Byzantine nodes. The simulation results show that both proposed algorithms have superior detection performance compared with other algorithms. The proposed RACA algorithm works well even when the number of Byzantine nodes exceeds half of the total number of sensors in the network. Furthermore, the robustness of our proposed algorithms is evaluated in a dynamically changing scenario, where the attacking parameters change over time. We show that our algorithms can still achieve superior detection performance.

  • Enhanced Audit Bit Based Distributed Bayesian Detection in the Presence of Strategic Attacks

    by Chen Quan, Baocheng Geng, Yunghsiang S. Han, Pramod K. Varshney

    This paper employs an audit bit based mechanism to mitigate the effect of Byzantine attacks on distributed Bayesian detection systems. In this framework, the optimal attacking strategy for strategic attackers is investigated for the traditional audit bit based scheme (TAS) to evaluate the robustness of the system. We show that it is possible for a strategic attacker to degrade the performance of TAS to the system without audit bits. To enhance the robustness of the system in the presence of strategic attackers, we propose an enhanced audit bit based scheme (EAS). The optimal fusion rule for the proposed scheme is derived and the detection performance of the system is evaluated via the probability of error for the system. Simulation results show that the proposed EAS improves the robustness and the detection performance of the system. Moreover, based on EAS, another new scheme called the reduced audit bit based scheme (RAS) is proposed which further improves system performance. We derive the new optimal fusion rule and the simulation results show that RAS outperforms EAS and TAS in terms of both robustness and detection performance of the system. Then, we extend the proposed RAS for a wide-area cluster based distributed wireless sensor networks (CWSNs). Simulation results show that the proposed RAS significantly reduces the communication overhead between the sensors and the FC, which prolongs the lifetime of the network.