In this paper, we show how to harness both low-rank and sparse structures in regular or near-regular textures for image completion. Our method is based on a unified formulation for both random and contiguous corruptio...In this paper, we show how to harness both low-rank and sparse structures in regular or near-regular textures for image completion. Our method is based on a unified formulation for both random and contiguous corruption. In addition to the low rank property of texture, the algorithm also uses the sparse assumption of the natural image： because the natural image is pieeewise smooth, it is sparse in certain transformed domain （such as Fourier or wavelet transform）. We combine low-rank and sparsity properties of the texture image together in the proposed algorithm. Our algorithm based on convex optimization can automatically and correctly repair the global structure of a corrupted texture, even without precise information about the regions to be completed. This algorithm integrates texture rectification and repairing into one optimization problem. Through extensive simulations, we show our method can complete and repair textures corrupted by errors with both random and contiguous supports better than existing low-rank matrix recovery methods. Our method demonstrates significant advantage over local patch based texture synthesis techniques in dealing with large corruption, non-uniform texture, and large perspective deformation.展开更多
This paper introduces a new low rank texture image denoising algorithm, which can restore low rank texture contaminated by both Gaussian and salt-and-pepper noise. The algorithm formulates texture image denoising in t...This paper introduces a new low rank texture image denoising algorithm, which can restore low rank texture contaminated by both Gaussian and salt-and-pepper noise. The algorithm formulates texture image denoising in terms of solving a low rank matrix optimization problem. Simply assuming low rank is insufficient to describe the properties of natural images, causing high noise amplitudes which lead to unsatisfactory denoising results or serious loss of image details. Thus, in addition to the low rank assumption,the continuity of natural images is also assumed by the algorithm, by adding a total variation regularizer to the optimization objective function. We further give an effective algorithm to solve this optimization problem. By combining the low rank and continuity assumptions, the proposed algorithm overcomes the deficiencies of using either the low rank assumption or total variation regularization alone. Experiments show that our algorithm can effectively remove mixed noise in low rank texture images, and is better than existing algorithms in both its subjective visual effects and in terms of quantitative objective measures.展开更多
文摘In this paper, we show how to harness both low-rank and sparse structures in regular or near-regular textures for image completion. Our method is based on a unified formulation for both random and contiguous corruption. In addition to the low rank property of texture, the algorithm also uses the sparse assumption of the natural image： because the natural image is pieeewise smooth, it is sparse in certain transformed domain （such as Fourier or wavelet transform）. We combine low-rank and sparsity properties of the texture image together in the proposed algorithm. Our algorithm based on convex optimization can automatically and correctly repair the global structure of a corrupted texture, even without precise information about the regions to be completed. This algorithm integrates texture rectification and repairing into one optimization problem. Through extensive simulations, we show our method can complete and repair textures corrupted by errors with both random and contiguous supports better than existing low-rank matrix recovery methods. Our method demonstrates significant advantage over local patch based texture synthesis techniques in dealing with large corruption, non-uniform texture, and large perspective deformation.
文摘This paper introduces a new low rank texture image denoising algorithm, which can restore low rank texture contaminated by both Gaussian and salt-and-pepper noise. The algorithm formulates texture image denoising in terms of solving a low rank matrix optimization problem. Simply assuming low rank is insufficient to describe the properties of natural images, causing high noise amplitudes which lead to unsatisfactory denoising results or serious loss of image details. Thus, in addition to the low rank assumption,the continuity of natural images is also assumed by the algorithm, by adding a total variation regularizer to the optimization objective function. We further give an effective algorithm to solve this optimization problem. By combining the low rank and continuity assumptions, the proposed algorithm overcomes the deficiencies of using either the low rank assumption or total variation regularization alone. Experiments show that our algorithm can effectively remove mixed noise in low rank texture images, and is better than existing algorithms in both its subjective visual effects and in terms of quantitative objective measures.
