scholarly journals Image Denoising Using Low Rank Matrix Approximation in Singular Value Decomposition

2021 ◽  
Vol 11 (2) ◽  
pp. 1430-1446
Author(s):  
Satyanarayana Tallapragada V.V.
Keyword(s):  
Singular Value Decomposition ◽  
Image Denoising ◽  
Singular Values ◽  
Singular Value ◽  
Low Rank ◽  
Lower Rank ◽  
Rank Matrix ◽  
Wide Range ◽  
Value Decomposition ◽  
Low Rank Matrix

The factorization of a matrix into lower rank matrices give solutions to a wide range of computer vision and image processing tasks. The inherent patches or the atomic patches can completely describe the whole image. The lower rank matrices are obtained using different tools including Singular Value Decomposition (SVD), which is typically found in minimization problems of nuclear norms. The singular values obtained will generally be a thresholder to realize the nuclear norm minimization. However, soft-thresholding is performed uniformly on all the singular values that lead to a similar importance to all the patches whether it is principal/useful or not. Our observation is that the decision on a patch (to be principal/useful or not) can be taken only when the application of this minimization is taken into consideration. Thus, in this paper, we propose a new method for image denoising by choosing variable weights to different singular values with a deep noise effect. Experimental results illustrate that the proposed weighted scheme performs better than the state-of-the-art methods.

A QUINTET SINGULAR VALUE DECOMPOSITION THROUGH EMPIRICAL MODE DECOMPOSITIONS

2014 ◽  
Vol 06 (02n03) ◽  
pp. 1450010
Author(s):  
MIN-SUNG KOH
Keyword(s):  
Singular Value Decomposition ◽  
Speech Enhancement ◽  
Singular Values ◽  
Singular Value ◽  
Diagonal Matrix ◽  
Low Rank ◽  
Orthogonal Matrices ◽  
Low Rank Approximations ◽  
Single Matrix ◽  
Value Decomposition

A particular quintet singular valued decomposition (Quintet-SVD) is introduced in this paper via empirical mode decompositions (EMDs). The Quintet-SVD results in four specific orthogonal matrices with a diagonal matrix of singular values. Furthermore, this paper shows relationships between the Quintet-SVD and traditional SVD, generalized low rank approximations of matrices (GLRAM) of one single matrix, and EMDs. One application of the Quintet-SVD for speech enhancement is shown and compared with an application of traditional SVD.

Optimized quantum singular value thresholding algorithm based on a hybrid quantum computer

2021 ◽  
Author(s):  
Yangyang Ge ◽  
Zhimin Wang ◽  
Wen Zheng ◽  
Yu Zhang ◽  
Xiangmin Yu ◽  
...  
Keyword(s):  
Quantum Computer ◽  
Singular Values ◽  
Singular Value ◽  
Low Rank ◽  
Continuous Variables ◽  
Rank Matrix ◽  
Near Term ◽  
Thresholding Algorithm ◽  
Low Rank Matrix ◽  
Singular Value Thresholding

Abstract Quantum singular value thresholding (QSVT) algorithm, as a core module of many mathematical models, seeks the singular values of a sparse and low rank matrix exceeding a threshold and their associated singular vectors. The existing all-qubit QSVT algorithm demands lots of ancillary qubits, remaining a huge challenge for realization on near-term intermediate-scale quantum computers. In this paper, we propose a hybrid QSVT (HQSVT) algorithm utilizing both discrete variables (DVs) and continuous variables (CVs). In our algorithm, raw data vectors are encoded into a qubit system and the following data processing is fulfilled by hybrid quantum operations. Our algorithm requires O[log(MN)] qubits with O(1) qumodes and totally performs O(1) operations, which significantly reduces the space and runtime consumption.

scholarly journals An Image Denoising Method with Enhancement of the Directional Features Based on Wavelet and SVD Transforms

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Min Wang ◽  
Zhen Li ◽  
Xiangjun Duan ◽  
Wei Li
Keyword(s):  
Wavelet Transform ◽  
Singular Value Decomposition ◽  
Image Denoising ◽  
High Frequency ◽  
Low Frequency ◽  
Singular Value ◽  
Denoising Method ◽  
Diagonal Part ◽  
Value Decomposition ◽  
Image Part

