Learning sparse latent representation and distance metric for image retrieval
Nguyen, Tu Dinh, Truyen, Tran, Phung, Dinh and Venkatesh, Svetha 2013, Learning sparse latent representation and distance metric for image retrieval, in ICME 2013 : Proceedings of the 14th IEEE International Conference on Multimedia and Expo, IEEE, Piscataway, N.J., pp. 1-6, doi: 10.1109/ICME.2013.6607435.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
Learning sparse latent representation and distance metric for image retrieval
The performance of image retrieval depends critically on the semantic representation and the distance function used to estimate the similarity of two images. A good representation should integrate multiple visual and textual (e.g., tag) features and offer a step closer to the true semantics of interest (e.g., concepts). As the distance function operates on the representation, they are interdependent, and thus should be addressed at the same time. We propose a probabilistic solution to learn both the representation from multiple feature types and modalities and the distance metric from data. The learning is regularised so that the learned representation and information-theoretic metric will (i) preserve the regularities of the visual/textual spaces, (ii) enhance structured sparsity, (iii) encourage small intra-concept distances, and (iv) keep inter-concept images separated. We demonstrate the capacity of our method on the NUS-WIDE data. For the well-studied 13 animal subset, our method outperforms state-of-the-art rivals. On the subset of single-concept images, we gain 79:5% improvement over the standard nearest neighbours approach on the MAP score, and 45.7% on the NDCG.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.