Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Deep subspace clustering based on multiscale self-representation learning with consistency and diversity
Zhuo ZHANG, Huazhu CHEN
Journal of Computer Applications    2024, 44 (2): 353-359.   DOI: 10.11772/j.issn.1001-9081.2023030275
Abstract252)   HTML19)    PDF (1205KB)(237)       Save

Deep Subspace Clustering (DSC) is based on the assumption that the original data lies in a collection of low-dimensional nonlinear subspaces. In the multi-scale representation learning methods for deep subspace clustering, based on deep auto-encoder, fully connected layers are added between the encoder and the corresponding decoder for each layer to capture multi-scale features, without deeply analyzing the nature of multi-scale features and considering the multi-scale reconstruction loss between input data and output data. In order to solve the above problems, firstly, the reconstruction loss function of each network layer was established to supervise the learning of encoder parameters at different levels; then, a more effective multi-scale self-representation module was proposed based on the block diagonality of the sum of the common self-representation matrix and the unique self-representation matrices for multi-scale features; finally, the diversity of unique self-representation matrices for different scale features was analyzed in depth and the multi-scale feature matrices were used effectively. On this basis, an MSCD-DSC (Multiscale Self-representation learning with Consistency and Diversity for Deep Subspace Clustering) method was proposed. Experimental results on the datasets Extended Yale B, ORL, COIL20 and Umist show that, compared to the suboptimal method MLRDSC (Multi-Level Representation learning for Deep Subspace Clustering), the clustering error rate of MSCD-DSC is reduced by 15.44%, 2.22%, 3.37%, and 13.17%, respectively, indicating that the clustering effect of MSCD-DSC is better than those of the existing methods.

Table and Figures | Reference | Related Articles | Metrics
Parallel computing of bifurcation stenosis flows of carotid artery based on lattice Boltzmann method and large eddy simulation model
Yizhuo ZHANG, Sen GE, Liangjun WANG, Jiang XIE, Jie CAO, Wu ZHANG
Journal of Computer Applications    2020, 40 (2): 404-409.   DOI: 10.11772/j.issn.1001-9081.2019081388
Abstract369)   HTML1)    PDF (1296KB)(428)       Save

The formation of carotid artery plaque is closely related to complex hemodynamic factors. The accurate simulation of complex flow conditions is of great significance for the clinical diagnosis of carotid artery plaque. In order to simulate the pulsating flow accurately, Large Eddy Simulation (LES) model was combined with Lattice Boltzmann Method (LBM) to construct a LBM-LES carotid artery simulation algorithm, and a real geometric model of carotid artery stenosis was established through medical image reconstruction software, thus the high-resolution numerical simulation of carotid artery stenosis flows was conducted. By calculating blood flow velocity and Wall Shear Stress (WSS), some meaningful flow results were obtained, proving the effectiveness of LBM-LES in the study of blood flow in the carotid artery narrow posterior. Based on the OpenMP programming environment, the parallel computation of the grid of ten million magnitude was carried out on the fully interconnected fat node of high-performance cluster machine. The results show that the LBM-LES carotid artery simulation algorithm has good parallel performance.

Table and Figures | Reference | Related Articles | Metrics