Froink commited on
Commit
17db6ea
·
verified ·
1 Parent(s): dbeebcf

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +3 -5
README.md CHANGED
@@ -2,6 +2,7 @@
2
  license: cc-by-4.0
3
  task_categories:
4
  - image-classification
 
5
  ---
6
 
7
  # [BMVC2025] An Exploratory Study on Abstract Images and Visual Representations Learned from Them
@@ -75,11 +76,9 @@ We name the folder to show the abstract information:
75
  ## Subset details
76
 
77
  **HAID-MiniImageNet**
78
-
79
- Derived from MiniImageNet. Contains ~60,000 images across 100 classes. Abstraction levels: **10, 30, 50, 100, 500, 1000** shapes, each contains mode **0 and 1**.
80
 
81
  **HAID-Caltech-256**
82
-
83
  Derived from Caltech-256. Abstraction levels: **10, 30, 50, 100** shapes, each contains mode **0 and 1**.
84
 
85
  **HAID-CIFAR-10**
@@ -133,5 +132,4 @@ year = {2025}
133
  ## Contact & project page
134
 
135
  * Project page : `https://fronik-lihaotian.github.io/HAID_page/`.
136
- * For questions, bug reports, or collaborations, please open an issue in this repository or contact the authors listed in the paper.
137
-
 
2
  license: cc-by-4.0
3
  task_categories:
4
  - image-classification
5
+ pretty_name: Hierarchical Abstraction Image Dataset
6
  ---
7
 
8
  # [BMVC2025] An Exploratory Study on Abstract Images and Visual Representations Learned from Them
 
76
  ## Subset details
77
 
78
  **HAID-MiniImageNet**
79
+ Derived from MiniImageNet. Contains 60,000 images across 100 classes. Abstraction levels: **10, 30, 50, 100, 500, 1000** shapes (**Please note that the 500 and 1000 shapes are in the zip file of `HAID_MiniImageNet_500+1000.zip`**), each contains mode **0 and 1**.
 
80
 
81
  **HAID-Caltech-256**
 
82
  Derived from Caltech-256. Abstraction levels: **10, 30, 50, 100** shapes, each contains mode **0 and 1**.
83
 
84
  **HAID-CIFAR-10**
 
132
  ## Contact & project page
133
 
134
  * Project page : `https://fronik-lihaotian.github.io/HAID_page/`.
135
+ * For questions, bug reports, or collaborations, please open an issue in this repository or contact the authors listed in the paper.