Harnessing Geometric Constraints from Auxiliary Labels to Improve
Embedding Functions for One-Shot Learning
- URL: http://arxiv.org/abs/2103.03862v1
- Date: Fri, 5 Mar 2021 18:27:38 GMT
- Title: Harnessing Geometric Constraints from Auxiliary Labels to Improve
Embedding Functions for One-Shot Learning
- Authors: Anand Ramakrishnan, Minh Pham, and Jacob Whitehill
- Abstract summary: We introduce novel geometric constraints on the embedding space learned by a deep model using either manually annotated or automatically detected auxiliary labels.
Our methods provide a higher verification accuracy (99.7, 86.2, 99.4, and 79.3% with our proposed TL+PDP+FBV loss, versus 97.5, 72.6, 93.1, and 70.5% using a standard Triplet Loss on the four datasets, respectively)
- Score: 21.445455835823626
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: We explore the utility of harnessing auxiliary labels (e.g., facial
expression) to impose geometric structure when training embedding models for
one-shot learning (e.g., for face verification). We introduce novel geometric
constraints on the embedding space learned by a deep model using either
manually annotated or automatically detected auxiliary labels. We contrast
their performances (AUC) on four different face datasets(CK+, VGGFace-2, Tufts
Face, and PubFig). Due to the additional structure encoded in the embedding
space, our methods provide a higher verification accuracy (99.7, 86.2, 99.4,
and 79.3% with our proposed TL+PDP+FBV loss, versus 97.5, 72.6, 93.1, and 70.5%
using a standard Triplet Loss on the four datasets, respectively). Our method
is implemented purely in terms of the loss function. It does not require any
changes to the backbone of the embedding functions.
Related papers
- On-the-fly Point Feature Representation for Point Clouds Analysis [7.074010861305738]
We propose On-the-fly Point Feature Representation (OPFR), which captures abundant geometric information explicitly through Curve Feature Generator module.
We also introduce the Local Reference Constructor module, which approximates the local coordinate systems based on triangle sets.
OPFR only requires extra 1.56ms for inference (65x faster than vanilla PFH) and 0.012M more parameters, and it can serve as a versatile plug-and-play module for various backbones.
arXiv Detail & Related papers (2024-07-31T04:57:06Z) - Gradient Boosting Mapping for Dimensionality Reduction and Feature Extraction [2.778647101651566]
A fundamental problem in supervised learning is to find a good set of features or distance measures.
We propose a supervised dimensionality reduction method, where the outputs of weak learners define the embedding.
We show that the embedding coordinates provide better features for the supervised learning task.
arXiv Detail & Related papers (2024-05-14T10:23:57Z) - LoLep: Single-View View Synthesis with Locally-Learned Planes and
Self-Attention Occlusion Inference [66.45326873274908]
We propose a novel method, LoLep, which regresses Locally-Learned planes from a single RGB image to represent scenes accurately.
Compared to MINE, our approach has an LPIPS reduction of 4.8%-9.0% and an RV reduction of 73.9%-83.5%.
arXiv Detail & Related papers (2023-07-23T03:38:55Z) - Integral Continual Learning Along the Tangent Vector Field of Tasks [112.02761912526734]
We propose a lightweight continual learning method which incorporates information from specialized datasets incrementally.
It maintains a small fixed-size memory buffer, as low as 0.4% of the source datasets, which is updated by simple resampling.
Our method achieves strong performance across various buffer sizes for different datasets.
arXiv Detail & Related papers (2022-11-23T16:49:26Z) - A High-Accuracy Unsupervised Person Re-identification Method Using
Auxiliary Information Mined from Datasets [53.047542904329866]
We make use of auxiliary information mined from datasets for multi-modal feature learning.
This paper proposes three effective training tricks, including Restricted Label Smoothing Cross Entropy Loss (RLSCE), Weight Adaptive Triplet Loss (WATL) and Dynamic Training Iterations (DTI)
arXiv Detail & Related papers (2022-05-06T10:16:18Z) - Tactile Grasp Refinement using Deep Reinforcement Learning and Analytic
Grasp Stability Metrics [70.65363356763598]
We show that analytic grasp stability metrics constitute powerful optimization objectives for reinforcement learning algorithms.
We show that a combination of geometric and force-agnostic grasp stability metrics yields the highest average success rates of 95.4% for cuboids.
In a second experiment, we show that grasp refinement algorithms trained with contact feedback perform up to 6.6% better than a baseline that receives no tactile information.
arXiv Detail & Related papers (2021-09-23T09:20:19Z) - SelfVoxeLO: Self-supervised LiDAR Odometry with Voxel-based Deep Neural
Networks [81.64530401885476]
We propose a self-supervised LiDAR odometry method, dubbed SelfVoxeLO, to tackle these two difficulties.
Specifically, we propose a 3D convolution network to process the raw LiDAR data directly, which extracts features that better encode the 3D geometric patterns.
We evaluate our method's performances on two large-scale datasets, i.e., KITTI and Apollo-SouthBay.
arXiv Detail & Related papers (2020-10-19T09:23:39Z) - PropagationNet: Propagate Points to Curve to Learn Structure Information [79.65125870257009]
We present a novel structure-infused face alignment algorithm based on heatmap regression.
We also propose a Focal Wing Loss for mining and emphasizing the difficult samples under in-the-wild condition.
Our method achieves 4.05% mean error on WFLW, 2.93% mean error on 300W full-set, and 3.71% mean error on COFW.
arXiv Detail & Related papers (2020-06-25T11:08:59Z) - SALD: Sign Agnostic Learning with Derivatives [42.43016094317574]
We introduce SALD: a method for learning implicit neural representations of shapes directly from raw data.
We demonstrate the efficacy of SALD for shape space learning on two challenging datasets.
arXiv Detail & Related papers (2020-06-09T16:54:57Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.