Source-linked AI summary

Towards Privacy-Preserving Visual Recognition via Adversarial Training: A Pilot Study

Zhenyu Wu, Zhangyang Wang, Zhaowen Wang, Hailin Jin

arXiv:1807.08379v2cs.CV

TL;DR

Privacy-preserving visual recognition must retain useful recognition while preventing sensitive information from being recovered by arbitrary privacy models. The paper learns an active degradation through adversarial training and adds budget-model restarting and ensembling to improve generalization. Experiments on action recognition report favorable utility–privacy trade-offs across identity and multiple-attribute settings.

  • Problem

    Privacy budgets are task-driven and cannot be reliably assessed with one privacy model, because protection should withstand any possible model attempting to recover private information.

  • Method

    The framework learns a degradation transform that jointly optimizes target-task performance and privacy cost, using budget-model restarting and ensembling to defend against unseen privacy models.

  • Results

    The experiments report compelling effectiveness in maintaining action-recognition performance while suppressing privacy-breach risk across identity and multiple-attribute privacy settings.

  • Takeaways & Limitations

    The framework provides a model-agnostic strategy for privacy-preserving action recognition across different task-driven definitions of privacy.

  • Takeaways & Limitations

    The pilot remains preliminary, with substantial room for improvement and a rough ensemble approximation of the privacy-model family.

Abstract

from arXiv · show

This paper aims to improve privacy-preserving visual recognition, an increasingly demanded feature in smart camera applications, by formulating a unique adversarial training framework. The proposed framework explicitly learns a degradation transform for the original video inputs, in order to optimize the trade-off between target task performance and the associated privacy budgets on the degraded video. A notable challenge is that the privacy budget, often defined and measured in task-driven contexts, cannot be reliably indicated using any single model performance, because a strong protection of privacy has to sustain against any possible model that tries to hack privacy information. Such an uncommon situation has motivated us to propose two strategies, i.e., budget model restarting and ensemble, to enhance the generalization of the learned degradation on protecting privacy against unseen hacker models. Novel training strategies, evaluation protocols, and result visualization methods have been designed accordingly. Two experiments on privacy-preserving action recognition, with privacy budgets defined in various ways, manifest the compelling effectiveness of the proposed framework in simultaneously maintaining high target task (action recognition) performance while suppressing the privacy breach risk.

1 Introduction

The paper addresses the tension between recognizing useful events from smart-camera video and preventing sensitive visual information from being exposed. It proposes adversarially learned video degradation to preserve target-task performance while suppressing privacy breaches against unseen models.

  • Smart cameras increasingly upload visual data to centralized clouds, intensifying concerns about privacy and authorized misuse.
  • The central challenge is preserving useful recognition while preventing sensitive information, such as faces, from being obtained.
  • The framework learns active degradations that optimize the trade-off between target-task performance and privacy budgets on transformed videos.
  • Because privacy protection must resist any possible hacker model, the authors introduce budget-model restarting and ensembling to improve generalization against unseen models.
  • Two privacy-preserving action-recognition experiments report effectiveness in maintaining target performance while suppressing privacy-breach risk.

2 Related Work

Prior work includes cryptographic protection, anonymized videos, learned sanitization, and adversarial obfuscation, but the paper targets learned degradations for recognition while addressing privacy protection beyond a single attacker model.

  • Cryptographic approaches can protect visual information but often impose high local computation costs and are difficult to generalize to complex classifiers.
  • Anonymized videos use low-quality processing to preserve selected activities while reducing identity leakage, including low resolution, blurring, and superpixel methods.
  • Learning-based sanitization methods jointly consider utility and privacy but have used relatively simple transformations such as linear projection and maximum mean discrepancy.
  • Earlier adversarial frameworks addressed toy hiding tasks or specific recognition models, leaving potential overfitting when the model changes.
  • Existing empirical obfuscations such as blurring, mosaicing, and face cropping can be readily hacked.
  • The proposed approach differs from simple downsampling by generating anonymized videos through learned, more complicated degradations.

3 Technical Approach

