Learned descriptor using dynamical exponential algorithm
Konferenz: AIIPCC 2021 - The Second International Conference on Artificial Intelligence, Information Processing and Cloud Computing
26.06.2021 - 28.06.2021 in Hangzhou, China
Tagungsband: AIIPCC 2021
Seiten: 5Sprache: EnglischTyp: PDF
Autoren:
Yin, Jianhua; Zhu, Longzhen (School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, Shenzhen, China)
Liu, Cong (Shenzhen Institute of Artificial Intelligence and Robotics for Society, Shenzhen, China)
Wen, Jie (School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, Shenzhen, China & Shenzhen Key Laboratory of Visual Object Detection and Recognition, Harbin Institute of Technology, Shenzhen, Shenzhen, China)
Chen, Junhong; Jiang, Jun (Peng Cheng Laboratory, Shenzhen, China)
Liu, Hui (Hengfeng Bank Co., Ltd, Shanghai, China)
Inhalt:
Recent works improve the performance of learned descriptors by the triplet loss function and make some effort in finding the hard negative samples. However, these methods pay less attention to the weight parameter of the loss function to improve the stability of learned descriptors. Unstable descriptors can cause mismatching. To solve the problem, we design a dynamical exponential algorithm (DEA) and introduce the algorithm into the triplet loss function. This algorithm can make that the distance between nonmatching descriptors is exceeded to the distance between matching descriptors. It can improve the stability of the learned descriptor by increasing the difference between two distances. We demonstrate that the performance of the consistent descriptors reached state-of-the-art on various datasets.