- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This work propose DDFR, a method to distangle degardation of low-quality faces to further accomplish the face retrival task. To evaluate the performance of DDFR, the authors curate a benchmark where input is low-quality (blurred) faces and the query target is clean faces. The DDFR achieves best performance on this benchmark.
Critical strengths
- As claimed in this work, the authors try to tackle with face retrieval task, where the input face is blurred, as an asymmetric embeddingalignment problem.
- The reprodulicity is available as the code and guidance are provided.
Critical weaknesses
- The experiement result is not sufficient. As the authors have only evaluated on the self-curated benchmark, is there any similar benchmark for this setting? If so please also evaluate DDFR with them.
- The discussion with other competing methods are not enough. What is the difference and novelty between DDFR and other blurred face retrieval methods?
- Method presentation is not enough. How "distangle" is achieved, and how it could help to the face retrieval task?
Questions for authors
Please refer from the weakness part.
Response to Reviewer mgKH
Thank you for recognizing DDFR's formulation of blurred-face retrieval as asymmetric embedding alignment and for noting the accompanying code and guidance.
1. Public benchmarks and the controlled blur protocol
We use a controlled protocol to measure how retrieval changes with the applied blur strength. Each Gaussian query is derived from its clean gallery photograph, so the source, pose, illumination, and crop stay fixed as the blur radius varies. This gives each evaluation point a known and reproducible degradation level. TinyFace provides a complementary measure of retrieval on native low-resolution images, whose standard annotations do not provide a calibrated blur-severity scale. TinyFace benchmark
We also evaluated the submitted model on two public datasets. For CFP, whose standard task is pair verification, we constructed a blurred-query, clean-gallery retrieval protocol. At σ=10, DDFR achieved 74.132% Rank-1 over 22,487 query evaluations in the same-source control, where the clean source photograph was the gallery positive. The study also evaluated cross-photograph retrieval with the query source excluded from the gallery. CFP benchmark · CFP same-source and cross-photograph results
On TinyFace, we evaluated naturally degraded probes against the official gallery of genuine matches and distractors. The protocol included 3,728 planned queries and 157,871 gallery entries. TinyFace results and denominators
2. Difference from prior blurred-face methods
Vageeswaran et al. model the possible blurred appearances of a gallery face as a convex set and match each probe against those sets. Blind restoration methods such as CodeFormer reconstruct a face image, which a retrieval system can then encode. DDFR learns to estimate a correction vector from the query's degradation features and applies it directly to the retrieval embedding. One deterministic latent reconstruction produces the correction, and cosine search uses cached clean-gallery embeddings. Set-theoretic blur-robust recognition · CodeFormer
3. How feature separation supports retrieval
A shared ResNet-18 supplies an identity feature a and a degradation feature d through separate branches. DDFR projects d into a latent, applies degradation-conditioned latent denoising, then predicts a 512-dimensional correction γ. It ranks the normalized embedding r=(a−γ)/∥a−γ∥2 against the gallery. Inference uses the same fixed condition at every blur radius and requires no query blur label.
During training, identity classification and supervised contrastive learning organize the corrected embeddings by identity, and paired consistency aligns their clean and degraded views. Severity regression supervises the degradation latent, and noise prediction trains the latent denoiser. The directional penalty ∣cos(a,γ)∣ discourages corrections along the identity feature direction, while a clean-anchor loss limits drift of the clean embedding. This is a functional separation between the feature used for identity retrieval and the pathway that estimates its degradation correction.
We tested the complete design against a residual MLP that replaced all components after the raw ResNet-18. The non-backbone parameter counts were 18.690M for DDFR and 18.469M for the MLP. Across five seeds, we paired backbone initialization and matched successful encoder updates in the base and direct training stages. Each model encoded the same clean gallery and degraded queries with its own checkpoint.
DDFR led in four of five seeds at σ=10. The comparison evaluates the structured backend together with its training objectives and supports its effectiveness under severe blur in the source-paired setting. We will annotate the method figure to show where each training loss acts and how the corrected query embedding reaches the gallery search. Five-seed results and training protocol