Search

Patch level-based noise level estimation (NLE) is often inaccurate and inefficient because of the harsh criteria required to select a small number of homogeneous patches. In this paper, a fast image NLE method based on a global search for similar pixels is proposed to solve the above problem. Specifically, the mean square distance (MSD) is first expressed in the form of the standard deviation (std) and mean value of image patches. Afterward, the two values, std and mean, are calculated and stored in advance. Then, a 2D statistical histogram and summed area table are adopted to speed up the search for similar patches. Further, the most similar pixels are selected from similar patches to obtain an initial estimation. Finally, we correct the deviation of the initial estimation by re-injecting noise for secondary estimation. Experimental results show that the proposed method outperforms the state-of-the-art techniques in fast NLE and guided denoising. [ABSTRACT FROM AUTHOR]

Graph regularized nonnegative matrix factorization (GNMF) has been widely used in data representation due to its excellent dimensionality reduction. When it comes to clustering polluted data, GNMF inevitably learns inaccurate representations, leading to models that are unusually sensitive to outliers in the data. For example, in a face dataset, obscured by items such as a mask or glasses, there is a high probability that the graph regularization term incorrectly describes the association relationship for that sample, resulting in an incorrect elicitation in the matrix factorization process. In this article, a novel self-initiated unsupervised subspace learning method named robust nonnegative matrix factorization with self-initiated multigraph contrastive fusion (RNMF-SMGF) is proposed. RNMF-SMGF is capable of creating samples with different angles and learning different graph structures based on these different angles in a self-initiated method without changing the original data. In the process of subspace learning guided by graph regularization, these different graph structures are fused into a more accurate graph structure, along with entropy regularization, L 2,1/2 -norm constraints to facilitate the robust learning of the proposed model and the formation of different clusters in the low-dimensional space. To demonstrate the effectiveness of the proposed model in robust clustering, we have conducted extensive experiments on several benchmark datasets and demonstrated the effectiveness of the proposed method. The source code is available at: https://github.com/LstinWh/RNMF-SMGF/.