Sparse structure regularized ranking

J. Wang, Y. Sun, X. Gao
Multimedia tools and applications, 74(2), 635-654, (2015)

Sparse structure regularized ranking

Keywords

Multimedia database retrieval, Ranking score, Sparse representation

Abstract

​Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse structure, we assume that each multimedia object could be represented as a sparse linear combination of all other objects, and combination coefficients are regarded as a similarity measure between objects and used to regularize their ranking scores. Moreover, we propose to learn the sparse combination coefficients and the ranking scores simultaneously. A unified objective function is constructed with regard to both the combination coefficients and the ranking scores, and is optimized by an iterative algorithm. Experiments on two multimedia database retrieval data sets demonstrate the significant improvements of the propose algorithm over state-of-the-art ranking score learning algorithms.

Code

DOI: 10.1007/s11042-014-1939-9

Sources

Website PDF

See all publications 2015