paper-with-me

Papers

BRULÈ: Barycenter-Regularized Unsupervised Landmark Extraction

2020-06-20 · Iaroslav Bespalov, Nazar Buzun, Dmitry V. Dylov

Unsupervised retrieval of image features is vital for many computer vision tasks where the annotation is missing or scarce. In this work, we propose a new unsupervised approach to detect the landmarks in images, validating it on the popular task of human face key-points extraction. The method is based on the idea of auto-encoding the wanted landmarks in the latent space while discarding the non-essential information (and effectively preserving the interpretability). The interpretable latent space representation (the bottleneck containing nothing but the wanted key-points) is achieved by a new two-step regularization approach. The first regularization step evaluates transport distance from a given set of landmarks to some average value (the barycenter by Wasserstein distance). The second regularization step controls deviations from the barycenter by applying random geometric deformations synchronously to the initial image and to the encoded landmarks. We demonstrate the effectiveness of the approach both in unsupervised and semi-supervised training scenarios using 300-W, CelebA, and MAFL datasets. The proposed regularization paradigm is shown to prevent overfitting, and the detection quality is shown to improve beyond the state-of-the-art face models.

📄 PDF Abstract BibTeX arXiv:2006.11643

Code (0)

등록된 구현이 없습니다.

Tasks

Retrieval

Similar Papers 제목 키워드 기반

Belief Roadmaps with Uncertain Landmark Evanescence

2025-01-29 · Erick Fuentes, Jared Strader, Ethan Fahnestock, Nicholas Roy

We would like a robot to navigate to a goal location while minimizing state uncertainty. To aid the robot in this endeavor, maps provide a prior belief over the location of objects and regions of interest. To localize it…

Navigate

Continuous Regularized Wasserstein Barycenters

2020-08-28 · NeurIPS 2020 12 · Lingxiao Li, Aude Genevay, Mikhail Yurochkin, Justin Solomon

Wasserstein barycenters provide a geometrically meaningful way to aggregate probability distributions, built on the theory of optimal transport. They are difficult to compute in practice, however, leading previous work t…

Doubly Regularized Entropic Wasserstein Barycenters

2023-03-21 · Lénaïc Chizat

We study a general formulation of regularized Wasserstein barycenters that enjoys favorable regularity, approximation, stability and (grid-free) optimization properties. This barycenter is defined as the unique probabili…

Computational Guarantees for Doubly Entropic Wasserstein Barycenters

2023-09-21 · NeurIPS 2023 11

We study the computation of doubly regularized Wasserstein barycenters, a recently introduced family of entropic barycenters governed by inner and outer regularization strengths. Previous research has demonstrated that v…

Computational Guarantees for Doubly Entropic Wasserstein Barycenters via Damped Sinkhorn Iterations

2023-07-25 · Lénaïc Chizat, Tomas Vaškevičius

We study the computation of doubly regularized Wasserstein barycenters, a recently introduced family of entropic barycenters governed by inner and outer regularization strengths. Previous research has demonstrated that v…