Feature Embedding Clustering using POCS-based Clustering Algorithm
Not on the map. Why?
Abstract (arXiv)
An application of the POCS-based clustering algorithm (POCS stands for Projection Onto Convex Set), a novel clustering technique, for feature embedding clustering problems is proposed in this paper. The POCS-based clustering algorithm applies the POCS's convergence property to clustering problems and has shown competitive performance when compared with that of other classical clustering schemes in terms of clustering error and execution speed. Specifically, the POCS-based clustering algorithm treats each data point as a convex set and applies a parallel projection operation from every cluster prototype to corresponding data members in order to minimize the objective function and update the prototypes. The experimental results on the synthetic embedding datasets extracted from the 5 Celebrity Faces and MNIST datasets show that the POCS-based clustering algorithm can perform with favorable results when compared with those of other classical clustering schemes such as the K-Means and Fuzzy C-Means algorithms in feature embedding clustering problems.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 5 of its 19 references that are in the map. First posted on arXiv 25 Mar 2023.
Builds on
5 of 19 references.
References · 5
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,849
- 2022A Novel Encoder-Decoder Network with Guided Transmission Map for Single Image Dehazingcited by 7
- 2022POCS-based Clustering Algorithmcited by 1
- 2022Encoder-Decoder Network with Guided Transmission Map: Architecturecited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.