The technical approach learns an active degradation shared by target and privacy models, optimizing useful recognition while suppressing privacy prediction across a model family. Restarting and ensembling address overfitting to individual privacy predictors.

  • Basic framework: The framework transforms raw video X with an active degradation function f_d, then feeds the result to both target-task and privacy-prediction models.
  • Optimization objective: The optimization seeks near-raw target-task performance while greatly suppressing the privacy cost on degraded video.
  • Problem definition: Privacy cost is task-driven: it measures how well a budget model predicts identity or attributes such as race, gender, or age from transformed video.
  • The ∀Challenge: Privacy protection requires suppressing every model in a prediction family, not merely reducing the success of one privacy model.
  • The ∀Challenge: The objective contrasts with standard adversarial training by optimizing degradation against all possible privacy predictors rather than one specific model.
  • Basic framework: The basic architecture trains degradation, target, and privacy modules end to end under a hybrid target and privacy loss.
  • Training: A three-module alternating update strategy is designed to reduce collapse and bad local minima during adversarial training.
  • Loss design: Negative entropy is used for the privacy loss to encourage uncertain privacy predictions while avoiding numerical instability associated with minimizing negative KL divergence.

4 Experiments

The experiments evaluate privacy-preserving action recognition across identity privacy on SBU and multiple privacy attributes on UCF-101/VISPR. The proposed adversarial training, especially restarting and budget-model ensembles, improves the trade-off between action recognition and privacy suppression against unseen models.

  • Experimental settings: The study tests privacy-preserving action recognition for identity protection on SBU and multiple privacy attributes on UCF-101/VISPR.SBU uses actor-pair recognition as the privacy task, while UCF-101 action recognition is evaluated against privacy prediction models trained on VISPR.
  • Experimental settings: The framework uses active degradation with target and privacy models trained on 16-frame video groups, evaluating against 10 unseen CNN privacy models.The implementation uses C3D for action recognition, MobileNet-based identity recognition, and an image transformation network for degradation.
  • SBU results: Increasing the ensemble size M consistently moves Method 3 toward the desirable upper-left trade-off region, indicating better generalization to unseen privacy models.The desirable region preserves larger target accuracy while suppressing smaller privacy-task accuracy.
  • UCF-101/VISPR results: On UCF-101/VISPR, adversarial training again produces more favorable trade-offs on VISPR-17 and VISPR-7 than simple downsampling.The results likewise indicate that ensemble and restarting help the degradation generalize against privacy breaches.

5 Limitations and Discussions

The discussion identifies practical and methodological limitations, including preliminary performance, unstable adversarial training, approximate privacy-budget modeling, and insufficient benchmark datasets. It also describes efficiency and scalability advantages over fully local recognition.

  • Compared with fully local recognition, the degradation module is more compact, faster to run, and potentially reusable across multiple cloud-based utility models.The cited comparison reports 1.3 million parameters for the degradation module versus over 70 million for the target model, with 45-times higher testing time for the target model.
  • The budget-model ensemble is only a rough discretized approximation of the full privacy-model family.
  • Adversarial training is difficult and unstable, motivating improved training techniques.
  • A lack of benchmark datasets with appropriately defined target and privacy tasks constrains evaluation and feature disentanglement.Cross-dataset evaluation partly alleviates the shortage, but domain mismatch can still hinder performance.

Appendix A Adversarial Training Algorithm

The appendix presents adversarial training as a three-competitor game in which degradation, privacy attack, and target utility models interact. The ensemble and restarting algorithm iteratively solves the corresponding optimization problems.

  • Algorithm 1 uses an ensemble of M budget models with restarting to provide a unified adversarial training procedure.Setting M = 1 and omitting restarting reduces it to basic adversarial training.
  • The framework can be viewed as a three-competitor game involving an obfuscator, an attacker, and a utilizer.The obfuscator is fd, the attacker is fb or its ensemble, and the utilizer is fT.
  • The algorithm iteratively solves two optimization problems, while the ensemble searches for the worst case to minimize.

B.1 Results for Methods 1

The identity-preserving action-recognition task on SBU is challenging because actors are clearly visible and identity cues extend beyond faces. Body shape and clothing colors can remain invariant across actions and videos.

  • SBU identity recognition is challenging because videos come from controlled indoor environments where actors are clearly visible.
  • Identity recognition can exploit body shape and clothing colors, not only facial information.These cues remain invariant for the same actor across different videos and actions, while actors wear distinct clothing.

B.2 Two-Fold Evaluation Results for Methods 2 and 3

