ArticleMedical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention2022
Longitudinal Infant Functional Connectivity Prediction via Conditional Intensive Triplet Network.
Article in Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
3 citing papers in PubMed.
- INDIVIDUALIZED TRAJECTORY PREDICTION OF EARLY DEVELOPING FUNCTIONAL CONNECTIVITY.Proceedings. IEEE International Symposium on Biomedical Imaging · 2025Article
- ENHANCING GROUP-WISE CONSISTENCY IN 3-HINGE GYRUS MATCHING VIA ANATOMICAL EMBEDDING AND STRUCTURAL CONNECTIVITY OPTIMIZATION.Proceedings. IEEE International Symposium on Biomedical Imaging · 2024Article
- SUPERVISED DEEP TREE IN ALZHEIMER'S DISEASE.Proceedings. IEEE International Symposium on Biomedical Imaging · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
10 authors.
Funding
Abstract
Longitudinal infant brain functional connectivity (FC) constructed from resting-state functional MRI (rs-fMRI) has increasingly become a pivotal tool in studying the dynamics of early brain development. However, due to various reasons including high acquisition cost, strong motion artifact, and subject dropout, there has been an extreme shortage of usable longitudinal infant rs-fMRI scans to construct longitudinal FCs, which hinders comprehensive understanding and modeling of brain functional development at early ages. To address this issue, in this paper, we propose a novel conditional intensive triplet network (CITN) for longitudinal prediction of the dynamic development of infant FC, which can traverse FCs within a long duration and predict the target FC at any specific age during infancy. Targeting at accurately modeling of the progression pattern of FC, while maintaining the individual functional uniqueness, our model effectively disentangles the intrinsically mixed age-related and identity-related information from the source FC and predicts the target FC by fusing well-disentangled identity-related information with the specific age-related information. Specifically, we introduce an intensive triplet auto-encoder for effective disentanglement of age-related and identity-related information and an identity conditional module to mix identity-related information with designated age-related information. We train the proposed model in a self-supervised way and design downstream tasks to help robustly disentangle age-related and identity-related features. Experiments on 464 longitudinal infant fMRI scans show the superior performance of the proposed method in longitudinal FC prediction in comparison with state-of-the-art approaches.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.