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

316292123 · Jun 202019922001200920172026
48 results for face reconstruction

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.

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.

The paper proves a Minkowski-like theorem for tetrahedra in dS3 and AdS3.

problem Formulating and proving a constant-curvature, holonomy-valued Lorentzian analogue of Minkowski theorem for tetrahedra.
method Formulated and proved a Lorentzian analogue of Minkowski theorem for tetrahedra in dS3 and AdS3.
result A unique strictly convex tetrahedron can be reconstructed from four non-trivial based SO+(1,2) holonomies.

State of the art deep generative networks are capable of producing images with such incredible realism that they can be suspected of memorizing training images. It is why it is not uncommon to include visualizations of training set nearest neighbors, to suggest generated images are not simply memorized. We demonstrate …

2019-01-09abs ↗pdf ↗

In this paper, we address the problem of data reconstruction from privacy-protected templates, based on recent concept of sparse ternary coding with ambiguization (STCA). The STCA is a generalization of randomization techniques which includes random projections, lossy quantization, and addition of ambiguization noise t…

2019-05-08abs ↗pdf ↗

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 ↗

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.

Here, we present a novel approach to solve the problem of reconstructing perceived stimuli from brain responses by combining probabilistic inference with deep learning. Our approach first inverts the linear transformation from latent features to brain responses with maximum a posteriori estimation and then inverts the …

2017-05-19abs ↗pdf ↗

This paper is the first work to propose a network to predict a structured uncertainty distribution for a synthesized image. Previous approaches have been mostly limited to predicting diagonal covariance matrices. Our novel model learns to predict a full Gaussian covariance matrix for each reconstruction, which permits …

2018-02-20abs ↗pdf ↗

Extends L2-norm LDA to 2D inputs using Bhattacharyya bound.

problem L2-norm LDA loses useful image information for 2D inputs.
method 2DBLDA maximizes matrix-based between-class distance and minimizes within-class distance, optimizing Bhattacharyya error bound.
result 2DBLDA improves image recognition and face reconstruction.

A novel method for feature selection using a reparameterized logitNormal distribution.

problem Feature selection for reconstruction in high-dimensional data.
method Introducing a reparameterization of the logitNormal distribution to address differentiability and covariance issues.
result The method provides an effective exploration scheme and efficient feature selection for reconstruction.

We investigate discrete groups GG of isometries of a complete connected Riemannian manifold MM which are generated by reflections, in particular those generated by disecting reflections. We show that these are Coxeter groups, and that the the orbit space M/GM/G is isometric to a Weyl chamber CC which is a Riemannian …

2003-06-04abs ↗pdf ↗

Generative model learns to autoencode and generate sets of images.

problem Learning to represent and generate sets of images with unknown number of sets.
method Set Distribution Networks (SDNs) learn set encoder, discriminator, generator, and prior.
result SDNs can reconstruct and generate sets of images with preserved attributes.

PolyGen models 3D meshes directly, predicting vertices and faces sequentially.

problem Efficiently modeling 3D geometry for computer graphics, robotics, and games.
method Transformer-based autoregressive model for predicting mesh vertices and faces.
result PolyGen produces high-quality, usable 3D meshes and competitive conditional performance.

This paper proposes a new evaluation metric and boosting method for weight separability in neural network design. In contrast to general visual recognition methods designed to encourage both intra-class compactness and inter-class separability of latent features, we focus on estimating linear independence of column vec…

2019-10-20abs ↗pdf ↗

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 ↗

DefenseVGAE defends graph neural networks against adversarial attacks.

problem Vulnerability of GNNs to adversarial structural perturbations.
method Variational Graph Autoencoder (VGAE) to reconstruct graph structure.
result DefenseVGAE reduces adversarial perturbations and boosts GCN performance.

Bidirectional VAE reduces parameters and improves image tasks.

problem Improving image reconstruction, classification, interpolation, and generation.
method Uses a single neural network for both encoding and decoding in both forward and backward directions.
result Bidirectional VAEs reduce parameters by almost 50% and slightly outperform unidirectional VAEs.

We present a definition of discrete channel surfaces in Lie sphere geometry, which reflects several properties for smooth channel surfaces. Various sets of data, defined at vertices, on edges or on faces, are associated with a discrete channel surface that may be used to reconstruct the underlying particular discrete L…

2018-09-05abs ↗pdf ↗

This is a detailed tutorial paper which explains the Principal Component Analysis (PCA), Supervised PCA (SPCA), kernel PCA, and kernel SPCA. We start with projection, PCA with eigen-decomposition, PCA with one and multiple projection directions, properties of the projection matrix, reconstruction error minimization, an…

2019-06-01abs ↗pdf ↗

New attack recovers user-level information from large batch images.

problem Recovering private information from user-level gradients in distributed learning.
method Proposes a gradient inversion attack using a denoising diffusion model as a prior.
result Demonstrates recovery of realistic facial images and private attributes.

A new method learns dynamic graph representations from time-varying data.

problem Learning dynamic graph representations from time-varying data.
method Higher-order skip-gram with negative sampling (HOSGNS) for tensor factorization.
result HOSGNS outperforms state-of-the-art methods in downstream tasks.

