1. Preinstallation
   • install Node.js https://nodejs.org/en/download/
   • install git https://git-scm.com/download/win
   • install hexo: right click “git bash here”, $npm install hexo-cli -g
2. SSH keys
   • check whether ssh exists $cd ~/.ssh. If not, $ssh-keygen -t rsa -C "your_email@example.com" to generate key file
   • get the SSH key $cat ~/.ssh/id_rsa.pub
   • create the key in github: account setting->SSH
   • check the SSH key $ ssh -T git@github.com

3. create an empty folder as Hexo folder

   1 2 3

   $hexo init $hexo generate $hexo server

   local test: http://localhost:4000/

4. deploy local Hexo folder

   • in Hexo folder, modify the _config.yml file as follows,

     1 2 3 4

     deploy: type: git repository: $(SSH address from github) branch: master

   • in Hexo folder, install the deployer by $npm install hexo-deployer-git --save

   • type $hexo g and $hexo d, or $hexo d -g.
5. change theme: go to the folder “/themes” and git clone https://github.com/iissnan/hexo-theme-next. config the theme in the file “/themes/XXXX/_config.yml”.

6. local search

   • $npm install hexo-generator-searchdb --save

   • in the site _config.yml file, set local_search: enable: true. paste the following lines anywhere.

     1 2 3 4 5

     search: path: search.xml field: post #post, page, all format: html limit: 10000

7. add new page for some subcategory (e.g., write): in the theme _config.yml file

   1 2	menu: write: /categories/write

8. add social links: in the theme _config.yml file

   1 2 3 4

   # Social links social: GitHub: https://github.com/ustcnewly Linkedin: https://www.linkedin.com/in/li-niu-b0905133/

9. latex:

   • install $npm install hexo-math --save and restart Hexo

   • in the theme _config.yml file, modify as follows (notice that cdn may change)

     1 2 3 4 5

     # MathJax Support mathjax: enable: true per_page: false cdn: //cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML

   • to address the conflict between MathJax and Hexo

     1 2	$npm uninstall hexo-renderer-marked --save $npm install hexo-renderer-kramed --save

10. push posts to the top

    • $ npm install hexo-generator-index-pin-top --save.
    • for the target post, add top: true in Front-matter, or top: 10 with larger number indicating higher priority.

11. insert code block

    1 2 3

    {% codeblock lang:python %} code snippet {% endcodeblock %}

12. insert image

    1	<img src="http://bcmi.sjtu.edu.cn/~niuli/github_images/t0IXoZq.jpg" width="50%" height="50%">

Tips:

1. If something is wrong with the representation and hard to tune, you can try deleting extra spaces or adopting an alternative format (e.g., two code block formats).

2. Case sensitive: sometimes you switch between capital letter and small letter, which may lead to 404 not found errors.

   • set ignorecase as false in the file .deploy_git/.git/config
   • clean the folder .deploy_git
   • hexo clean and hexo d -g

We use the Dawid-Skene vote aggregation algorithm to obtain the ground truth label for each snippet, since this is often considered ‘gold standard’ for aggregation in practice. DawidSkene is an unsupervised inference algorithm that gives the Maximum Likelihood Estimate of observer error rates using the EM algorithm.

1) Using the labels given by multiple annotators, estimate the most likely “correct” label for each video snippet.

2) Based on the estimated correct answer for each object, compute the error rates for each annotator.

3) Taking into consideration the error rates for each annotator, recompute the most likely “correct” label for each object.

4) Repeat steps 2 and 3 until one of the termination criteria is met (error rates are below a pre-specified threshold or a pre-specified number of iterations are completed).

Vector Quantization: VQVAE [1],VQVAE2 [2], VQGAN [6].

Residual Quantization: RQVAE [3]

Accelerate auto-regression: [4] [5]

Hierarchical residual quantization: VAR [7]

References

[1] Oord, Aaron van den, Oriol Vinyals, and Koray Kavukcuoglu. “Neural discrete representation learning.” arXiv preprint arXiv:1711.00937 (2017).

[2] Razavi, Ali, Aaron van den Oord, and Oriol Vinyals. “Generating diverse high-fidelity images with vq-vae-2.” Advances in neural information processing systems. 2019.

[3] Lee, Doyup, et al. “Autoregressive Image Generation using Residual Quantization.” arXiv preprint arXiv:2203.01941 (2022).

[4] Bond-Taylor, Sam, et al. “Unleashing Transformers: Parallel Token Prediction with Discrete Absorbing Diffusion for Fast High-Resolution Image Generation from Vector-Quantized Codes.” arXiv preprint arXiv:2111.12701 (2021).

[5] Huiwen Chang, Han Zhang, Lu Jiang, Ce Liu, William T. Freeman, “MaskGIT: Masked Generative Image Transformer”, arXiv preprint arXiv:2202.04200.

[6] Patrick Esser, Robin Rombach, Björn Ommer, “Taming Transformers for High-Resolution Image Synthesis”.

[7] Tian, Keyu, et al. “Visual Autoregressive Modeling: Scalable Image Generation via Next-Scale Prediction.” arXiv preprint arXiv:2404.02905 (2024).

1. learn attribute vector based on the relation and difference between different categories (each dimension if uninterpretable): [1] (Laplacian matrix), [2] (triplet loss)

2. exploit local information and encode them into attribute vector (each dimension is interpretable): [3] (discriminative cluster, doublets), [4] (joint attribute learning and feature learning)

3. learn attention map for each latent attribute [5]

Reference

1. Yu, Felix X., et al. “Designing category-level attributes for discriminative visual recognition.” CVPR, 2013.

2. Li, Yan, et al. “Discriminative learning of latent features for zero-shot recognition.” CVPR, 2018.

3. Singh, Saurabh, Abhinav Gupta, and Alexei A. Efros. “Unsupervised discovery of mid-level discriminative patches.” ECCV, 2012.

4. Huang, Chen, Chen Change Loy, and Xiaoou Tang. “Unsupervised learning of discriminative attributes and visual representations.” CVPR, 2016.

5. Yang, Wenjie, et al. “Towards rich feature discovery with class activation maps augmentation for person re-identification.” CVPR, 2019.

Let us use $S$ to denote the set of training categories and $T$ to denote the set of testing categories.

• $S=T$: the most common case
• $S\cap T=\emptyset$: zero-shot learning
• $S\subset T$: generalized zero-shot learning
• $S\supset T$: pretrained model

1. Blend text and background images.

   • text image (font, color, border, blending): [1]
   • scene-text image (font, color, border, blending, geometry): [2] [3]

Reference:

1. Jaderberg, Max, et al. “Synthetic data and artificial neural networks for natural scene text recognition.” arXiv preprint arXiv:1406.2227 (2014).

2. Gupta, Ankush, Andrea Vedaldi, and Andrew Zisserman. “Synthetic data for text localisation in natural images.” CVPR, 2016.

3. Zhan, Fangneng, Shijian Lu, and Chuhui Xue. “Verisimilar image synthesis for accurate detection and recognition of texts in scenes.” ECCV, 2018.

As mentioned in [1] One major concern of subjective annotation is that the annotations provided by different workers for each image may not be reliable, which calls for consistency analysis on the annotations. We use Spearman’s rank correlation ρ between pairs of workers to measure consistency and estimate p-values to evaluate statistical significance of the correlation relative to a null hypothesis of uncorrelated responses. We use the Benjamini-Hochberg
procedure to control the false discovery rate (FDR) for multiple comparisons [2]. At an FDR level of 0.05, we find 98.45% batches have significant agreement among raters. Further consistency analysis of the dataset can be found in the supplementary material of [1].

[1] Kong, Shu, et al. “Photo aesthetics ranking network with attributes and content adaptation.” European Conference on Computer Vision. Springer, Cham, 2016.

[2] Benjamini, Yoav, and Daniel Yekutieli. “The control of the false discovery rate in multiple testing under dependency.” Annals of statistics (2001): 1165-1188.

Given the predicted softmax logits $p_i$, ground-truth softmax logits or free-form weights $w_i$.

1. weighted softmax loss: $-\sum_{i} w_i \log p_i$

2. EMD softmax loss: $-\sum_{i} w_i p_i$

3. softmax loss after label flip layer: $-\log{\sum_{i} w_i p_i}$

4. knowledge distillation: $\sum_{i} (p_i-w_i)$

Application

• Shadow detection: [1]

• Object-shadow pair detection/matting: [2] [10] [11]

• Shadow removal: [3] [4] [5] [6]

• Shadow generation: [7] [8]

• Remove occluder and its associated shadow [9]

