Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

4488131175 · Jun 202019922001200920172026
48 results for Facial Landmark Detection

Paper evaluates CNN-based facial landmark detection methods.

problem Evaluate characteristics and performance of CNN-based facial landmark detection methods.
method Divided into regression and heatmap approaches, investigated using a hybrid loss function and discrimination network.
result Proposed model outperforms other models in all tested datasets.

We present a method for synthesizing a frontal, neutral-expression image of a person's face given an input face photograph. This is achieved by learning to generate facial landmarks and textures from features extracted from a facial-recognition network. Unlike previous approaches, our encoding feature vector is largely…

2017-01-17abs ↗pdf ↗

Some tasks, such as surface normals or single-view depth estimation, require per-pixel ground truth that is difficult to obtain on real images but easy to obtain on synthetic. However, models learned on synthetic images often do not generalize well to real images due to the domain shift. Our key idea to improve domain …

2019-08-16abs ↗pdf ↗

First steps towards a mathematical theory of deep convolutional neural networks for feature extraction were made---for the continuous-time case---in Mallat, 2012, and Wiatowski and Bölcskei, 2015. This paper considers the discrete case, introduces new convolutional neural network architectures, and proposes a mathemati…

2016-05-26abs ↗pdf ↗

Estimation of facial expressions, as spatio-temporal processes, can take advantage of kernel methods if one considers facial landmark positions and their motion in 3D space. We applied support vector classification with kernels derived from dynamic time-warping similarity measures. We achieved over 99% accuracy - measu…

2013-06-08abs ↗pdf ↗

This work generates synthetic 3D thermal facial data using 2D facial data and deep learning.

problem Creating large datasets for deep learning in computer vision.
method 3D facial modelling techniques and deep learning methodologies.
result Synthetic 3D thermal facial data created for deep learning applications.

Facial pain expression is an important modality for assessing pain, especially when the patient's verbal ability to communicate is impaired. The facial muscle-based action units (AUs), which are defined by the Facial Action Coding System (FACS), have been widely studied and are highly reliable as a method for detecting…

2018-11-13abs ↗pdf ↗

Fawkes protects images from unauthorized facial recognition models.

problem Unauthorized training of facial recognition models poses privacy risks.
method Fawkes adds imperceptible pixel-level changes (cloaks) to images before release.
result Fawkes can protect images from misidentification by 95% and 80% even when clean images are leaked.

A new landmark sampling method improves TDA performance on biomedical data.

problem Improving landmark samplers for pseudometric spaces with varying density and multiplicities.
method Proposes 'lastfirst' procedure based on ranked distances, proving landmarks have desired properties.
result lastfirst outperforms maxmin on homology detection tasks and comparable on prediction tasks.

Detect facial keypoints is a critical element in face recognition. However, there is difficulty to catch keypoints on the face due to complex influences from original images, and there is no guidance to suitable algorithms. In this paper, we study different algorithms that can be applied to locate keyponits. Specifical…

2017-10-15abs ↗pdf ↗

A deep neural network model is a powerful framework for learning representations. Usually, it is used to learn the relation xyx \to y by exploiting the regularities in the input xx. In structured output prediction problems, yy is multi-dimensional and structural relations often exist between the dimensions. The motiv…

2015-04-28abs ↗pdf ↗

In this paper, we propose a novel deep learning framework for anatomy segmentation and automatic landmark- ing. Specifically, we focus on the challenging problem of mandible segmentation from cone-beam computed tomography (CBCT) scans and identification of 9 anatomical landmarks of the mandible on the geodesic space. T…

2018-10-06abs ↗pdf ↗

CAOS aggregates multiple one-shot predictors for efficient uncertainty quantification.

problem Lack of principled uncertainty quantification in one-shot prediction.
method CAOS, a conformal framework that aggregates multiple one-shot predictors and uses a leave-one-out calibration scheme.
result CAOS produces smaller prediction sets with reliable coverage compared to split conformal baselines.

The study extends stochastic completeness to landmark spaces with any number of landmarks.

problem Stochastic completeness for landmark spaces with arbitrary numbers of landmarks.
method Volume growth criterion and eigenvalue bounds for geodesic balls.
result Stochastic completeness for landmark spaces with any number of landmarks is proven.

Group convolutional neural networks (G-CNNs) can be used to improve classical CNNs by equipping them with the geometric structure of groups. Central in the success of G-CNNs is the lifting of feature maps to higher dimensional disentangled representations, in which data characteristics are effectively learned, geometri…

2019-09-26abs ↗pdf ↗

Purpose: We perform anatomical landmarking for craniomaxillofacial (CMF) bones without explicitly segmenting them. Towards this, we propose a new simple yet efficient deep network architecture, called \textit{relational reasoning network (RRN)}, to accurately learn the local and the global relations among the landmarks…

2019-04-08abs ↗pdf ↗

Paper proposes a new landmark selection method for kernel ridge regression.

problem Efficient landmark selection for scalable kernel methods.
method Two-step approach: first computes importance scores, then clusters them into landmarks.
result Proposed method provides better accuracy and efficiency trade-offs.

Researchers prove long-time existence for two landmark Brownian motion.

problem Proving long-time existence of Brownian motion on configurations of two landmarks.
method Classification and analysis of long-time existence for configurations of exactly two landmarks, using a radial kernel.
result For configurations of exactly two landmarks, long-time existence is possible for certain kernels, but not for others.

Landmark-based node embeddings approximate shortest path distances in random graphs.

problem Capturing global graph distances in node representations.
method Landmark-based node embeddings using shortest path distances from a subset of reference nodes (landmarks).
result Random graphs require lower dimensions in landmark-based embeddings compared to worst-case graphs.

Exact universal interpolation property for landmark configurations in Euclidean space.

problem Representing and deforming landmark configurations through flows of vector fields.
method Explicitly describe vector fields for exact universal interpolation property in all dimensions.
result Achieve controllability by combining constant and polynomial vector fields.

Selecting diverse and important items, called landmarks, from a large set is a problem of interest in machine learning. As a specific example, in order to deal with large training sets, kernel methods often rely on low rank matrix Nyström approximations based on the selection or sampling of landmarks. In this context, …

2019-05-29abs ↗pdf ↗

The perception of facial beauty is a complex phenomenon depending on many, detailed and global facial features influencing each other. In the machine learning community this problem is typically tackled as a problem of supervised inference. However, it has been conjectured that this approach does not capture the comple…

2019-10-30abs ↗pdf ↗

Neumann eigenmaps improve landmark-based diffusion map embeddings.

problem Landmark-based diffusion map embeddings can be computationally inefficient and unstable.
method NeuMaps use a renormalized Neumann Laplacian for eigendecomposition, incorporating landmarks as a subgraph.
result NeuMaps offer a computationally efficient and stable embedding method.

Paper introduces conformal prediction for reliable uncertainty quantification in landmark localization.

problem Systematic underestimation of total predictive uncertainty in landmark localization.
method Conformal prediction framework for multi-output regression, generating flexible prediction regions.
result Methods outperform existing approaches in validity and efficiency across 2D and 3D datasets.

The paper explores a new method for landmark matching using sub-Riemannian geometry and neural networks.

problem Finding a time-dependent vector field to warp points from an initial set to a target set.
method Sub-Riemannian geometry and residual neural networks.
result Demonstrates the importance of regularization in landmark matching.

Kernel methods obtain superb performance in terms of accuracy for various machine learning tasks since they can effectively extract nonlinear relations. However, their time complexity can be rather large especially for clustering tasks. In this paper we define a general class of kernels that can be easily approximated …

2015-10-28abs ↗pdf ↗