Methods 2 and 3 use adversarial training with budget models, restarting and ensemble-style competition to learn privacy-preserving degradations while retaining target-task performance. Their two-fold evaluation reports action-recognition results alongside privacy suppression, with stricter evaluation for Methods 2 and 3 than for single-model baselines.

  • Evaluation protocol: Methods 2 and 3 are evaluated through a two-fold protocol combining privacy suppression details with corresponding action-recognition results.The action-recognition results are attached after each sub-table.
  • Training procedure: The training algorithm updates the active degradation module from mini-batches while using target-task and budget modules in the adversarial framework.The algorithm begins with pre-trained degradation, target-task, and budget modules, then updates the degradation module with stochastic gradients.
  • Budget suppression: Budget-model competition suppresses the most confident privacy predictor among M models, while the L1 degradation penalty is used only in the SBU experiment.The budget loss is described as negative entropy, and the L1 term is restricted to SBU.
  • Training thresholds: Budget training uses a 95% accuracy threshold, while target-task training uses dataset-specific thresholds of 90% for SBU and 70% for UCF101/VISPR.The budget task is trained until its accuracy exceeds Threshold2; target-task and degradation updates use Threshold1 values for the respective datasets.
  • Budget-model restarting: The framework empirically restarts all M budget models every 100 iterations to refresh the privacy competitors during training.The restart is followed by repeating the training procedure from the beginning.
  • Evaluation protocol: Methods 2 and 3 evaluate privacy suppression using the highest achievable result among N = 10 models, making their protocol stricter than single-model evaluation.Direct accuracy comparisons therefore underestimate the privacy-protection gain of Methods 2 and 3 relative to Methods 1, 4, and 5.

C.1 “Transferability” Study of Privacy Attributes between UCF-101 and VISPR

The study uses VISPR-pretrained privacy prediction to examine which privacy attributes transfer to UCF-101 and to visualize the learned degradation on SBU. Frequent attributes are narrowed to a seven-attribute smart-home setting, while qualitative examples indicate reliable privacy prediction in ordinary videos.

  • Selection of 17 and 7 Privacy Attributes: 43 privacy attributes occur at least once in UCF-101 videos, but only 17 are frequent enough for consideration.Occurrence statistics are obtained with a privacy attribute prediction model pretrained on VISPR.
  • Selection of 17 and 7 Privacy Attributes: Seven of the 17 frequent attributes are selected for the smart-home setting: semi-nudity, occupation, hobbies, sports, personal relationship, social relationship, and one listed attribute.The supplied passage explicitly names six attributes while stating that seven are selected.
  • Privacy Attribute Examples in UCF-101: UCF-101 example frames are evaluated with VISPR-pretrained privacy predictors, whose outputs include predicted attributes and associated confidences.The examples use the right column for predictions and confidences corresponding to the left-column frames.
  • Learned Degradation Examples: Figure 5 provides example SBU frames after applying the learned degradation, alongside the SBU two-fold evaluation summarized in Table 2.The supplied passages identify these as visualized degradation examples and the associated evaluation table.
  • Privacy Attribute Examples in UCF-101: Qualitative examination finds privacy-attribute predictions highly reliable across many UCF-101 frames, indicating substantial privacy-leak risk in common videos.The cited passages connect reliable prediction with the privacy risk shown in daily videos.

C.2 UCF-101 / VISPR Two-Fold Evaluation

The UCF-101 experiments evaluate privacy protection using VISPR-17 and VISPR-7 attribute settings, with quantitative results reported through two-fold evaluations and visualized degraded examples. For N=10 privacy predictors, performance is measured using class-based MAP rather than recognition accuracy.

  • Evaluation Protocol: The two-fold evaluations compare UCF-101 privacy protection under the VISPR-17 and VISPR-7 attribute settings.Tables 3 and 4 report the respective trade-off results.
  • Evaluation Protocol: For N=10 privacy attribute prediction, evaluation uses class-based MAP rather than recognition accuracy.This metric distinction applies to the privacy-attribute prediction evaluation.
  • Privacy Examples: Figure 7 shows UCF-101 example frames with predicted privacy attributes and confidences, illustrating privacy-leak risk in daily common videos.The right column contains predictions associated with the frames in the left column.
  • Learned Degradation Examples: Figure 8 visualizes learned degradations for UCF-101 under adversarial training with VISPR-17 and VISPR-7.The passage directs readers to Figure 8 for visualized examples under both privacy-attribute settings.
Loading 1807.08379v2…