2024
DOI: 10.1109/tnnls.2023.3239033
|View full text |Cite
|
Sign up to set email alerts
|

Graph-Collaborated Auto-Encoder Hashing for Multiview Binary Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 39 publications
(10 citation statements)
references
References 51 publications
0
10
0
Order By: Relevance
“…Then, a novel scale-aware feature pyramid structure SA-FPN is proposed to extract rich, robust features of underwater images and improve the performance of marine object detection. Wang H et al [ 21 , 22 ] aim at minimizing the reconstruction loss between input data and binary codes for autoencoder-based hashing algorithms while ignoring the potential consistency and complementarity of multi-source data, proposes an autoencoder-based multi-view binary clustering hashing algorithm that dynamically learns an associative graph with low-rank constraints, and employs collaborative learning between the autoencoder and the associative graph to learn a unified binary code. Then, considering that most existing methods have to introduce additional clustering steps to produce the final clusters, significantly reducing the unified relationship between graph learning and clustering, a multi-view clustering based on graph collaboration is proposed.…”
Section: Related Workmentioning
confidence: 99%
“…Then, a novel scale-aware feature pyramid structure SA-FPN is proposed to extract rich, robust features of underwater images and improve the performance of marine object detection. Wang H et al [ 21 , 22 ] aim at minimizing the reconstruction loss between input data and binary codes for autoencoder-based hashing algorithms while ignoring the potential consistency and complementarity of multi-source data, proposes an autoencoder-based multi-view binary clustering hashing algorithm that dynamically learns an associative graph with low-rank constraints, and employs collaborative learning between the autoencoder and the associative graph to learn a unified binary code. Then, considering that most existing methods have to introduce additional clustering steps to produce the final clusters, significantly reducing the unified relationship between graph learning and clustering, a multi-view clustering based on graph collaboration is proposed.…”
Section: Related Workmentioning
confidence: 99%
“…Recently, attention mechanisms [14,[16][17][18][19]24] have been widely applied in the field of Re-ID to improve the performance of the model, which focuses on the information in the image that is useful for identity identification and filters out the information that is not useful for identity identification by means of an adaptive weight adjustment. AGNet [17] proposes an attention module to generate attribute masks can extract more discriminative features for category recognition.…”
Section: Attention Mechanismmentioning
confidence: 99%
“…To better distinguish vehicles with similar appearance in Fig 1, the problem of small inter-class differences in vehicle Re-ID task is solved. Many studies [14][15][16][17][18][19][20] have shown the importance of applying attention mechanisms to the vehicle Re-ID task. DGPM [14] introduced non-local attention [15] after dividing the feature map into multiple regions using rigid division to enhance attentional modeling.…”
Section: Introductionmentioning
confidence: 99%
“…Person search is an active research area that attempts to locate and identify query people from real-world scenes, and has gained significant attention in recent years. To date, the person's information that has been collected from multiple monitors or sensors cry out for effective search tools [1][2][3]. Compared to the person re-identification (re-id) task, this process usually contain a two-stage process, including person detection and person re-id.…”
Section: Introductionmentioning
confidence: 99%