Skip to Content
EntropyEntropy
  • Article
  • Open Access

18 March 2026

PromptSeg: An End-to-End Universal Medical Image Segmentation Method via Visual Prompts †

,
,
and
School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China
*
Author to whom correspondence should be addressed.
This article is a revised and expanded version of a paper entitled PromptSeg: Learning to Segment Medical Image via Visual Prompts, which was presented at the 2025 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2025), held in Hyderabad, India, 6–11 April 2025.

Abstract

Deep learning has achieved remarkable advancements in medical image segmentation, yet its generalization capability across unseen tasks remains a significant challenge. The variety of task objectives, disease-dependent labeling variations, and multi-center data contribute to the high uncertainty of task-specific models on unseen distributions. In this study, we propose PromptSeg, an innovative Transformer-based unified framework for universal 2D medical image segmentation. From an information-theoretic perspective, PromptSeg formulates the segmentation process as a conditional entropy minimization problem, utilizing visual prompts as side information to reduce the uncertainty of the target task. Guided by the information bottleneck principle, PromptSeg aims to utilize the provided visual prompts to filter out redundant noise and learn contextual representations, thereby breaking the restrictions of the task-specific paradigm. When faced with unseen datasets or segmentation targets, our method only requires a few annotated visual prompt pairs to extract task-specific semantics and segment the query images without retraining. Extensive experiments on CT and MRI datasets demonstrate that PromptSeg not only outperforms state-of-the-art methods but also exhibits strong multi-modality generalization capabilities.

1. Introduction

Precise segmentation of anatomical structures in medical images is pivotal for clinical diagnosis, treatment planning, and image-guided interventions. Over the past decade, deep learning approaches have revolutionized this field, achieving expert-level performance on specific tasks [1,2,3,4,5,6]. However, the standard paradigm—training specialized neural networks for specific organs or datasets—encounters significant bottlenecks in clinical deployment [7]. First, these task-specific models lack flexibility; the segmentation performance significantly degrades when applied to unseen anatomical targets or distinct imaging modalities due to the domain shift. From an information processing standpoint, this failure stems from the high uncertainty inherent in unseen data distributions, which fixed-weight models cannot resolve without additional contextual information. On the other hand, training a segmentation model from scratch for a specific task typically requires large-scale annotated data, leading to high costs.
To address these issues, considerable efforts have been devoted to exploring methods such as transfer learning and few-shot learning. Transfer learning strategies aim to adapt pre-trained models to new tasks through fine-tuning, thereby reducing the demand for annotated data [8,9,10]. Some studies have transferred pre-trained models obtained from large-scale natural image datasets [10,11,12,13], such as ImageNet [14] and COCO [15], to medical image segmentation tasks. While effective to some extent, the substantial feature discrepancy between natural and medical scenes often limits the efficacy of feature reuse [12]. Few-shot-learning-based methods aim to segment query images by leveraging a “support set” containing a few annotated examples. Classic few-shot learning approaches often employ a “learn-to-learn” strategy. These methods require designing a specialized model to construct a representative prototype from the training set and then obtaining segmentation results by matching support and query representations [16,17,18]. Although these methods demonstrate rapid adaptation, they often struggle with cross-modality generalization and fail to capture complex structural variations outside their training domains. Recently, UniverSeg [19] introduced a task-agnostic framework trained on a large-scale and diverse annotated dataset, showing promise in universal segmentation. UniverSeg demonstrates strong generalization ability on unseen anatomical structures and tasks, outperforming existing few-shot methods. However, its reliance on lightweight convolutional blocks restricts its capacity for high-precision segmentation and model scalability.
In recent years, the field of natural language processing (NLP) has witnessed a paradigm shift with the advent of “prompt learning,” which enables the model to infer task objectives from input prompts and adaptively learn from context [20,21]. Existing large language models (LLMs), such as GPT-4, adopt the prompt learning strategy to enhance the generalization ability across various language tasks without parameter updates. Inspired by this success, the computer vision community has begun to investigate prompt learning for natural image analysis such as inpainting and segmentation [22,23]. These methods are no longer limited to specific task objectives but can perform well on various tasks such as image classification, reconstruction, and segmentation defined by the provided visual prompts. However, most existing methods are designed for general image analysis tasks rather than just the segmentation task and rely on complex proxy tasks and training procedures.
To overcome the above problems, we propose an end-to-end universal medical image segmentation method based on prompt learning, named PromptSeg. The core idea is to utilize visual prompts to guide the model in segmenting query images for specified targets, without being limited to specific tasks and data modalities. We interpret the visual prompting process as a conditional entropy minimization mechanism, where the prompts serve as side information to maximize the mutual information between the input context and the prediction. Our main contributions can be summarized as follows:
  • We introduce prompt learning into medical image segmentation, creating a novel end-to-end universal segmentation method.
  • We propose PromptSeg, a task-agnostic framework that employs an image-level auto-regressive model to segment query images through next-image prediction, using a handful of image–mask pairs with the same segmentation class as visual prompts to indicate the task. Furthermore, we aggregate existing open-source datasets to construct a large-scale, multi-source medical segmentation dataset for training PromptSeg.
  • Extensive experiments on multiple open-source datasets demonstrate that PromptSeg outperforms existing few-shot methods in terms of segmentation accuracy and generalization capability on unseen datasets and targets, accompanied by remarkable scalability.

3. Methods

3.1. Overview of PromptSeg

A segmentation task, denoted as T : x y , typically comprises a set of images and their corresponding pixel-wise annotations, represented as a dataset D = { ( x i , y i ) } i = 1 N . Traditional segmentation methods generally focus on training a model to fit the specific data distribution of task T , which limits the model’s applicability solely to that task.
As illustrated in Figure 1, we propose PromptSeg, a novel paradigm designed for generalized medical image segmentation, with a particular focus on unseen tasks. Within a probabilistic framework, PromptSeg formulates the task T as the estimation of a conditional distribution:
p ( y q | x 1 , y 1 , , x n , y n , q ) p ( y q | q , T ) .
This paradigm treats a sequence of image–mask pairs P = ( x 1 , y 1 , , x n , y n ) specific to a task T as a visual prompt, utilizing it to guide the prediction of the target mask y q for a query image q. It is important to note that these visual prompts are not learnable parameters. Instead, they are image–mask pairs that are either provided by users or sampled from existing annotated datasets prior to inference.
Figure 1. Overview of PromptSeg. Given the appropriate visual prompts, PromptSeg can solve different segmentation tasks within a single model.
From an information-theoretic perspective, we posit that the effectiveness of PromptSeg stems from uncertainty reduction, achieved by injecting task-specific information via the prompts. We formulate this process as conditional entropy minimization. In the absence of task-specific guidance, the segmentation target for a query q exhibits high uncertainty, quantified by the Shannon entropy H ( y q | q ) . The sequence of image–mask pairs P serves as side information to mitigate this uncertainty. Our objective is to maximize the mutual information (MI) between the visual prompt P and the target y q , which is equivalent to minimizing the conditional entropy:
I ( y q ; P | q ) = H ( y q | q ) H ( y q | q , P ) .
This formulation demonstrates that PromptSeg effectively learns to extract maximal task-specific semantics from P to eliminate the ambiguity in segmenting q.
PromptSeg aims to automatically identify task patterns through contextual learning, enabling the model to segment the query image under the guidance of visual prompts. As detailed in Figure 2, PromptSeg employs a streamlined end-to-end architecture, comprising an encoder for image feature extraction and a decoder for contextual learning.
Figure 2. The architecture of PromptSeg. This model comprises an image-level encoder, an image-level auto-regressive decoder, and a segmentation head. First, the support visual prompts (image–mask pairs) and the query image are symmetrically processed by the ViT encoder. The extracted feature maps are then flattened and concatenated along the sequence dimension. Subsequently, the decoder utilizes an image-level causal attention mechanism to auto-regressively predict the features of target mask for the query image, strictly conditioned on the provided prompt context. Finally, a lightweight segmentation head transforms the features into a two-dimensional binary mask.

