mlsanityData to 7 Oct 2026

Invariance encoding in sliced-Wasserstein space for image classification with limited training data

arXiv 2201.02980 ↗First posted 9 Jan 2022cs.CV cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Deep convolutional neural networks (CNNs) are broadly considered to be state-of-the-art generic end-to-end image classification systems. However, they are known to underperform when training data are limited and thus require data augmentation strategies that render the method computationally expensive and not always effective. Rather than using a data augmentation strategy to encode invariances as typically done in machine learning, here we propose to mathematically augment a nearest subspace classification model in sliced-Wasserstein space by exploiting certain mathematical properties of the Radon Cumulative Distribution Transform (R-CDT), a recently introduced image transform. We demonstrate that for a particular type of learning problem, our mathematical solution has advantages over data augmentation with deep CNNs in terms of classification accuracy and computational complexity, and is particularly effective under a limited training data setting. The method is simple, effective, computationally efficient, non-iterative, and requires no parameters to be tuned. Python code implementing our method is available at https://github.com/rohdelab/mathematical_augmentation. Our method is integrated as a part of the software package PyTransKit, which is available at https://github.com/rohdelab/PyTransKit.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 25 of its 79 references that are in the map. First posted on arXiv 9 Jan 2022.

Builds on

25 of 79 references.

References · 25

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  5. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
  6. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  7. 2014Going Deeper with Convolutionscited by 4,231
  8. 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,472
  9. 2016Deep Networks with Stochastic Depthcited by 973
  10. 2017Dynamic Routing Between Capsulescited by 689
  11. 2018Threat of Adversarial Attacks on Deep Learning in Computer Vision: A Surveycited by 459
  12. 2017The Effectiveness of Data Augmentation in Image Classification using Deep Learningcited by 368
13 more
  1. 2015Recent Advances in Convolutional Neural Networkscited by 360
  2. 20163D Bounding Box Estimation Using Deep Learning and Geometrycited by 277
  3. 2018Why do deep convolutional networks generalize so poorly to small image transformations?cited by 198
  4. 2016Understanding data augmentation for classification: when to warp?cited by 74
  5. 2017Improving Deep Learning using Generic Data Augmentationcited by 36
  6. 2015The Radon cumulative distribution transform and its application to image classificationcited by 28
  7. 2015The Cumulative Distribution Transform and Linear Pattern Classificationcited by 19
  8. 2020Radon cumulative distribution transform subspace modeling for image classificationcited by 14
  9. 2018Unsupervised Learning using Pretrained CNN and Associative Memory Bankcited by 12
  10. 2019Deep Neural Network Hyperparameter Optimization with Orthogonal Array Tuningcited by 11
  11. 2017Discovery and visualization of structural biomarkers from MRI using transport-based morphometrycited by 6
  12. 2021Nearest Subspace Search in The Signed Cumulative Distribution Transform Space for 1D Signal Classificationcited by 5
  13. 2021Low-cost and high-performance data augmentation for deep-learning-based skin lesion classificationcited by 4

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 1; 2024: 1; 2025: 3.

7 papers.