Jiazhou Chen

Jiazhou Chen

Auto-generated profile, based on publicly available information

Jiazhou Chen

School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 January 2022 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
YLYang Li
Yang Li
Tingting DanTingting Dan
Tingting Dan
HLHaojiang Li
Haojiang Li
JCJiazhou Chen
Jiazhou Chen
HPHong Peng
Hong Peng
HCHongmin Cai
Hongmin Cai
Nasopharyngeal carcinoma (NPC) is a malignant tumor whose survivability is greatly improved if early diagnosis and timely treatment are provided. Accurate segmentation of both the primary NPC tumors and metastatic lymph nodes (MLNs) is crucial for patient staging and radiotherapy scheduling. However, existing studies mainly focus on the segmentation of primary tumors, eliding the recognition of MLNs, and thus fail to comprehensively provide a landscape for tumor identification. There are three main challenges in segmenting primary NPC tumors and MLNs: variable location, variable size, and irregular boundary. To address these challenges, we propose an automatic segmentation network, named by NPCNet, to achieve segmentation of primary NPC tumors and MLNs simultaneously. Specifically, we design three modules, including position enhancement module (PEM), scale enhancement module (SEM), and boundary enhancement module (BEM), to address the above challenges. First, the PEM enhances the feature representations of the most suspicious regions. Subsequently, the SEM captures multiscale context information and target context information. Finally, the BEM rectifies the unreliable predictions in the segmentation mask. To that end, extensive experiments are conducted on our dataset of 9124 samples collected from 754 patients. Empirical results demonstrate that each module realizes its designed functionalities and is complementary to the others. By incorporating the three proposed modules together, our model achieves state-of-the-art performance compared with nine popular models.

24 September 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
BZBin Zhang
Bin Zhang
YZYue Zhang
Yue Zhang
JLJunyu Li
Junyu Li
JCJiazhou Chen
Jiazhou Chen
Tatsuya AkutsuTatsuya Akutsu
Tatsuya Akutsu
HCHongmin Cai
Hongmin Cai
Hashing technology has exhibited great cross-modal retrieval potential due to its appealing retrieval efficiency and storage effectiveness. Most current supervised cross-modal retrieval methods heavily rely on accurate semantic supervision, which is intractable for annotations with ever-growing sample sizes. By comparison, the existing unsupervised methods rely on accurate sample similarity preservation strategies with intensive computational costs to compensate for the lack of semantic guidance, which causes these methods to lose the power to bridge the semantic gap. Furthermore, both kinds of approaches need to search for the nearest samples among all samples in a large search space, whose process is laborious. To address these issues, this paper proposes an unsupervised dual deep hashing (UDDH) method with semantic-index and content-code for cross-modal retrieval. Deep hashing networks are utilized to extract deep features and jointly encode the dual hashing codes in a collaborative manner with a common semantic index and modality content codes to simultaneously bridge the semantic and heterogeneous gaps for cross-modal retrieval. The dual deep hashing architecture, comprising the head code on semantic index and tail codes on modality content, enhances the efficiency for cross-modal retrieval. A query sample only needs to search for the retrieved samples with the same semantic index, thus greatly shrinking the search space and achieving superior retrieval efficiency. UDDH integrates the learning processes of deep feature extraction, binary optimization, common semantic index, and modality content code within a unified model, allowing for collaborative optimization to enhance the overall performance. Extensive experiments are conducted to demonstrate the retrieval superiority of the proposed approach over the state-of-the-art baselines

29 December 2020 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
JCJiazhou Chen
Jiazhou Chen
GHGuoqiang Han
Guoqiang Han
HCHongmin Cai
Hongmin Cai
DYDefu Yang
Defu Yang
Paul LaurientiPaul Laurienti
Paul Laurienti
GWGuorong Wu
Guorong Wu
Converging evidence shows that disease-relevant brain alterations do not appear in random brain locations, instead, their spatial patterns follow large-scale brain networks. In this context, a powerful network analysis approach with a mathematical foundation is indispensable to understand the mechanisms of neuropathological events as they spread through the brain. Indeed, the topology of each brain network is governed by its native harmonic waves, which are a set of orthogonal bases derived from the Eigen-system of the underlying Laplacian matrix. To that end, we propose a novel connectome harmonic analysis framework that provides enhanced mathematical insights by detecting frequency-based alterations relevant to brain disorders. The backbone of our framework is a novel manifold algebra appropriate for inference across harmonic waves. This algebra overcomes the limitations of using classic Euclidean operations on irregular data structures. The individual harmonic differences are measured by a set of common harmonic waves learned from a population of individual Eigen-systems, where each native Eigen-system is regarded as a sample drawn from the Stiefel manifold. Specifically, a manifold optimization scheme is tailored to find the common harmonic waves, which reside at the center of the Stiefel manifold. To that end, the common harmonic waves constitute a new set of neurobiological bases to understand disease progression. Each harmonic wave exhibits a unique propagation pattern of neuropathological burden spreading across brain networks. The statistical power of our novel connectome harmonic analysis approach is evaluated by identifying frequency-based alterations relevant to Alzheimer's disease, where our learning-based manifold approach discovers more significant and reproducible network dysfunction patterns than Euclidean methods.

