A Scalable Graph-Based Semi-Supervised Ranking System for Content-Based Image Retrieval

A Scalable Graph-Based Semi-Supervised Ranking System for Content-Based Image Retrieval

Xiaojun Qi, Ran Chang
DOI: 10.4018/ijmdem.2013100102
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The authors propose a scalable graph-based semi-supervised ranking system for image retrieval. This system exploits the synergism between relevance feedback based transductive short-term learning and semantic feature-based long-term learning to improve retrieval performance. Active learning is applied to build a dynamic feedback log to extract semantic features of images. Two-layer manifold graphs are then built in both low-level visual and high-level semantic spaces. One graph is constructed at the first layer using anchor images obtained from the feedback log. Several graphs are constructed at the second layer using images in their respective cluster formed around each anchor image. An asymmetric relevance vector is created for each second layer graph by propagating initial scores from the first layer. These vectors are fused to propagate relevance scores of labeled images to unlabeled images. The authors’ extensive experiments demonstrate the proposed system outperforms four manifold-based and five state-of-the-art long-term-based image retrieval systems.
Article Preview
Top

1. Introduction

With the rapidly growing number of digital images found on the Internet and housed in digital libraries, the need for effective and efficient tools to manage large image databases has grown dramatically. Specifically, the development of efficient image retrieval systems to find images of interest in this haystack of data has become an active research area in recent years (Thomee, 2010).

Content-based image retrieval (CBIR) techniques (Datta et al., 2008; Lew et al., 2006) are viable solutions to find desired images from multimedia databases and have evolved significantly since the early 1990s. They make use of low-level visual image features (e.g., color, texture, shape, etc.) instead of keywords to represent images, where each feature can be automatically and consistently extracted without human intervention. Consequently, they overcome the limitations entailed by text-based image retrieval, which include the large amount of manual labor required to annotate each image in the database, and the inconsistency among different annotators in perceiving the same image. However, as the ranking of retrievals is calculated based on selected image features, the retrieval accuracy may be unsatisfactory due to the semantic gap between low-level visual features and high-level semantic concepts. This semantic gap exists because objects of the same type do not have the same visual representation. For example, images of similar semantic content may be scattered far away from each other in the feature space, while images of dissimilar semantic content may share similar low-level features. To bridge the semantic gap, a great deal of research work has been focused on developing effective relevance feedback (RF) techniques (Liu et al., 2007; Zhou & Huang, 2003), which utilize users’ interaction to learn better representation of images as well as the query concept. RF, as an interactive search technique, has been used in CBIR systems to repeatedly modify the query descriptive information (feature, matching models, metrics or any meta knowledge) as response to the users’ feedback on retrieved results. Therefore, it learns the query close to its optimal and returns more user-desired images (i.e., improves the retrieval precision) after each round.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing