Methods › Computer Vision › Image Data Augmentation › Random Erasing

Random Erasing

19 papers tagged archive 2025-07-28

Introduced by Zhun Zhong et al. in Random Erasing Data Augmentation

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Random Erasing is a data augmentation method for training the convolutional neural network (CNN), which randomly selects a rectangle region in an image and erases its pixels with random values. In this process, training images with various levels of occlusion are generated, which reduces the risk of over-fitting and makes the model robust to occlusion. Random Erasing is parameter learning free, easy to implement, and can be integrated with most of the CNN-based recognition models. Random Erasing is complementary to commonly used data augmentation techniques such as random cropping and flipping, and can be implemented in various vision tasks, such as image classification, object detection, semantic segmentation.

In the Albumentations library, there is a generalization of RandomErasing called CoarseDropout, which allows masking an arbitrary number of regions of rectangular shape.

It could be applied to images, segmentation masks, and key points.

Documentation for CoarseDropout

PaperSourceSee Code · zhunzhong07/Random-Erasing

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: MFPI-random; Random Cloud; Random-K-of-N; Random Tickets; Random-Bridges; random selection; Random Attention; Random Registers.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 19 · with a code link: 8 · where Syntology ran a sample: 2 (0 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (2 of 19 tagged: 0 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 19 of 19, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 43 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Data Augmentation12
Image Classification5
Person Re-Identification4
image-classification4
Object Detection3
object-detection3
Diversity2
General Classification2
Knowledge Distillation2
Meta-Learning2
Transfer Learning2
Adversarial Attack1
Anomaly Detection1
Cross-Modal Person Re-Identification1
Data Visualization1
Facial Expression Recognition1
Facial Expression Recognition (FER)1
Fine-Grained Image Classification1
Fire Detection1
Generalizable Person Re-identification1

Usage over time archive 2025-07-28

Papers per year tagged with Random Erasing: 2017 to 2025, peak 6 6 0 2017: 1 paper 2017 2018: 1 paper 2018 2019: 0 papers 2019 2020: 2 papers 2020 2021: 6 papers 2021 2022: 0 papers 2022 2023: 3 papers 2023 2024: 5 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (19 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Image Data Augmentation

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections