Abstract

Deep distance metric learning (DDML), which is proposed to learn image similarity metrics in an end-to-end manner based on the convolution neural network, has achieved encouraging results in many computer vision tasks.\(L2\)-normalization in the embedding space has been used to improve the performance of several DDML methods. However, the commonly used Euclidean distance is no longer an accurate metric for \(L2\)-normalized embedding space, i.e., a hyper-sphere. Another challenge of current DDML methods is that their loss functions are usually based on rigid data formats, such as the triplet tuple. Thus, an extra process is needed to prepare data in specific formats. In addition, their losses are obtained from a limited number of samples, which leads to a lack of the global view of the embedding space. In this paper, we replace the Euclidean distance with the cosine similarity to better utilize the \(L2\)-normalization, which is able to attenuate the curse of dimensionality. More speci

Authors

(none)

Tags

  • Image Retrieval

Stats

  • citations54
  • S2 citationsβ€”
  • github stars0
  • HF likes0
  • heat score13.05
  • arxiv keyzhe2018directional

Related papers