|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM29467778X |
| 003 |
DE-627 |
| 005 |
20231225082015.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2019 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2019.2903294
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0982.xml
|
| 035 |
|
|
|a (DE-627)NLM29467778X
|
| 035 |
|
|
|a (NLM)30843836
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Liang, Jie
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Simultaneous Subspace Clustering and Cluster Number Estimating Based on Triplet Relationship
|
| 264 |
|
1 |
|c 2019
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Revised 24.06.2019
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a In this paper, we propose a unified framework to discover the number of clusters and group the data points into different clusters using subspace clustering simultaneously. Real data distributed in a high-dimensional space can be disentangled into a union of low-dimensional subspaces, which can benefit various applications. To explore such intrinsic structure, state-of-the-art subspace clustering approaches often optimize a self-representation problem among all samples, to construct a pairwise affinity graph for spectral clustering. However, a graph with pairwise similarities lacks robustness for segmentation, especially for samples which lie on the intersection of two subspaces. To address this problem, we design a hyper-correlation-based data structure termed as the triplet relationship, which reveals high relevance and local compactness among three samples. The triplet relationship can be derived from the self-representation matrix, and be utilized to iteratively assign the data points to clusters. Based on the triplet relationship, we propose a unified optimizing scheme to automatically calculate clustering assignments. Specifically, we optimize a model selection reward and a fusion reward by simultaneously maximizing the similarity of triplets from different clusters while minimizing the correlation of triplets from the same cluster. The proposed algorithm also automatically reveals the number of clusters and fuses groups to avoid over-segmentation. Extensive experimental results on both synthetic and real-world datasets validate the effectiveness and robustness of the proposed method
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Yang, Jufeng
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Cheng, Ming-Ming
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Rosin, Paul L
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Wang, Liang
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 28(2019), 8 vom: 07. Aug., Seite 3973-3985
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:28
|g year:2019
|g number:8
|g day:07
|g month:08
|g pages:3973-3985
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2019.2903294
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 28
|j 2019
|e 8
|b 07
|c 08
|h 3973-3985
|