3.2. General Segmentation Task with Visual Prompt

Inspired by the use of prompts in natural language processing to provide instructions to models, we specify tasks through visual prompts. For a set of n images and their corresponding annotations { x { 1 , , n } , y { 1 , , n } } from the segmentation task T , we arrange the paired images and masks alternately to create the prompt sequence [ x 1 , y 1 , x 2 , y 2 , , x n , y n ] . We then input the query image q along with the combined input [ x 1 , y 1 , x 2 , y 2 , , x n , y n , q ] into the model, enabling it to refer to the sequence to perform segmentation on the query.
For the segmentation tasks T { 1 , , K } , we assume they contain respective target category sets C { 1 , , K } . If we use a single model to solve all segmentation tasks T { 1 , , K } , a naive implementation approach is to combine them into a multi-category segmentation task, satisfying T = i = 1 K T i and containing a new category set C = i = 1 K C i . When the number of prompts degenerates to 0, we obtain a segmentation model containing | C | categories. As the size of model parameters increases, models have increasingly strong fitting capabilities. Models that rely solely on the queries for segmentation fit the training set well but fail to reason from context and generalize to solve unseen tasks.
To ensure that PromptSeg can recognize target features from the prompt through in-context learning, we decompose the task into binary segmentation as shown in Figure 3. Suppose that for the multi-class segmentation task T with | C | categories, the segmentation result of image q on task T is y q R H × W × | C | , where H , W represent the height and width of the image. The task T can be decomposed into | C | binary segmentation sub-tasks { T 1 , T 2 , , T | C | } . Correspondingly, y q is decomposed into { y q 1 , y q 2 , , y q | C | } . For the same query q, when using the prompt P j T j , the ground truth y q j R H × W × 1 differs from the ground truth y q k when using P k T k , ensuring that the model cannot directly segment based on the query but instead requires task-specific contextual information provided by the prompt to obtain the correct result.
Figure 3. Task-specific segmentation model and task-agnostic segmentation model schemes. When using task-specific models for multi-class segmentation, each output value is strictly mapped to a predefined category, which prevents the model from extending to new tasks after training. In contrast, task-agnostic models generate binary segmentation results (foreground vs. background) and determine the specific category based on contextual information, allowing for better generalization capability to novel tasks.

3.3. Window Attention Based Encoder with Information Bottleneck

In PromptSeg, the image and mask features are extracted using an image-level encoder. To balance the computational cost and feature quality, we use a ViT-Base [30] with window attention as the encoder following SAM [26]. Specifically, at layers 2, 5, 8, and 11 of ViT-Base, 7 × 7 window attention is used instead of global attention to better capture local dependencies.
However, the high-dimensional features extracted by the backbone often contain redundant information (e.g., background noise) that is irrelevant to the target task. Guided by the information bottleneck (IB) principle, we aim to extract a compressed latent representation that retains sufficient task-relevant information while filtering out irrelevant nuisances.
To physically implement this, we append a lightweight bottleneck adapter after the ViT backbone. As shown in the code structure (Equation (3)), this module consists of a 1 × 1 convolution and a 3 × 3 convolution, followed by LayerNorm operations.
N e c k ( F ) = C o n v 3 × 3 ( L N ( C o n v 1 × 1 ( F ) ) ) .
Functionally, the 1 × 1 convolution projects the high-dimensional ViT embedding (e.g., 768 dim) to a lower dimension (e.g., 256 dim), serving as a compressor to reduce feature redundancy. Subsequently, the 3 × 3 convolution aggregates local spatial context to smooth out pixel-level noise, thereby enhancing the task-relevant structural information.
The image x { 1 , , n } , annotations y { 1 , , n } , and query q are encoded using this shared-parameter encoder:
x { 1 , , n } = N e c k ( V i T ( x { 1 , , n } ) ) , y { 1 , , n } = N e c k ( V i T ( y { 1 , , n } ) ) , q = N e c k ( V i T ( q ) )
The sequence of encoded feature maps F = [ x 1 , y 1 , x 2 , y 2 , , x n , y n , q ] , where x { 1 , , n } , y { 1 , , n } and q R h × w × d , represent the compressed feature maps. Here, d corresponds to the bottleneck dimension, ensuring a compact and semantic-rich representation, while h and w represent the height and width of the feature map, respectively.

3.4. Image-Level Auto-Regressive Decoder

