.png){kind=icon}
.png){kind=icon}
Return
DIST-C-SEGAN: A Novel Distributed Dimension Reduction Neural Framework for Visual Data
.png){kind=icon}
PRE
AI
DOI：10.5755/j01.itc.55.1.42668.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a distributed unsupervised dimensionality reduction network framework for visual data, referred to as DIST-C-SEGAN. It aims to achieve low-bandwidth, high-fidelity, scalable, and privacy-friendly unsupervised dimensionality reduction and compression oflarge-scale image data, laying a solid foundation for downstream tasks in resource-constrained distributed or edge computing environments. This method captures local spatial information through a lightweight convolutional network and explores deep feature information using a graph neural propagation structure that combines compression and activation techniques with multi-head self-attention mechanisms. At the same time, it introduces the Proximal Alignment Algorithm to generate low-dimensional embedding features, achieving end-to-end near-lossless preservation of local neighborhood structure and global manifold continuity. Experimental results showthat DIST-C-SEGAN achieves an original variance retention rate of over 98% in all data tasks, demonstrating high reliability and strong continuity. Its structural evaluation metrics are significantly superior to those of classic dimensionality reduction techniques, such as Principal Component Analysis (PCA), Kernel Principal Component Analysis (KPCA), Autoencoder (AE), Variational Autoencoder (VAE), UMAP, and t-SNE. Sensitivity analysis determines the optimal range of key hyperparameters and confirms their robustness to random parameter initialization. Ablation experiments verify the necessity of multi-head self-attention mechanisms and geometric alignment, while downstream tasks further confirm their effectiveness. Moreover, DIST-C-SEGAN theoretically reduces communication costs and provides new solutions for high-fidelity and communication-efficient compression and recovery in distributed environments.
Keywords:
Distributed dimension reduction
near-lossless compression
Distributed learning
Journal
I
IF:
1.9
Papers:
13
Citations:
0