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

Multi-label inductive matrix completion for joint MGMT and IDH1 status prediction for glioma patients 1

学校读者我要写书评

暂无评论

20th International Conference on medical Image computing and computer-assisted intervention, MICCAI 2017

作者： Chen, Lei Zhang, Han Thung, Kim-Han Liu, Luyan Lu, Junfeng Wu, Jinsong Wang, Qian Shen, Dinggang Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China Department of Radiology and BRIC University of North Carolina Chapel Hill United States School of Biomedical Engineering Med-X Research Institute Shanghai Jiao Tong University Shanghai China Department of Neurosurgery Huashan Hospital Fudan University Shanghai China Shanghai Key Lab of Medical Image Computing and Computer Assisted Intervention Shanghai China

ISBN: (数字)9783319661858

ISBN: (纸本)9783319661841

MGMT promoter methylation and IDH1 mutation in high-grade gliomas (HGG) have proven to be the two important molecular indicators associated with better prognosis. Traditionally, the statuses of MGMT and IDH1 are obtained via surgical biopsy, which is laborious, invasive and time-consuming. Accurate presurgical prediction of their statuses based on preoperative imaging data is of great clinical value towards better treatment plan. In this paper, we propose a novel Multi-label Inductive Matrix Completion (MIMC) model, highlighted by the online inductive learning strategy, to jointly predict both MGMT and IDH1 statuses. Our MIMC model not only uses the training subjects with possibly missing MGMT/IDH1 labels, but also leverages the unlabeled testing subjects as a supplement to the limited training dataset. More importantly, we learn inductive labels, instead of directly using transductive labels, as the prediction results for the testing subjects, to alleviate the overfitting issue in small-sample-size studies. Furthermore, we design an optimization algorithm with guaranteed convergence based on the block coordinate descent method to solve the multivariate non-smooth MIMC model. Finally, by using a precious single-center multi-modality presurgical brain imaging and genetic dataset of primary HGG, we demonstrate that our method can produce accurate prediction results, outperforming the previous widely-used single- or multi-task machine learning methods. This study shows the promise of utilizing imaging-derived brain connectome phenotypes for prognosis of HGG in a non-invasive manner. © Springer International Publishing AG 2017.

关键词： Forecasting

A Novel Method for the Absolute Pose Problem with Pairwise Constraints

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Liu, Yinlong Li, Xuechen Wang, Manning Chen, Guang Song, Zhijian Knoll, Alois Technische Universität München Digital Medical Research Center School of Basic Medical Sciences Fudan University Shanghai Key Laboratory of Medical Imaging Computing and Computer Assisted Intervention Tongji University

Absolute pose estimation is a fundamental problem in computer vision, and it is a typical parameter estimation problem, meaning that efforts to solve it will always suffer from outlier-contaminated data. Conventionally, for a fixed dimensionality d and the number of measurements N, a robust estimation problem cannot be solved faster than O(Nd). Furthermore, it is almost impossible to remove d from the exponent of the runtime of a globally optimal algorithm. However, absolute pose estimation is a geometric parameter estimation problem, and thus has special constraints. In this paper, we consider pairwise constraints and propose a globally optimal algorithm for solving the absolute pose estimation problem. The proposed algorithm has a linear complexity in the number of correspondences at a given outlier ratio. Concretely, we first decouple the rotation and the translation subproblems by utilizing the pairwise constraints, and then we solve the rotation subproblem using the branch-and-bound algorithm. Lastly, we estimate the translation based on the known rotation by using another branch-and-bound algorithm. The advantages of our method are demonstrated via thorough testing on both synthetic and real-world data. Copyright © 2019, The Authors. All rights reserved.

关键词： Branch and bound method

Dual Attention Poser: Dual Path Body Tracking Based on Attention

学校读者我要写书评

暂无评论

Dual Attention Poser: Dual Path Body Tracking Based on Atten...

IEEE computer Society Conference on computer Vision and Pattern Recognition Workshops (CVPRW)

作者： Xinhan Di Xiaokun Dai Xinkang Zhang Xinrong Chen Deepearthgo Academy for Engineering&Technology Fudan Universiry Shanghai Key Laboratory of Medical Image Computing and Computer Assisted Intervention Fudan University

