Aug 2026· Neural Networks· Vol 205 Pt B, pp.
109489
· 0 citations· 52 references
Medicine
TL;DR
A robust non-parametric Bayesian method known as the Bayesian adaptive tensor ring decomposition (BATR) method, which accomplishes an adaptive low tensor ring (TR) rank model by incorporating a more advanced generalized hyperbolic (GH) prior into the probabilistic framework, thereby facilitating automatic TR rank determination.
Abstract
Robust tensor decomposition (RTD) is designed to distinguish low-rank and sparse tensors from noisy high-dimensional data, which holds fundamental significance in the fields of machine learning and computer vision. Nevertheless, current RTD-based methods fall short in addressing the issues of automatic noise adaptation and determination of model capacity. In response to these challenges, this paper introduces a robust non-parametric Bayesian method known as the Bayesian adaptive tensor ring decomposition (BATR) method. More precisely, BATR models unknown noise using a Dirichlet process Gaussian mixture model (DP-GMM), with automatic determination of the noise components. Besides, BATR accomplishes an adaptive low tensor ring (TR) rank model by incorporating a more advanced generalized hyperbolic (GH) prior into the probabilistic framework, thereby facilitating automatic TR rank determination. Furthermore, a variational Bayesian inference algorithm is employed to update the posteriors of the model. Extensive experiments on synthetic data, color images, face images, multispectral images, and hyperspectral images demonstrate the improved performance of BATR compared to other state-of-the-art methods.
A robust tensor recovery model based on second-order difference-induced adaptive tensor nuclear norm regularization that consistently improves PSNR and ERGAS under all tested noise settings while achieving competitive SSIM values is proposed.
The Kronecker-DCT (K-DCT) model uses a Kronecker-factored decomposition of inter-color covariances and spatial covariances modeled in the frequency domain using the Discrete Cosine Transform (DCT), resulting in negligible computational and memory overhead in each denoising step.
Rui Xia, Ayan Das, A. Artemev et al.· Trans. Mach. Learn. Res.· 0 citations
Image Sparse Noise Removal constitutes a core issue within the domain of image processing. The tensor nuclear norm (TNN) has achieved great success in color image sparse denoising, but it suffers from the problem of direction sensitivity. In order to address this problem, a color image sparse noise removal scheme via t...
Li Guo, Pei-Yu Qin· Journal of Physics, Conferen...· 0 citations
A unified framework for scalable estimation of tensor covariances based on a Kronecker-structured sparse inverse Cholesky (KSIC) projection, proving that the KSIC estimator gainfully exploits cross-mode information and is robust to data scarcity.
This work provides a theoretical analysis which establishes a non-asymptotic reconstruction error bound that characterizes the effects of sampling complexity, optimization convergence, and model mismatch in a structured tensor approximation problem.
Jeongmin Chae, Usama Saleem, Selin Bac et al.· 0 citations
An efficient numerical approach for compressing a high-dimensional discrete distribution function into a non-negative tensor train (NTT) format and observing that the proposed NTT fitting procedure exhibits drastically faster convergence than an alternative multiplicative update method that has been previously proposed...
Xun Tang, Rajat Vadiraj Dwaraknath, Le-Xing Ying· SIAM Journal on Scientific C...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.