paper-with-me

홈 › Papers

Web Scale Photo Hash Clustering on A Single Machine

2015-06-01 · CVPR 2015 6 · Yunchao Gong, Marcin Pawlowski, Fei Yang, Louis Brandy, Lubomir Bourdev, Rob Fergus

This paper addresses the problem of clustering a very large number of photos (i.e. hundreds of millions a day) in a stream into millions of clusters. This is particularly important as the popularity of photo sharing websites, such as Facebook, Google, and Instagram. Given large number of photos available online, how to efficiently organize them is an open problem. To address this problem, we propose to cluster the binary hash codes of a large number of photos into binary cluster centers. We present a fast binary k-means algorithm that works directly on the similarity-preserving hashes of images and clusters them into binary centers on which we can build hash indexes to speedup computation. The proposed method is capable of clustering millions of photos on a single machine in a few minutes. We show that this approach is usually several magnitude faster than standard k-means and produces comparable clustering accuracy. In addition, we propose an online clustering method based on binary k-means that is capable of clustering large photo stream on a single machine, and show applications to spam detection and trending photo discovery.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringOnline ClusteringSpam detection

Similar Papers 제목 키워드 기반

Web-Scale Image Clustering Revisited

2015-12-01 · ICCV 2015 12 · Yannis Avrithis, Yannis Kalantidis, Evangelos Anagnostopoulos, Ioannis Z. Emiris

Large scale duplicate detection, clustering and mining of documents or images has been conventionally treated with seed detection via hashing, followed by seed growing heuristics using fast search. Principled clustering …

ClusteringImage ClusteringQuantization

LOH and behold: Web-scale visual search, recommendation and clustering using Locally Optimized Hashing

2016-04-21 · Yannis Kalantidis, Lyndon Kennedy, Huy Nguyen, Clayton Mellina 외

We propose a novel hashing-based matching scheme, called Locally Optimized Hashing (LOH), based on a state-of-the-art quantization algorithm that can be used for efficient, large-scale search, recommendation, clustering,…

ClusteringDistributed ComputingQuantization

TPCH: Tensor-interacted Projection and Cooperative Hashing for Multi-view Clustering

2024-12-25 · Zhongwen Wang, Xingfeng Li, Yinghui Sun, Quansen Sun 외

In recent years, anchor and hash-based multi-view clustering methods have gained attention for their efficiency and simplicity in handling large-scale data. However, existing methods often overlook the interactions among…

ClusteringCPU

Graph-based Multi-view Binary Learning for Image Clustering

2019-12-11 · Guangqi Jiang, Huibing Wang, Jinjia Peng, Dongyan Chen 외

Hashing techniques, also known as binary code learning, have recently gained increasing attention in large-scale data analysis and storage. Generally, most existing hash clustering methods are single-view ones, which lac…

ClusteringGraph EmbeddingImage Clustering

HARRISON: A Benchmark on HAshtag Recommendation for Real-world Images in Social Networks

2016-05-17 · Minseok Park, Hanxiang Li, Junmo Kim

Simple, short, and compact hashtags cover a wide range of information on social networks. Although many works in the field of natural language processing (NLP) have demonstrated the importance of hashtag recommendation, …