Download the test dataset from here: IDDAW Test Images
The dataset, including training data, ground truth, and an evaluation script, will be made publicly available post-competition in accordance with ICPR guidelines.
Misclassifications within critical classes, and non-critical classes classified as critical, are penalized based on their distance in the class hierarchy. The tree distance (td) between a pair of labels is the length of the shortest path in the class hierarchy tree divided by 2
Let C be the set of all classes at the bottom level of the hierarchy, d(c,s) be the tree distance between class c and s, and n be the number of levels in the hierarchy, gtc the set of pixels in the ground truth with label c and preds the set of pixels in the prediction with label s . We define the following quantities:
$$\label{eq:1} I_c^{\text{safe}} = \begin{cases} \begin{aligned}[t] I_{c,c} & - \sum_{s \in C , s \neq c}\frac{d(c,s)}{n}I_{c,s}^{\text{safe}} & \text{ if } c \in C_{\text{imp}} \\ I_{c,c} & - \sum_{s \in C_{\text{imp}} }\frac{d(c,s)}{n}I_{c,s}^{\text{safe}}& \text{ else. } \end{aligned} \end{cases}$$
$$\label{eq:2} \text{SmIoU} = \frac{\sum_{c\in C} I_c^{\text{safe}}}{|C|}$$