scispace - formally typeset
Journal ArticleDOI

Graph-based clustering and ranking for diversified image search

Reads0
Chats0
TLDR
A novel ranking framework, namely cluster-constrained conditional Markov random walk (CCCMRW), which has two key steps: first, cluster images into topics, and then perform Markovrandom walk in an image graph conditioned on constraints of image cluster information is proposed.
Abstract
In this paper, we consider the problem of clustering and re-ranking web image search results so as to improve diversity at high ranks. We propose a novel ranking framework, namely cluster-constrained conditional Markov random walk (CCCMRW), which has two key steps: first, cluster images into topics, and then perform Markov random walk in an image graph conditioned on constraints of image cluster information. In order to cluster the retrieval results of web images, a novel graph clustering model is proposed in this paper. We explore the surrounding text to mine the correlations between words and images and therefore the correlations are used to improve clustering results. Two kinds of correlations, namely word to image and word to word correlations, are mainly considered. As a standard text process technique, tf-idf method cannot measure the correlation of word to image directly. Therefore, we propose to combine tf-idf method with a novel feature of word, namely visibility, to infer the word-to-image correlation. By latent Dirichlet allocation model, we define a topic relevance function to compute the weights of word-to-word correlations. Taking word to image correlations as heterogeneous links and word-to-word correlations as homogeneous links, graph clustering algorithms, such as complex graph clustering and spectral co-clustering, are respectively used to cluster images into topics in this paper. In order to perform CCCMRW, a two-layer image graph is constructed with image cluster nodes as upper layer added to a base image graph. Conditioned on the image cluster information from upper layer, Markov random walk is constrained to incline to walk across different image clusters, so as to give high rank scores to images of different topics and therefore gain the diversity. Encouraging clustering and re-ranking outputs on Google image search results are reported in this paper.

read more

Citations
More filters
Journal ArticleDOI

Unsupervised Topic Hypergraph Hashing for Efficient Mobile Image Retrieval

TL;DR: A novel unsupervised hashing scheme, called topic hypergraph hashing (THH), is proposed, to address the semantic shortage of hashing codes by exploiting auxiliary texts around images and can achieve superior performance compared with several state-of theart methods.
Journal ArticleDOI

Multi-task support vector machines for feature selection with shared knowledge discovery

TL;DR: A novel feature selection method in which the hinge loss function with a ?
Journal ArticleDOI

Super-Resolution Integrated Building Semantic Segmentation for Multi-Source Remote Sensing Imagery

TL;DR: The experimental results obtained from the test area in Tokyo, Japan demonstrate that the proposed SR-integrated method significantly outperforms that without SR, improving the Jaccard index and kappa by approximately 19.01% and 19.10%, respectively.
Journal ArticleDOI

Multi-Modal Knowledge Graph Construction and Application: A Survey

TL;DR: This survey on MMKGs constructed by texts and images is systematically review the challenges, progresses and opportunities on the construction and application of MMKG respectively, with detailed analyses of the strength and weakness of different solutions.
Journal ArticleDOI

Image Re-Ranking Based on Topic Diversity

TL;DR: A topic diverse ranking approach for tag-based image retrieval with the consideration of promoting the topic coverage performance is proposed and an inverted index structure for images is built to accelerate the searching process.
References
More filters
Journal ArticleDOI

Latent dirichlet allocation

TL;DR: This work proposes a generative model for text and other collections of discrete data that generalizes or improves on several previous models including naive Bayes/unigram, mixture of unigrams, and Hofmann's aspect model.
Proceedings Article

Latent Dirichlet Allocation

TL;DR: This paper proposed a generative model for text and other collections of discrete data that generalizes or improves on several previous models including naive Bayes/unigram, mixture of unigrams, and Hof-mann's aspect model, also known as probabilistic latent semantic indexing (pLSI).
Journal ArticleDOI

Cluster ensembles --- a knowledge reuse framework for combining multiple partitions

TL;DR: This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings and proposes three effective and efficient techniques for obtaining high-quality combiners (consensus functions).
Journal ArticleDOI

Image retrieval: Ideas, influences, and trends of the new age

TL;DR: Almost 300 key theoretical and empirical contributions in the current decade related to image retrieval and automatic image annotation are surveyed, and the spawning of related subfields are discussed, to discuss the adaptation of existing image retrieval techniques to build systems that can be useful in the real world.
Proceedings ArticleDOI

Co-clustering documents and words using bipartite spectral graph partitioning

TL;DR: A new spectral co-clustering algorithm is used that uses the second left and right singular vectors of an appropriately scaled word-document matrix to yield good bipartitionings and it can be shown that the singular vectors solve a real relaxation to the NP-complete graph bipartitionsing problem.
Related Papers (5)