Iterative Singular Tube Hard Thresholding Algorithms for Tensor Completion

Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be further used to define the best low-rank approximation of a tensor to significantly reduce the dimensionality for signal compression and recovery. In this paper, we consider the low-rank tensor completion problem. We propose a novel class of iterative singular tube hard thresholding algorithms for tensor completion based on the low-tubal-rank tensor approximation, including basic, accelerated deterministic and stochastic versions. Convergence guarantees are provided along with the special case when the measurements are linear. Numerical experiments on tensor compressive sensing and color image inpainting are conducted to demonstrate convergence and computational efficiency in practice

영상 잡음 제거와 수중 영상 복원을 위한 정규화 방법

학위논문(박사)--서울대학교 대학원 :자연과학대학 수리과학부,2020. 2. 강명주.In this thesis, we discuss regularization methods for denoising images corrupted by Gaussian or Cauchy noise and image dehazing in underwater. In image denoising, we introduce the second-order extension of structure tensor total variation and propose a hybrid method for additive Gaussian noise. Furthermore, we apply the weighted nuclear norm under nonlocal framework to remove additive Cauchy noise in images. We adopt the nonconvex alternating direction method of multiplier to solve the problem iteratively. Subsequently, based on the color ellipsoid prior which is effective for restoring hazy image in the atmosphere, we suggest novel dehazing method adapted for underwater condition. Because attenuation rate of light varies depending on wavelength of light in water, we apply the color ellipsoid prior only for green and blue channels and combine it with intensity map of red channel to refine the obtained depth map further. Numerical experiments show that our proposed methods show superior results compared with other methods both in quantitative and qualitative aspects.본 논문에서 우리는 가우시안 또는 코시 분포를 따르는 잡음으로 오염된 영상과 물 속에서 얻은 영상을 복원하기 위한 정규화 방법에 대해 논의한다. 영상 잡음 문제에서 우리는 덧셈 가우시안 잡음의 해결을 위해 구조 텐서 총변이의 이차 확장을 도입하고 이것을 이용한 혼합 방법을 제안한다. 나아가 덧셈 코시 잡음 문제를 해결하기 위해 우리는 가중 핵 노름을 비국소적인 틀에서 적용하고 비볼록 교차 승수법을 통해서 반복적으로 문제를 푼다. 이어서 대기 중의 안개 낀 영상을 복원하는데 효과적인 색 타원면 가정에 기초하여, 우리는 물 속의 상황에 알맞은 영상 복원 방법을 제시한다. 물 속에서 빛의 감쇠 정도는 빛의 파장에 따라 달라지기 때문에, 우리는 색 타원면 가정을 영상의 녹색과 청색 채널에 적용하고 그로부터 얻은 깊이 지도를 적색 채널의 강도 지도와 혼합하여 개선된 깊이 지도를 얻는다. 수치적 실험을 통해서 우리가 제시한 방법들을 다른 방법과 비교하고 질적인 측면과 평가 지표에 따른 양적인 측면 모두에서 우수함을 확인한다.1 Introduction 1 1.1 Image denoising for Gaussian and Cauchy noise 2 1.2 Underwater image dehazing 5 2 Preliminaries 9 2.1 Variational models for image denoising 9 2.1.1 Data-fidelity 9 2.1.2 Regularization 11 2.1.3 Optimization algorithm 14 2.2 Methods for image dehazing in the air 15 2.2.1 Dark channel prior 16 2.2.2 Color ellipsoid prior 19 3 Image denoising for Gaussian and Cauchy noise 23 3.1 Second-order structure tensor and hybrid STV 23 3.1.1 Structure tensor total variation 24 3.1.2 Proposed model 28 3.1.3 Discretization of the model 31 3.1.4 Numerical algorithm 35 3.1.5 Experimental results 37 3.2 Weighted nuclear norm minimization for Cauchy noise 46 3.2.1 Variational models for Cauchy noise 46 3.2.2 Low rank minimization by weighted nuclear norm 52 3.2.3 Proposed method 55 3.2.4 ADMM algorithm 56 3.2.5 Numerical method and experimental results 58 4 Image restoration in underwater 71 4.1 Scientific background 72 4.2 Proposed method 73 4.2.1 Color ellipsoid prior on underwater 74 4.2.2 Background light estimation 78 4.3 Experimental results 80 5 Conclusion 87 Appendices 89Docto

Tensor Networks for Dimensionality Reduction and Large-Scale Optimizations. Part 2 Applications and Future Perspectives

Part 2 of this monograph builds on the introduction to tensor networks and their operations presented in Part 1. It focuses on tensor network models for super-compressed higher-order representation of data/parameters and related cost functions, while providing an outline of their applications in machine learning and data analytics. A particular emphasis is on the tensor train (TT) and Hierarchical Tucker (HT) decompositions, and their physically meaningful interpretations which reflect the scalability of the tensor network approach. Through a graphical approach, we also elucidate how, by virtue of the underlying low-rank tensor approximations and sophisticated contractions of core tensors, tensor networks have the ability to perform distributed computations on otherwise prohibitively large volumes of data/parameters, thereby alleviating or even eliminating the curse of dimensionality. The usefulness of this concept is illustrated over a number of applied areas, including generalized regression and classification (support tensor machines, canonical correlation analysis, higher order partial least squares), generalized eigenvalue decomposition, Riemannian optimization, and in the optimization of deep neural networks. Part 1 and Part 2 of this work can be used either as stand-alone separate texts, or indeed as a conjoint comprehensive review of the exciting field of low-rank tensor networks and tensor decompositions.Comment: 232 page