.png){kind=icon}
Return
Deep graph regularized nonnegative Tucker decomposition for image data analysis
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-024-05920-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nonnegative Tucker decomposition (NTD) is widely recognized as an effective tool for image analysis. However, the single-layer structure of the original NTD model is insufficient for capturing multiple directional representations and local manifold structural information from the raw image data. To overcome these limitations, we extend the single-layer framework to a deep graph regularized nonnegative Tucker decomposition (DGNTD) structure by harmoniously unifying deep learning and graph regularization terms in NTD. DGNTD constructs a hierarchical deep structure and decomposes image data into several layers that describe the interconnections of different layers throughout the deep structure. Furthermore, DGNTD with graph learning utilizes a graph structure to express the relationships between samples, which allows for the depiction of the inner geometrical relationships between samples while preserving computational feasibility. In addition, tests on three image datasets, including COIL20, ORL, and PIE, are used to assess the effectiveness of the proposed method.
Keywords:
Nonnegative Tucker decomposition
Deep learning
Graph regularization
Image data analysis
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
ShareSave
ShareSaveShareSaveShareSaveShareSaveShareSaveHyperNTF: A hypergraph regularized nonnegative tensor factorization for dimensionality reduction.png)
NEUROCOMPUTING
OAAI
NEUROCOMPUTINGIF6.5
OAAIShareSaveShareSave
View more