The augmented lagrange multipliers method for matrix completion from corrupted samplings with application to mixed Gaussian-impulse noise removal.

This paper presents a novel denoising scheme for video sequences corrupted by mixed Gaussian-impulse noise. From a global viewpoint, such a video sequence contains three parts: temporal-spatially correlated video content, uncorrelated dense Gaussian noise, and uncorrelated sparse impulse noise. This fact motivates us to formulate the mixed Gaussian-impulse noise removal task as a temporal-spatial decomposition problem, which amounts to a convex program. A two-stage algorithm is developed to solve this problem efficiently. Effectiveness of the proposed algorithm on mixed Gaussian-impulse noise removal is validated through experiments. The results are satisfactory in both visual quality and PSNR values, while very few prior knowledge of noise statistic is required compared to most state-of-the-art methods.

The motivation of this paper is to introduce a novel framework for the restoration of images corrupted by mixed Gaussian-impulse noise. To this aim, first, an adaptive curvelet thresholding criterion is proposed which tries to adaptively remove the perturbations appeared during denoising process. Then, a new statistical regularization term, called joint adaptive statistical prior (JASP), is established which enforces both the local and nonlocal statistical consistencies, simultaneously, in a unified manner. Furthermore, a novel technique for mixed Gaussian plus impulse noise removal using JASP in a variational scheme is developed--we refer to it as De-JASP. To efficiently solve the above variational scheme, an efficient alternating minimization algorithm based on split Bregman iterative framework is developed. Extensive experimental results manifest the effectiveness of the proposed method comparing with the current state-of-the-art methods in mixed Gaussian-impulse noise removal.

Hyperspectral image denoising using constraint smooth rank approximation and weighted enhance 3DTV

Summary Contamination of seismic data by background noise causes difficulties for the following inversion, imaging, stratigraphic interpretation, etc. Desert seismic records pose a particular problem because of the strong energy of desert random noise and its serious spectrum overlapping with effective signals. Thus, the robust principle component analysis (RPCA) is introduced into the denoising of desert seismic data. RPCA is a classical method of low-rank matrix recovery. By kernel norm optimization, it can decompose noisy data into optimal low-rank matrix (LM) and sparse matrix (SM) which contain most effective signals and noise, respectively. However, due to the low signal-to-noise ratio and serious spectrum overlapping of desert seismic record, there are still a lot of random noise in its optimal LM. Therefore, the convolutional neural network (CNN) is combined with RPCA to establish the optimal mapping relationship from noisy LM to desert random noise through the training of CNN, so as to accurately predict desert random noise from the LM of desert seismic record. Finally, the denoising result is obtained by subtracting the desert random noise predicted by CNN from the LM. Experiments show that this improved RPCA can suppress random noise and recover effective signal more effectively than the traditional methods.

Digital signals are often contaminated by noise during signal acquisition and transmission for sewage sensing signal treatment such as aeration volume, oxygen content and water transparency etc. Sometimes, noise is a mixed one of gaussian noise and impulse noise. Unfortunately, existing denoising algorithms are often designed for removing single gaussian noise or impulse noise. In this paper, an efficient algorithm for mixed noise removal in signal is proposed, including space impulse noise removal and wavelet Gaussian noise removal. An impulse noise detection algorithm based on median filter is given to filter impulse signal, also a lifting wavelet was constructed by lifting original wavelet. The threshold based on lifting wavelet transform for signal was applied to denoising gaussian noise. Simulations are conducted on the presented algorithm, and the simulation result shows that this algorithm can remove mixed Gaussian and impulse noise in signal efficiently.

Defect inspection for TFT-LCD images based on the low-rank matrix reconstruction

