Abstract

In this paper, we show a formal equivalence between histogram equalization and distribution-preserving quantization. We use this equivalence to connect histogram equalization to quantization for preserving anonymity under the k-anonymity metric, while maintaining distributional properties for data analytics applications. Finally, we make connections to mismatched quantization. These relationships allow us to characterize the loss in mean-squared error (MSE) performance of privacy-preserving quantizers that must meet distribution-preservation constraints as compared to MSE-optimal quantizers in the high-rate regime. Thus, we obtain a formal characterization of the cost of anonymity.

Original languageEnglish (US)
Title of host publication2016 50th Annual Conference on Information Systems and Sciences, CISS 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages24-29
Number of pages6
ISBN (Electronic)9781467394574
DOIs
StatePublished - Apr 26 2016
Event50th Annual Conference on Information Systems and Sciences, CISS 2016 - Princeton, United States
Duration: Mar 16 2016Mar 18 2016

Publication series

Name2016 50th Annual Conference on Information Systems and Sciences, CISS 2016

Other

Other50th Annual Conference on Information Systems and Sciences, CISS 2016
Country/TerritoryUnited States
CityPrinceton
Period3/16/163/18/16

Keywords

  • Data
  • Histogram equalization
  • K-anonymity
  • Mismatched quantization
  • Neural information processing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Fingerprint

Dive into the research topics of 'Fidelity loss in distribution-preserving anonymization and histogram equalization'. Together they form a unique fingerprint.

Cite this