Cong Wang

Cong Wang

Auto-generated profile, based on publicly available information

Cong Wang

School of Mathematics and Statistics, Northwestern Polytechnical University, Xian, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
4 July 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
KLKe Li
Ke Li
DWDi Wang
Di Wang
HXHaojie Xu
Haojie Xu
HZHaodi Zhong
Haodi Zhong
CWCong Wang
Cong Wang
Visual grounding in remote sensing images (RSVG) aims to detect specific objects associated with referring expressions in remote sensing images. Existing methods typically combine outputs of pre-trained visual and linguistic backbones to locate referred objects. However, due to the lack of interaction with the language modality during the visual feature extraction process, the visual backbone may suffer from attention drift, limiting RSVG’s performance. To avoid this, we propose a novel RSVG framework, namely Language-guided Progressive Visual Attention (LPVA), which achieves precise attention on referred objects by adjusting visual features with a progressive attention module and a multi-level feature enhancement decoder. Specifically, the former can dynamically generate multi-scale weights and biases, enabling the visual backbone to gradually focus on expression-related features at spatial and channel levels. The latter is designed to aggregate visual contextual information of the referred objects to enhance features distinctiveness while simultaneously suppressing information of irrelevant regions. To thoroughly examine the localization capability of RSVG models, we construct a new large-scale benchmark dataset, namely OPT-RSVG, which poses challenges in comprehensive understanding among complex scenarios. Experimental results show that the proposed method pushes the accuracy score to 82.27% (6.29% absolute improvement) on DIOR-RSVG dataset and 78.03% on OPT-RSVG dataset, thus setting new records. The source codes of the proposed method and OPT-RSVG dataset are available at https://github.com/like413/OPT-RSVG.

14 April 2020 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
CWCong Wang
Cong Wang
WPWitold Pedrycz
Witold Pedrycz
Mengchu ZhouMengchu Zhou
Mengchu Zhou
Zhiwu LiZhiwu Li
Zhiwu Li
The conventional fuzzy C-means (FCM) algorithm is not robust to noise and its rate of convergence is generally impacted by data distribution. Consequently, it is challenging to develop FCM-related algorithms that have good performance and require less computing time. In this article, we elaborate on a comprehensive FCM-related algorithm for image segmentation. To make FCM robust, we first utilize a morphological grayscale reconstruction (MGR) operation to filter observed images before clustering, which guarantees noise-immunity and image detail-preservation. Since real images can generally be approximated by sparse coefficients in a tight wavelet frame system, feature spaces of observed and filtered images can be obtained. Taking such features to be clustered, we investigate an improved FCM model in which a sparse regularization term is introduced into the objective function of FCM. We design a three-step iterative algorithm to solve the sparse regularization-based FCM model, which is constructed by the Lagrangian multiplier method, hard-threshold operator, and normalization operator, respectively. Such an algorithm can not only perform well for image segmentation, but also come with high computational efficiency. To further enhance the segmentation accuracy, we use MGR to filter the label set generated by clustering. Finally, a large number of supporting experiments and comparative studies with other FCM-related algorithms available in the literature are provided. The obtained results for synthetic, medical and color images indicate that the proposed algorithm has good ability for multiphase image segmentation, and performs better than other alternative FCM-related algorithms. Moreover, the proposed algorithm requires less time than most of the existing algorithms.

8 October 2021 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
CWCong Wang
Cong Wang
WPWitold Pedrycz
Witold Pedrycz
Zhiwu LiZhiwu Li
Zhiwu Li
Mengchu ZhouMengchu Zhou
Mengchu Zhou
In this article, we elaborate on a Kullback–Leibler (KL) divergence-based Fuzzy ${C}$ -Means (FCM) algorithm by incorporating a tight wavelet frame transform and morphological reconstruction (MR). To make membership degrees of each image pixel closer to those of its neighbors, a KL divergence term on the partition matrix is introduced as a part of FCM, thus resulting in KL divergence-based FCM. To make the proposed FCM robust, a filtered term is augmented in its objective function, where MR is used for image filtering. Since tight wavelet frames provide redundant representations of images, the proposed FCM is performed in a feature space constructed by tight wavelet frame decomposition. To further improve its segmentation accuracy (SA), a segmented feature set is reconstructed by minimizing the inverse process of its objective function. Each reconstructed feature is reassigned to the closest prototype, thus modifying abnormal features produced in the reconstruction process. Moreover, a segmented image is reconstructed by using tight wavelet frame reconstruction. Finally, supporting experiments coping with synthetic, medical, and real-world images are reported. The experimental results exhibit that the proposed algorithm works well and comes with better segmentation performance than other peers. In a quantitative fashion, its average SA improvements over its peers are 4.06%, 3.94%, and 4.41%, respectively, when segmenting synthetic, medical, and real-world images. Moreover, the proposed algorithm requires less time than most of the FCM-related algorithms.