Dictionary learning algorithms have been successfully used for both reconstructive and discriminative tasks, where an input signal is represented with a sparse linear combination of dictionary atoms. While these methods are mostly developed for single-modality scenarios, recent studies have demonstrated the advantages …

2015-02-04abs ↗pdf ↗

The field of multiple view geometry has seen tremendous progress in reconstruction and calibration due to methods for extracting reliable point features and key developments in projective geometry. Point features, however, are not available in certain applications and result in unstructured point cloud reconstructions.…

2016-04-27abs ↗pdf ↗

CSGM framework applied to clinical MRI data for robust reconstructions.

problem Applying deep generative priors to clinical MRI data for high-quality reconstructions.
method Training a generative prior on brain scans from the fastMRI dataset and using Langevin dynamics for posterior sampling.
result Posterior sampling via Langevin dynamics achieves high quality reconstructions in clinical MRI data.

A novel approach stores encoded images as centroids and covariance matrices to improve classification accuracy with less memory.

problem Catastrophic forgetting and memory limitations in continual learning.
method Trains autoencoders with Neural Style Transfer to encode images, replay encoded episodes to avoid forgetting, and use centroids and covariance matrices for pseudo-images when memory is full.
result Increases classification accuracy by 13-17% over state-of-the-art methods on benchmark datasets, while requiring 78% less storage space.

TadGAN detects anomalies in time series data using GANs and LSTM.

problem Challenges in detecting anomalies in time series data, especially without labeled data.
method TadGAN uses Generative Adversarial Networks (GANs) with LSTM Recurrent Neural Networks to capture temporal correlations and compute anomaly scores.
result TadGAN outperforms 8 baseline methods in most cases, achieving the highest averaged F1 score.

SentenceMIM learns rich latent representations for variable-length language data.

problem Challenges in learning VAEs for variable-length language data, especially posterior collapse.
method Probabilistic auto-encoder trained with Mutual Information Machine (MIM) learning.
result SentenceMIM learns informative latent representations with high mutual information.

Study improves confidence measures in medical imaging pipelines by addressing bias.

problem Bias in metric-based imaging pipelines compromises the efficiency of prediction intervals.
method Formalized symmetric and asymmetric CP formulations, analyzed bias effects, and validated empirically.
result Symmetric intervals are inflated by bias, while asymmetric intervals remain unaffected.

New methods improve feature extraction and representation quality in supervised and unsupervised DR.

problem Statistical dependence, data diversity, contrast, and interpretability in conventional DR methods.
method Combines linear and nonlinear formulations for three new independence criteria.
result Significant improvements in contrast, accuracy, and interpretability over baselines.

PTOPOFL uses topological descriptors to protect privacy in federated learning.

problem Privacy and data reconstruction attacks in federated learning.
method PTOPOFL replaces gradient communication with persistent homology feature vectors for privacy and topology-guided aggregation.
result PTOPOFL achieves higher AUC and reduces reconstruction risk compared to gradient sharing.

We present an autoencoder that leverages learned representations to better measure similarities in data space. By combining a variational autoencoder with a generative adversarial network we can use learned feature representations in the GAN discriminator as basis for the VAE reconstruction objective. Thereby, we repla…

2015-12-31abs ↗pdf ↗

Study finds no significant short-term impact on liquidity supply after protocol fees were reduced.

problem Liquidity provider welfare is affected by protocol fees, but the impact on liquidity supply is unclear.
method Used a matched-overlap event-study difference-in-differences design to estimate the liquidity-supply response to take-rate cuts.
result No significant short-term impact on active liquidity or local depth; no change in LP participation or composition.

Gaussian processes are a flexible Bayesian nonparametric modelling approach that has been widely applied but poses computational challenges. To address the poor scaling of exact inference methods, approximation methods based on sparse Gaussian processes (SGP) are attractive. An issue faced by SGP, especially in latent …

2019-10-13abs ↗pdf ↗

Facial attribute editing aims to manipulate single or multiple attributes of a face image, i.e., to generate a new face with desired attributes while preserving other details. Recently, generative adversarial net (GAN) and encoder-decoder architecture are usually incorporated to handle this task with promising results.…

2017-11-29abs ↗pdf ↗

A neural network learns phase space properties for time series analysis.

problem Lack of consistency and robustness in estimating embedding parameters.
method Forgetting mechanism neural network to learn phase space properties.
result Neural network approach is competitive or superior to state-of-the-art strategies.

In the field of machine learning, it is still a critical issue to identify and supervise the learned representation without manually intervening or intuition assistance to extract useful knowledge or serve for the downstream tasks. In this work, we focus on supervising the influential factors extracted by the variation…

2018-09-06abs ↗pdf ↗

In many scientific disciplines structures in high-dimensional data have to be found, e.g., in stellar spectra, in genome data, or in face recognition tasks. In this work we present a novel approach to non-linear dimensionality reduction. It is based on fitting K-nearest neighbor regression to the unsupervised regressio…

2011-07-19abs ↗pdf ↗