As is shown in Figure 4, we design an image-level conditional probability model that extracts contextual information from the prompt in the sequence. To model the feature map sequence F R ( 2 n + 1 ) × h × w × d from various images and masks, as depicted in Figure 2, we flatten it into a token sequence, F R S × d , where
F = c o n c a t ( x 1 , y 1 , x 2 , y 2 , , x n , y n , q )
where sequential features x , y , q R s × d , s = h × w represents the number of tokens for each subsequence corresponding to a feature map, and S denotes the overall sequence length, satisfying S = h × w × ( 2 n + 1 ) = s × ( 2 n + 1 ) .
Figure 4. Image-level conditional probability model. (1) Training phase: the model simultaneously predicts the next image (the segmentation result) at multiple positions using visual prompts from preceding contexts. (2) Inference phase: replace any image at position ≥2 to predict the result.
To establish an image-level conditional probability model, we utilize a standard 12-layer decoder-only Transformer (structurally equivalent to the GPT-2 small [21] architecture) as our base decoder. Furthermore, we have designed image-level masked self-attention to ensure complete visibility of the preceding visual prompt for each image, while concealing the subsequent segmentation mask. This module enables the auto-regressive prediction of the mask corresponding to each image in the input sequence.
y ^ i = D e c o d e r ( x i | x 1 , y 1 , , x i 1 , y i 1 ) , y ^ i = S e g m e n t a t i o n H e a d ( y ^ i ) , i { 2 , , n }
Specifically, we designed a mechanism to mask out the subsequent information for each image that needs to be predicted in the multi-head attention.
O = s o f t m a x ( Q K d M ) V
M i , j = 1 , i f j i / s s 0 , o t h e r w i s e
As is shown in Figure 5, each token can perceive other tokens within the same image by employing an image-level mask instead of a token-level mask, ensuring the coherence of the features.
Figure 5. Comparison of token-level and image-level attention masks. (Left) Conventional token-level causal masks enforce strict token-wise autoregression, preventing tokens within the same image from attending to each other, which leads to structural fragmentation. (Right) Our image-level autoregressive mask. Spatial tokens within the same query or prompt image are fully visible to each other (see unmasked diagonal blocks). This design ensures holistic spatial coherency and structural continuity.
Figure 4 shows the training and inference schemes of PromptSeg. To ensure feature consistency and maximize training efficiency, the prompt images and the target query image share an identical encoding process. During the training phase, we utilize n + 1 image–mask pairs as input to enable multi-position parallel training. In this next-image prediction process, the first k image–mask pairs serve as a k-pair visual prompt for the subsequent image x k + 1 ( 1 k n ). Thus, the input prompt images inherently act as intermediate queries themselves. The outputs corresponding to x { 2 , 3 , , n + 1 } are supervised and denoted as y ^ { 2 , 3 , , n + 1 } , while outputs from other positions are deprecated. The loss function is defined as:
L t o t a l = 1 n i = 2 n + 1 L ( y ^ i , y i )
During the inference process, PromptSeg can handle a variable number of prompt pairs, ranging from 1 to n prompt pairs, followed by a query image. The loss used for training our PromptSeg is defined as a combination of distribution-based and region-based objectives: L = L c e + L d i c e .
The cross-entropy loss L c e is employed to measure the pixel-wise classification accuracy by minimizing the divergence between the predicted probability distribution and the ground truth. It is formulated as:
L c e = 1 N i = 1 N y i log ( p i ) + ( 1 y i ) log ( 1 p i )
where N denotes the total number of pixels in the query image, y i { 0 , 1 } represents the ground truth label of pixel i, and p i [ 0 , 1 ] is the predicted probability of the foreground class. From an information-theoretic perspective, optimizing the network via the cross-entropy loss in Equation (10) is equivalent to minimizing the empirical conditional entropy defined in Equation (2). By injecting the visual prompt P as a conditioning context, the model extracts task-specific semantics to reduce the uncertainty of the query. This results in a sharper predicted probability distribution p i , which directly minimizes L c e and guides the parameter updates to better utilize the prompt.
To mitigate the issue of class imbalance, where the anatomical target often occupies a small portion of the scan, we incorporate the Dice loss L d i c e . This loss directly optimizes the structural overlap between the prediction and the target mask:
L d i c e = 1 2 i = 1 N y i p i + ϵ i = 1 N y i + i = 1 N p i + ϵ
where ϵ is a smooth term (set to 1 × 10−5) used to prevent division by zero and improve numerical stability.

4. Experiments

4.1. Dataset and Metrics

We collect 20 open-source and 4 private medical segmentation datasets for training and analyzing PromptSeg’s general segmentation capabilities, involving different data modalities, anatomical structures, and segmentation targets. Among them, four datasets, SegThor [31], BTCV [32], CHAOS [33], and Abdominal-OAR, are fully held out for evaluating the effectiveness of various methods and do not participate in the train-validation process. SegThor and BTCV are public CT datasets used for the segmentation of organs-at-risk (OAR) in the thoracic and abdominopelvic regions, respectively. CHAOS is a public MRI dataset reserved for evaluating cross-modality performance. Abdominal-OAR is a private OAR segmentation dataset for liver cancer, collected by the Radiotherapy Department of Anhui Provincial Hospital, where all CT images were annotated by two experienced physicists. In addition, we retain four unique segmentation targets from the TotalSegmentatorV2 [34] dataset—lung upper/lower lobe right/left (Lung-ulr, Lung-llr, Lung-ull, and Lung-lll)—which do not appear in other datasets, for evaluation as unseen targets. This implies that slices containing these classes are excluded from the training process. All MRI datasets utilize the T1 modality. Each dataset involved in the train-validation process is divided into a training validation set at a proportion of 8:2. The detailed information of datasets is listed in Table 1.
Table 1. Dataset information.
All 3D scans are reformatted into 2D axial slices, with the data annotations similarly structured into 2D masks. Separate binary masks are generated for each class within the same 2D slice.
We utilize the Dice similarity coefficient (DSC) as the evaluation metric. For datasets with multiple segmentation targets, we calculate the average performance across all classes. To avoid the random effect of the low-quality prompts, we randomly generate five different prompt sequences for all query images during evaluation and use the average DSC as the final result. In practice, a low-quality prompt typically refers to a sub-optimal slice situated at organ boundaries, corrupted by imaging artifacts, or lacking representative anatomical features.

4.2. Implementation Details

We use PyTorch-2.2.0 to implement the proposed method. All models are trained from scratch using 8 NVIDIA H800 GPUs with 80 GB memory. For data preprocessing, distinct strategies are applied to align with the physical properties of different modalities. CT images are clipped according to the specific window width and level corresponding to the segmentation target, followed by min-max normalization. In contrast, MRI images, lacking standardized intensity values, are clipped at 0.5% and 99.5% of each sample’s intensity histogram before performing min-max normalization to mitigate outlier effects.
The resolution of each input image is 256 × 256, and the patch size is 16 × 16. For each query image, we generate the input sequence or support set by sampling n pairs of image–mask with identical category from the corresponding dataset. In the comparative experiments, n is set to 7, which equals a 7-shot setting in few-shot learning methods. After each training epoch, the input sequences are resampled to generate new prompt-query sequences. The support set is also resampled in the same way.
The model configuration of PromptSeg comprises an encoder and a decoder, each constructed from 12 Transformer layers. The batch size is set to 2, implying that in the case of n equals 7, each training step will concurrently process 32 images on each GPU. During training, we employ an AdamW optimizer with a cosine learning rate scheduler. All methods employ the same data augmentation approach, namely selecting an augmentation method at random from those methods shown in Table 2 each time, and performing data augmentation with the same parameters on the query image and its visual prompts with a probability of p = 0.5 . The other training hyperparameters include a base learning rate of 2 × 10−4, a weight decay of 0.01, β 1 set to 0.9, β 2 set to 0.999, and a one-epoch warm-up period.
Table 2. Data augmentation methods.
The comparative experiments are conducted in two phases to evaluate performance and generalization. First, for the CT modality, models are trained from scratch for five epochs using the collected datasets, explicitly excluding CHAOS, AMOS-MRI, and TotalSegmentator-MRI. Second, for the MRI modality, we perform cross-modality fine-tuning. Models pre-trained on CT are fine-tuned on AMOS-MRI and TotalSegmentator-MRI for approximately 5000 steps, with the learning rate reduced to half of the first phase.

