Real-Time Visual Navigation in Huge Image Sets Using Similarity Graphs

@article{Barthel2019RealTimeVN,
  title={Real-Time Visual Navigation in Huge Image Sets Using Similarity Graphs},
  author={Kai Uwe Barthel and Nico Hezel and Konstantin Schall and Klaus Jung},
  journal={Proceedings of the 27th ACM International Conference on Multimedia},
  year={2019}
}
  • K. U. Barthel, N. Hezel, K. Jung
  • Published 14 October 2019
  • Computer Science
  • Proceedings of the 27th ACM International Conference on Multimedia
Nowadays stock photo agencies often have millions of images. Non-stop viewing of 20 million images at a speed of 10 images per second would take more than three weeks. This demonstrates the impossibility to inspect all images and the difficulty to get an overview of the entire collection. Although there has been a lot of effort to improve visual image search, there is little research and support for visual image exploration. Typically, users start "exploring" an image collection with a keyword… 

PicArrange - Visually Sort, Search, and Explore Private Images on a Mac Computer

PicArrange integrates state-of-the-art image sorting and similarity search to enable users to get a better overview of their images and a modification of the Self Sorting Map algorithm enables a list-like image arrangement without loosing the visual sorting.

References

SHOWING 1-10 OF 13 REFERENCES

Visually Browsing Millions of Images Using Image Graphs

In experiments, best user experience for navigating the graph is achieved by projecting sub-graphs onto a regular 2D image map, which allows users to explore the image collection like an interactive map.

Dynamic Construction and Manipulation of Hierarchical Quartic Image Graphs

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.

Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search

Estimation of the full geometric transformation of bag-of-features in the framework of approximate nearest neighbor search is complementary to the weak geometric consistency constraints and allows to further improve the accuracy.

Large-Scale Image Retrieval with Attentive Deep Local Features

An attentive local feature descriptor suitable for large-scale image retrieval, referred to as DELE (DEep Local Feature), based on convolutional neural networks, which are trained only with image-level annotations on a landmark image dataset.

Particular object retrieval with integral max-pooling of CNN activations

This work revisits both retrieval stages, namely initial search and re-ranking, by employing the same primitive information derived from the CNN, and significantly improves existing CNN-based recognition pipeline.

Self-Sorting Map: An Efficient Algorithm for Presenting Multimedia Data in Structured Layouts

The Self-Sorting Map is a novel algorithm for organizing and presenting multimedia data that integrates ideas from dimension reduction, sorting, and data clustering algorithms, and can organize a set of data into a structured layout without overlap, providing a simple and intuitive presentation.

Deep Metric Learning using Similarities from Nonlinear Rank Approximations

This paper introduces a metric learning algorithm that focuses on identifying and modifying those feature vectors that most strongly affect the retrieval quality, and compute normalized approximated ranks and convert them to similarities by applying a nonlinear transfer function.

ImageNet Large Scale Visual Recognition Challenge

The creation of this benchmark dataset and the advances in object recognition that have been possible as a result are described, and the state-of-the-art computer vision accuracy with human accuracy is compared.

Deep Residual Learning for Image Recognition

This work presents a residual learning framework to ease the training of networks that are substantially deeper than those used previously, and provides comprehensive empirical evidence showing that these residual networks are easier to optimize, and can gain accuracy from considerably increased depth.

Self-Organizing Maps, Second Edition

  • T. Kohonen
  • Computer Science
    Springer Series in Information Sciences
  • 1997