Currently, mixed reality head-mounted displays tracking the full body of users is an important human-computer interaction mode through the pose of the head and the hands. Unfortunately, users’ virtual representation and experience is limited due to high reconstruction error when simple transformer network architecture is applied. In this paper, we present a novel model, named Dual Attention Poser, which can learn the whole body reconstruction at a high accuracy. The proposed model consists of three key modules. Among them, dual-path attention encoder is designed to extract feature of the sparse signals. Cross attention mixer module enable the fusion of representation in the double path. Attention-gated-mlp decoder is applied to decode the hidden feature from the sparse input through attention gate. Test results on the AMASS dataset show that Dual Attention Poser can reduce the error by up to 18.2% in comparison with the state-of-the-art results.

关键词：

Rethinking Multiple Instance Learning: Developing an Instance-Level Classifier via Weakly-Supervised Self-Training

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ma, Yingfan Luo, Xiaoyuan Yuan, Mingzhi Chen, Xinrong Wang, Manning The Digital Medical Research Center School of Basic Medical Science Fudan University Shanghai200032 China The Shanghai Key Laboratory of Medical Image Computing and Computer Assisted Intervention Shanghai200032 China

Multiple instance learning (MIL) problem is currently solved from either bag-classification or instance-classification perspective, both of which ignore important information contained in some instances and result in limited performance. For example, existing methods often face difficulty in learning hard positive instances. In this paper, we formulate MIL as a semi-supervised instance classification problem, so that all the labeled and unlabeled instances can be fully utilized to train a better classifier. The difficulty in this formulation is that all the labeled instances are negative in MIL, and traditional self-training techniques used in semi-supervised learning tend to degenerate in generating pseudo labels for the unlabeled instances in this scenario. To resolve this problem, we propose a weakly-supervised self-training method, in which we utilize the positive bag labels to construct a global constraint and a local constraint on the pseudo labels to prevent them from degenerating and force the classifier to learn hard positive instances. It is worth noting that easy positive instances are instances are far from the decision boundary in the classification process, while hard positive instances are those close to the decision boundary. Through iterative optimization, the pseudo labels can gradually approach the true labels. Extensive experiments on two MNIST synthetic datasets, five traditional MIL benchmark datasets and two histopathology whole slide image datasets show that our method achieved new SOTA performance on all of them. The code will be publicly available. Impact Statement-MIL is a primary research field within weakly supervised learning and has numerous applications, such as histopathology analysis, video anomaly detection, and drug design. However, current mainstream methods in MIL predominantly rely on bag labels to train the network, consequently overlooking the potential of instance-level supervision information. In our paper, we highlight the

关键词： Self-supervised learning

Pos-Bert: Point Cloud One-Stage Bert Pre-Training

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Fu, Kexue Gao, Peng Liu, Shaolei Wang, Manning Digital Medical Research Center School of Basic Medical Science Fudan University China Shandong Computer Science Center China Shanghai Key Lab of Medical Image Computing and Computer Assisted Intervention China Shanghai AILab China

Recently, the pre-training paradigm combining Transformer and masked language modeling in BERT has achieved tremendous success not only in NLP, but also in images and point clouds. However, directly extending BERT from NLP to point clouds requires first training a discrete Variational AutoEncoder (dVAE) as the tokenizer, which results in a complex two-stage process, as in Point-BERT. Inspired by BERT and MoCo, we propose POS-BERT, a one-stage BERT pre-training method for point clouds. Specifically, we use the masked patch modeling (MPM) task to perform point cloud pre-training, which aims to recover masked patch information under the supervision of a tokenizer's output. Unlike Point-BERT, whose tokenizer is extra-trained and frozen, we propose a momentum tokenizer which is dynamically updated during training the Transformer. Furthermore, in order to better learn high-level semantic representation, we integrate contrastive learning into the proposed framework to maximize the class token consistency between augmented point cloud pairs. Experiments show that POS-BERT achieves the state-of-the-art performance on linear SVM classification of ModelNet40 with fixed feature extractors, and it exceeds Point-BERT by 3.5%. In addition, POS-BERT has significantly improved many downstream tasks, including fine-tuned classification, few-shot classification and part segmentation. The code and the trained model will be released soon. © 2023, The Authors. All rights reserved.

关键词： Natural language processing systems

Boosting 3D Point Cloud Registration by Transferring Multi-modality Knowledge

学校读者我要写书评

暂无评论

Boosting 3D Point Cloud Registration by Transferring Multi-m...

IEEE International Conference on Robotics and Automation (ICRA)

作者： Mingzhi Yuan Xiaoshui Huang Kexue Fu Zhihao Li Manning Wang Digital Medical Research Center School of Basic Medical Science Fudan University Shanghai China Shanghai Key Laboratory of Medical Image Computing and Computer Assisted Intervention Shanghai China Shanghai artificial intelligence Lab. China

