Binary Codes Based on Non-Negative Matrix Factorization for Clustering and Retrieval
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 t...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9258904/ |