4.3. Comparative Experiments on CT Modality

We compare the proposed PromptSeg with other existing methods including RPT [18], CATNet [17], ALPNet [16], and UniverSeg [19]. Among them, RPT, CATNet, and ALPNet are typical few-shot learning methods, and UniverSeg is the state-of-the-art (SOTA) general medical segmentation model before PromptSeg. It is crucial to emphasize that during the evaluation on these unseen datasets and targets, the model parameters were strictly frozen. The model relies entirely on the provided visual prompts or support set for task adaptation, achieving true training-free transfer.
To evaluate the universality of PromptSeg on the dominant modality in medical imaging, we first conduct extensive comparisons on unseen CT datasets. Experiment results reported in Table 3 and Table 4 demonstrate that PromptSeg performs well on all three unseen datasets and four unseen targets. On the datasets never seen during training, our PromptSeg achieves 55.72% DSC on SegThor, 63.57% DSC on BTCV, and 84.70% DSC on Abdominal-OAR, at least outperforming the other methods by 0.41%, 9.31%, and 9.11%, respectively. On the four classes of unseen segmentation targets, our PromptSeg has achieved 73.82% DSC, 65.17% DSC, and 63.65% DSC on Lung-ulr, Lung-llr, and Lung-lll, respectively, surpassing the other approaches by a bare minimum of 3.52%, 1.81%, and 4.93%, respectively. For the Lung-ull class, we obtain a DSC of 63.35%, only 0.84% lower than the best-performing model ALPNet. The consistent superiority of our method relative to existing methods on these tasks demonstrates the outstanding generalization ability and effectiveness of PromptSeg.
Table 3. Comparison with other methods in Dice similarity coefficient (%, mean ± std) on the held-out CT datasets. Best results are highlighted in bold.
Table 4. Comparison with other methods in Dice similarity coefficient (%, mean ± std) on the retained four unseen targets. Best results are highlighted in bold.

4.4. Comparative Experiments on MRI Modality

An MRI image presents different imaging characteristics compared to CT, relying on proton density and magnetic properties rather than electron density (Hounsfield units). Furthermore, publicly available annotated MRI datasets are significantly scarcer than CT datasets, posing challenges for training large-scale universal models from scratch. To address these challenges, we extended our evaluation to the MRI modality by leveraging the representations learned from the extensive CT data. We initialized PromptSeg with CT-pretrained weights and performed minimal adaptation on the MRI support sets. We compared PromptSeg with the same baselines (RPT, CATNet, ALPNet, and UniverSeg) using the CHAOS dataset as a held-out test set.
As summarized in Table 5, PromptSeg demonstrates superior overall performance in this transfer setting, achieving the highest average DSC of 70.24%. This outperforms the state-of-the-art universal model, UniverSeg (68.73%), and significantly surpasses the best few-shot baseline, ALPNet (63.56%). Specifically, PromptSeg exhibits remarkable robustness on major organs, achieving 83.94% DSC on the liver and an average of 68.70% on the kidneys, surpassing UniverSeg by substantial margins. However, a performance drop is observed on the spleen target (59.67%). This can be attributed to the negative transfer of strong priors learned from CT data. In CT images, the spleen typically presents as an organ with intensity similar to or higher than the liver. Conversely, in T1-weighted MRI, the spleen appears hypointense (darker than the liver). This intensity inversion between modalities conflicts with the strong feature priors captured by PromptSeg during its extensive CT training, leading to misinterpretation in the MRI domain. Despite this specific challenge, PromptSeg maintains the best overall performance, confirming that for most anatomical structures, the structural semantics learned from CT can be effectively transferred to MRI via visual prompts.
Table 5. Cross-modality generalization comparison on the unseen CHAOS MRI dataset in Dice similarity coefficient (%, mean ± std). Best results are highlighted in bold.
This experiment validates PromptSeg’s capability for robust in-context learning across modalities. Despite the intensity inversion challenge in the spleen, the model effectively extracts contextual structural semantics from visual prompts to guide the segmentation. It suggests that the information bottleneck encoder minimizes conditional entropy by filtering modality-specific noise, enabling the model to generalize based on invariant shapes rather than low-level textures.

5. Discussion

While the experimental results have demonstrated the superior performance and cross-modality generalization of PromptSeg, the underlying working mechanism remains a critical subject of inquiry.
In this section, we first conduct an ablation study to isolate the contribution of each core architectural component. Subsequently, we examine the model’s fidelity in following visual prompts. This validates the foundational reliability of the prompt-based interaction. Then, we explore the scalability of the framework by evaluating its performance under varying training and inference settings. This analysis highlights the model’s inference flexibility and deployment efficiency, demonstrating its adaptability to different computational constraints. Next, to provide an interpretable perspective on these behaviors, we visualize and quantify the predictive uncertainty using Shannon entropy. This metric serves as a proxy for the model’s confidence, revealing how visual prompts as side information effectively reduce the uncertainty of the prediction and verifying the underlying mechanism of the proposed framework. Finally, we discuss the inherent limitations and trade-offs of PromptSeg to provide a comprehensive view of its clinical applicability and guide future research.

5.1. Ablation Study

To explicitly isolate and quantify the contribution of the core components in our framework, we conducted comprehensive ablation studies evaluated across four CT datasets.
Prompt Mechanism. Within our task-agnostic framework, multi-class tasks are uniformly decomposed into binary sub-tasks (foreground vs. background). Consequently, conducting an ablation with absolutely no visual prompts ( n = 0 ) is mathematically ill-posed, as the segmentation target becomes entirely undefined without task-specific context. Instead, we utilize the 1-shot setting ( n = 1 ) as the extreme minimal conditioning baseline. As will be demonstrated in the subsequent scaling study (Section 5.3), minimal prompting yields highly constrained performance. The substantial performance surge from n = 1 to n = 7 explicitly verifies the prompt mechanism as the foundational driver of ambiguity resolution.
Architectural Components. Furthermore, we ablated two critical architectural designs under the fixed 7-shot setting. The quantitative results are summarized in Table 6.
Table 6. Ablation study of architectural components (evaluated under 7-shot setting using DSC %, and best results are highlighted in bold).
As shown in the first row of Table 6, removing the bottleneck adapter (comprising the 1 × 1 and 3 × 3 convolutions in Equation (3)) and routing raw high-dimensional ViT features directly to the decoder causes a precipitous performance decline. Notably, the DSC scores plummeted from 55.72% to 28.66% on SegThor and from 66.50% to 57.51% on TotalSegmentator. These results underscore the bottleneck adapter’s indispensable role in filtering noise and compressing redundant information, serving as a concrete physical implementation of our information bottleneck (IB) principle.
Subsequently, we substituted our proposed image-level mask with a conventional token-level auto-regressive mask. This alteration led to a significant performance degradation, most notably a margin of over 5% (from 66.50% to 61.37%) on the challenging TotalSegmentator dataset. Unlike natural language processing (NLP), where unidirectional causality is inherent to sequence modeling, dense spatial features in medical imaging necessitate bidirectional context within each individual image to resolve local ambiguities. These results confirm that image-level visibility is indispensable for preserving spatial coherency and structural continuity during dense prediction tasks.

