Dynamic Construction and Manipulation of Hierarchical Quartic Image Graphs

2018 International Conference on Multimedia Retrieval (ICMR '18)

TL;DR

We present new techniques for dynamically constructing and manipulating image graphs, which connect similar images and perform well in retrieval tasks. Using an enhanced fast self-sorting map algorithm, we enable efficient exploration of large image collections.

Abstract

Over the last years, we have published papers about intuitive image graph navigation and showed how to build static hierarchical image graphs efficiently. In this paper, we showcase new results and present techniques to dynamically construct and manipulate these kinds of graphs. They connect similar images and perform well in retrieving tasks regardless of the number of nodes. By applying an improved fast self-sorting map algorithm, entire image collections (structured in a graph) can be explored with a user interface resembling common navigation services.

BibTeX

If you use our work in your research, please cite our publication:

@inproceedings{10.1145/3206025.3206093,
author = {Hezel, Nico and Barthel, Kai Uwe},
title = {Dynamic Construction and Manipulation of Hierarchical Quartic Image Graphs},
year = {2018},
isbn = {9781450350464},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3206025.3206093},
doi = {10.1145/3206025.3206093},
booktitle = {Proceedings of the 2018 ACM on International Conference on Multimedia Retrieval},
pages = {513–516},
numpages = {4},
keywords = {visualization, quartic graph, image graph, exploration, dynamic construction and manipulation of graphs},
location = {Yokohama, Japan},
series = {ICMR '18}
}