- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes a computationally efficient strategy for zero-shot referring image segmentation with negated referring expressions. The strategy incorporates three scores: a base score and a target-compatibility score to assess the alignment between candidate objects and the target described in the expression, and a negation-violation score to penalize candidates that violate the negation constraints. Experimental results demonstrate competitive performance with low computational requirements.
Critical strengths
-
The paper is clearly written and easy to follow.
-
The proposed method achieves competitive performance with low computational cost.
Critical weaknesses
-
The paper argues that the base score can introduce substantial bias. However, the proposed method initially uses this score to select the top-(K) candidate masks for subsequent processing. This raises a concern that valid target masks may already be excluded at this stage. How can the target-compatibility and negation-violation scores mitigate this initial bias, particularly when the correct mask is absent from the selected candidates? Further analysis of candidate recall and sensitivity to (K) would help address this concern.
-
The operation in Eq. (9) is unclear. Please clarify its purpose, define the relevant terms, and provide an example illustrating how it works.
-
The paper does not present failure cases. Including representative failure examples and discussing their causes would help readers better understand the method’s limitations.
Questions for authors
see above mentioned