Concept Preserving Hashing for Semantic Image Retrieval with Concept Drift

Xing Tian, Wing Ng, Hui Wang

Research output: Contribution to journalArticle

Abstract

Current hashing-based image retrieval methods mostly assume that the database of images is static. However, this assumption is not true in cases where the databases are constantly updated (e.g. on Internet) and there exists the problem of concept drift. Online (a.k.a. incremental) hashing methods are proposed recently for image retrieval where the database is not static. However, they have not considered the concept drift problem. Moreover, they update hash functions dynamically by generating new hash codes for all accumulated data over time which is clearly uneconomical. In order to solve these two problems, Concept Preserving Hashing (CPH), is proposed. In contrast to existing methods, CPH preserves the original concept, i.e., the set of hash codes representing a concept is preserved over time, by learning a new set of hash functions to yield the same set of hash codes for images (old and new) of a concept. The objective function of CPH learning consists of three components: isomorphic similarity, hash codes partition balancing, and heterogeneous similarity fitness. Experimental results on 11 concept drift scenarios show that CPH yields better retrieval precisions than existing methods and does not need to update hash codes of previously stored images.
LanguageEnglish
Number of pages14
JournalIEEE Transactions on Cybernetics
Publication statusAccepted/In press - 18 Nov 2019

Fingerprint

Image retrieval
Hash functions
Semantics
Internet

Cite this

@article{e836548960e14157adc5f6d544654286,
title = "Concept Preserving Hashing for Semantic Image Retrieval with Concept Drift",
abstract = "Current hashing-based image retrieval methods mostly assume that the database of images is static. However, this assumption is not true in cases where the databases are constantly updated (e.g. on Internet) and there exists the problem of concept drift. Online (a.k.a. incremental) hashing methods are proposed recently for image retrieval where the database is not static. However, they have not considered the concept drift problem. Moreover, they update hash functions dynamically by generating new hash codes for all accumulated data over time which is clearly uneconomical. In order to solve these two problems, Concept Preserving Hashing (CPH), is proposed. In contrast to existing methods, CPH preserves the original concept, i.e., the set of hash codes representing a concept is preserved over time, by learning a new set of hash functions to yield the same set of hash codes for images (old and new) of a concept. The objective function of CPH learning consists of three components: isomorphic similarity, hash codes partition balancing, and heterogeneous similarity fitness. Experimental results on 11 concept drift scenarios show that CPH yields better retrieval precisions than existing methods and does not need to update hash codes of previously stored images.",
author = "Xing Tian and Wing Ng and Hui Wang",
year = "2019",
month = "11",
day = "18",
language = "English",
journal = "IEEE Transactions on Cybernetics",
issn = "2168-2267",

}

Concept Preserving Hashing for Semantic Image Retrieval with Concept Drift. / Tian, Xing; Ng, Wing; Wang, Hui.

In: IEEE Transactions on Cybernetics, 18.11.2019.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Concept Preserving Hashing for Semantic Image Retrieval with Concept Drift

AU - Tian, Xing

AU - Ng, Wing

AU - Wang, Hui

PY - 2019/11/18

Y1 - 2019/11/18

N2 - Current hashing-based image retrieval methods mostly assume that the database of images is static. However, this assumption is not true in cases where the databases are constantly updated (e.g. on Internet) and there exists the problem of concept drift. Online (a.k.a. incremental) hashing methods are proposed recently for image retrieval where the database is not static. However, they have not considered the concept drift problem. Moreover, they update hash functions dynamically by generating new hash codes for all accumulated data over time which is clearly uneconomical. In order to solve these two problems, Concept Preserving Hashing (CPH), is proposed. In contrast to existing methods, CPH preserves the original concept, i.e., the set of hash codes representing a concept is preserved over time, by learning a new set of hash functions to yield the same set of hash codes for images (old and new) of a concept. The objective function of CPH learning consists of three components: isomorphic similarity, hash codes partition balancing, and heterogeneous similarity fitness. Experimental results on 11 concept drift scenarios show that CPH yields better retrieval precisions than existing methods and does not need to update hash codes of previously stored images.

AB - Current hashing-based image retrieval methods mostly assume that the database of images is static. However, this assumption is not true in cases where the databases are constantly updated (e.g. on Internet) and there exists the problem of concept drift. Online (a.k.a. incremental) hashing methods are proposed recently for image retrieval where the database is not static. However, they have not considered the concept drift problem. Moreover, they update hash functions dynamically by generating new hash codes for all accumulated data over time which is clearly uneconomical. In order to solve these two problems, Concept Preserving Hashing (CPH), is proposed. In contrast to existing methods, CPH preserves the original concept, i.e., the set of hash codes representing a concept is preserved over time, by learning a new set of hash functions to yield the same set of hash codes for images (old and new) of a concept. The objective function of CPH learning consists of three components: isomorphic similarity, hash codes partition balancing, and heterogeneous similarity fitness. Experimental results on 11 concept drift scenarios show that CPH yields better retrieval precisions than existing methods and does not need to update hash codes of previously stored images.

M3 - Article

JO - IEEE Transactions on Cybernetics

T2 - IEEE Transactions on Cybernetics

JF - IEEE Transactions on Cybernetics

SN - 2168-2267

ER -