Local Similarity-aware Deep Feature Embedding

Abstract

Existing deep embedding methods in vision tasks are capable of learning a compact Euclidean space from images, where Euclidean distances correspond to a similarity metric. To make learning more effective and efficient, hard sample mining is usually employed, with samples identified through computing the Euclidean feature distance. However, the global Euclidean distance cannot faithfully characterize the true feature similarity in a complex visual feature space, where the intraclass distance in a high-density region may be larger than the interclass distance in low-density regions. In this paper, we introduce a Position-Dependent Deep Metric (PDDM) unit, which is capable of learning a similarity metric adaptive to local feature structure. The metric can be used to select genuinely hard samples in a local neighborhood to guide the deep embedding learning in an online and robust manner. The new layer is appealing in that it is pluggable to any convolutional networks and is trained end-to-

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyhuang2016local

Related papers

• Directional Statistics-based Deep Metric Learning For Image Classification And Retrieval (2018)13.05
• Deep Metric Learning Using Similarities From Nonlinear Rank Approximations (2019)2.26
• Divide And Conquer The Embedding Space For Metric Learning (2019)14.39
• Deep Metric Learning Meets Deep Clustering: An Novel Unsupervised Approach For Feature Embedding (2020)2.26
• Dynamic Sampling For Deep Metric Learning (2020)5.84
• Deeppoint3d: Learning Discriminative Local Descriptors Using Deep Metric Learning On 3D Point Clouds (2019)9.59
• Deep Metric Learning Via Facility Location (2016)17.16
• Learning To Embed Semantic Similarity For Joint Image-text Retrieval (2022)7.50