Image Representation and Learning With Graph-Laplacian Tucker Tensor Decomposition.

Area of Science:

• Computer Vision
• Machine Learning
• Data Science

Background:

• Tucker tensor decomposition (TD) is valuable for image representation and reconstruction.
• Traditional TD models primarily use attribute information, neglecting pairwise image similarities.
• Principal Component Analysis (PCA) linearizes images, unlike tensor models that preserve 2-D characteristics.

Purpose of the Study:

• To propose Graph-Laplacian Tucker Tensor Decomposition (GLTD) integrating both attribute and pairwise similarity information.
• To enhance image reconstruction robustness against occlusions and outliers.
• To improve the regularity of image representations for better learning outcomes.

Main Methods:

• Developed a novel Graph-Laplacian Tucker Tensor Decomposition (GLTD) framework.
• Incorporated Laplacian regularization to enhance robustness and regularity.
• Designed an effective algorithm to solve the non-convex GLTD problem, ensuring stable solutions.

Main Results:

• GLTD demonstrated significant robustness in image reconstruction against occlusions and outliers, attributed to Laplacian regularization.
• GLTD representations exhibited improved regularity, leading to enhanced performance in unsupervised and supervised learning tasks.
• Experimental validation on image reconstruction, clustering, and classification confirmed the benefits of GLTD.

Conclusions:

• GLTD effectively combines attribute and pairwise similarity information for superior image analysis.
• The proposed method offers enhanced robustness and regularity, outperforming traditional TD and PCA.
• GLTD provides a stable and effective solution for complex image representation and learning tasks.