5.2. Prompt Following Study

PromptSeg is proposed to identify task patterns through contextual information in visual prompts and guide the model to segment specified targets from query images. When visual prompts with different segmentation targets are provided for the same query image, PromptSeg can automatically identify the types of segmentation targets based on the visual prompts and generate corresponding segmentation results. As shown in Figure 6, we provide PromptSeg with four sets of visual prompts, each targeting a different segmentation: right lung, left lung, liver, and spine cord. Each set of visual prompts ends with an identical query image, encompassing all four segmentation targets. It is evident that PromptSeg completely follows the visual prompts, exclusively generating segmentation prediction outcomes that coincide with the present visual prompts in every inference. This indicates that PromptSeg has a good ability to follow prompts and can understand prompts well.
Figure 6. Segmentation results of same query image with different visual prompts. Upon provision of prompts with diverse segmentation targets, PromptSeg generates disparate segmentation results for an identical query image.

5.3. Scaling Study

We conduct training on PromptSeg with varying parameter quantities to explore its scalability on the model side. Specifically, the encoder of PromptSeg expanded from four Transformer layers to twelve, with the decoder correspondingly possessing an equivalent number of layers as the encoder. As shown in Figure 7, the performance of these models on four unseen targets suggests that our model’s generalization capabilities are enhanced concurrently with the scaling of parameters.
Figure 7. Segmentation performance of diverse model sizes on the four unseen segmentation targets. The legend ( 4 , 4 ) denotes a model architecture wherein the model’s encoder and decoder each possess 4 Transformer layers.
Furthermore, we train PromptSeg with varying prompt sequence length configurations to examine its scalability efficacy on the visual prompt side. As shown in Table 7, when the number of image–mask pairs provided to train the model as visual prompts gradually increases from 1 to 11, the segmentation accuracy of PromptSeg also increases accordingly on different datasets. Benefiting from the sequential design, image-level auto-regressive decoder, and the loss elucidated in (9), when trained with n pairs of visual prompts, PromptSeg can accommodate an equal or lesser number of visual prompt pairs during inference. We further conduct scaling experiments on PromptSeg during the inference stage. For the model trained with n = 7 , we provide three to seven pairs of visual prompts during inference. The results presented in Table 8 illustrate that across all four test datasets, the segmentation outcomes consistently demonstrate a characteristic of growing with the increase in the number of input visual prompts. In comparison with Table 7, it becomes apparent that the model trained under the setting of n = 7 exhibits comparable performance to a model specifically trained under the setting of n = 3 , when the quantity of visual prompt pairs is set at three. This signifies that we can accommodate a variety of visual prompt number input scenarios by training a model with a larger n, which is quite effective for practical applications and deployments.
Table 7. Segmentation performance of the same model trained with different prompt pairs. Best results are highlighted in bold.
Table 8. Segmentation performance scaling with varying numbers of visual prompts during inference. The model is trained with a fixed 7-shot setting ( n = 7 ), demonstrating inference flexibility. Best results are highlighted in bold.
In conjunction with the prompt following study and scaling study, we suggest that the segmentation ability of PromptSeg on unseen tasks stems from its understanding and following of visual prompts, and amplifies with the increase of model parameters and provided visual prompts.

5.4. Entropy Dynamics and Uncertainty Quantification

To provide a theoretical interpretation of the model’s behavior, we visualize and quantify the predictive uncertainty using Shannon entropy. We employ a model trained with a fixed 7-shot setting ( n = 7 ) and evaluate it under varying inference settings to observe the dynamic evolution of uncertainty.
In our binary segmentation task, the model output passes through a Softmax layer to produce a probability map. Let p i , c [ 0 , 1 ] denote the predicted probability of class c at pixel i, where C = 2 corresponds to the background ( c = 0 ) and the foreground target ( c = 1 ). Since c = 0 1 p i , c = 1 , the pixel-wise entropy H i is calculated by summing the contributions of both classes:
H i = c = 0 1 p i , c log ( p i , c + ϵ )
where ϵ = 10 8 is a small constant for numerical stability. A higher H i indicates greater uncertainty in the model’s prediction at that location, whereas a lower value implies high confidence in either the background or the foreground.
We first visualize the pixel-wise entropy maps in Figure 8 to understand how visual contexts influence decision confidence. In the 1-shot setting, we observe that the contour of the segmentation target (e.g., spleen) exhibits high entropy. This aligns with the expectation in medical image segmentation, where boundaries are inherently ambiguous. However, critically, we also observe substantial high-entropy clusters in the adjacent non-target background. These regions correspond to false positive predictions (artifacts), indicating high epistemic uncertainty where the limited context fails to distinguish the foreground from similar surrounding tissues. As the number of prompt pairs increases, a clear trend emerges. The transition from 1-shot to 3-shot yields a significant reduction in background artifacts, and by the 7-shot setting, these non-target high-entropy regions effectively vanish. Simultaneously, the entropy values at the boundaries show a consistent downward trend. This suggests that the model integrates richer contextual representations from the expanded support set, gaining more information to resolve local ambiguities. This visualization confirms that increasing the number of prompts effectively transforms the model’s state from high uncertainty to high confidence, specifically by suppressing the ambiguity in non-target regions.
Figure 8. Visualization of entropy dynamics. In the 1-shot setting, high uncertainty (red/yellow) dominates the prediction. As prompts increase, the uncertainty is effectively minimized, remaining only at the object boundaries.
Complementing the visualization, we perform a quantitative evaluation on the BTCV dataset to measure the global reduction in uncertainty. We calculate the average pixel-wise entropy across the test set under different prompt settings. As presented in Table 9, the average entropy exhibits a monotonic decrease as the number of prompt pairs increases. Specifically, the sharpest decline occurs when transitioning from the 1-shot to the 3-shot setting, which aligns perfectly with the rapid performance gain observed in the segmentation metrics. Subsequent additions (from three to seven pairs) yield smaller marginal reductions in entropy. This trajectory is consistent with the segmentation performance in Table 7 and Table 8, validating that PromptSeg optimizes segmentation performance by explicitly minimizing the conditional entropy of the target distribution, thereby ensuring reliable decision making in complex medical scenarios.
Table 9. Quantitative analysis of predictive uncertainty on the BTCV dataset. The average pixel-wise entropy decreases monotonically as more visual prompts are provided, indicating higher model confidence. (↓: lower is better).

