paper-with-me

홈 › Papers

Recurrence without Recurrence: Stable Video Landmark Detection with Deep Equilibrium Models

2023-04-02 · CVPR 2023 1 · Paul Micaelli, Arash Vahdat, Hongxu Yin, Jan Kautz, Pavlo Molchanov

Cascaded computation, whereby predictions are recurrently refined over several stages, has been a persistent theme throughout the development of landmark detection models. In this work, we show that the recently proposed Deep Equilibrium Model (DEQ) can be naturally adapted to this form of computation. Our Landmark DEQ (LDEQ) achieves state-of-the-art performance on the challenging WFLW facial landmark dataset, reaching $3.92$ NME with fewer parameters and a training memory cost of $\mathcal{O}(1)$ in the number of recurrent modules. Furthermore, we show that DEQs are particularly suited for landmark detection in videos. In this setting, it is typical to train on still images due to the lack of labelled videos. This can lead to a ``flickering'' effect at inference time on video, whereby a model can rapidly oscillate between different plausible solutions across consecutive frames. By rephrasing DEQs as a constrained optimization, we emulate recurrence at inference time, despite not having access to temporal data at training time. This Recurrence without Recurrence (RwR) paradigm helps in reducing landmark flicker, which we demonstrate by introducing a new metric, normalized mean flicker (NMF), and contributing a new facial landmark video dataset (WFLW-V) targeting landmark uncertainty. On the WFLW-V hard subset made up of $500$ videos, our LDEQ with RwR improves the NME and NMF by $10$ and $13\%$ respectively, compared to the strongest previously published model using a hand-tuned conventional filter.

📄 PDF Abstract BibTeX arXiv:2304.00600

Code (1)

polo5/ldeq_rwr 공식 구현 pytorch

Tasks

Face Alignment

Methods 이 논문이 사용한 방법론

DEQ A new kind of implicit models, where the output of the network is defined as the solution to an "infinite-level" fixed point equation. Thanks to this we can compute the gradient…

Similar Papers 제목 키워드 기반

Recurrence-in-Recurrence Networks for Video Deblurring

2022-03-12 · JoonKyu Park, Seungjun Nah, Kyoung Mu Lee

State-of-the-art video deblurring methods often adopt recurrent neural networks to model the temporal dependency between the frames. While the hidden states play key role in delivering information to the next frame, abru…

DeblurringVideo Deblurring

Time-Series U-Net with Recurrence for Noise-Robust Imaging Photoplethysmography

2025-03-21 · Vineet R. Shenoy, Shaoju Wu, Armand Comas, Tim K. Marks 외

Remote estimation of vital signs enables health monitoring for situations in which contact-based devices are either not available, too intrusive, or too expensive. In this paper, we present a modular, interpretable pipel…

Time Series

KV-Fold: One-Step KV-Cache Recurrence for Long-Context Inference

2026-05-12 · Alireza Nadali, Patrick Cooper, Ashutosh Trivedi, Alvaro Velasquez arxiv

We introduce KV-Fold, a simple, training-free long-context inference protocol that treats the key-value (KV) cache as the accumulator in a left fold over sequence chunks. At each step, the model processes the next chunk …

Solving Recurrence Relations using Machine Learning, with Application to Cost Analysis

2023-08-30 · Maximiliano Klemen, Miguel Á. Carreira-Perpiñán, Pedro Lopez-Garcia

Automatic static cost analysis infers information about the resources used by programs without actually running them with concrete data, and presents such information as functions of input data sizes. Most of the analysi…

Form

A Machine Learning-based Approach for Solving Recurrence Relations and its use in Cost Analysis of Logic Programs

2024-05-11 · Louis Rustenholz, Maximiliano Klemen, Miguel Ángel Carreira-Perpiñán, Pedro López-García

Automatic static cost analysis infers information about the resources used by programs without actually running them with concrete data, and presents such information as functions of input data sizes. Most of the analysi…

Symbolic Regression