3 research outputs found

    컀널에 μ˜ν•œ λΉ„κ·Όμ ‘ λΆ€λΆ„μ˜μƒκ³Ό μ €μ°¨μˆ˜ μ˜μƒμ„ μ΄μš©ν•œ μ˜μƒ μ„ λͺ…ν™” 기법

    Get PDF
    ν•™μœ„λ…Όλ¬Έ (박사)-- μ„œμšΈλŒ€ν•™κ΅ λŒ€ν•™μ› : 전기·컴퓨터곡학뢀, 2016. 2. μœ μ„μΈ.Blind image deblurring aims to restore a high-quality image from a blurry image. Blind image deblurring has gained considerable attention in recent years because it involves many challenges in problem formulation, regularization, and optimization. In optimization perspective, blind image deblurring is a severely ill-posed inverse problemtherefore, effective regularizations are required in order to obtain a high-quality latent image from a single blurred one. In this paper, we propose nonlocal regularizations to improve blind image deblurring. First, we propose to use the nonlocal patches selected by similarity weighted by the kernel for the next blur-kernel estimation. Using these kernel-guided nonlocal patches, we impose regularization that nonlocal patches would produce the similar values by convolution. Imposing this regularization improves the kernel estimation. Second, we propose to use a nonlocal low-rank image obtained from the composition of nonlocal similar patches. Using this nonlocal low-rank image, we impose regularization that the latent image is similar to this nonlocal low-rank image. A nonlocal low-rank image contains less noise by its intrinsic property. Imposing this regularization improves the estimation of the latent image with less noise. We evaluated our method quantitatively and qualitatively by comparing several conventional blind deblurring methods. For the quantitative evaluation, we computed the sum of squared error, peak signal-to-noise ratio, and structural similarity index. For blurry images without noise, our method was generally superior to the other methods. Especially, the results of ours were sharper on structures and smoother on flat regions. For blurry and noisy images, our method highly outperformed the conventional methods. Most of other methods could not successfully estimate the blur-kernel, and the image blur was not removed. On the other hand, our method successfully estimate the blur-kernel by overcoming the noise and restored a high-quality of deblurred image with less noise.Chapter 1 Introduction 1 1.1 Formulation of the Blind Image Deblurring 2 1.2 Approach 4 1.2.1 The Use of Kernel-guided Nonlocal Patches 4 1.2.2 The Use of Nonlocal Low-rank Images 5 1.3 Overview 5 Chapter 2 Related Works 6 2.1 Natural Image Prior 7 2.1.1 Scale Mixture of Gaussians 8 2.1.2 Hyper-Laplacian Distribution 8 2.2 Avoiding No-blur Solution 10 2.2.1 Marginalization over Possible Images 11 2.2.2 Normalization of l1 by l2 13 2.2.3 Alternating I and k Approach 15 2.3 Sparse Representation 17 2.4 Using Sharp Edges 19 2.5 Handling Noise 20 Chapter 3 Preliminary: Optimization 24 3.1 Iterative Reweighted Least Squares (IRLS) 25 3.1.1 Least Squared Error Approximation 26 3.1.2 Weighted Least Squared Error Approximation 26 3.1.3 The lp Norm Approximation of Overdetermined System 27 3.1.4 The lp Norm Approximation of Underdetermined System 28 3.2 Optimization using Conjugacy 29 3.2.1 The Conjugate Direction Method 30 3.2.2 The Conjugate Gradient Method 33 3.3 The Singular Value Thresholding Algorithm 36 Chapter 4 Extracting Salient Structures 39 4.1 Structure-Texture Decomposition with Uniform Edge Map 39 4.2 Structure-Texture Decomposition with Adaptive Edge Map 41 4.3 Enhancing Structures and Producing Salient Edges 43 4.4 Analysis on the Method of Extracting Salient Edges 44 Chapter 5 Blind Image Deblurring using Nonlocal Patches 46 5.1 Estimating a Blur-kernel using Kernel-guided Nonlocal Patches 47 5.1.1 Sparse Prior 48 5.1.2 Continuous Prior 48 5.1.3 Nonlocal Prior by Kernel-guided Nonlocal Patches 49 5.2 Estimating an Interim Image using Nonlocal Low-rank Images 52 5.2.1 Nonlocal Low-rank Prior 52 5.3 Multiscale Implementation 55 5.4 Latent Image Estimation 56 Chapter 6 Experimental Results 58 6.1 Images with Ground Truth 61 6.2 Images without Ground Truth 105 6.3 Analysis on Preprocessing using Denoising 111 6.4 Analysis on the Size of Nonlocal Patches 121 6.5 Time Performance 125 Chapter 7 Conclusion 126 Bibliography 129 μš”μ•½ 140Docto
    corecore