Summary
This work proposes a probability-based pseudo label generation scheme which synthesize dense 3D segmentation masks from sparsely annotated point annotations. Then, the proposed self-attention network extract the probability-driven features, and serve as the basis of the probability informed segmentation loss.
Strengths
(1)This work is aimed to solve the interesting problem of weakly-supervised 3D segmentation.
(2)The manuscript is well wirtten and clearly organized.
Weaknesses
(1) Only evenly distributed annotations are evaluated, which is unavailabel in practice. The proposed method tackles the sparsely annotated points. As described in Sec 3.2.1., the annotators are instructed to select 3D points **evenly distributed on the surface of the targe organ**. However, in practice, the weak annotations exist in hospital systems might be distributed irregularly. If the proposed method is only evaluated on these evenly distributed annotations, it might lost the generalization ability to the datasets in real applications.
(2) The proposed confidence score also relies on the even distribution of point annotations, as it is based on the distance between the target point and the annotated point. Then, its performance could decrease significantly when adapted to the irregularly annotations.
(3) The proposed segmentation loss is a simple combination of Dice and PCE, to take the pseudo labels as supervision. However, this mechanism highly relies on the threshold (hyper-parameter) to determine which pseudo label should be taken. When the annotation is not ideal, there could be a lot of noise in the generated pseudo labels, and this pipline might lost its advantage.
(4) It lacks the comparison with SOTA weakly supervised medical image segmentation methods, such as point-supervised segmentation, scribble-supervised segmentation, et al.
Questions
1. This method is proposed to tackle the 3D medical image segmentation. Can it be adapted to 2D segmentation tasks?
2. For Sec 3.4, the KL divergence loss is introduced to align the distribution of dependency score and the manually-set prior distribution. How to determine this prior distribution and what is the difference between different priors?
3. My main concern is the reliance of the proposed method on uniformly distributed annotations.How does performance change if annotations have a biased distribution?
4. What's the annotation cost of proposed evenly distributed points? What is the difference between this annotation pattern and scribbles/randomly distributed points ?
Rating
3: reject, not good enough
Confidence
3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.