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.
This paper investigates the impact of unconventional preprocessors on deep convolutional neural networks for face identification.
problem The impact of unconventional preprocessors on deep convolutional neural networks for face identification.
method Varying the preprocessing module across different approaches while keeping other network architecture facets constant, using transfer learning from Inception-V3 network features.
result Improvement in discriminative capability of deep networks through preprocessing with HE, quantization, and other methods.
Paper proposes a framework to protect user anonymity in emotion recognition.
problem Preserving user anonymity in face-based emotion recognition systems.
method Adversarial learning framework using CNN architecture.
result The proposed approach minimizes identity-specific information and maximizes emotion-dependent information.
Classifies 3-manifolds from cube identifications.
problem Classifying non-orientable 3-manifolds.
method Identifying cube faces to form manifolds, classifying based on surface-complexity.
result Identifies four flat non-orientable 3-manifolds with surface-complexity one.
Face recognition system trained with noisy labels.
problem Label noise in training deep learning classifiers.
method Review and apply recent methods to manage noisy annotations.
result Improved performance of face recognition system with noisy labels.
New gait segmentation method identifies users and adversaries with high accuracy.
problem Simultaneous identification of users and adversaries from accelerometer data.
method Geometric features and a new similarity metric for time series analysis.
result 98.79% accuracy for 6 classes (user-adversary identification) and 99.06% for binary (user only identification).
The paper tackles individualized decision-making under unmeasured confounding, providing a novel minimax solution and a paradox.
problem Unmeasured confounding in causal inference leads to biased estimates and affects individualized decision-making.
method The authors establish a formal link between individualized decision-making under partial identification and classical decision theory, providing a minimax solution and a paradox.
result A novel minimax solution for individualized decision-making/policy assignment is provided, and an interesting paradox is drawn.
ECGID research focuses on rest but not exercise, this study evaluates both.
problem ECGID performance under exercise is insufficiently studied.
method Various learning methods applied to ECG dataset.
result Current ECGID methods fail under exercise conditions.
State of the art online learning procedures focus either on selecting the best alternative ("best arm identification") or on minimizing the cost (the "regret"). We merge these two objectives by providing the theoretical analysis of cost minimizing algorithms that are also delta-PAC (with a proven guaranteed bound on th…
New method improves neural network robustness by identifying functions rather than parameters.
problem Neural networks' lack of robustness to distribution shifts.
method Identify the function represented by quadratic networks, not their parameters.
result Obtain robust generalization bounds for neural networks.
SafeAccess identifies people in smart homes for safer access.
problem Enhancing safety and independence for people with disabilities.
method Change detection, Faster-RCNN, LBP/FaceNet, MTCNN, MMS.
result Average F-score of 0.97 for identifying friends/families/caregivers versus intruders/unknown.
This paper analyzes the stability and generalization of triplet learning algorithms.
problem Lack of theoretical understanding of triplet learning's generalization performance.
method Stability analysis and high-probability generalization bounds for triplet learning algorithms.
result Established general high-probability generalization bound for triplet learning algorithms.
Cervical spondylosis (CS) is a common chronic disease that affects up to two-thirds of the population and poses a serious burden on individuals and society. The early identification has significant value in improving cure rate and reducing costs. However, the pathology is complex, and the mild symptoms increase the dif…
Despite significant progress made over the past twenty five years, unconstrained face verification remains a challenging problem. This paper proposes an approach that couples a deep CNN-based approach with a low-dimensional discriminative embedding learned using triplet probability constraints to solve the unconstraine…
We consider a novel stochastic multi-armed bandit problem called {\em good arm identification} (GAI), where a good arm is defined as an arm with expected reward greater than or equal to a given threshold. GAI is a pure-exploration problem that a single agent repeats a process of outputting an arm as soon as it is ident…
Study on adversarial attacks on user identification systems using motion sensors.
problem Adversarial attacks on deep learning models for user identification based on motion sensors.
method Study of adversarial example generation methods and their impact on user identification systems.
result Deep neural networks trained for user identification based on motion sensors are vulnerable to adversarial attacks, leading to high misclassification rates.
This paper reviews deep learning techniques for face recognition and sketch matching.
problem Matching composite sketches to photo images of faces is challenging due to limited details.
method Uses deep learning for feature extraction and classification in face recognition.
result Deep learning improves face recognition accuracy with large datasets.
New techniques improve the accuracy of identifying nonlinear systems from noisy data.
problem Identifying nonlinear dynamical systems from noisy state measurements.
method Comparative study of local and global smoothing techniques to denoise state measurements and improve sparse regression methods.
result Global smoothing methods outperform local methods in improving the accuracy of governing equation recovery.
We present a novel algorithm, called Links, designed to perform online clustering on unit vectors in a high-dimensional Euclidean space. The algorithm is appropriate when it is necessary to cluster data efficiently as it streams in, and is to be contrasted with traditional batch clustering algorithms that have access t…
Cross-domain visual data matching is one of the fundamental problems in many real-world vision tasks, e.g., matching persons across ID photos and surveillance videos. Conventional approaches to this problem usually involves two steps: i) projecting samples from different domains into a common space, and ii) computing (…
ARX models predict thermal behavior of WBG semiconductors accurately.
problem Thermal management challenges of WBG semiconductors.
method Use of ARX parametric models based on experimental measurements.
result ARX models provide accurate temperature predictions without detailed component information.
Two single parameter families of polyhedra P(ψ) are constructed in three dimensional spaces of constant curvature C(ψ). Identification of the faces of the polyhedra via isometries results in cone manifolds M(ψ) which are topologically $S^1\timesS^2$, S3 or singular S2. The singular set of M(ψ) can have se…
New algorithm for efficiently identifying the best arm in stochastic bandits.
problem Best arm identification in stochastic multi-armed bandits with fixed confidence.
method Sequential probability ratio tests for arm selection.
result Asymptotically optimal sample complexity and guaranteed δ−PAC performance. Algorithm learns new tasks efficiently from past experience.
problem Lack of robustness to distributional shift in meta-reinforcement learning.
method Model Identification and Experience Relabeling (MIER) using dynamics models.
result Efficient extrapolation to out-of-distribution tasks.
In this paper, we propose a deep multimodal fusion network to fuse multiple modalities (face, iris, and fingerprint) for person identification. The proposed deep multimodal fusion algorithm consists of multiple streams of modality-specific Convolutional Neural Networks (CNNs), which are jointly optimized at multiple fe…
The paper introduces metrics to rank potential outcomes for better decision-making.
problem Optimal action selection in uncertain situations using causal reasoning.
method Introducing two new metrics: probabilities of potential outcome ranking (PoR) and probability of achieving the best potential outcome (PoB). Establishing identification theorems and deriving bounds for these metrics, and presenting estimation methods.
result The estimators' finite-sample properties and their application to a real-world dataset are demonstrated.
Person Re-identification (re-id) faces two major challenges: the lack of cross-view paired training data and learning discriminative identity-sensitive and view-invariant features in the presence of large pose variations. In this work, we address both problems by proposing a novel deep person image generation model for…
In this paper, we study the problem of author identification under double-blind review setting, which is to identify potential authors given information of an anonymized paper. Different from existing approaches that rely heavily on feature engineering, we propose to use network embedding approach to address the proble…
The World Health Organization (WHO) reported 1.25 million deaths yearly due to road traffic accidents worldwide and the number has been continuously increasing over the last few years. Nearly fifth of these accidents are caused by distracted drivers. Existing work of distracted driver detection is concerned with a smal…
Let Out(Fn) be the outer automorphism group of the free group Fn. It acts properly on the outer space Xn of marked metric graphs, which is a finite-dimensional infinite simplicial complex with some simplicial faces missing. In this paper, we construct complete geodesic metrics and complete piecewise s…
Proposes methods for learning optimal dynamic treatment regimes robust to unconfoundedness violations.
problem Estimating optimal dynamic treatment regimes using historical observational data when unconfoundedness is violated.
method Utilizes proximal causal inference framework to propose three nonparametric identification methods, a (K+1)-robust method, and establish a semiparametric efficiency bound.
result Establishes the (K+1)-robust method for learning optimal dynamic treatment regimes, validating its efficiency and multiple robustness through numerical experiments.
As in many other scientific domains, we face a fundamental problem when using machine learning to identify proteins from mass spectrometry data: large ground truth datasets mapping inputs to correct outputs are extremely difficult to obtain. Instead, we have access to imperfect hand-coded models crafted by domain exper…
Paper analyzes and improves GPSP algorithm for block sparse signal recovery.
problem Recovering block sparse signals from noisy data.
method Group Projected Subspace Pursuit (GPSP) with convergence analysis and feature selection criteria.
result GPSP exactly recovers true block sparse signals under certain conditions.
Some statistical models are specified via a data generating process for which the likelihood function cannot be computed in closed form. Standard likelihood-based inference is then not feasible but the model parameters can be inferred by finding the values which yield simulated data that resemble the observed data. Thi…
Motivated by models of human decision making proposed to explain commonly observed deviations from conventional expected value preferences, we formulate two stochastic multi-armed bandit problems with distorted probabilities on the reward distributions: the classic K-armed bandit and the linearly parameterized bandit…
The paper addresses bias in survival analysis due to informative censoring.
problem Bias in treatment effect estimates due to informative censoring in survival analysis.
method Assumption-lean framework using partial identification to derive bounds on CATE.
result Proposes a meta-learner, SurvB-learner, to estimate bounds on CATE.
New method can infer training data from deep neural networks with high success rates.
problem Model inversion attacks on deep neural networks pose privacy risks.
method Generative model-inversion attack using GANs and partial public information.
result Significant improvement in identifying private training data from deep models.
Consumers with low demand, like households, are generally supplied single-phase power by connecting their service mains to one of the phases of a distribution transformer. The distribution companies face the problem of keeping a record of consumer connectivity to a phase due to uninformed changes that happen. The exact…
BLADE uses Bayesian methods to discover complex systems from scarce data.
problem Efficiently discovering governing equations of complex dynamical systems from limited data.
method Combines replica-exchange stochastic gradient Langevin Monte Carlo with active learning.
result Reduces measurement requirements by 60% for Lotka-Volterra and 40% for Burgers' equation.
Study uses stacked hourglass networks to improve facial landmark detection for medical diagnosis.
problem Improving accuracy of facial landmark detection for medical diagnosis.
method Conducted a study on landmark localisation methods using stacked hourglass networks.
result State-of-the-art stacked hourglass architecture outperforms traditional methods.
Paper defends LSTM-based text classification models from backdoor attacks.
problem Backdoor attacks in LSTM models cause misclassification of spam or malicious speech.
method Backdoor Keyword Identification (BKI) to identify and exclude poisoned samples.
result BKI method effectively mitigates backdoor attacks in various text classification datasets.
AI-driven framework improves enterprise financial audits and risk identification.
problem Manual auditing is inefficient and limited by data complexity and evolving fraud tactics.
method Machine learning algorithms (SVM, RF, KNN) applied to a dataset of audit project counts, violations, and fraud instances.
result Random Forest achieves best performance with F1-score of 0.9012, identifying fraud and compliance anomalies.
New tilings of the 2-sphere from convex polyhedra in 3-sphere.
problem Finding tilings of the 2-sphere from convex polyhedra in 3-sphere.
method Using the Lie group SU(2) and its Maurer-Cartan forms. result Existence of two canonical tilings of the 2-sphere.
A technique to quickly fix mistakes in neural networks.
problem Fixing model errors in neural networks quickly and without affecting other samples.
method Editable Training, a model-agnostic training technique.
result Effectiveness demonstrated on large-scale image classification and machine translation tasks.
We study the impact of contagion in a network of firms facing credit risk. We describe an intensity based model where the homogeneity assumption is broken by introducing a random environment that makes it possible to take into account the idiosyncratic characteristics of the firms. We shall see that our model goes behi…
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.
A network of agents attempt to learn some unknown state of the world drawn by nature from a finite set. Agents observe private signals conditioned on the true state, and form beliefs about the unknown state accordingly. Each agent may face an identification problem in the sense that she cannot distinguish the truth in …
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.