Dataset

Shadow Generation

1. Shadow-AR (rendered) paper
2. RGB-AO-depth (rendered) paper
3. Composition datasets: WILDTRACK, Penn-Fudan, UA-DETRAC, Cityscapes, ShapeNet paper
4. Soft shadow dataset (rendered) paper
5. ShadowGAN (rendered, 12,400 rendered images, 9265 objects, 110 textures for rendering the plane, up to four objects in each scene) paper
6. SID (single object, 25, 000 images, 12, 500 3D objects, 50 homogeneous color and 200 variable set of textured patterns) paper
7. SID2 (45,000 images, similar to SID, more than one object in each scene) paper
8. SHAD3S paper
9. DESOBA paper

Shadow Removal/Detection

1. ISTD/ ISTD+ (1870 0 triplets of shadow, shadow mask and shadow-free images) paper
2. USR(unpaired, 2,445 shadow images, 1,770 shadow-free) paper
3. SRD/ SRD+ (3088 pairs, paired shadow and shadow-free, without the ground-truth shadow mask) paper
4. LRSS (37 image pairs, soft shadow) paper
5. UIUC (76 pairs, paired shadow/shadow-free) paper
6. GTAV (5723 pairs, 5110 daylight scenes, occlude objects inside camera) paper
7. SynShadow (based on USR, occlude objects outside camera, shadow/shadow-free/matte image triplets synthesized from rendered 10,000 matte images and about 1,800 background images) paper
8. UCF (245 pairs, shadow/shadow mask, only for detection)
9. SBU (4727 pairs, shadow/shadow mask, only for detection)
10. CUHK-Shadow (10,500 pairs, shadow/shadow mask, only for detection) paper
11. SOBA (1013 images) paper
12. AISD (514 pairs, shadow/shadow mask, only for detection, areial images) paper
13. video shadow removal dataset (8 videos, shadow/shadow mask/shadow free) paper
14. CMU dataset(135 pairs, shadow/shadow boundaries) paper
15. ViSha (120 videos with 11685 frames) paper
16. VISAD (82 videos, half-annotated) paper

References

1. Zhu, Lei, et al. “Bidirectional feature pyramid network with recurrent attention residual modules for shadow detection.” Proceedings of the European Conference on Computer Vision (ECCV). 2018.

2. Wang, Tianyu, et al. “Instance shadow detection.” Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 2020.

3. Hu, Xiaowei, et al. “Mask-ShadowGAN: Learning to remove shadows from unpaired data.” Proceedings of the IEEE International Conference on Computer Vision. 2019.

4. Le, Hieu, and Dimitris Samaras. “Shadow removal via shadow image decomposition.” Proceedings of the IEEE International Conference on Computer Vision. 2019.

5. Xiaodong, Cun, Pun Chi-Man, and Shi Cheng. “Towards Ghost-free Shadow Removal via Dual Hierarchical Aggregation Network and Shadow Matting GAN.” arXiv preprint arXiv:1911.08718 (2019).

6. Le, Hieu, and Dimitris Samaras. “From Shadow Segmentation to Shadow Removal.” European Conference on Computer Vision. Springer, Cham, 2020.

7. Liu, Daquan, et al. “ARShadowGAN: Shadow Generative Adversarial Network for Augmented Reality in Single Light Scenes.” Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 2020.

8. Zhan, Fangneng, et al. “Adversarial Image Composition with Auxiliary Illumination.” Proceedings of the Asian Conference on Computer Vision. 2020.

9. Zhang, Edward, et al. “No Shadow Left Behind: Removing Objects and their Shadows using Approximate Lighting and Geometry.” CVPR, 2021.

10. Wang, Tianyu, et al. “Single-stage instance shadow detection with bidirectional relation learning.” CVPR, 2021.

11. Lu, Erika, et al. “Omnimatte: Associating objects and their effects in video.” CVPR, 2021.

Statistical methods

• use a model (e.g., Gaussian) to fit the distribution of all data
• use two models to fit the distributions of non-outliers and outliers separately
• Grubbs’ test

Distance based methods

• the density within a neighborhood
• the distance from a nearest neighbor

Learning based method

• clustering, the smallest cluster is likely to contain outliers
• one-class classifier (e.g., one-class SVM)
• binary classifier (e.g., naive bayes for spam filtering, weighted binary SVM)