The generalization threshold for Iterative Patch Selection on low object-to-image-ratio images depends on training set size and task, and smaller patches relative to the object improve low-data accuracy.
Iterative Patch Selection for High-Resolution Image Recognition
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
High-resolution images are prevalent in various applications, such as autonomous driving and computer-aided diagnosis. However, training neural networks on such images is computationally challenging and easily leads to out-of-memory errors even on modern GPUs. We propose a simple method, Iterative Patch Selection (IPS), which decouples the memory usage from the input size and thus enables the processing of arbitrarily large images under tight hardware constraints. IPS achieves this by selecting only the most salient patches, which are then aggregated into a global representation for image recognition. For both patch selection and aggregation, a cross-attention based transformer is introduced, which exhibits a close connection to Multiple Instance Learning. Our method demonstrates strong performance and has wide applicability across different domains, training regimes and image sizes while using minimal accelerator memory. For example, we are able to finetune our model on whole-slide images consisting of up to 250k patches (>16 gigapixels) with only 5 GB of GPU VRAM at a batch size of 16.
fields
cs.CV 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Generalizability of Iterative Patch Selection for Memory-Efficient High-Resolution Image Classification
The generalization threshold for Iterative Patch Selection on low object-to-image-ratio images depends on training set size and task, and smaller patches relative to the object improve low-data accuracy.