Tensor compressive sensing fused low-rankness and local-smoothness
A plethora of previous studies indicates that making full use of multifarious intrinsic
properties of primordial data is a valid pathway to recover original images from their …
properties of primordial data is a valid pathway to recover original images from their …
Sparse data reconstruction, missing value and multiple imputation through matrix factorization
Social science approaches to missing values predict avoided, unrequested, or lost
information from dense data sets, typically surveys. The authors propose a matrix …
information from dense data sets, typically surveys. The authors propose a matrix …
Fluorescence microscopy images denoising via deep convolutional sparse coding
Fluorescence microscopy images captured in low light and short exposure time conditions
are always contaminated by photons and readout noises, which reduce the fluorescence …
are always contaminated by photons and readout noises, which reduce the fluorescence …
Guaranteed matrix recovery using weighted nuclear norm plus weighted total variation minimization
This work presents a general framework regarding the recovery of matrices equipped with
hybrid low-rank and local-smooth properties from just a few measurements consisting of …
hybrid low-rank and local-smooth properties from just a few measurements consisting of …
A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems
X Zhang, D Peng, Y Su - Journal of Global Optimization, 2024 - Springer
In this paper, we study the low-rank matrix optimization problem, where the loss function is
smooth but not necessarily convex, and the penalty term is a nonconvex (folded concave) …
smooth but not necessarily convex, and the penalty term is a nonconvex (folded concave) …
Robust low-rank matrix recovery fusing local-smoothness
Recovering low-rank matrices by nuclear norm minimization and local-smooth matrices by
total variation seminorm minimization are two common methods in the context of …
total variation seminorm minimization are two common methods in the context of …
Performance guarantees of regularized ℓ1− 2-minimization for robust sparse recovery
W Wang, J Zhang - Signal Processing, 2022 - Elsevier
Based on the powerful restricted isometry property (RIP) and the coherence tools, this paper
develops two types of robust recovery results for a (non-convex) regularized ℓ 1− 2 …
develops two types of robust recovery results for a (non-convex) regularized ℓ 1− 2 …
Robust principal component analysis via weighted nuclear norm with modified second-order total variation regularization
Y Dou, X Liu, M Zhou, J Wang - The Visual Computer, 2023 - Springer
The traditional robust principal component analysis (RPCA) model aims to decompose the
original matrix into low-rank and sparse components and uses the nuclear norm to describe …
original matrix into low-rank and sparse components and uses the nuclear norm to describe …
[HTML][HTML] RIP-based performance guarantee for low-tubal-rank tensor recovery
The essential task of tensor data analysis focuses on the tensor decomposition and the
corresponding notion of rank. In this paper, by introducing the notion of tensor Singular …
corresponding notion of rank. In this paper, by introducing the notion of tensor Singular …
The MMV tail null space property and DOA estimations by tail-ℓ2, 1 minimization
B Zheng, C Zeng, S Li, G Liao - Signal Processing, 2022 - Elsevier
The tail-minimization approach is applied to the joint sparse multiple measurement vector
(MMV) model and direction of arrival (DOA) estimations. The mechanism is to estimate the …
(MMV) model and direction of arrival (DOA) estimations. The mechanism is to estimate the …