5.5. Limitations

While PromptSeg demonstrates strong few-shot generalization capabilities, it possesses several inherent limitations that must be acknowledged for practical clinical deployment.
Two-Dimensional Slice-by-Slice Processing. First and foremost, although clinical CT and MRI data are volumetric, PromptSeg is fundamentally a 2D segmentation framework. It processes 3D volumes in a slice-by-slice manner. While this design significantly reduces the GPU memory footprint required for in-context sequence reasoning, it inherently discards critical inter-slice spatial context along the Z-axis, which can sometimes lead to disjointed predictions across continuous anatomical structures.
Computational Trade-offs for Multi-Target Parsing. A primary engineering limitation stems from the conditional binary decomposition. To segment K distinct anatomical structures simultaneously, the framework requires K independent forward passes. To quantify this overhead, we profiled the computational complexity and inference efficiency on a standard commercial GPU, as summarized in Table 10.
Table 10. Computational complexity and inference efficiency of PromptSeg across different numbers of visual prompts (n).
As demonstrated, even under the 7-shot setting, PromptSeg achieves an inference latency of 42.90 ms per slice (∼23.3 FPS) with a highly affordable memory footprint of ∼3.4 GB. While this efficiency is highly practical and acceptable for on-demand, interactive clinical queries, the linear scaling of computational cost for comprehensive whole-body parsing leaves substantial room for further algorithmic acceleration.
Dataset Construction and Evaluation Protocols. Regarding dataset construction, our current training corpus is predominantly composed of CT scans, which inherently limits the comprehensive verification of cross-modality capabilities. Furthermore, while our framework demonstrates strong generalization on unseen targets and cross-modality datasets, evaluating universal generalization through a strictly isolated cross-region paradigm (e.g., training exclusively on abdominal organs and testing on thoracic organs) was not conducted. Such rigorous cross-region evaluations will be a primary focus in our future scaled-up iterations.
Performance on Complex Tasks and Modality Inversion. Moreover, PromptSeg currently exhibits sub-optimal performance when confronted with highly complex anatomical topologies and severe modality inversion. As visualized in Figure 9, in the challenging tasks of the left upper lung lobe (CT-Lung-ull) and the spleen under MRI modality, the segmentation results intuitively improve as the number of visual prompts increases. However, the corresponding entropy maps indicate that the model’s predictive uncertainty remains relatively high in the boundary regions. Consequently, the segmentation precision in these extreme corner cases has not yet met the rigorous standards required for direct clinical application. Enhancing the model’s robustness, entropy reduction efficiency, and accuracy on such difficult tasks remains a critical objective for future development.
Figure 9. Visual results for lung lobe (CT) and spleen (MRI) segmentation. While the segmentation performance steadily improves with an increasing number of prompts, the prediction maps still exhibit high entropy values.

6. Conclusions

In this work, we propose PromptSeg, an end-to-end universal medical image segmentation method based on prompt learning. We introduce the approach of prompt learning into medical image segmentation, enabling the model to generalize to unseen tasks without additional training by providing a handful of task-specific visual prompts. Our extensive experiments on multiple held-out datasets demonstrate that PromptSeg outperforms existing state-of-the-art few-shot and universal methods on almost all unseen targets. Notably, the model exhibits strong cross-modality robustness, successfully transferring structural knowledge from CT to MRI for major organs, proving the versatility of the proposed framework.
Beyond standard performance metrics, we provide a theoretical interpretation of the model’s effectiveness. Through the visualization of entropy dynamics and quantitative uncertainty analysis, we demonstrate that the model’s generalization capability stems from the minimization of predictive uncertainty via visual contexts. The visual prompts serve as effective side information, collapsing the hypothesis space and suppressing the uncertainty in the query image.
Furthermore, our study highlights the remarkable scalability and inference efficiency of PromptSeg. The model supports flexible deployment with varying numbers of prompts, allowing users to balance computational cost and segmentation precision in real-world clinical scenarios. In the future, we aim to expand the scale of PromptSeg by integrating modern large vision models as the visual backbone to further enhance feature representation. Additionally, we plan to address the specific challenges of negative transfer observed in cross-modality tasks (e.g., intensity inversion in the spleen) by developing lightweight, modality-specific adapters to decouple texture representation from structural priors, ultimately maximizing the model’s universality across diverse imaging protocols.

Author Contributions

Conceptualization, M.Z.; methodology, M.Z.; software, M.Z. and B.W.; data, M.Z. and B.W.; supervision, H.A. and J.S.; visualization, M.Z.; resources, H.A. and J.S.; writing—original draft, M.Z.; funding acquisition, H.A.; writing—review and editing, M.Z., J.S., B.W. and H.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Data are contained within the article.

Acknowledgments

