Summary
The paper addresses the problem of human-object interaction (HOI) detection. The authors introduce a new "triplet-reasoning attention" mechanism that enumerates all possible "human-action-object" triplets. Meanwhile, the authors propose a new logic-guided loss function, which enables an interaction detector with stronger reasoning capability. The new method (LoTR) is evaluated on HICO-DET and V-COCO, achieving competitive results.
Strengths
I believe that the authors may introduce some new points to the domain of HOI detection, especifically the logic-guided learning strategy and the proposed LoTR demonstrates excellent performance. However, the paper is really hard to follow due to the poor presentation.
Weaknesses
- In Eq. 4, $\mathbf{Q}^h \in \mathbb{R}^{N_h \times 1 \times D}$ and $\mathbf{Q}^a \in \mathbb{R}^{1 \times N_a \times D}$, why $\mathbf{Q}^h + \mathbf{Q}^a \in \mathbb{R}^{N_h \times N_a}$
- The $\mathbf{X}$ are *inputs* (line 186) in Eq. 5 and *outputs* (line 191) in Eq. 6. According to my understanding,the $\mathbf{X}$ in Eq.5 are the outputs of "triplet-reasoning attention" while the $\mathbf{X}$ in Eq.6 are the outputs of the decoder, i.e., the outputs of cross-attention (omitted residual connection and FFN).
- In Eq. 7 and Eq. 8, what is $x(\cdot)$ and what is x? is it a function or a variable? In Eq. 7, what is $M$? And it is really hard for me to understand L214-217. In line 213, $\{ h_1, h_2,\cdots, h_N\}$ are infeasible interactions, which yet seem to be reasonable interactions in line 217 (e.g., "human-launch-boat").
- Eq. 11 and Eq. 12 need more detailed description. What is $M$ in Eq. 11 and what is $N$ is Eq. 12? Is $h_m$ different from $h_n$? What is $x_k$? The action-position loss, $L_{v,p} = (1-G_{v,p}) \propto {1-s_k(v)[1-s_k(h_m)]}$,
which decreases as $s_k(v)$
increases and $s_k(h_m)$ decreases. It can be intuitively interpreated that when an action *v* gets a high confidient score, then the interaction $h_m$ should get a low score. How to understand it?
Questions
1. Acorrding to Line 180-182, the "triplet reasoning attention" actually enumerates all human-action-object combinations ($N_h \times N_a \times N_o$), in which most are negative proposals.
2. The number of queries in this paper is $N_h \times N_a \times N_o = 32^3 = 32768$. However, in pervious approaches, the number of queries is normally less than 100. So the computational complexity should be reported.
Rating
4: Borderline reject: Technically solid paper where reasons to reject, e.g., limited evaluation, outweigh reasons to accept, e.g., good evaluation. Please use sparingly.
Confidence
4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.
Limitations
Yes, the authors have addressed the limitations.