2020
DOI: 10.1007/s11063-020-10194-y
|View full text |Cite
|
Sign up to set email alerts
|

An Image Clustering Auto-Encoder Based on Predefined Evenly-Distributed Class Centroids and MMD Distance

Abstract: In this paper, we propose an end-to-end image clustering auto-encoder algorithm: ICAE. The algorithm uses PEDCC (Predefined Evenly-Distributed Class Centroids) as the clustering centers of the images, which ensures the inter-class distance of latent features is maximal, and adds data distribution constraint, data augmentation constraint, autoencoder reconstruction loss constraint and latent features plus noise constraint to improve clustering performance. Specifically, we perform one-to-one data augmentation s… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
19
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 22 publications
(20 citation statements)
references
References 32 publications
1
19
0
Order By: Relevance
“…When the equilibrium state is reached, the n points on the hypersphere can be farthest apart. The detail of algorithm implementation is visible in [13].…”
Section: Pedccmentioning
confidence: 99%
See 1 more Smart Citation
“…When the equilibrium state is reached, the n points on the hypersphere can be farthest apart. The detail of algorithm implementation is visible in [13].…”
Section: Pedccmentioning
confidence: 99%
“…In this paper, PEDCC proposed in CSAE (Zhu qiuyu et al, 2019) [13] is used to generate the class centroids of the evenly distributed normalized weight, which is called PEDCC weights. We replace the weight of the classification linear layer with PEDCC weights in CNNs, and the PEDCC weights are solidified during training to maximize the inter-class distance.…”
Section: Introductionmentioning
confidence: 99%
“…However, if the inter-class distance is small, the accuracy of classification will be reduced. PEDCC is proposed based on the hypersphere charge model [20]. Due to mutual exclusion of charges, in equilibrium, n charges will be evenly distributed on the hypersphere, and the distance between points is the farthest.…”
Section: Pedccmentioning
confidence: 99%
“…As a result, we have a new data form that is presented as F Ss. In order to better extract the time information, we calculate RP for each F S. Inspired by the PEDCC [26] algorithm and Deep Embedded Clustering (DEC) [25] model, we introduce a CNN based supervised autoencoder that can learn the high-level features well and leverage them as much as possible. Besides, we also make the network accept both F Ss and RPs as inputs by extending the network to dual autoencoder, thus forming the Dual-CSA.…”
Section: Proposed Frameworkmentioning
confidence: 99%
“…To effectively interpret the time information inside MFs and AFs, we develop a method to encode them as RPs. 2) We propose a cluster centroids aware supervised autoencoder that can make the high-level features (latent embedding) of the same class of samples as close as possible to PCC, which is mainly benefited from a loss function we improved from the one proposed in [25], and this improvement is based on the Predefined Evenly-Distributed Class Centroids (PEDCC) algorithm [26]. 3) A neural network consisting of two autoencoders is designed, one of which learns the high-level features of RPs and the other learns the high-level features of AFs and MFs.…”
Section: Introductionmentioning
confidence: 99%