检索结果-内蒙古大学图书馆

SS-MAF: Semi-Supervised Echocardiographic Segmentation Using Multi-Atlas Fusion

学校读者我要写书评

暂无评论

SS-MAF: Semi-Supervised Echocardiographic Segmentation Using...

Communication, Image and Signal Processing (CCISP), International Conference on

作者： Shuaihua Yang Caixia Zheng College of Information Science and Technology Northeast Normal University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Left ventricle (LV) segmentation in echocardiography is of paramount significance in cardiac function analysis. Recently, semi-supervised segmentation has garnered considerable attention due to its potential mitigation of labeling costs. Despite this, most semi-supervised methodologies tend to overlook the specialized anatomical priors specific to echocardiography, often yielding suboptimal outcomes. Simultaneously, atlas priors have been validated on other organs and imaging modalities. However, their direct application in echocardiography is fraught with challenges, primarily attributed to the indistinct boundaries of the LV and the presence of fan-shaped image edges, which impede atlas image registration. This paper presents a new method of semi-supervised segmentation using multi-atlas fusion, named SS- MAF, which is designed to incorporate atlas priors tailored for echocardiography while circumventing the intricate image registration process in traditional atlas-based methods. The SS-MAF comprises two components: a Multi-Task Learning (MTL) module and a Multi-Atlas Fusion (MAF) module. The MTL module serves precise landmark localization and segmentation estimation. The MAF module is primarily focused on the generation of probabilistic atlases, utilizing annotated atlas data with the guidance of key landmarks to facilitate the automatic annotation of unlabeled data, avoiding the traditional image-level registration, thus enhancing the performance of the MTL module. Our SS- MAF is rigorously evaluated on the publicly available CAMUS dataset, with results demonstrating its superiority over other state-of-the-art semi-supervised segmentation techniques in echocardiography.

关键词：

Troublemaker Learning for Low-Light Image Enhancement

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Song, Yinghao Cao, Zhiyuan Xiang, Wanhong Long, Sifan Ge, Hongwei Liang, Yanchun Yang, Bo Wu, Chunguo College of Computer Science and Technology Jilin University Jilin China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin China YGSOFT INC Dalian University of Technology China

Low-light image enhancement (LLIE) restores the color and brightness of underexposed images. Supervised methods suffer from high costs in collecting low/normal-light image pairs. Unsupervised methods invest substantial effort in crafting complex loss functions. We address these two challenges through the proposed TroubleMaker Learning (TML) strategy, which employs normal-light images as inputs for training. TML is simple: we first dim the input and then increase its brightness. TML is based on two core components. First, the troublemaker model (TM) constructs pseudo low-light images from normal images to relieve the cost of pairwise data. Second, the predicting model (PM) enhances the brightness of pseudo low-light images. Additionally, we incorporate an enhancing model (EM) to further improve the visual performance of PM outputs. Moreover, in LLIE tasks, characterizing global element correlations is important because more information on the same object can be captured. CNN cannot achieve this well, and self-attention has high time complexity. Accordingly, we propose Global Dynamic Convolution (GDC) with O(n) time complexity, which essentially imitates the partial calculation process of self-attention to formulate elementwise correlations. Based on the GDC module, we build the UGDC model. Extensive quantitative and qualitative experiments demonstrate that UGDC trained with TML can achieve competitive performance against state-of-the-art approaches on public datasets. The code is available at https://***/Rainbowman0/TML LLIE. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

Migration: An Efficient Explorer Operator to Guide Swarm Evolution

学校读者我要写书评

暂无评论

Migration: An Efficient Explorer Operator to Guide Swarm Evo...

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Xiaosong Han Chengyang Zhou Yanchun Liang Renchu Guan Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Jilin University Changchun China Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Zhuhai Laboratory of Key Laboratory for Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Zhuhai College of Science and Technology Zhuhai China

