.png){kind=icon}
.png){kind=icon}
Return
Binary Codes Based on Non-Negative Matrix Factorization for Clustering and Retrieval
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3037956.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Traditional non-negative matrix factorization methods cannot learn the subspace from the high-dimensional data space composed of binary codes. One hopes to discover a compact parts-based representation composed of binary codes, which can uncover the intrinsic information and simultaneously respect the geometric structure of the original data. For this purpose, we introduce discrete hashing methods and propose a novel non-negative matrix factorization to generate binary codes from the original data. In this paper, we construct an affinity graph to encode the geometrical structure of the original data, and the learned binary code subspace achieved by matrix factorization respects the structure. The proposed problem can be formulated as a mixed integer optimization problem. Therefore, we transform it into several sub-problems including an integer optimization problem, two convex problems with the non-negative constraint and a quadratic programming problem. Optimizing each sub-problem alternately until we achieve a local optimal solution. Image clustering and retrieval on image datasets show the excellent performance of our method in comparison to other dimensional reduction methods.
Keywords:
Binary codes
Optimization
Matrix decomposition
Complexity theory
Sparse matrices
Search problems
Heating systems
Binary codes
discrete hashing
non-negative matrix factorization
dimensional reduction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W