Update README.md
Browse files
README.md
CHANGED
|
@@ -142,9 +142,9 @@ We use the following _statistical-based metrics_:
|
|
| 142 |
- **Image Precision** measures the percentage of correct images in the multimodal answer relative to the total number of inserted images, assessing whether irrelevant images were introduced.
|
| 143 |
It is computed as:
|
| 144 |
|
| 145 |
-
\[
|
| 146 |
\text{Image Precision} = \frac{\text{True Positives}}{\text{True Positives} + \text{False Positives}}
|
| 147 |
-
\]
|
| 148 |
|
| 149 |
where True Positives are the correctly inserted images, and False Positives are irrelevant images that were included.
|
| 150 |
|
|
@@ -182,7 +182,8 @@ We use the following _statistical-based metrics_:
|
|
| 182 |
|
| 183 |
- **Details**:
|
| 184 |
- Here, \( \text{dist}(A, B) \) represents the weighted edit distance between string \( A \) and string \( B \), i.e., the minimum total cost to transform string \( B \) into string \( A \) through the following three operations:
|
| 185 |
-
- **String Insertion**: If \( B \) is missing certain images, insert an image from \( A \) into a specific position in \( B \)
|
|
|
|
| 186 |
- **String Deletion**: If \( B \) contains extra irrelevant images, delete them. The operation cost is \( p_2 \).
|
| 187 |
- **String Substitution**: If the positions of images in \( B \) do not match \( A \), substitute the image in \( B \) with the corresponding image from \( A \). The operation cost is \( p_3 \).
|
| 188 |
- The weights generally satisfy \( p_1 > p_2 > p_3 \), and \( p \geq p_1 \) ensures the final score falls within the range \([0, 1]\).
|
|
|
|
| 142 |
- **Image Precision** measures the percentage of correct images in the multimodal answer relative to the total number of inserted images, assessing whether irrelevant images were introduced.
|
| 143 |
It is computed as:
|
| 144 |
|
| 145 |
+
![\[
|
| 146 |
\text{Image Precision} = \frac{\text{True Positives}}{\text{True Positives} + \text{False Positives}}
|
| 147 |
+
\]](https://cdn-uploads.huggingface.co/production/uploads/67571051d39ac252085797ca/vfqon9fMx6NMEAMm1jWbV.png)
|
| 148 |
|
| 149 |
where True Positives are the correctly inserted images, and False Positives are irrelevant images that were included.
|
| 150 |
|
|
|
|
| 182 |
|
| 183 |
- **Details**:
|
| 184 |
- Here, \( \text{dist}(A, B) \) represents the weighted edit distance between string \( A \) and string \( B \), i.e., the minimum total cost to transform string \( B \) into string \( A \) through the following three operations:
|
| 185 |
+
- **String Insertion**: If \( B \) is missing certain images, insert an image from \( A \) into a specific position in \( B \)
|
| 186 |
+
. The operation cost is \( p_1 \).
|
| 187 |
- **String Deletion**: If \( B \) contains extra irrelevant images, delete them. The operation cost is \( p_2 \).
|
| 188 |
- **String Substitution**: If the positions of images in \( B \) do not match \( A \), substitute the image in \( B \) with the corresponding image from \( A \). The operation cost is \( p_3 \).
|
| 189 |
- The weights generally satisfy \( p_1 > p_2 > p_3 \), and \( p \geq p_1 \) ensures the final score falls within the range \([0, 1]\).
|