Xiaohong Jia

Dr. Xiaohong Jia


Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
23 July 2019 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Open access
LTLei Tao
Lei Tao
PLPeng Liu
Peng Liu
XJXiaohong Jia
Xiaohong Jia
XZXuande Zhang
Xuande Zhang
Hongying MengHongying Meng
Hongying Meng
ANAsoke K. Nandi
Asoke K. Nandi
Clustering algorithms by minimizing an objective function share a clear drawback of having to set the number of clusters manually. Although density peak clustering is able to find the number of clusters, it suffers from memory overflow when it is used for image segmentation because a moderate-size image usually includes a large number of pixels leading to a huge similarity matrix. To address this issue, here we proposed an automatic fuzzy clustering framework (AFCF) for image segmentation. The proposed framework has threefold contributions. First, the idea of superpixel is used for the density peak (DP) algorithm, which efficiently reduces the size of the similarity matrix and thus improves the computational efficiency of the DP algorithm. Second, we employ a density balance algorithm to obtain a robust decision-graph that helps the DP algorithm achieve fully automatic clustering. Finally, a fuzzy c-means clustering based on prior entropy is used in the framework to improve image segmentation results. Because the spatial neighboring information of both the pixels and membership are considered, the final segmentation result is improved effectively. Experiments show that the proposed framework not only achieves automatic image segmentation, but also provides better segmentation results than state-of-the-art algorithms.

10 August 2020 in IEEE Access
Verified
Journal Article
Open access
XJXiaohong Jia
Xiaohong Jia
LTLei Tao
Lei Tao
XDXiaogang Du
Xiaogang Du
SLShigang Liu
Shigang Liu
Hongying MengHongying Meng
Hongying Meng
ANAsoke K. Nandi
Asoke K. Nandi
Traditional fuzzy clustering algorithms suffer from two problems in image segmentations. One is that these algorithms are sensitive to outliers due to the non-sparsity of fuzzy memberships. The other is that these algorithms often cause image over-segmentation due to the loss of image local spatial information. To address these issues, we propose a robust self-sparse fuzzy clustering algorithm (RSSFCA) for image segmentation. The proposed RSSFCA makes two contributions. The first concerns a regularization under Gaussian metric that is integrated into the objective function of fuzzy clustering algorithms to obtain fuzzy membership with sparsity, which reduces a proportion of noisy features and improves clustering results. The second concerns a connected-component filtering based on area density balance strategy (CCF-ADB) that is proposed to address the problem of image over-segmentation. Compared to the integration of local spatial information into the objective functions, the presented CCF-ADB is simpler and faster for the removal of small areas. Experimental results show that the proposed RSSFCA addresses two problems in current fuzzy clustering algorithms, i.e., the outlier sensitivity and the over-segmentation, and it provides better image segmentation results than state-of-the-art algorithms.

23 December 2020 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
DXDinghua Xue
Dinghua Xue
LTLei Tao
Lei Tao
XJXiaohong Jia
Xiaohong Jia
XWXingwu Wang
Xingwu Wang
Tao ChenTao Chen
Tao Chen
ANAsoke K. Nandi
Asoke K. Nandi
Popular unsupervised change detection algorithms suffer from two problems: firstly, the difference image generated by bitemporal images usually includes a large number of falsely changed regions due to noise corruption and illumination change; secondly, fuzzy clustering algorithms are sensitive to noise and they miss the relationship among feature components. To address these issues, we propose a multi-scale and multi-resolution Gaussian-mixture-model guided by saliency-enhancement (SE-MGMM) for change detection in bitemporal remote sensing images. The proposed SE-MGMM makes two contributions. The first is a novel salient strategy that can enhance saliency objects while suppressing the image background. The strategy uses the saliency weight information to enhance changed regions leading to the improvement of grayscale contrast between changed regions and unchanged regions. The second is that we present a Gaussian-mixture-model based on spatial multi-scale and frequency multi-resolution information fusion (SM-FM), which can effectively utilize features of difference images and improve detection results of changed regions. Experiments show that the proposed SE-MGMM is robust for both very high-resolution (VHR) remote sensing images and synthetic aperture radar (SAR) images. Moreover, the SE-MGMM achieves better change detection and provides better performance metrics than state-of-the-art approaches.