Hyperspectral images (HSIs) have a wealth of applications in many areas, due to their fine spectral discrimination ability. However, in the practical imaging process, HSIs are often degraded by a mixture of various types of noise, for example, Gaussian noise, impulse noise, dead pixels, dead lines, and stripe noise. Low-rank matrix decomposition theory has been widely used in HSI denoising, and has achieved competitive results by modeling the impulse noise, dead pixels, dead lines, and stripe noise as sparse components. However, the existing low-rank-based methods for HSI denoising cannot completely remove stripe noise when the stripe noise is no longer sparse. In this article, we extend the HSI observation model and propose a double low-rank (DLR) matrix decomposition method for HSI denoising and destriping. By simultaneously exploring the low-rank characteristic of the lexicographically ordered noise-free HSI and the low-rank structure of the stripe noise on each band of the HSI, the two low-rank constraints are formulated into one unified framework, to achieve separation of the noise-free HSI, stripe noise, and other mixed noise. The proposed DLR model is then solved by the augmented Lagrange multiplier (ALM) algorithm efficiently. Both simulation and real HSI data experiments were carried out to verify the superiority of the proposed DLR method.

In this paper, we propose an efficient singing voice extraction method from a music sound consisting of a singing voice and a drum sound. The proposed method is based on robust principal component analysis (RPCA) which is a technique to separate a given matrix into a sparse matrix and a low rank matrix. Dealing with a spectrogram of the music sound as the given matrix, RPCA gives an extracted singing voice spectrogram as a sparse spectrogram. We improve the capability of RPCA method by removing a residual drum sound from the sparse spectrogram. The residual drum sound is estimated as spectral components which repeatedly arise in the sparse spectrogram. Removing the estimated residual drum sound spectrogram from the sparse spectrogram gives an improved singing voice spectrogram. Simulation results show that the proposed method can improve 10dB of GNSDR as compared with the conventional RPCA singing voice extraction method.

Due to the severe interference of background noise, the signal-to-noise ratio of desert seismic data is extremely low. In addition, due to low-frequency characteristics of sand in the Tarim desert region, the background noise in desert seismic data is mainly distributed in low-frequency band, so that the frequency spectrum aliasing of effective signals and background noise is more serious than the general land seismic data. Thus, conventional filtering methods cannot effectively suppress background noise in desert seismic data and recover effective signals. In order to overcome the problem that low-frequency background noise in desert seismic data is hard to suppress, a new method called R-TNRD based on robust principal component analysis (RPCA) algorithm and trainable nonlinear reaction diffusion (TNRD) network is proposed in this paper. By using the good sparsity of RPCA, the input noisy desert seismic data are decomposed into a low-rank matrix and a sparse matrix, and these two matrices contain background noise and effective signals. Due to the serious spectrum aliasing of desert seismic data, conventional thresholds have been unable to extract effective signals from the two matrices obtained by RPCA effectively. Therefore, we introduce TNRD network into desert seismic data denoising. By network training with a low-frequency noise set, the optimisation of TNRD network can be achieved, so as to accurately extract the effective signals from the low-rank matrix and the sparse matrix. In the experimental part, we test the performance of R-TNRD on both synthetic and real seismic data. The results demonstrate that the proposed method can suppress background noise more effectively than conventional methods.

Infrared images are susceptible to interference from a variety of factors during acquisition and transmission, resulting in the inclusion of mixed noise, which seriously affects the accuracy of subsequent vision tasks. To solve this problem, we designed a mixed noise removal algorithm for infrared images based on improved CycleGAN. First, we proposed a ResNet-E Block that incorporates the EMA (Efficient Multi-Scale Attention Module) and build a generator based on it using the skip-connection structure to improve the network’s ability to remove mixed noise of different strengths. Second, we added the PSNR (Peak Signal-to-Noise Ratio) as an extra calculation item of cycle consistency loss, so that the network can effectively retain the detailed information of infrared images while denoising. Finally, we conducted experimental validation on both synthetic noisy images and real noisy images, which proved that our algorithm can effectively remove the mixed noise in infrared images and the denoising effect is better than other similar methods.

