Bayesian Low Rank Tensor Ring Model for Image Completion

• URL: http://arxiv.org/abs/2007.01055v1
• Date: Mon, 29 Jun 2020 02:58:25 GMT
• Title: Bayesian Low Rank Tensor Ring Model for Image Completion
• Authors: Zhen Long, Ce Zhu, Jiani Liu, Yipeng Liu
• Abstract summary: Low rank tensor ring model is powerful for image completion which recovers missing entries in data acquisition and transformation. In this paper, we present a Bayesian low rank tensor ring model for image completion by automatically learning the low rank structure of data.
• Score: 44.148303000278574
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Low rank tensor ring model is powerful for image completion which recovers missing entries in data acquisition and transformation. The recently proposed tensor ring (TR) based completion algorithms generally solve the low rank optimization problem by alternating least squares method with predefined ranks, which may easily lead to overfitting when the unknown ranks are set too large and only a few measurements are available. In this paper, we present a Bayesian low rank tensor ring model for image completion by automatically learning the low rank structure of data. A multiplicative interaction model is developed for the low-rank tensor ring decomposition, where core factors are enforced to be sparse by assuming their entries obey Student-T distribution. Compared with most of the existing methods, the proposed one is free of parameter-tuning, and the TR ranks can be obtained by Bayesian inference. Numerical Experiments, including synthetic data, color images with different sizes and YaleFace dataset B with respect to one pose, show that the proposed approach outperforms state-of-the-art ones, especially in terms of recovery accuracy.

Related papers

• EnsIR: An Ensemble Algorithm for Image Restoration via Gaussian Mixture Models [70.60381055741391]
  Image restoration challenges related to illposed problems, resulting in deviations between single model predictions and ground-truths. Ensemble learning aims to address these deviations by combining the predictions of multiple base models. We employ an expectation (EM)-based algorithm to estimate ensemble weights for prediction candidates. Our algorithm is model-agnostic and training-free, allowing seamless integration and enhancement of various pre-trained image restoration models.
  arXiv  Detail & Related papers  (2024-10-30T12:16:35Z)
• Irregular Tensor Low-Rank Representation for Hyperspectral Image Representation [71.69331824668954]
  Low-rank tensor representation is an important approach to alleviate spectral variations. Previous low-rank representation methods can only be applied to the regular data cubes. We propose a novel irregular lowrank representation method that can efficiently model the irregular 3D cubes.
  arXiv  Detail & Related papers  (2024-10-24T02:56:22Z)
• Rethinking Classifier Re-Training in Long-Tailed Recognition: A Simple Logits Retargeting Approach [102.0769560460338]
  We develop a simple logits approach (LORT) without the requirement of prior knowledge of the number of samples per class. Our method achieves state-of-the-art performance on various imbalanced datasets, including CIFAR100-LT, ImageNet-LT, and iNaturalist 2018.
  arXiv  Detail & Related papers  (2024-03-01T03:27:08Z)
• Fine Structure-Aware Sampling: A New Sampling Training Scheme for Pixel-Aligned Implicit Models in Single-View Human Reconstruction [105.46091601932524]
  We introduce Fine Structured-Aware Sampling (FSS) to train pixel-aligned implicit models for single-view human reconstruction. FSS proactively adapts to the thickness and complexity of surfaces. It also proposes a mesh thickness loss signal for pixel-aligned implicit models.
  arXiv  Detail & Related papers  (2024-02-29T14:26:46Z)
• Fine-grained Retrieval Prompt Tuning [149.9071858259279]
  Fine-grained Retrieval Prompt Tuning steers a frozen pre-trained model to perform the fine-grained retrieval task from the perspectives of sample prompt and feature adaptation. Our FRPT with fewer learnable parameters achieves the state-of-the-art performance on three widely-used fine-grained datasets.
  arXiv  Detail & Related papers  (2022-07-29T04:10:04Z)
• Bayesian Robust Tensor Ring Model for Incomplete Multiway Data [7.765112574724006]
  Low-rank tensor completion aims to recover missing entries from the observed data. In this paper, we propose a robust tensor ring (BRTR) decomposition method for RTC problem. Experiments indicate that BRTR has better recovery performance and ability to remove noise than other state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-02-27T09:25:24Z)
• Robust M-estimation-based Tensor Ring Completion: a Half-quadratic Minimization Approach [14.048989759890475]
  We develop a robust approach to tensor ring completion that uses an M-estimator as its error statistic. We present two HQ-based algorithms based on truncated singular value decomposition and matrix factorization.
  arXiv  Detail & Related papers  (2021-06-19T04:37:50Z)
• Monocular Depth Estimation via Listwise Ranking using the Plackett-Luce Model [15.472533971305367]
  In many real-world applications, the relative depth of objects in an image is crucial for scene understanding. Recent approaches mainly tackle the problem of depth prediction in monocular images by treating the problem as a regression task. Yet, ranking methods suggest themselves as a natural alternative to regression, and indeed, ranking approaches leveraging pairwise comparisons have shown promising performance on this problem.
  arXiv  Detail & Related papers  (2020-10-25T13:40:10Z)
• Tensor completion via nonconvex tensor ring rank minimization with guaranteed convergence [16.11872681638052]
  In recent studies, the tensor ring (TR) rank has shown high effectiveness in tensor completion. A recently proposed TR rank is based on capturing the structure within the weighted sum penalizing the singular value equally. In this paper, we propose to use the logdet-based function as a non smooth relaxation for solutions practice.
  arXiv  Detail & Related papers  (2020-05-14T03:13:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.