Graph-based Multi-view Binary Learning For Image Clustering

Abstract

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 lack complete structure or complementary information from multiple views. For cluster tasks, abundant prior researches mainly focus on learning discrete hash code while few works take original data structure into consideration. To address these problems, we propose a novel binary code algorithm for clustering, which adopts graph embedding to preserve the original data structure, called (Graph-based Multi-view Binary Learning) GMBL in this paper. GMBL mainly focuses on encoding the information of multiple views into a compact binary code, which explores complementary information from multiple views. In particular, in order to maintain the graph-based structure of the original data, we adopt a Laplacian matrix to preserve the local linear relationship of the data and map it

Stats

• citations32
• S2 citations—
• github stars0
• HF likes0
• heat score11.39
• arxiv keyjiang2019graph

Related papers

• Graph-collaborated Auto-encoder Hashing For Multi-view Binary Clustering (2023)14.31
• Discriminative Cross-view Binary Representation Learning (2018)4.52
• Learning Discriminative Hashing Codes For Cross-modal Retrieval Based On Multi-view Features (2018)3.58
• Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
• Locality Preserving Multiview Graph Hashing For Large Scale Remote Sensing Image Search (2023)4.52
• Bilinear Supervised Hashing Based On 2D Image Features (2019)8.60
• Unsupervised Multi-modal Hashing For Cross-modal Retrieval (2019)8.35
• Compact Hash Code Learning With Binary Deep Neural Network (2017)9.03