The recent multi-modality models have achieved great performance in many vision tasks because the extracted features contain the multi-modality knowledge. However, most of the current registration descriptors have only concentrated on local geometric structures. This paper proposes a method to boost point cloud registration accuracy by transferring the multi-modality knowledge of pre-trained multi-modality model to a new descriptor neural network. Different to the previous multi-modality methods that requires both modalities, the proposed method only requires point clouds during inference. Specifically, we propose an ensemble descriptor neural network combining pre-trained sparse convolution branch and a new point-based convolution branch. By fine-tuning on a single modality data, the proposed method achieves new state-of-the-art results on 3DMatch and competitive accuracy on 3DLoMatch and KITTI. The code and the trained model will be released at https://***/phdymz/***.

关键词：

Ddfp: Data-Dependent Frequency Prompt for Source Free Domain Adaptation of medical Image Segmentation

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Yin, Siqi Liu, Shaolei Wang, Manning Digital Medical Research Center School of Basic Medical Science Fudan University Shanghai200032 China Shanghai Key Laboratory of Medical Image Computing and Computer Assisted Intervention Shanghai200032 China

Domain adaptation aims to address model performance degradation problem under domain gap. In the typical setting of unsupervised domain adaptation, labeled data from source domain and unlabeled data from target domain are used to train a target model. However, access to source domain medical data can be restricted due to privacy policies, in which scenario, the research attention has shifted to source free domain adaptation (SFDA) which only requires a trained source domain model and unlabeled target domain data for adaptation. Existing SFDA methods often utilize domain-dependent image style translation and self-supervision techniques to reduce domain gap and train the target domain model. However, the quality of domain-dependent style translated images and pseudo labels still leaves room for improvement. Moreover, training the entire model during adaptation is suboptimal under limited supervision. In this paper, we propose a novel SFDA framework to overcome these limitations. Specifically, to effectively mitigate the impact of domain gap in the initial training phase, we introduce pre-adaptation to derive a pre-adapted model for target model initialization and generate quality enhanced pseudo labels without introducing additional parameters. Furthermore, we propose a data-dependent frequency prompt to better translate target domain images into a source-like style individually. Subsequently, the style-related layers fine-tuning strategy tailored for SFDA is used to train the target model using the prompted target domain images and pseudo labels. Extensive experiments on cross-modality abdominal and cardiac SFDA segmentation tasks demonstrated that our proposed method outperforms the state-of-the-art baselines. Our code is available online. © 2024, The Authors. All rights reserved.

关键词： Semantic Segmentation

Robust Point Cloud Registration Framework Based on Deep Graph Matching(TPAMI Version)

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Fu, Kexue Luo, Jiazheng Luo, Xiaoyuan Liu, Shaolei Zhang, Chenxi Wang, Manning The Digital Medical Research Center School of Basic Medical Science Fudan University Shanghai200032 China The Shanghai Key Laboratory of Medical Image Computing and Computer Assisted Intervention Shanghai200032 China

3D point cloud registration is a fundamental problem in computer vision and robotics. Recently, learning-based point cloud registration methods have made great progress. However, these methods are sensitive to outliers, which lead to more incorrect correspondences. In this paper, we propose a novel deep graph matching-based framework for point cloud registration. Specifically, we first transform point clouds into graphs and extract deep features for each point. Then, we develop a module based on deep graph matching to calculate a soft correspondence matrix. By using graph matching, not only the local geometry of each point but also its structure and topology in a larger range are considered in establishing correspondences, so that more correct correspondences are found. We train the network with a loss directly defined on the correspondences, and in the test stage the soft correspondences are transformed into hard one-to-one correspondences so that registration can be performed by a correspondence-based solver. Furthermore, we introduce a transformer-based method to generate edges for graph construction, which further improves the quality of the correspondences. Extensive experiments on object-level and scene-level benchmark datasets show that the proposed method achieves state-of-the-art performance. The code is available at: https://***/fukexue/RGM. Copyright © 2022, The Authors. All rights reserved.

关键词： Topology

Boosting 3D Point Cloud Registration by Transferring Multi-modality Knowledge

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yuan, Mingzhi Huang, Xiaoshui Fu, Kexue Li, Zhihao Wang, Manning The Digital Medical Research Center School of Basic Medical Science Fudan University Shanghai200032 China The Shanghai Key Laboratory of Medical Image Computing and Computer Assisted Intervention Shanghai200032 China The Shanghai artificial intelligence Lab China

关键词： Convolution