Particle Swarm Optimization with Migration (MPSO) is proposed to solve the issue that PSO will encounter unbearable time cost problems when dealing with High-dimension, Expensive and Black-box objective function tasks. The Migration operator is inspired by the migration of Salmon. Salmon will start a dangerous journey from the ocean to the home rivers for reproduction. The process of the entire behavior is similar to the reduction and recovery of dimension. Therefore, we design the Migration operator where a pretrained Wasserstein Autoencoders (WAE) is applied to simulate the migration behavior to accelerate the process of evolution in PSO, and we use Least-Squares Regression in lower space to produce better generation. In comparison with famous baseline methods in some benchmark functions, MPSO converges faster and more accurately, which shows the great potential of migration operations.

关键词：

DeciLS-PBO: an Effective Local Search Method for Pseudo-Boolean Optimization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jiang, Luyu Ouyang, Dantong Zhang, Qi Zhang, Liming College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China

Local search is an effective method for solving large-scale combinatorial optimization problems, and it has made remarkable progress in recent years through several subtle mechanisms. In this paper, we found two ways to improve the local search algorithms in solving Pseudo-Boolean Optimization(PBO): Firstly, some of those mechanisms such as unit propagation are merely used in solving MaxSAT before, which can be generalized to solve PBO as well;Secondly, the existing local search algorithms utilize the heuristic on variables, so-called score, to mainly guide the search. We attempt to gain more insights into the clause, as it plays the role of a middleman who builds a bridge between variables and the given formula. Hence, we first extended the combination of unit propagation-based decimation algorithm to PBO problem, giving a further generalized definition of unit clause for PBO problem, and apply it to the existing solver LS-PBO for constructing an initial assignment;then, we introduced a new heuristic on clauses, dubbed care, to set a higher priority for the clauses that are less satisfied in current iterations. Experiments on benchmarks from the most recent PB Competition, as well as three real-world application benchmarks including minimum-width confidence band, wireless sensor network optimization, and seating arrangement problems show that our algorithm DeciLS-PBO has a promising performance compared to the state-of-the-art algorithms. Copyright © 2023, The Authors. All rights reserved.

关键词： Wireless sensor networks

Robust Federated Semi-Supervised Learning for Medical Image Classification via Pseudo-Label Filtering

学校读者我要写书评

暂无评论

Robust Federated Semi-Supervised Learning for Medical Image ...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Ziwei Wang Shuyu Guo Mingzhu Zhu Tian Bai College of Software Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Federated learning (FL) enables collaborative model training across multiple medical institutions to ensure data security. However, due to the variations in medical imaging equipment and regions at different medical institutions, FL methods usually suffer from insufficient data annotations and irrelevant noise within private datasets. To address these issues, a robust federated semi-supervised learning method via pseudo-label filtering (PFRFed) is introduced to utilize unlabeled data while mitigating the impact of noise data. Compared with existing federated semi-supervised learning methods, we propose a pseudo-label filtering mechanism with double dynamic thresholds, which allows the model to adopt more unlabeled data by adjusting the confidence and entropy thresholds at each stage of model training. Moreover, to reduce the degradation caused by noise data in private datasets from different clients, a noise-tolerant loss function and a grouping aggregation method based on the local model similarity are employed. The comparative experiments demonstrate the effectiveness of PFRFed, which has achieved the best classification accuracy of 95.20% and 88.72% on two public medical datasets. Also, PFRFed exhibits heightened resilience to variations in noisy data ratio and labeled data ratio, reaffirming its versatility and robustness.

关键词： Training Filtering Biological system modeling Noise Semisupervised learning Data models Robustness Noise measurement Biomedical imaging Image classification

Uncertainty-Aware Global-View Reconstruction for Multi-View Multi-Label Feature Selection

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Hao, Pingting Liu, Kunpeng Gao, Wanfu College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Department of Computer Science Portland State University PortlandOR97201 United States

In recent years, multi-view multi-label learning (MVML) has gained popularity due to its close resemblance to real-world scenarios. However, the challenge of selecting informative features to ensure both performance and efficiency remains a significant question in MVML. Existing methods often extract information separately from the consistency part and the complementary part, which may result in noise due to unclear segmentation. In this paper, we propose a unified model constructed from the perspective of global-view reconstruction. Additionally, while feature selection methods can discern the importance of features, they typically overlook the uncertainty of samples, which is prevalent in realistic scenarios. To address this, we incorporate the perception of sample uncertainty during the reconstruction process to enhance trustworthiness. Thus, the global-view is reconstructed through the graph structure between samples, sample confidence, and the view relationship. The accurate mapping is established between the reconstructed view and the label matrix. Experimental results demonstrate the superior performance of our method on multi-view datasets. Copyright © 2025, The Authors. All rights reserved.