30 January 2024 in Computers in Biology and Medicine
Verified
Journal Article
Open access
JWJian Wang
Jian Wang
XYXin Yang
Xin Yang
XJXiaohong Jia
Xiaohong Jia
WXWu-Feng Xue
Wu-Feng Xue
RCRusi Chen
Rusi Chen
NGNing Gu
Ning Gu
Thyroid nodule classification and segmentation in ultrasound images are crucial for computer-aided diagnosis; however, they face limitations owing to insufficient labeled data. In this study, we proposed a multi-view contrastive self-supervised method to improve thyroid nodule classification and segmentation performance with limited manual labels. Our method aligns the transverse and longitudinal views of the same nodule, thereby enabling the model to focus more on the nodule area. We designed an adaptive loss function that eliminates the limitations of the paired data. Additionally, we adopted a two-stage pre-training to exploit the pre-training on ImageNet and thyroid ultrasound images. Extensive experiments were conducted on a large-scale dataset collected from multiple centers. The results showed that the proposed method significantly improves nodule classification and segmentation performance with limited manual labels and outperforms state-of-the-art self-supervised methods. The two-stage pre-training also significantly exceeded ImageNet pre-training.

24 November 2020 in IEEE Access
Verified
Journal Article
Open access
XJXiaohong Jia
Xiaohong Jia
LTLei Tao
Lei Tao
PLPeng Liu
Peng Liu
DXDinghua Xue
Dinghua Xue
Hongying MengHongying Meng
Hongying Meng
ANAsoke K. Nandi
Asoke K. Nandi
Although automatic fuzzy clustering framework (AFCF) based on improved density peak clustering is able to achieve automatic and efficient image segmentation, the framework suffers from two problems. The first one is that the adaptive morphological reconstruction (AMR) employed by the AFCF is easily influenced by the initial structuring element. The second one is that the improved density peak clustering using a density balance strategy is complex for finding potential clustering centers. To address these two problems, we propose a fast and automatic image segmentation algorithm using superpixel-based graph clustering (FAS-SGC). The proposed algorithm has two major contributions. First, the AMR based on regional minimum removal (AMR-RMR) is presented to improve the superpixel result generated by the AMR. The binary morphological reconstruction is performed on a regional minimum image, which overcomes the problem that the initial structuring element of the AMR is chosen empirically, since the geometrical information of images is effectively explored and utilized. Second, we use an eigenvalue gradient clustering (EGC) instead of improved density peak (DP) algorithms to obtain potential clustering centers, since the EGC is faster and requires fewer parameters than the DP algorithm. Experiments show that the proposed algorithm is able to achieve automatic image segmentation, providing better segmentation results while requiring less execution time than other state-of-the-art algorithms.

9 April 2025 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
XJXiaohong Jia
Xiaohong Jia
YLYonghui Li
Yonghui Li
JJJianjun Jiao
Jianjun Jiao
YZYao Zhao
Yao Zhao
ZXZhiwei Xia
Zhiwei Xia
Deep convolutional networks have achieved remarkable success in superpixel segmentation. However, they only focus on local features ignoring global attributes. The visual Mamba demonstrates an exceptional capability to capture long-range dependencies and offers a lower computational cost compared to the Transformer. Building on this inspiration, we propose a novel superpixel segmentation with Mamba, termed SSMamba. In SSMamba, Mamba is integrated into a global-local architecture, enabling efficient interaction between global attributes and local features to produce high-quality superpixels. The designed activation function further enhances the effectiveness of SSMamba. Extensive experiments on four public datasets demonstrate that SSMamba outperforms existing state-of-the-art methods, achieving competitive average values of ASA = 0.9541, BR = 0.8768, BP = 0.2124, UE = 0.0910, and CO = 0.3698.