24 November 2020 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
Hong PengHong Peng
Hong Peng
YHYu Hu
Yu Hu
JCJiazhou Chen
Jiazhou Chen
HWHaiyan Wang
Haiyan Wang
YLYang Li
Yang Li
HCHongmin Cai
Hongmin Cai
The performance of most the clustering methods hinges on the used pairwise affinity, which is usually denoted by a similarity matrix. However, the pairwise similarity is notoriously known for its venerability of noise contamination or the imbalance in samples or features, and thus hinders accurate clustering. To tackle this issue, we propose to use information among samples to boost the clustering performance. We proved that a simplified similarity for pairs, denoted by a fourth order tensor, equals to the Kronecker product of pairwise similarity matrices under decomposable assumption, or provide complementary information for which the pairwise similarity missed under indecomposable assumption. Then a high order similarity matrix is obtained from the tensor similarity via eigenvalue decomposition. The high order similarity capturing spatial information serves as a robust complement for the pairwise similarity. It is further integrated with the popular pairwise similarity, named by IPS2, to boost the clustering performance. Extensive experiments demonstrated that the proposed IPS2 significantly outperformed previous similarity-based methods on real-world datasets and it was capable of handling the clustering task over under-sampled and noisy datasets.

10 July 2019 in IEEE Transactions on Biomedical Engineering
Verified
Journal Article
Closed access
JCJiazhou Chen
Jiazhou Chen
GHGuoqiang Han
Guoqiang Han
AXAodan Xu
Aodan Xu
HCHongmin Cai
Hongmin Cai
Objective: The accumulation of large amounts of multidimensional genomic data provides new opportunities to study multilevel biological regulatory associations. Identifying multidimensional regulatory modules (md-modules) from omics data is crucial to provide a comprehensive understanding of the regulatory mechanisms of biological systems. Methods: We develop a multi-graph matching with multiple network constraints (MGMMNC) model to identify the md-modules. The MGMMNC model aims to accurately capture highly relevant md-modules by considering the relationships intra- and inter- multidimensional omics data, including interactions within a network and cycle consistency information. The proposed technique adopts a novel graph-smoothing similarity measurement for the highly contaminated genetic data. Results: The superiority and effectiveness of MGMMNC have been demonstrated by comparative experiments with three state-of-the-art techniques using simulated and cervical cancer data. Conclusion: MGMMNC can accurately and efficiently identify the md-modules that are significantly enriched in GO biological processes and in KEGG pathways. Many different level molecules in the same md-module collaboratively regulate the same pathway. Moreover, the md-modules are capable of stratifying patients into subtypes with significant survival differences. Significance: The problem of identifying multidimensional regulatory modules from omics data is formulated as a multi-graph matching problem, and multiple network constraints and cycle consistency information are seamlessly integrated into the matching model.

8 April 2024 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
HCHongmin Cai
Hongmin Cai
BZBin Zhang
Bin Zhang
JLJunyu Li
Junyu Li
BHBin Hu
Bin Hu
JCJiazhou Chen
Jiazhou Chen
Current cross-modal retrieval methods heavily rely on accurate semantic labels or sample similarity measurements, and need to search for the nearest samples among all samples in the huge search space, severely limiting the application in stratifying large-scale and high-dimensional multimodal data. To tackle with the issues, this paper proposes an unsupervised cross-modal retrieval method to bypass the semanticwise supervision and samplewise similarity from a standpoint of featurewise matching, named by unsupervised dual hashing coding (UDC). It jointly learns the dual hashing codes on semantic tagging and sample content through factorizing a feature matching potential, which is allowed to bridge the semantic and heterogeneous gaps among different modalities simultaneously through maintaining the inter-modality-consistent semantic information and cross-modality-correlated sample content. In this way, each sample is uniquely coded by a head code on semanticwise tags, and tail codes on samplewise content. The dual coding design makes it very efficient for sample retrieval, in which the query sample only need to search for the retrieved ones with the same semantic tag, greatly narrowing down the search space. The proposed model avoids the calculation of massive sample-wise similarity and works with dual hashing coding scheme, which achieves a twofold efficiency enhancement for analyzing the large-scale and high-dimensional multimodal data. Extensive experiments have been conducted to demonstrate that it achieved superiority on computational time and retrieval performance.