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,742 papers · 148 categories

Trend · papers per month

2615217821,042 · Jun 202019922001200920172026
48 results for face generation

Optimizes master faces for 2D and 3D face verification using evolutionary algorithms and neural networks.

problem Impersonation attacks using master faces for face-based identity authentication.
method Evolutionary algorithm in latent space of StyleGAN, neural network to direct search, 2D and 3D face reconstruction.
result Obtains high impersonation rates with fewer master faces for 2D and 3D face verification.

Humans are able to imagine a person's voice from the person's appearance and imagine the person's appearance from his/her voice. In this paper, we make the first attempt to develop a method that can convert speech into a voice that matches an input face image and generate a face image that matches the voice of the inpu…

2019-04-09abs ↗pdf ↗

We are interested in attribute-guided face generation: given a low-res face input image, an attribute vector that can be extracted from a high-res image (attribute image), our new method generates a high-res face image for the low-res input that satisfies the given attributes. To address this problem, we condition the …

2017-05-28abs ↗pdf ↗

Bayesian optimization generates personalized face stimuli for cognitive neuroscience.

problem Lack of personalized face stimuli in cognitive neuroscience studies.
method Combines GANs with Bayesian optimization to identify individual response patterns to faces.
result Algorithm efficiently generates optimal faces maximizing individual subject's response.

Powerful generative adversarial networks (GAN) have been developed to automatically synthesize realistic images from text. However, most existing tasks are limited to generating simple images such as flowers from captions. In this work, we extend this problem to the less addressed domain of face generation from fine-gr…

2019-11-26abs ↗pdf ↗

