Accurate Image-Based Pedestrian Detection With Privacy Preservation
Bibliographic record
Abstract
In this paper, we propose an accurate pedestrian detection scheme with privacy preservation (PPPD) based on pedestrian images. By utilizing the vector homomorphic encryption (VHE), private linear-transforming matrices are ingeniously designed to enable arbitrary permutation operations for the encrypted vectors. In this way, the feature vector extraction of the histogram of oriented gradient (HOG) can be efficiently performed over the encrypted pedestrian images. Furthermore, due to the encrypted inner product calculations supported by VHE, an encrypted kernel matrix is constructed to generate multiple encrypted kernels (i.e., linear, polynomial, and Gaussian kernels). The pedestrian detection model based on the supported vector machine (SVM) can be securely trained over the encrypted kernels. With the proposed scheme, the extracted features of pedestrian images are not necessary to be returned to the image owner for decryption, such that the communication costs can be significantly reduced. In addition, the privacy of the whole process in pedestrian detection can also be guaranteed. Extensive experiments are conducted over multiple pedestrian datasets, and it is demonstrated that PPPD can achieve high accuracy of pedestrian detection with lower computation and communication overhead compared with the existing schemes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".