ADS: Approximate Densest Subgraph for Novel Image Discovery

arXiv:2402.08743v1 Announce Type: cross
Abstract: The volume of image repositories continues to grow. Despite the availability of content-based addressing, we still lack a lightweight tool that allows us to discover images of distinct characteristics from a large collection. In this paper, we propose a fast and training-free algorithm for novel image discovery. The key of our algorithm is formulating a collection of images as a perceptual distance-weighted graph, within which our task is to locate the K-densest subgraph that corresponds …

abstract ads algorithm arxiv availability collection cs.cv cs.lg discovery eess.iv free image images novel paper repositories tool training type