Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Dual-branch distribution consistency contrastive learning model for hard negative sample identification in chest X-rays
Jin XIE, Surong CHU, Yan QIANG, Juanjuan ZHAO, Hua ZHANG, Yong GAO
Journal of Computer Applications    2025, 45 (7): 2369-2377.   DOI: 10.11772/j.issn.1001-9081.2024070968
Abstract33)   HTML0)    PDF (4052KB)(13)       Save

To address the issues of Contrastive Learning (CL) methods struggling to distinguish similar chest X-ray samples and detect tiny lesions in medical images, a dual-branch distribution consistency contrastive learning model (TCL) was proposed. Firstly, inpainting and outpainting data augmentation strategies were employed to strengthen the model’s focus on lung textures, thereby improving the model’s ability to recognize complex structures. Secondly, a collaborative learning approach was used to further enhance the model’s sensitivity to tiny lesions in lungs, thereby capturing lesion information from different perspectives. Finally, the heavy-tailed characteristic of Student-t distribution was utilized to differentiate hard negative samples, so as to constrain the consistency of distributions among different augmented views and samples, thereby reinforcing the learning of feature relationships among hard negatives and other samples, and reducing the influence of hard negatives on the model. Experimental results on four chest X-ray datasets, including pneumoconiosis, NIH (National Institutes of Health), Chest X-Ray Images (Pneumonia), and COVID-19 (Corona Virus Disease 2019), demonstrate that compared to MoCo v2 (Momentum Contrastive Learning) model, TCL model improves the accuracy by 6.14%, 3.08%, 0.65%, and 4.67%, respectively, and in terms of transfer performance on COVID-19 dataset, TCL model achieves improvements of 4.10%, 0.61%, and 8.41%, respectively, at label rate of 5%, 20%, and 50%. Furthermore, CAM (Class Activation Mapping) visualization verifies that TCL model focuses on critical pathological regions effectively, confirming the model’s effectiveness.

Table and Figures | Reference | Related Articles | Metrics
Parallelism of adaptive Hungary greedy algorithm for biomolecular networks alignment
MA Jin XIE Jiang DAI Dongbo TAN Jun ZHANG Wu
Journal of Computer Applications    2013, 33 (12): 3321-3325.  
Abstract658)      PDF (790KB)(595)       Save
Biomolecular networks alignment is an important field, and it is an effective way to study biomolecular phenomenon. Adaptive Hungary Greedy Algorithm (AHGA) is one of the valid biomolecular networks alignment algorithms. Commonly, biomolecular networks have large scale and biological background, so the data of biomolecular networks are special. In order to get the alignment results of biomolecular networks in acceptable time, considering the biological significance when aligning them, two methods including MPI (Message Passing Interface) and CUDA (Compute Unified Device Architecture) were used to parallelize the adaptive hybrid algorithm. The methods were analyzed and compared to find the suitable one for biomolecular networks alignment.
Related Articles | Metrics