The paper is motivated by the study of graded representations of Takiff algebras, cominuscule parabolics, and their generalizations. We study certain special subsets of the set of weights (and of their convex hull) of the generalized Verma modules (or GVM's) of a semisimple Lie algebra $\lie g$. In particular, we exten…

2010-05-07abs ↗pdf ↗

Pixel-wise relevance method shows how CNNs classify faces, varying across datasets and tasks.

problem Interpreting black-box CNN face recognition models.
method Layer-wise relevance propagation (LRP) applied to VGG-16 models trained for face recognition.
result Relevance maps are generally stable across random initializations and tasks, but less so across pretraining datasets.

A recent Cell paper [Chang and Tsao, 2017] reports an interesting discovery. For the face stimuli generated by a pre-trained active appearance model (AAM), the responses of neurons in the areas of the primate brain that are responsible for face recognition exhibit strong linear relationship with the shape variables and…

2018-05-14abs ↗pdf ↗

Paper proposes a method to encrypt faces while maintaining visual similarity.

problem Protecting personal data from unauthorized face recognition.
method Targeted identity-protection iterative method (TIP-IM) to generate adversarial identity masks.
result TIP-IM provides 95%+ protection success rate against face recognition models.

Face recognition systems are vulnerable to composite face reconstruction attacks.

problem Vulnerability of face recognition systems to composite face reconstruction attacks.
method Assumed attacker uses composite face parts to reconstruct faces faster and more efficiently.
result Current face recognition systems are extremely vulnerable to random search attacks.

The state-of-the-art performance of deep learning algorithms has led to a considerable increase in the utilization of machine learning in security-sensitive and critical applications. However, it has recently been shown that a small and carefully crafted perturbation in the input space can completely fool a deep model.…

2018-09-24abs ↗pdf ↗

The paper studies invariant convex sets in representations with nontrivial copolarity.

problem Understanding the face structure of invariant convex sets in representations with nontrivial copolarity.
method Proves that the face structure of an invariant convex set is determined by its intersection with a fat section, and that a face is exposed if and only if the corresponding face of the intersection is exposed.
result The face structure of invariant convex sets is completely determined by their intersections with fat sections, and exposed faces are preserved.

Given a point (the "spider") on a rectangular box, we would like to find the minimal distance along the surface to its opposite point (the "fly" - the reflection of the spider across the center of the box). Without loss of generality, we can assume that the box has dimensions 1×a×b1\times a\times b with the spider on one …

2015-02-03abs ↗pdf ↗

The paper connects knot theory and cluster algebras via dimer face polynomials.

problem Understanding the relationship between knot theory and cluster algebras.
method Analyzing dimer face polynomials and their connections to Alexander polynomials and cluster algebras.
result Dimer face polynomials are multivariate generalizations of Alexander polynomials and FF-polynomials in cluster algebras.

Energy-based models can generate complex images by combining simpler concepts.

problem Generating natural images that satisfy complex logical combinations of concepts.
method Energy-based models combine probability distributions of simpler concepts to generate compositions.
result Energy-based models can generate images that satisfy conjunctions, disjunctions, and negations of concepts.

A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on opposite edges. A graph without a railroad is called tight. We consider the zigz…

2002-12-27abs ↗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.

We investigate the face numbers of simplicial complexes with Buchsbaum vertex links, especially pseudomanifolds with isolated singularities. This includes deriving Dehn-Sommerville relations for pseudomanifolds with isolated singularities and establishing lower bound theorems when the singularities are also homological…

2010-04-28abs ↗pdf ↗

GANs can bias synthetic data, affecting minority and female faces.

problem GANs can amplify biases in synthetic data augmentation.
method Examine GANs on face-shots with gender and skin tone biases.
result GANs generate biased synthetic data, skewing minority modes and features.

In this paper, we study face vectors of simplicial posets that are the face posets of cell decompositions of topological manifolds without boundary. We characterize all possible face vectors of simplicial posets whose geometric realizations are homeomorphic to the product of spheres. As a corollary, we obtain the chara…

2010-10-02abs ↗pdf ↗

Study on critical faces convergence in a Poisson point process.

problem Convergence of point processes associated with critical faces in a Čech filtration.
method Established convergence in M0\mathcal M_0-topology for critical faces above vanishing threshold.
result Obtained limit theorems for positive and negative critical faces.

Deep generative models have recently achieved impressive results for many real-world applications, successfully generating high-resolution and diverse samples from complex datasets. Due to this improvement, fake digital contents have proliferated growing concern and spreading distrust in image content, leading to an ur…

2019-11-02abs ↗pdf ↗

In this paper, we address the problem of conditional modality learning, whereby one is interested in generating one modality given the other. While it is straightforward to learn a joint distribution over multiple modalities using a deep multimodal architecture, we observe that such models aren't very effective at cond…

2016-03-06abs ↗pdf ↗

Thurston's fibered face theory allows us to partition the set of pseudo-Anosov mapping classes on different compact oriented surfaces into subclasses with related dynamical behavior. This is done via a correspondence between the rational points on fibered faces in the first cohomology of a hyperbolic 3-manifold and the…

2012-12-13abs ↗pdf ↗

Contrastive examples improve fairness in face recognition by balancing minority and majority groups.

problem Face recognition algorithms favor majority groups in training data.
method Create contrastive examples by swapping group memberships in the training dataset.
result Contrastive examples improve fairness metrics like equalized odds.

In this paper, we deal with two challenges for measuring the similarity of the subject identities in practical video-based face recognition - the variation of the head pose in uncontrolled environments and the computational expense of processing videos. Since the frame-wise feature mean is unable to characterize the po…

2016-09-22abs ↗pdf ↗

Face recall is a basic human cognitive process performed routinely, e.g., when meeting someone and determining if we have met that person before. Assisting a subject during face recall by suggesting candidate faces can be challenging. One of the reasons is that the search space - the face space - is quite large and lac…

2016-04-28abs ↗pdf ↗

New flows represent Thurston norm ball faces, differing by veering mutations.

problem Dynamic representation of Thurston norm ball faces by distinct flows.
method Combining veering triangulations and mutations to represent faces by multiple flows.
result Non-fibered faces can be represented by two distinct flows differing by veering mutations.

In this paper we address the following question, given a face representation, how many identities can it resolve? In other words, what is the capacity of the face representation? A scientific basis for estimating the capacity of a given face representation will not only benefit the evaluation and comparison of differen…

2017-09-29abs ↗pdf ↗

Enhances 2D face recognition with 3D features using active illumination.

problem Improving robustness of 2D face recognition to spoofing attacks and low-light conditions.
method Projecting a high spatial frequency pattern onto the face to recover 3D information and a 2D image simultaneously.
result Significantly boosts face recognition performance and dramatically improves robustness to spoofing attacks.

Study evaluates the impact of academic support center's face-to-face assistance on student performance.

problem Underestimation of Academic Support Center's true impact due to group bias.
method Applied causal inference theory and T-learner to evaluate conditional average treatment effect (CATE) of F2F personal assistance.
result Developed a new CATE function that depends on the number of F2F sessions, predicting improved CATE performance.

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P^2-irreducible triangulation. In addition we present constraints upon the co…

2003-07-30abs ↗pdf ↗