This article is a revised and expanded version of a paper entitled PromptSeg: Learning to Segment Medical Image via Visual Prompts [42], which was presented at the 2025 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2025), held in Hyderabad, India, 6–11 April 2025.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Kamnitsas, K.; Ferrante, E.; Parisot, S.; Ledig, C.; Nori, A.V.; Criminisi, A.; Rueckert, D.; Glocker, B. DeepMedic for Brain Tumor Segmentation. In Proceedings of the Brainlesion: Glioma, Multiple Sclerosis, Stroke and Traumatic Brain Injuries: Second International Workshop, BrainLes 2016, with the Challenges on BRATS, ISLES and mTOP 2016, Held in Conjunction with MICCAI 2016, Athens, Greece, 17 October 2016; Revised Selected Papers 2; Springer: Berlin/Heidelberg, Germany, 2016; pp. 138–149. [Google Scholar]
  2. Isensee, F.; Jaeger, P.F.; Kohl, S.A.; Petersen, J.; Maier-Hein, K.H. nnU-Net: A Self-configuring Method for Deep Learning-based Biomedical Image Segmentation. Nat. Methods 2021, 18, 203–211. [Google Scholar] [CrossRef] [Scilit]
  3. Ronneberger, O.; Fischer, P.; Brox, T. U-net: Convolutional Networks for Biomedical Image Segmentation. In Proceedings of the Medical Image Computing and Computer-Assisted Intervention–MICCAI 2015: 18th International Conference, Munich, Germany, 5–9 October 2015; Proceedings, Part III 18; Springer: Berlin/Heidelberg, Germany, 2015; pp. 234–241. [Google Scholar]
  4. Chen, J.; Lu, Y.; Yu, Q.; Luo, X.; Adeli, E.; Wang, Y.; Lu, L.; Yuille, A.L.; Zhou, Y. Transunet: Transformers Make Strong Encoders for Medical Image Segmentation. arXiv 2021, arXiv:2102.04306. [Google Scholar] [CrossRef] [Scilit]
  5. Huang, G.; Liu, Z.; Van Der Maaten, L.; Weinberger, K.Q. Densely Connected Convolutional Networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Honolulu, HI, USA, 21–26 July 2017; pp. 4700–4708. [Google Scholar]
  6. Shi, J.; Kan, H.; Ruan, S.; Zhu, Z.; Zhao, M.; Qiao, L.; Wang, Z.; An, H.; Xue, X. H-DenseFormer: An Efficient Hybrid Densely Connected Transformer for Multimodal Tumor Segmentation. In Proceedings of the International Conference on Medical Image Computing and Computer-Assisted Intervention; Springer: Berlin/Heidelberg, Germany, 2023; pp. 692–702. [Google Scholar]
  7. Sharma, N.; Aggarwal, L.M. Automated Medical Image Segmentation Techniques. J. Med. Phys. 2010, 35, 3. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  8. Sun, B.; Feng, J.; Saenko, K. Return of Frustratingly Easy Domain Adaptation. In Proceedings of the AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 12–17 February 2016; Volume 30. [Google Scholar]
  9. Zhou, Z.; Sodha, V.; Pang, J.; Gotway, M.B.; Liang, J. Models Genesis. Med. Image Anal. 2021, 67, 101840. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  10. Alzubaidi, L.; Al-Amidie, M.; Al-Asadi, A.; Humaidi, A.J.; Al-Shamma, O.; Fadhel, M.A.; Zhang, J.; Santamaría, J.; Duan, Y. Novel Transfer Learning Approach for Medical Imaging with Limited Labeled Data. Cancers 2021, 13, 1590. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  11. Ghafoorian, M.; Mehrtash, A.; Kapur, T.; Karssemeijer, N.; Marchiori, E.; Pesteie, M.; Guttmann, C.R.; de Leeuw, F.E.; Tempany, C.M.; Van Ginneken, B.; et al. Transfer Learning for Domain Adaptation in MRI: Application in Brain Lesion Segmentation. In Proceedings of the Medical Image Computing and Computer Assisted Intervention- MICCAI 2017: 20th International Conference, Quebec City, QC, Canada, 11–13 September 2017; Proceedings, Part III 20; Springer: Berlin/Heidelberg, Germany, 2017; pp. 516–524. [Google Scholar]
  12. Raghu, M.; Zhang, C.; Kleinberg, J.; Bengio, S. Transfusion: Understanding Transfer Learning for Medical Imaging. Adv. Neural Inf. Process. Syst. 2019, 32. [Google Scholar] [CrossRef] [Scilit]
  13. Shie, C.K.; Chuang, C.H.; Chou, C.N.; Wu, M.H.; Chang, E.Y. Transfer Representation Learning for Medical Image Analysis. In Proceedings of the 2015 37th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC); IEEE: New York, NY, USA, 2015; pp. 711–714. [Google Scholar]
  14. Deng, J.; Dong, W.; Socher, R.; Li, L.J.; Li, K.; Fei-Fei, L. Imagenet: A Large-scale Hierarchical Image Database. In Proceedings of the 2009 IEEE Conference on Computer Vision and Pattern Recognition; IEEE: New York, NY, USA, 2009; pp. 248–255. [Google Scholar]
  15. Lin, T.Y.; Maire, M.; Belongie, S.; Hays, J.; Perona, P.; Ramanan, D.; Dollár, P.; Zitnick, C.L. Microsoft Coco: Common Objects in Context. In Proceedings of the Computer Vision–ECCV 2014: 13th European Conference, Zurich, Switzerland, 6–12 September 2014; Proceedings, Part V 13; Springer: Berlin/Heidelberg, Germany, 2014; pp. 740–755. [Google Scholar]
  16. Ouyang, C.; Biffi, C.; Chen, C.; Kart, T.; Qiu, H.; Rueckert, D. Self-supervision with Superpixels: Training Few-shot Medical Image Segmentation Without Annotation. In Proceedings of the Computer Vision–ECCV 2020: 16th European Conference, Glasgow, UK, 23–28 August 2020; Proceedings, Part XXIX 16; Springer: Berlin/Heidelberg, Germany, 2020; pp. 762–780. [Google Scholar]
  17. Lin, Y.; Chen, Y.; Cheng, K.T.; Chen, H. Few Shot Medical Image Segmentation with Cross Attention Transformer. arXiv 2023, arXiv:2303.13867. [Google Scholar] [CrossRef] [Scilit]
  18. Zhu, Y.; Wang, S.; Xin, T.; Zhang, H. Few-Shot Medical Image Segmentation via a Region-Enhanced Prototypical Transformer. In Proceedings of the International Conference on Medical Image Computing and Computer-Assisted Intervention; Springer: Berlin/Heidelberg, Germany, 2023; pp. 271–280. [Google Scholar]
  19. Butoi, V.I.; Ortiz, J.J.G.; Ma, T.; Sabuncu, M.R.; Guttag, J.; Dalca, A.V. Universeg: Universal Medical Image Segmentation. In Proceedings of the IEEE/CVF International Conference on Computer Vision, Paris, France, 2–3 October 2023; pp. 21438–21451. [Google Scholar]
  20. Brown, T.; Mann, B.; Ryder, N.; Subbiah, M.; Kaplan, J.D.; Dhariwal, P.; Neelakantan, A.; Shyam, P.; Sastry, G.; Askell, A.; et al. Language Models are Few-shot Learners. Adv. Neural Inf. Process. Syst. 2020, 33, 1877–1901. [Google Scholar]
  21. Radford, A.; Wu, J.; Child, R.; Luan, D.; Amodei, D.; Sutskever, I. Language Models are Unsupervised Multitask Learners. OpenAI Blog 2019, 1, 9. [Google Scholar]
  22. Bar, A.; Gandelsman, Y.; Darrell, T.; Globerson, A.; Efros, A. Visual Prompting via Image Inpainting. Adv. Neural Inf. Process. Syst. 2022, 35, 25005–25017. [Google Scholar]
  23. Bai, Y.; Geng, X.; Mangalam, K.; Bar, A.; Yuille, A.; Darrell, T.; Malik, J.; Efros, A.A. Sequential Modeling Enables Scalable Learning for Large Vision Models. arXiv 2023, arXiv:2312.00785. [Google Scholar] [CrossRef] [Scilit]
  24. Dong, Q.; Li, L.; Dai, D.; Zheng, C.; Wu, Z.; Chang, B.; Sun, X.; Xu, J.; Sui, Z. A Survey on In-context Learning. arXiv 2022, arXiv:2301.00234. [Google Scholar]
  25. Alayrac, J.B.; Donahue, J.; Luc, P.; Miech, A.; Barr, I.; Hasson, Y.; Lenc, K.; Mensch, A.; Millican, K.; Reynolds, M.; et al. Flamingo: A Visual Language Model for Few-shot Learning. Adv. Neural Inf. Process. Syst. 2022, 35, 23716–23736. [Google Scholar]
  26. Kirillov, A.; Mintun, E.; Ravi, N.; Mao, H.; Rolland, C.; Gustafson, L.; Xiao, T.; Whitehead, S.; Berg, A.C.; Lo, W.Y.; et al. Segment Anything. arXiv 2023, arXiv:2304.02643. [Google Scholar]
  27. Wang, X.; Wang, W.; Cao, Y.; Shen, C.; Huang, T. Images Speak in Images: A Generalist Painter for In-context Visual Learning. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Vancouver, BC, Canada, 17–24 June 2023; pp. 6830–6839. [Google Scholar]
  28. Wang, X.; Zhang, X.; Cao, Y.; Wang, W.; Shen, C.; Huang, T. Seggpt: Segmenting Everything in Context. arXiv 2023, arXiv:2304.03284. [Google Scholar] [CrossRef] [Scilit]
  29. Esser, P.; Rombach, R.; Ommer, B. Taming Transformers for High-resolution Image Synthesis. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Nashville, TN, USA, 20–25 June 2021; pp. 12873–12883. [Google Scholar]
  30. Dosovitskiy, A.; Beyer, L.; Kolesnikov, A.; Weissenborn, D.; Zhai, X.; Unterthiner, T.; Dehghani, M.; Minderer, M.; Heigold, G.; Gelly, S.; et al. An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale. arXiv 2020, arXiv:2010.11929. [Google Scholar]
  31. Lambert, Z.; Petitjean, C.; Dubray, B.; Kuan, S. Segthor: Segmentation of Thoracic Organs at Risk in CT Images. In Proceedings of the 2020 Tenth International Conference on Image Processing Theory, Tools and Applications (IPTA); IEEE: New York, NY, USA, 2020; pp. 1–6. [Google Scholar]
  32. Landman, B.; Xu, Z.; Igelsias, J.; Styner, M.; Langerak, T.; Klein, A. Miccai Multi-atlas Labeling Beyond the Cranial Vault–Workshop and Challenge. In Proceedings of the MICCAI Multi-Atlas Labeling Beyond Cranial Vault—Workshop Challenge, Munich, Germany, 5–9 October 2015; Volume 5, p. 12. [Google Scholar]
  33. Kavur, A.E.; Gezer, N.S.; Barış, M.; Aslan, S.; Conze, P.H.; Groza, V.; Pham, D.D.; Chatterjee, S.; Ernst, P.; Özkan, S.; et al. CHAOS Challenge-Combined (CT-MR) Healthy Abdominal Organ Segmentation. Med. Image Anal. 2021, 69, 101950. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  34. Wasserthal, J.; Breit, H.C.; Meyer, M.T.; Pradella, M.; Hinck, D.; Sauter, A.W.; Heye, T.; Boll, D.T.; Cyriac, J.; Yang, S.; et al. TotalSegmentator: Robust Segmentation of 104 Anatomic Structures in CT Images. Radiol. Artif. Intell. 2023, 5, e230024. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  35. D’Antonoli, T.A.; Berger, L.K.; Indrakanti, A.K.; Vishwanathan, N.; Weiß, J.; Jung, M.; Berkarda, Z.; Rau, A.; Reisert, M.; Küstner, T.; et al. TotalSegmentator MRI: Robust Sequence-independent Segmentation of Multiple Anatomic Structures in MRI. arXiv 2024, arXiv:2405.19492. [Google Scholar] [CrossRef] [Scilit]
  36. Antonelli, M.; Reinke, A.; Bakas, S.; Farahani, K.; Kopp-Schneider, A.; Landman, B.A.; Litjens, G.; Menze, B.; Ronneberger, O.; Summers, R.M.; et al. The Medical Segmentation Decathlon. Nat. Commun. 2022, 13, 4128. [Google Scholar] [CrossRef] [Scilit]
  37. Sekuboyina, A.; Husseini, M.E.; Bayat, A.; Löffler, M.; Liebl, H.; Li, H.; Tetteh, G.; Kukačka, J.; Payer, C.; Štern, D.; et al. VerSe: A Vertebrae Labelling and Segmentation Benchmark for Multi-detector CT Images. Med. Image Anal. 2021, 73, 102166. [Google Scholar] [CrossRef] [Scilit]
  38. Ji, Y.; Bai, H.; Ge, C.; Yang, J.; Zhu, Y.; Zhang, R.; Li, Z.; Zhang, L.; Ma, W.; Wan, X.; et al. Amos: A Large-scale Abdominal Multi-organ Benchmark for Versatile Medical Image Segmentation. Adv. Neural Inf. Process. Syst. 2022, 35, 36722–36732. [Google Scholar]
  39. Armato, S.G., III; McLennan, G.; Bidaut, L.; McNitt-Gray, M.F.; Meyer, C.R.; Reeves, A.P.; Zhao, B.; Aberle, D.R.; Henschke, C.I.; Hoffman, E.A.; et al. The Lung Image Database Consortium (LIDC) and Image Database Resource Initiative (IDRI): A Completed Reference Database of Lung Nodules on CT Scans. Med. Phys. 2011, 38, 915–931. [Google Scholar] [CrossRef] [Scilit]
  40. Shi, J. StructSeg2019 GTV Segmentation. Available online: https://ieee-dataport.org/documents/structseg2019-gtv-segmentation (accessed on 24 December 2023).
  41. An, P.; Xu, S.; Harmon, S.A.; Turkbey, E.B.; Sanford, T.H.; Amalou, A.; Kassin, M.; Varble, N.; Blain, M.; Anderson, V.; et al. CT Images in COVID-19. Available online: https://www.cancerimagingarchive.net/collection/ct-images-in-covid-19/ (accessed on 24 December 2023).
  42. Zhao, M.; Zhu, Z.; Shi, J.; Wang, Z.; Chen, J.; An, H.; Yan, B. PromptSeg: Learning to Segment Medical Image via Visual Prompts. In Proceedings of the ICASSP 2025—2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Hyderabad, India, 6–11 April 2025; pp. 1–5. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.