This paper proposes an image denoising method, using the wavelet transform and the singular value decomposition (SVD), with the enhancement of the directional features. First, use the single-level discrete 2D wavelet transform to decompose the noised image into the low-frequency image part and the high-frequency parts (the horizontal, vertical, and diagonal parts), with the edge extracted and retained to avoid edge loss. Then, use the SVD to filter the noise of the high-frequency parts with image rotations and the enhancement of the directional features: to filter the diagonal part, one needs first to rotate it 45 degrees and rotate it back after filtering. Finally, reconstruct the image from the low-frequency part and the filtered high-frequency parts by the inverse wavelet transform to get the final denoising image. Experiments show the effectiveness of this method, compared with relevant methods.

scholarly journals A Singular Value Thresholding with Diagonal-Update Algorithm for Low-Rank Matrix Completion

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Yong-Hong Duan ◽  
Rui-Ping Wen ◽  
Yun Xiao
Keyword(s):  
Matrix Completion ◽  
Arithmetic Operation ◽  
Computational Cost ◽  
Singular Value ◽  
Low Rank ◽  
Simple Arithmetic ◽  
Rank Matrix ◽  
Low Rank Matrix Completion ◽  
Low Rank Matrix ◽  
Singular Value Thresholding

The singular value thresholding (SVT) algorithm plays an important role in the well-known matrix reconstruction problem, and it has many applications in computer vision and recommendation systems. In this paper, an SVT with diagonal-update (D-SVT) algorithm was put forward, which allows the algorithm to make use of simple arithmetic operation and keep the computational cost of each iteration low. The low-rank matrix would be reconstructed well. The convergence of the new algorithm was discussed in detail. Finally, the numerical experiments show the effectiveness of the new algorithm for low-rank matrix completion.

scholarly journals Through-Wall Image Enhancement Based on Singular Value Decomposition

2012 ◽  
Vol 2012 ◽  
pp. 1-20 ◽  
Author(s):  
Muhammad Mohsin Riaz ◽  
Abdul Ghafoor
Keyword(s):  
Singular Value Decomposition ◽  
Image Enhancement ◽  
Visual Inspection ◽  
Signal To Noise Ratio ◽  
Singular Values ◽  
Singular Value ◽  
Information Theoretic ◽  
Value Decomposition ◽  
Suppress Noise ◽  
Wall Imaging

Singular value decomposition and information theoretic criterion-based image enhancement is proposed for through-wall imaging. The scheme is capable of discriminating target, clutter, and noise subspaces. Information theoretic criterion is used with conventional singular value decomposition to find number of target singular values. Furthermore, wavelet transform-based denoising is performed (to further suppress noise signals) by estimating noise variance. Proposed scheme works also for extracting multiple targets in heavy cluttered through-wall images. Simulation results are compared on the basis of mean square error, peak signal to noise ratio, and visual inspection.

scholarly journals On critical points of quadratic low-rank matrix optimization problems

2020 ◽  
Vol 40 (4) ◽  
pp. 2626-2651
Author(s):  
André Uschmajew ◽  
Bart Vandereycken
Keyword(s):  
Critical Points ◽  
Optimization Problems ◽  
Quadratic Function ◽  
Singular Values ◽  
Positive Semidefinite ◽  
Optimization Methods ◽  
Low Rank ◽  
Local Minima ◽  
Rank Matrix ◽  
Low Rank Matrix

Abstract The absence of spurious local minima in certain nonconvex low-rank matrix recovery problems has been of recent interest in computer science, machine learning and compressed sensing since it explains the convergence of some low-rank optimization methods to global optima. One such example is low-rank matrix sensing under restricted isometry properties (RIPs). It can be formulated as a minimization problem for a quadratic function on the Riemannian manifold of low-rank matrices, with a positive semidefinite Riemannian Hessian that acts almost like an identity on low-rank matrices. In this work new estimates for singular values of local minima for such problems are given, which lead to improved bounds on RIP constants to ensure absence of nonoptimal local minima and sufficiently negative curvature at all other critical points. A geometric viewpoint is taken, which is inspired by the fact that the Euclidean distance function to a rank-$k$ matrix possesses no critical points on the corresponding embedded submanifold of rank-$k$ matrices except for the single global minimum.

Sign in / Sign up

Export Citation Format

Share Document