TY - GEN
T1 - Optimizing top precision performance measure of content-based image retrieval by learning similarity function
AU - Liang, Ru-Ze
AU - Shi, Lihui
AU - Wang, Haoxiang
AU - Meng, Jiandong
AU - Wang, Jim Jing-Yan
AU - Sun, Qingquan
AU - Gu, Yi
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: The study is supported by a grant from Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, China
PY - 2017/4/24
Y1 - 2017/4/24
N2 - In this paper we study the problem of content-based image retrieval. In this problem, the most popular performance measure is the top precision measure, and the most important component of a retrieval system is the similarity function used to compare a query image against a database image. However, up to now, there is no existing similarity learning method proposed to optimize the top precision measure. To fill this gap, in this paper, we propose a novel similarity learning method to maximize the top precision measure. We model this problem as a minimization problem with an objective function as the combination of the losses of the relevant images ranked behind the top-ranked irrelevant image, and the squared Frobenius norm of the similarity function parameter. This minimization problem is solved as a quadratic programming problem. The experiments over two benchmark data sets show the advantages of the proposed method over other similarity learning methods when the top precision is used as the performance measure.
AB - In this paper we study the problem of content-based image retrieval. In this problem, the most popular performance measure is the top precision measure, and the most important component of a retrieval system is the similarity function used to compare a query image against a database image. However, up to now, there is no existing similarity learning method proposed to optimize the top precision measure. To fill this gap, in this paper, we propose a novel similarity learning method to maximize the top precision measure. We model this problem as a minimization problem with an objective function as the combination of the losses of the relevant images ranked behind the top-ranked irrelevant image, and the squared Frobenius norm of the similarity function parameter. This minimization problem is solved as a quadratic programming problem. The experiments over two benchmark data sets show the advantages of the proposed method over other similarity learning methods when the top precision is used as the performance measure.
UR - http://hdl.handle.net/10754/623313
UR - http://ieeexplore.ieee.org/document/7900086/
UR - http://www.scopus.com/inward/record.url?scp=85019142962&partnerID=8YFLogxK
U2 - 10.1109/ICPR.2016.7900086
DO - 10.1109/ICPR.2016.7900086
M3 - Conference contribution
SN - 9781509048472
SP - 2954
EP - 2958
BT - 2016 23rd International Conference on Pattern Recognition (ICPR)
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -