A Review on Attribute Based Image Search Reranking

Image search reranking is one of the effective approach to refine the text-based image search result. Text-based image retrieval suffers from essential problems that are lead to the incapability of the associated text to appropriately evoke the image content. In this paper, reranking methods are put forward to address this drawback in scalable fashion. Based on the classifiers for each and every predefined attributes,each and every  image is represented by an attribute feature consisting of the responses from these classifiers. This hypergraph can be used to model the relationship between images by integration of low-level visual features and attribute features. Hypergraph ranking is then performed to order the images. Its basic principle is that visually close images should have identical ranking scores. It improves the performance over the text-based image search engin

Learning Word Representations with Hierarchical Sparse Coding

We propose a new method for learning word representations using hierarchical regularization in sparse coding inspired by the linguistic study of word meanings. We show an efficient learning algorithm based on stochastic proximal methods that is significantly faster than previous approaches, making it possible to perform hierarchical sparse coding on a corpus of billions of word tokens. Experiments on various benchmark tasks---word similarity ranking, analogies, sentence completion, and sentiment analysis---demonstrate that the method outperforms or is competitive with state-of-the-art methods. Our word representations are available at \url{http://www.ark.cs.cmu.edu/dyogatam/wordvecs/}

Joint Semantic and Latent Attribute Modelling for Cross-Class Transfer Learning

This work is partially supported by grants from the National Natural Science Foundation of China under contract No. 61390515, No. U1611461, and No. 61425025, and the National Basic Research Program of China under Grant No. 2015CB351806