7 October 2020 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
CWCong Wang
Cong Wang
WPWitold Pedrycz
Witold Pedrycz
Zhiwu LiZhiwu Li
Zhiwu Li
Mengchu ZhouMengchu Zhou
Mengchu Zhou
SGShuzhi Ge
Shuzhi Ge
G-images refer to image data defined on irregular graph domains. This article elaborates on a similarity-preserving Fuzzy C -Means (FCM) algorithm for G-image segmentation and aims to develop techniques and tools for segmenting G-images. To preserve the membership similarity between an arbitrary image pixel and its neighbors, a Kullback–Leibler divergence term on partition matrix is introduced as a part of FCM. As a result, similarity-preserving FCM is developed by considering spatial information of image pixels for its robustness enhancement. Due to superior characteristics of a wavelet space, the proposed FCM is performed in this space rather than the Euclidean one used in conventional FCM to secure its high robustness. Experiments on synthetic and real-world G-images demonstrate that it indeed achieves higher robustness and performance than the state-of-the-art segmentation algorithms. Moreover, it requires less computation than most of them.

1 December 2022 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
CWCong Wang
Cong Wang
Mengchu ZhouMengchu Zhou
Mengchu Zhou
WPWitold Pedrycz
Witold Pedrycz
Zhiwu LiZhiwu Li
Zhiwu Li
Since a noisy image has inferior characteristics, the direct use of Fuzzy ${C}$ -Means (FCM) to segment it often produces poor image segmentation results. Intuitively, using its ideal value (noise-free image) benefits FCM’s robustness enhancement. Therefore, the realization of accurate noise estimation in FCM is a new and important task. To date, only two noise-estimation-based FCM algorithms have been proposed for image segmentation, that is: 1) deviation-sparse FCM (DSFCM) and 2) our earlier proposed residual-driven FCM (RFCM). In this article, we make a thorough comparative study of DSFCM and RFCM. We demonstrate that an RFCM framework can realize more accurate noise estimation than DSFCM when different types of noise are involved. It is mainly thanks to its utilization of noise distribution characteristics instead of noise sparsity used in DSFCM. We show that DSFCM is a particular case of RFCM, thus signifying that they are the same when only impulse noise is involved. With a spatial information constraint, we demonstrate RFCM’s superior effectiveness and efficiency over DSFCM in terms of supporting experiments with different levels of single, mixed, and unknown noise.

18 April 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
HWHeng Wang
Heng Wang
CWCong Wang
Cong Wang
YYYuan Yuan
Yuan Yuan
Single hyperspectral image super-resolution aims to reconstruct a high-resolution hyperspectral image from a low-resolution one, which does not use any auxiliary images. For now, existing super-resolution methods often ignore the difference between the features of neighbor and non-neighbor spectral bands, leaving the feature exploration untargeted. As a result, the complementary information of such bands has not been effectively exploited. To do so, we propose an asymmetric dual-direction quasi-recursive network for single hyperspectral image super-resolution, which separately explores the features among neighbor and non-neighbor bands via forward and backward units. By considering the high similarity among neighbor bands, each forward unit thoroughly exploits spatial-spectral features among such bands through two kinds of correspondence aggregation modules. It also preserves a spectral structure by a spectral band grouping strategy and a spatial-spectral consistency module. Owning to the inconsecutive spectra among non-neighbor bands, backward units focus on extracting spatial features in such bands. With the aid of a global feature context fusion module, the information of global non-neighbor context and neighbor bands are adaptively fused, thus improving information completeness and complementarity. Experimental results reported for natural and remote sensing hyperspectral image datasets demonstrate the proposed network not only outperforms the state-of-the-art methods in terms of reconstruction quality and noise suppression, but also requires a smaller memory footprint.