Difficulty in estimating visual information from randomly sampled images
In this paper, we evaluate dimensionality reduction methods in terms of difficulty in estimating visual information on original images from dimensionally reduced ones. Recently, dimensionality reduction has been receiving attention as the process of not only reducing the number of random variables, but also protecting visual information for privacy-preserving machine learning. For such a reason, difficulty in estimating visual information is discussed. In particular, the random sampling method that was proposed for privacy-preserving machine learning, is compared with typical dimensionality reduction methods. In an image classification experiment, the random sampling method is demonstrated not only to have high difficulty, but also to be comparable to other dimensionality reduction methods, while maintaining the property of spatial information invariant.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningDimensionality Reductionimage-classificationImage ClassificationPrivacy PreservingSimilar Papers 제목 키워드 기반
How hard can it be? Estimating the difficulty of visual search in an image
We address the problem of estimating image difficulty defined as the human response time for solving a visual search task. We collect human annotations of image difficulty for the PASCAL VOC 2012 data set through a crowd…
Object LocalizationWeakly-Supervised Object LocalizationAccuracy-based Curriculum Learning in Deep Reinforcement Learning
In this paper, we investigate a new form of automated curriculum learning based on adaptive selection of accuracy requirements, called accuracy-based curriculum learning. Using a reinforcement learning agent based on the…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)The Shooting Regressor; Randomized Gradient-Based Ensembles
An ensemble method is introduced that utilizes randomization and loss function gradients to compute a prediction. Multiple weakly-correlated estimators approximate the gradient at randomly sampled points on the error sur…
Estimating the Size of a Large Network and its Communities from a Random Sample
Most real-world networks are too large to be measured or studied directly and there is substantial interest in estimating global network properties from smaller sub-samples. One of the most important global properties is…
EpidemiologyStochastic Block ModelLearning on manifolds without manifold learning
Function approximation based on data drawn randomly from an unknown distribution is an important problem in machine learning. The manifold hypothesis assumes that the data is sampled from an unknown submanifold of a high…