Recovering a low-rank matrix from some of its linear measurements is a popular problem in many areas of science and engineering. One special case of it is the matrix completion problem, where we need to reconstruct a low-rank matrix from incomplete samples of its entries. A lot of efficient algorithms have been proposed to solve this problem and they perform well when Gaussian noise with a small variance is added to the given data. But they can not deal with the sparse random-valued noise in the measurements. In this paper, we propose a robust method for recovering the low-rank matrix with adaptive outlier pursuit when part of the measurements are damaged by outliers. This method will detect the positions where the data is completely ruined and recover the matrix using correct measurements. Numerical experiments show the accuracy of noise detection and high performance of matrix completion for our algorithms compared with other algorithms.

We consider the problem of noisy matrix completion, in which the goal is to reconstruct a structured matrix whose entries are partially observed in noise. Standard approaches to this underdetermined inverse problem are based on assuming that the underlying matrix has low rank, or is well-approximated by a low rank matrix. In this paper, we first identify how the classical non-negative rank model enforces restrictions that may be undesirable in practice. We propose a richer model based on what we term the “permutation-rank” of a matrix and show how the restrictions due to classical low rank assumptions can be avoided by using the richer permutation-rank model. We establish information-theoretic lower bounds on the rates of estimation, and design an estimator which we prove is simultaneously optimal (up to logarithmic factors) for both the permutation-rank and the low-rank models. Our results thus show that the proposed permutation-rank model and estimator enjoy a surprising win-win in terms of the statistical bias-variance tradeoff as compared to the classical low-rank models. An extended version of this paper is available on arXiv [1].

In recent years, the sparse coding-based techniques have been widely used for image denoising. However, most of the sparse coding-based mixed noise reduction methods fail to take full advantage of the geometric structure of data samples. In other words, they neglect the common information shared by the similar patches in sparse coding. To address this concern, in this paper, we propose a robust constrained sparse representation (RCSR) method to remove mixed noise. By using the center coefficient of similar patches as the guider which is approximated by the coefficient of query patch in sparse coding, the geometric structure of data can be well preserved. Moreover, different from most existing two-stage mixed noise reduction methods that use explicit detectors to restrain impulse noise, the proposed RCSR adaptively adjusts the contribution of each pixel in the loss function to eliminate the influences of outliers. Experiments on the reconstruction of synthetic data and the removal of mixed noise in real images demonstrate the effectiveness of our proposed method.

Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a novel approach to the colorization problem by formulating it as a matrix completion problem. In particular, taking a monochrome image and parts of the color pixels (labels) as inputs, we develop a robust colorization model and resort to an augmented Lagrange multiplier algorithm for solving the model. Our approach is based on the fact that a matrix can be represented as a low-rank matrix plus a sparse matrix. Our approach is effective because it is able to handle the potential noises in the monochrome image and outliers in the labels. To improve the performance of our method, we further incorporate a so-called local-color-consistency idea into our method. Empirical results on real data sets are encouraging.

Video background recovery is a very important task in computer vision applications. Recent research offers robust principal component analysis (RPCA) as a promising approach for solving video background recovery. RPCA works by decomposing a data matrix into a low-rank matrix and a sparse matrix. Our previous work shows that when the desired rank of the low-rank matrix is known, fixing the rank in the algorithm called FrALM (fixed-rank ALM) yields more robust and accurate results than existing RPCA algorithms. However, application of RPCA to video background recovery requires that each frame in the video is encoded as a column in the data matrix. This is impractical in real applications because the videos can be easily larger than the amount of memory in a computer. This paper presents an algorithm called iFrALM (incremental fixed-rank ALM) that computes fixed-rank RPCA incrementally by splitting the video frames into an initial batch and an incremental batch. Comprehensive tests show that iFrALM uses less memory and time compared to FrALM. Moreover, the initial batch size and batch quality can be carefully selected to ensure that iFrALM reduces memory and time complexity without sacrificing accuracy.KeywordsBackground recoveryIncremental SVDFixed-rank robust PCA