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

16324864 · Jun 202019922001200920172026
48 results for face de-identification

Automatic video modification to hide faces while maintaining pose, illumination, and expression.

problem Face de-identification in video to protect identities.
method A novel feed-forward encoder-decoder network architecture conditioned on facial image high-level representation.
result Fully automatic video modification at high frame rates with minimal distortion.

Objective: Patient notes in electronic health records (EHRs) may contain critical information for medical investigations. However, the vast majority of medical investigators can only access de-identified notes, in order to protect the confidentiality of patients. In the United States, the Health Insurance Portability a…

2016-06-10abs ↗pdf ↗

Patient notes contain a wealth of information of potentially great interest to medical investigators. However, to protect patients' privacy, Protected Health Information (PHI) must be removed from the patient notes before they can be legally released, a process known as patient note de-identification. The main objectiv…

2016-10-30abs ↗pdf ↗

Recent approaches based on artificial neural networks (ANNs) have shown promising results for named-entity recognition (NER). In order to achieve high performances, ANNs need to be trained on a large labeled dataset. However, labels might be difficult to obtain for the dataset on which the user wants to perform NER: la…

2017-05-17abs ↗pdf ↗

For a data holder, such as a hospital or a government entity, who has a privately held collection of personal data, in which the revealing and/or processing of the personal identifiable data is restricted and prohibited by law. Then, "how can we ensure the data holder does conceal the identity of each individual in the…

2019-03-27abs ↗pdf ↗

A variety of methods existing for generating synthetic electronic health records (EHRs), but they are not capable of generating unstructured text, like emergency department (ED) chief complaints, history of present illness or progress notes. Here, we use the encoder-decoder model, a deep learning algorithm that feature…

2018-06-01abs ↗pdf ↗

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.

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.

Universal adversarial patches prevent face detection in various frameworks.

problem Preventing face detection in state-of-the-art face detection systems.
method Investigated the phenomenon of patches that suppress face detection and proposed optimization-based approaches for automatic design.
result Universal adversarial patches can prevent face detection without introducing false positives.

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 ↗

Releasing full data records is one of the most challenging problems in data privacy. On the one hand, many of the popular techniques such as data de-identification are problematic because of their dependence on the background knowledge of adversaries. On the other hand, rigorous methods such as the exponential mechanis…

2017-08-26abs ↗pdf ↗

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 ↗

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 ↗

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.

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.

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 ↗

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.

Access to medical data is highly restricted due to its sensitive nature, preventing communities from using this data for research or clinical training. Common methods of de-identification implemented to enable the sharing of data are sometimes inadequate to protect the individuals contained in the data. For our researc…

2019-09-19abs ↗pdf ↗

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.

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.

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 ↗

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 ↗

We study polar orbitopes, i.e. convex hulls of orbits of a polar representation of a compact Lie group. The face structure is studied by means of the gradient momentum map and it is shown that every face is exposed and is again a polar orbitope. Up to conjugation the faces are completely determined by the momentum poly…

2012-06-25abs ↗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.

We call "flippable tilings" of a constant curvature surface a tiling by "black" and "white" faces, so that each edge is adjacent to two black and two white faces (one of each on each side), the black face is forward on the right side and backward on the left side, and it is possible to "flip" the tiling by pushing all …

2010-12-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.

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 ↗

Researchers determine the Thurston unit ball for a family of nn-chained links and find conditions for fibered faces.

problem Determining the Thurston unit ball and conditions for fibered faces in a family of nn-chained links.
method Analyzing the family of nn-chained links C(n,p)C(n,p), proving the Thurston unit ball is an nn-dimensional cocube for p>0p > 0, and finding conditions for fibered faces.
result The Thurston unit ball for C(n,p)C(n,p) is an nn-dimensional cocube for p>0p > 0 and provides at least one fibered face for any pp.