关键词： Feature Selection

Improved CS Algorithm and its Application in Parking Space Prediction

学校读者我要写书评

暂无评论

Journal of Bionic engineering 2020年第5期17卷 1075-1083页

作者： Rui Guo Xuanjing Shen Hui Kang College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China

This paper simulates the cuckoo incubation process and flight path to optimize the Wavelet Neural Network(WNN)model,and proposes a parking prediction algorithm based on WNN and improved Cuckoo Search(CS)***,the initialization parameters are provided to optimize the WNN using the improved *** traditional CS algorithm adopts the strategy of overall update and evaluation,but does not consider its own information,so the convergence speed is very *** proposed algorithm employs the evaluation strategy of group update,which not only retains the advantage of fast convergence of the dimension-by-dimension update evaluation strategy,but also increases the mutual relationship between the nests and reduces the overall running ***,we use the WNN model to predict parking *** proposed algorithm is compared with six different heuristic algorithms in five *** experimental results show that the proposed algorithm is superior to other algorithms in terms of running time and accuracy.

关键词： wavelet neural network cuckoo search algorithm available parking spaces prediction bionic

WHO IS YOUR RIGHT MIXUP PARTNER IN POSITIVE AND UNLABELED LEARNING 10

学校读者我要写书评

暂无评论

WHO IS YOUR RIGHT MIXUP PARTNER IN POSITIVE AND UNLABELED LE...

10th International Conference on Learning Representations, ICLR 2022

作者： Li, Changchun Li, Ximing Feng, Lei Ouyang, Jihong College of Computer Science and Technology Jilin University China College of Computer Science Chongqing University China Imperfect Information Learning Team RIKEN Center for Advanced Intelligence Project Japan Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China

Positive and Unlabeled (PU) learning targets inducing a binary classifier from weak training datasets of positive and unlabeled instances, which arise in many real-world applications. In this paper, we propose a novel PU learning method, namely Positive and unlabeled learning with Partially Positive Mixup (P3Mix), which simultaneously benefits from data augmentation and supervision correction with a heuristic mixup technique. To be specific, we take inspiration from the decision boundary deviation phenomenon observed in our preliminary experiments, where the learned PU boundary tends to deviate from the fully supervised boundary towards the positive side. For the unlabeled instances with ambiguous predictive results, we select their mixup partners from the positive instances around the learned PU boundary, so as to transform them into augmented instances near to the boundary yet with more precise supervision. Accordingly, those augmented instances may push the learned PU boundary towards the fully supervised boundary, thereby improving the classification performance. Comprehensive experimental results demonstrate the effectiveness of the heuristic mixup technique in PU learning and show that P3Mix can consistently outperform the state-of-the-art PU learning methods. © 2022 ICLR 2022 - 10th International Conference on Learning Representationss. All rights reserved.

关键词： Heuristic methods

Reconsidering Feature Structure Information and Latent Space Alignment in Partial Multi-label Feature Selection

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Pan, Hanlin Liu, Kunpeng Gao, Wanfu College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Department of Computer Science Portland State University PortlandOR97201 United States

The purpose of partial multi-label feature selection is to select the most representative feature subset, where the data comes from partial multi-label datasets that have label ambiguity issues. For label disambiguation, previous methods mainly focus on utilizing the information inside the labels and the relationship between the labels and features. However, the information existing in the feature space is rarely considered, especially in partial multi-label scenarios where the noises is considered to be concentrated in the label space while the feature information is correct. This paper proposes a method based on latent space alignment, which uses the information mined in feature space to disambiguate in latent space through the structural consistency between labels and features. In addition, previous methods overestimate the consistency of features and labels in the latent space after convergence. We comprehensively consider the similarity of latent space projections to feature space and label space, and propose new feature selection term. This method also significantly improves the positive label identification ability of the selected features. Comprehensive experiments demonstrate the superiority of the proposed method. Copyright © 2025, The Authors. All rights reserved.

关键词： Feature extraction