GDGuohua Dong

Guohua Dong

*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


Guohua Dong has a total of 39 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    DBP: Adaptive and Interpretable Factor Analysis for Single-cell RNA-seq Data with Deep Beta Processes

    by Runyan Liu, Shuofeng Hu, Guohua Dong, Tongtong Kan, Jinhui Shi, Jing Wang, Jiahao Zhou, Zhen He, Xiaomin Ying

    Factor analysis is a method that condenses multiple variables into a few latent factors. It can be used to extract the underlying sources of biological variation in high-dimensional data and distill them into interpretable gene programs. However, existing factorization methods lack adaptability in selecting the optimal number of factors and interpretability in capturing biological variation. To address these concerns, we propose Deep Beta Process (DBP), a deep probabilistic framework for adaptive and interpretable factor analysis of single-cell transcriptomic data. DBP achieves adaptive selection of factors through a stick-breaking Beta process and performs batch correction using an adversarial learning strategy. We validate the flexible factor extraction and robust batch correction capabilities of DBP on simulated datasets. We also demonstrate its superior performance in dimensionality reduction and biological interpretability while explaining biological variation from both cell and gene perspectives using factor and loading matrices. The application of DBP to a gastric adenocarcinoma dataset reveals malignant epithelial cell heterogeneity, providing valuable insights for investigating the molecular mechanisms of disease onset and progression. DBP is available at https://github.com/labomics/DBP and https://ngdc.cncb.ac.cn/biocode/tool/BT007954.

  • Open Access

    Memory recall: Retrieval-Augmented mind reconstruction for brain decoding

    by Yuxiao Zhao, Guohua Dong, Lei Zhu, Xiaomin Ying


  • Open Access

    A Survey on fMRI-based Brain Decoding for Reconstructing Multimodal Stimuli

    by Pengyu Liu, Guohua Dong, Dan Guo, Kun Li, Fengling Li, Xun Yang, Meng Wang, Xiaomin Ying

    In daily life, we encounter diverse external stimuli, such as images, sounds, and videos. As research in multimodal stimuli and neuroscience advances, fMRI-based brain decoding has become a key tool for understanding brain perception and its complex cognitive processes. Decoding brain signals to reconstruct stimuli not only reveals intricate neural mechanisms but also drives progress in AI, disease treatment, and brain-computer interfaces. Recent advancements in neuroimaging and image generation models have significantly improved fMRI-based decoding. While fMRI offers high spatial resolution for precise brain activity mapping, its low temporal resolution and signal noise pose challenges. Meanwhile, techniques like GANs, VAEs, and Diffusion Models have enhanced reconstructed image quality, and multimodal pre-trained models have boosted cross-modal decoding tasks. This survey systematically reviews recent progress in fMRI-based brain decoding, focusing on stimulus reconstruction from passive brain signals. It summarizes datasets, relevant brain regions, and categorizes existing methods by model structure. Additionally, it evaluates model performance and discusses their effectiveness. Finally, it identifies key challenges and proposes future research directions, offering valuable insights for the field. For more information and resources related to this survey, visit https://github.com/LpyNow/BrainDecodingImage.


  • Open Access

    Incomplete Cross-Modal Retrieval with Deep Correlation Transfer

    by Dan Shi, Lei Zhu, Jingjing Li, Guohua Dong, Huaxiang Zhang

    Most cross-modal retrieval methods assume the multi-modal training data is complete and has a one-to-one correspondence. However, in the real world, multi-modal data generally suffers from missing modality information due to the uncertainty of data collection and storage processes, which limits the practical application of existing cross-modal retrieval methods. Although some solutions have been proposed to generate the missing modality data using a single pseudo sample, this may lead to incomplete semantic restoration and sub-optimal retrieval results due to the limited semantic information it provides. To address this challenge, this article proposes an Incomplete Cross-Modal Retrieval with Deep Correlation Transfer (ICMR-DCT) method that can robustly model incomplete multi-modal data and dynamically capture the adjacency semantic correlation for cross-modal retrieval. Specifically, we construct intra-modal graph attention-based auto-encoder to learn modality-invariant representations by performing semantic reconstruction through intra-modality adjacency correlation mining. Then, we design dual cross-modal alignment constraints to project multi-modal representations into a common semantic space, thus bridging the heterogeneous modality gap and enhancing the discriminability of the common representation. We further introduce semantic preservation to enhance adjacency semantic information and achieve cross-modal semantic correlation. Moreover, we propose a nearest-neighbor weighting integration strategy with cross-modal correlation transfer to generate the missing modality data according to inter-modality mapping relations and adjacency correlations between each sample and its neighbors, which improves the robustness of our method against incomplete multi-modal training data. Extensive experiments on three widely tested benchmark datasets demonstrate the superior performance of our method in cross-modal retrieval tasks under both complete and incomplete retrieval scenarios. Our used datasets and source codes are available at https://github.com/shidan0122/DCT.git .


  • Open Access

    A Joint Batch Correction and Adaptive Clustering Method of Single-Cell Transcriptomic Data

    by Sijing An, Jinhui Shi, Runyan Liu, Jing Wang, Shuofeng Hu, Guohua Dong, Xiaomin Ying, Zhen He

    Clustering analysis for single-cell RNA sequencing (scRNA-seq) data is essential for characterizing cellular heterogeneity. However, batch information caused by batch effects is often confused with the intrinsic biological information in scRNA-seq data, which makes accurate clustering quite challenging. A Deep Adaptive Clustering with Adversarial Learning method (DACAL) is proposed here. DACAL jointly optimizes the batch correcting and clustering processes to remove batch effects while retaining biological information. DACAL achieves batch correction and adaptive clustering without requiring manually specified cell types or resolution parameters. DACAL is compared with other widely used batch correction and clustering methods on human pancreas datasets from different sequencing platforms and mouse mammary datasets from different laboratories. The results demonstrate that DACAL can correct batch effects efficiently and adaptively find accurate cell types, outperforming competing methods. Moreover, it can obtain cell subtypes with biological meanings.

  • Top Cited Papers
    Open Access

    When CLIP meets cross-modal hashing retrieval: A new strong baseline

    by Xinyu Xia, Guohua Dong, Fengling Li, Lei Zhu, Xiaomin Ying


  • Open Access

    Discriminative Geometric-Structure-Based Deep Hashing for Large-Scale Image Retrieval

    by Guohua Dong, Xiang Zhang, Xiaobo Shen, Long Lan, Zhigang Luo, Xiaomin Ying

    Deep hashing reaps the benefits of deep learning and hashing technology, and has become the mainstream of large-scale image retrieval. It generally encodes image into hash code with feature similarity preserving, that is, geometric-structure preservation, and achieves promising retrieval results. In this article, we find that existing geometric-structure preservation manner inadequately ensures feature discrimination, while improving feature discrimination of hash code essentially determines hash learning retrieval performance. This fact principally spurs us to propose a discriminative geometric-structure-based deep hashing method (DGDH), which investigates three novel loss terms based on class centers to induce the so-called discriminative geometrical structure. In detail, the margin-aware center loss assembles samples in the same class to the corresponding class centers for intraclass compactness, then a linear classifier based on class center serves to boost interclass separability, and the radius loss further puts different class centers on a hypersphere to tentatively reduce quantization errors. An efficient alternate optimization algorithm with guaranteed desirable convergence is proposed to optimize DGDH. We theoretically analyze the robustness and generalization of the proposed method. The experiments on five popular benchmark datasets demonstrate superior image retrieval performance of the proposed DGDH over several state of the arts.


  • Open Access

    MetaLogo: a heterogeneity-aware sequence logo generator and aligner

    by Yaowen Chen, Zhen He, Yahui Men, Guohua Dong, Shuofeng Hu, Xiaomin Ying

    Sequence logos are used to visually display conservations and variations in short sequences. They can indicate the fixed patterns or conserved motifs in a batch of DNA or protein sequences. However, most of the popular sequence logo generators are based on the assumption that all the input sequences are from the same homologous group, which will lead to an overlook of the heterogeneity among the sequences during the sequence logo making process. Heterogeneous groups of sequences may represent clades of different evolutionary origins, or genes families with different functions. Therefore, it is essential to divide the sequences into different phylogenetic or functional groups to reveal their specific sequence motifs and conservation patterns. To solve these problems, we developed MetaLogo, which can automatically cluster the input sequences after multiple sequence alignment and phylogenetic tree construction, and then output sequence logos for multiple groups and aligned them in one figure. User-defined grouping is also supported by MetaLogo to allow users to investigate functional motifs in a more delicate and dynamic perspective. MetaLogo can highlight both the homologous and nonhomologous sites among sequences. MetaLogo can also be used to annotate the evolutionary positions and gene functions of unknown sequences, together with their local sequence characteristics. We provide users a public MetaLogo web server (http://metalogo.omicsnet.org), a standalone Python package (https://github.com/labomics/MetaLogo), and also a built-in web server available for local deployment. Using MetaLogo, users can draw informative, customized and publishable sequence logos without any programming experience to present and investigate new knowledge on specific sequence sets.


  • Open Access

    MetaLogo: a heterogeneity-aware sequence logo generator and aligner

    by Yaowen Chen, Zhen He, Yahui Men, Guohua Dong, Shuofeng Hu, Xiaomin Ying

    Sequence logos are used to visually display conservations and variations in short sequences. They can indicate the fixed patterns or conserved motifs in a batch of DNA or protein sequences. However, most of the popular sequence logo generators are based on the assumption that all the input sequences are from the same homologous group, which will lead to an overlook of the heterogeneity among the sequences during the sequence logo making process. Heterogeneous groups of sequences may represent clades of different evolutionary origins, or genes families with different functions. Therefore, it is essential to divide the sequences into different phylogenetic or functional groups to reveal their specific sequence motifs and conservation patterns. To solve these problems, we developed MetaLogo, which can automatically cluster the input sequences after multiple sequence alignment and phylogenetic tree construction, and then output sequence logos for multiple groups and aligned them in one figure. User-defined grouping is also supported by MetaLogo to allow users to investigate functional motifs in a more delicate and dynamic perspective. MetaLogo can highlight both the homologous and nonhomologous sites among sequences. MetaLogo can also be used to annotate the evolutionary positions and gene functions of unknown sequences, together with their local sequence characteristics. We provide users a public MetaLogo web server ( http://metalogo.omicsnet.org ), a standalone Python package ( https://github.com/labomics/MetaLogo ), and also a built-in web server available for local deployment. Using MetaLogo, users can draw informative, customized and publishable sequence logos without any programming experience to present and investigate new knowledge on specific sequence sets.

  • Learning deep discriminative embeddings via joint rescaled features and log-probability centers

    by Huayue Cai, Xiang Zhang, Long Lan, Guohua Dong, Chuanfu Xu, Xinwang Liu, Zhigang Luo