mlsanityData to 7 Oct 2026

When Liebig's Barrel Meets Facial Landmark Detection: A Practical Model

arXiv 2105.13150 ↗First posted 27 May 2021cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

In recent years, significant progress has been made in the research of facial landmark detection. However, few prior works have thoroughly discussed about models for practical applications. Instead, they often focus on improving a couple of issues at a time while ignoring the others. To bridge this gap, we aim to explore a practical model that is accurate, robust, efficient, generalizable, and end-to-end trainable at the same time. To this end, we first propose a baseline model equipped with one transformer decoder as detection head. In order to achieve a better accuracy, we further propose two lightweight modules, namely dynamic query initialization (DQInit) and query-aware memory (QAMem). Specifically, DQInit dynamically initializes the queries of decoder from the inputs, enabling the model to achieve as good accuracy as the ones with multiple decoder layers. QAMem is designed to enhance the discriminative ability of queries on low-resolution feature maps by assigning separate memory values to each query rather than a shared one. With the help of QAMem, our model removes the dependence on high-resolution feature maps and is still able to obtain superior accuracy. Extensive experiments and analysis on three popular benchmarks show the effectiveness and practical advantages of the proposed model. Notably, our model achieves new state of the art on WFLW as well as competitive results on 300W and COFW, while still running at 50+ FPS.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 25 of its 41 references that are in the map. First posted on arXiv 27 May 2021.

Builds on

25 of 41 references.

References · 25

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
  4. 2020End-to-End Object Detection with Transformerscited by 7,384
  5. 2020Deformable DETR: Deformable Transformers for End-to-End Object Detectioncited by 3,410
  6. 2019Deep High-Resolution Representation Learning for Visual Recognitioncited by 1,417
  7. 2021Transformers in Vision: A Surveycited by 1,009
  8. 2016Stacked Hourglass Networks for Human Pose Estimationcited by 913
  9. 2017SphereFace: Deep Hypersphere Embedding for Face Recognitioncited by 733
  10. 2020Face2Face: Real-time Face Capture and Reenactment of RGB Videoscited by 631
  11. 2015WIDER FACE: A Face Detection Benchmarkcited by 297
  12. 2018Look at Boundary: A Boundary-Aware Face Alignment Algorithmcited by 137
13 more
  1. 2019Adaptive Wing Loss for Robust Face Alignment via Heatmap Regressioncited by 127
  2. 2017Wing Loss for Robust Facial Landmark Localisation with Convolutional Neural Networkscited by 108
  3. 2020LUVLi Face Alignment: Estimating Landmarks' Location, Uncertainty, and Visibility Likelihoodcited by 87
  4. 2020Pixel-in-Pixel Net: Towards Efficient Facial Landmark Detection in the Wildcited by 74
  5. 2018Style Aggregated Network for Facial Landmark Detectioncited by 60
  6. 2020Structured Landmark Detection via Topology-Adapting Deep Graph Learningcited by 50
  7. 2019DeCaFA: Deep Convolutional Cascade for Face Alignment In The Wildcited by 46
  8. 2017Improving Landmark Localization with Semi-Supervised Learningcited by 39
  9. 2019Aggregation via Separation: Boosting Facial Landmark Detector with Semi-Supervised Style Translationcited by 33
  10. 2019Teacher Supervises Students How to Learn From Partially Labeled Images for Facial Landmark Detectioncited by 28
  11. 2018Quantized Densely Connected U-Nets for Efficient Landmark Localizationcited by 20
  12. 2019Semantic Alignment: Finding Semantically Consistent Ground-truth for Facial Landmark Detectioncited by 16
  13. 2019Laplace Landmark Localizationcited by 16

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 1.

3 papers.