RDP: Ranked Differential Privacy for Facial Feature Protection in Multiscale Sparsified Subspaces

With the widespread sharing of personal face images on the Internet, systems based on face recognition encounter the real threat of being breached by potential adversaries who are able to access individuals’ face images and use them to intrude the systems. In this article, we propose a novel privacy protection method in the sparsified multiscale feature subspaces to protect sensitive facial features, taking care of the influence or weight-ranked subspace coefficients on the privacy budget, named “ranked differential privacy (RDP).” After the multiscale subspaces’ decomposition, the lightweight Laplacian noise is added to the dimension-reduced sparsified subspaces’ coefficients according to the geometric superposition method. Then, we rigorously prove that the RDP satisfies <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\varepsilon _{0}$ </tex-math></inline-formula>-differential privacy. After that, the nonlinear Lagrange multiplier method (LM) is formulated for the constraint optimization problem of maximizing the utility of protected face images of high-visualization quality with sanitizing noise, under a given privacy budget <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\varepsilon _{0}$ </tex-math></inline-formula>. Then, two methods are proposed to solve the nonlinear Lagrangian multiplier method (LM) problem and obtain the optimal noise scale parameters: 1) the analytical normalization approximation (NA) method with identical average noise scale parameter for real-time online applications and 2) the LM optimization method via gradient descent (LMGD) to obtain the nonlinear solution through iterative updating for more accurate offline applications. Experimental results on two real-world datasets show that our proposed RDP outperforms other state-of-the-art methods: at a privacy budget of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\varepsilon _{0} = 0.2$ </tex-math></inline-formula>, the peak signal-to-noise ratio (PSNR) of the optimized RDP is about ~10 dB higher than (10 times as high as) the highest PSNR of all state-of-the-art methods compared.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2025-02-04
DOI
https://doi.org/10.1109/jiot.2025.3538478
Primary Topic
Face recognition and analysis
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

RDP: Ranked Differential Privacy for Facial Feature Protection in Multiscale Sparsified Subspaces

Zheng Qin, Lu Ou, Shaolin Liao, Shihui Gao et al.
IEEE Internet of Things Journal
Face recognition and analysis
article

RDP: Ranked Differential Privacy for Facial Feature Protection in Multiscale Sparsified Subspaces

Zheng Qin, Lu Ou, Shaolin Liao, Shihui Gao, Guandong Huang
article en

Abstract

With the widespread sharing of personal face images on the Internet, systems based on face recognition encounter the real threat of being breached by potential adversaries who are able to access individuals’ face images and use them to intrude the systems. In this article, we propose a novel privacy protection method in the sparsified multiscale feature subspaces to protect sensitive facial features, taking care of the influence or weight-ranked subspace coefficients on the privacy budget, named “ranked differential privacy (RDP).” After the multiscale subspaces’ decomposition, the lightweight Laplacian noise is added to the dimension-reduced sparsified subspaces’ coefficients according to the geometric superposition method. Then, we rigorously prove that the RDP satisfies <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\varepsilon _{0}$ </tex-math></inline-formula>-differential privacy. After that, the nonlinear Lagrange multiplier method (LM) is formulated for the constraint optimization problem of maximizing the utility of protected face images of high-visualization quality with sanitizing noise, under a given privacy budget <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\varepsilon _{0}$ </tex-math></inline-formula>. Then, two methods are proposed to solve the nonlinear Lagrangian multiplier method (LM) problem and obtain the optimal noise scale parameters: 1) the analytical normalization approximation (NA) method with identical average noise scale parameter for real-time online applications and 2) the LM optimization method via gradient descent (LMGD) to obtain the nonlinear solution through iterative updating for more accurate offline applications. Experimental results on two real-world datasets show that our proposed RDP outperforms other state-of-the-art methods: at a privacy budget of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\varepsilon _{0} = 0.2$ </tex-math></inline-formula>, the peak signal-to-noise ratio (PSNR) of the optimized RDP is about ~10 dB higher than (10 times as high as) the highest PSNR of all state-of-the-art methods compared.

IEEE Internet of Things JournalVol. 12(11)
Sun Yat-sen University (CN), Hunan University (CN), Hunan Xiangdian Test Research Institute (China) (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 99%
Face recognition and analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.