5 research outputs found

    Scale-aware decomposition of images based on patch-based filtering

    Get PDF
    ν•™μœ„λ…Όλ¬Έ (박사)-- μ„œμšΈλŒ€ν•™κ΅ λŒ€ν•™μ› : 전기·컴퓨터곡학뢀, 2015. 2. 쑰남읡.This dissertation presents an image decomposition algorithm based on patch-based filtering, for splitting an image into a structure layer and a texture layer. There are many applications through the decomposition because each layer can be processed respectively and appropriate manipulations are accomplished. Generally, structure layer captures coarse structure with large discontinuities and a texture layer contains fine details or proper patterns. The image decomposition is done by edge-preserving smoothing where structure layer can be obtained by applying smoothing filters to an image and then a texture layer by subtracting the filtered image from the original. The main contribution of this dissertation is to design an efficient and effective edge-preserving filter that can be adapted to various scales of images. The advantage of the proposed decomposition scheme is that it is robust to noise and can be extended to a noisy image decomposition, while conventional image decomposition methods cannot be applied to a noisy image decomposition and conventional image denoising methods are not suitable for image decomposition. To be specific, a patch-based framework is proposed in this dissertation, which is efficient in image denoising and it is designed to smooth an image while preserving details and texture. Specifically, given a pixel, the filtering output is computed as the weighted average of neighboring pixels. For computing the weights, a set of similar patches is found at each pixel by considering patch similarities based on mean squared error (MSE) and other constraints. Then, weights between each patch and its similar patches are computed respectively. With the patch weights, all the pixels in a patch are updated at the same time while adapting to the local pixel weight. For better edge-preserving smoothing, the proposed algorithm utilizes two iterations which are performed through the same smoothing filter with different parameters. Also kernel bandwidth and the number of similar patches are tuned for multi-scale image decomposition. The proposed decomposition can be applied to many applications, such as HDR tone mapping, detail enhancement, image denoising, and image coding, etc. In detail enhancement, the proposed smoothing filter is utilized to extract image detail and enhance it. In HDR tone mapping, a typical framework is used where the smoothing operator is replaced by the proposed one to reduce contrast range of a high dynamic range image to display it on low dynamic range devices. For image denoising, a noisy input is decomposed into structure/texture/noise and the noise layer is discarded while the texture layer is restored through the histogram matching. Also a novel coding scheme named as ``structure scalable image coding scheme'' is proposed where structure layer and salient texture layer are encoded for efficient image coding. Experimental results show that the proposed framework works well for image decomposition and it is robust to the presence of noise. Also it is verified that the proposed work can be utilized in many applications. In addition, by adopting the proposed method in decomposition of a noisy image, both image denoising and image enhancement can be achieved in the proposed framework. Furthermore, the proposed image coding method reduces compression artifact and improve the performance of image coding.Abstract i Contents iv List of Figures vi List of Tables xi 1 Introduction 1 1.1 Image decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Image enhancement . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3 Image denoising . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.3.1 Spatial denoising . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.3.2 Transformdomain denoising . . . . . . . . . . . . . . . . . . 9 1.3.3 benefits of combined image decomposition and image denoising 9 1.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2 Related work 17 2.1 Image decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2.1.1 Laplacian subbands . . . . . . . . . . . . . . . . . . . . . . . 17 2.2 Edge-preserving smoothing . . . . . . . . . . . . . . . . . . . . . . . 18 2.2.1 Bilateral filtering . . . . . . . . . . . . . . . . . . . . . . . . . 18 2.2.2 Nonlocal means filtering . . . . . . . . . . . . . . . . . . . . . 21 3 Scale-aware decomposition of images based on patch-based filtering 23 3.1 Edge-preserving smoothing via patch-based framework . . . . . . . . 23 3.2 Multi-scale image decomposition . . . . . . . . . . . . . . . . . . . . 26 4 Applications 31 4.1 Image enhancement . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 4.1.1 Detail enhancement . . . . . . . . . . . . . . . . . . . . . . . 31 4.1.2 HDR tone mapping . . . . . . . . . . . . . . . . . . . . . . . 36 4.2 Image denoising . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40 4.2.1 A noisy image decomposition . . . . . . . . . . . . . . . . . . 40 4.2.2 texture enhancement via histogram preservation . . . . . . . 41 4.2.3 image denoising via subband BLF . . . . . . . . . . . . . . . 44 4.2.4 Experimental results of image denoising . . . . . . . . . . . . 48 4.3 Image coding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 4.3.1 Structure scalable image coding framework . . . . . . . . . . 61 5 Conclusion 73 Bibliography 76Docto

    Development of novel infectious clones of genotype 1 hepatitis C virus

    Get PDF
    μ˜κ³ΌλŒ€ν•™/석사Background & Aims: Hepatitis C virus (HCV) research has been hampered by the inability to culture HCV isolates in vitro except for the genotype 2a JFH1. Thus, it is important to develop cell culture-infectious clones for various HCV genotypes and to study cell culture-adaptive mutations which would enable development of infectious HCV clones. Among cell culture-adaptive mutations, S2204I robustly enhances HCV RNA replication in most HCV genotypes but the relevant mechanism is still unclear. Recent studies identified four cell culture-adaptive mutations F1464L/A1672S/D2979G/ Y2981F (LSGF) that permit many HCV isolates to be further adapted in cell culture. In this study, LSGF mutations were used as the first step for developing genotype 1 infectious clones and we also investigated the effect of S2204I mutation on viral RNA replication. Method: Multiple cell culture-adaptive mutations including LSGF were introduced into genotype 1a and 1b HCV sequences. We also generated various recombinant chimeras with or without S2204I mutation. And we generated genotype 1a constructs including substitutions at position 2204 (threonine and serine) which were found in the chimpanzee-infection experiment. Huh7.5 cells were transfected with in vitro-transcribed viral RNA and HCV RNA replication was evaluated by Gaussia luciferase reporter assay. Results: LSGF mutations did not confer the RNA replication ability of H77C and H77S.3 (genotype 1a). Con1 (genotype 1b) that was introduced with multiple cell culture-adaptive mutations including LSGF showed a low RNA replication level. The RNA replication of H77S-based JFH1 chimeras in transfected cells was impaired regardless of S2204I mutation. RNA replication level of H77S.3 with either threonine or serine at position 2204 was similar to each other. Conclusion: LSGF mutations did not increase RNA replication capacities of H77C, H77S.3 and Con1. Capability of S2204I mutation in enhancing HCV RNA replication was not dependent on background genotypes. Serine and threonine at position 2204 supported HCV RNA replication similarly in in-vitro transfection experiments.ope

    Image Registration Using Image Segmentation and Mesh-based Image Transformation

    No full text
    ν•™μœ„λ…Όλ¬Έ(석사) --μ„œμšΈλŒ€ν•™κ΅ λŒ€ν•™μ› :μ „κΈ°. 컴퓨터곡학뢀,2010.2.Maste

    μžμœ¨μ£Όν–‰μžλ™μ°¨μ— λŒ€ν•œ μ†ŒλΉ„μž μ„ ν˜Έ 연ꡬ: ν˜Όν•© λ‘œμ§“ λͺ¨ν˜•μ„ μ΄μš©ν•˜μ—¬

    Get PDF
    ν•™μœ„λ…Όλ¬Έ (석사)-- μ„œμšΈλŒ€ν•™κ΅ λŒ€ν•™μ› : ν˜‘λ™κ³Όμ • κΈ°μˆ κ²½μ˜Β·κ²½μ œΒ·μ •μ±…μ „κ³΅, 2014. 8. μ΄μ’…μˆ˜.ν˜„μž¬ μžλ™μ°¨ 산업은 19μ„ΈκΈ° μ‚°μ—…ν˜λͺ…μœΌλ‘œ 인해 μžλ™μ°¨κ°€ λ“±μž₯ν•œ 이래 μƒˆλ‘œμš΄ μ‹œκΈ°μ˜ μ „ν™˜μ μ„ 맞고 μžˆλ‹€. μžλ™μ°¨ 기술과 IT 기술의 μ ‘λͺ©μ„ 톡해 이전에 μ—†λ˜ μžλ™μ°¨ μ‚°μ—…μ˜ μ‹œλŒ€κ°€ λ„λž˜ν•  κ²ƒμœΌλ‘œ μ˜ˆμƒλ˜κ³  μžˆλ‹€. IT 기술과 μžλ™μ°¨ 기술이 μ ‘λͺ©λœ 기술 쀑 ν•˜λ‚˜μΈ μžμœ¨μ£Όν–‰μžλ™μ°¨λŠ” μ•žμœΌλ‘œμžλ™μ°¨λ₯Ό λ‘˜λŸ¬μ‹Ό μ‚¬νšŒμ  ν™˜κ²½μ„ 크게 λ³€ν™”μ‹œν‚¬ 전망이닀. μžμœ¨μ£Όν–‰μžλ™μ°¨κ°€ μƒμš©ν™”κ°€ 될 경우 μš΄μ „μžμ˜ 편의λ₯Ό ν–₯μƒμ‹œν‚¬ 뿐만 μ•„λ‹ˆλΌ ꡐ톡 νš¨μœ¨μ„±μ„ 높이며, ꡐ톡사고가 κ°μ†Œν•˜λŠ” λ“±, ν˜„μž¬ μžλ™μ°¨λ‘œ μΈν•œ μ‚¬νšŒμ  λΉ„μš©μ„ 크게 κ°μ†Œμ‹œν‚¬ 수 μžˆμ„ 것이라 μ˜ˆμƒλœλ‹€. κ·ΈλŸ¬λ‚˜ μ•žμœΌλ‘œ μžμœ¨μ£Όν–‰μžλ™μ°¨κ°€ μƒμš©ν™” λ˜κΈ°μ—λŠ” λ„˜μ–΄μ•Ό ν•  μž₯벽이 λ†’λ‹€. μžμœ¨μ£Όν–‰μžλ™μ°¨ 기술의 λ°œμ „ ν˜„ν™©κ³ΌλŠ” λ³„κ°œλ‘œ μƒμš©ν™”λ₯Ό μœ„ν•œ λ„λ‘œ 및 κ΄€λ ¨ μΈν”„λΌλ‚˜ 법적인 μ œλ„ ꡬ좕이 λ―ΈλΉ„ν•˜λ©°, μžλ™μ°¨μ˜ μ‹œμŠ€ν…œ 였λ₯˜ ν™•λ₯  및 μ•ˆμ „μ„±μ— λŒ€ν•œ μž…μ¦μ΄ 아직 λΆ€μ‘±ν•˜κΈ° λ•Œλ¬Έμ΄λ‹€. μ΄λŸ¬ν•œ μ‹œμ μ—μ„œ μžμœ¨μ£Όν–‰μžλ™μ°¨μ˜ ꡬ맀에 영ν–₯을 λ―ΈμΉ˜λŠ” μš”μΈμ΄ 무엇인지에 λŒ€ν•œ λ…Όμ˜λŠ” 거의 μ—†λŠ” 싀정이닀. λ³Έ μ—°κ΅¬μ—μ„œλŠ” μ΄λŸ¬ν•œ λ¬Έμ œλ“€μ— λŒ€ν•œ 정보λ₯Ό μ œκ³΅ν•˜κΈ° μœ„ν•΄ ν˜Όν•© λ‘œμ§“ λͺ¨ν˜•(Mixed Logit Model)을 μ΄μš©ν•˜μ—¬ μžμœ¨μ£Όν–‰μžλ™μ°¨μ— λŒ€ν•œ μ†ŒλΉ„μžμ˜ μ„ ν˜Έλ₯Ό λΆ„μ„ν•˜κ³ μž ν•œλ‹€. μ†ŒλΉ„μžλ“€μ˜ μžμœ¨μ£Όν–‰μžλ™μ°¨μ˜ ꡬ맀에 영ν–₯을 λ―ΈμΉ˜λŠ” μš”μΈλ“€μ— λŒ€ν•΄ λ…Όμ˜ν•˜λ©°, ν–₯ν›„ μ†ŒλΉ„μžλ“€μ˜ μžμœ¨μ£Όν–‰μžλ™μ°¨ 선택이 μžμœ¨μ£Όν–‰μžλ™μ°¨λ₯Ό κ΅¬μ„±ν•˜λŠ” 속성 변화에 따라 μ–΄λ–»κ²Œ λ³€ν™”ν•˜λŠ”μ§€λ₯Ό λΆ„μ„ν•˜κ³ μž ν•œλ‹€.제 1μž₯ μ„œλ‘  제 2μž₯ 이둠적 λ°°κ²½ 및 μ„ ν–‰ 연ꡬ 2.1 μžλ™μ°¨μ— λŒ€ν•œ μ†ŒλΉ„μž μ„ ν˜Έ 뢄석 연ꡬ 2.2 λŒ€μ²΄μ—°λ£Œμžλ™μ°¨μ— λŒ€ν•œ μˆ˜μš” 예츑 연ꡬ 2.3 λ³Έ μ—°κ΅¬μ˜ 의의 제 3μž₯ 연ꡬ λͺ¨ν˜• 및 방법둠 3.1 연ꡬ 섀계 3.2 싀증 λͺ¨ν˜• 제 4μž₯ 싀증 뢄석 4.1 자료의 ꡬ성 4.2 μΆ”μ •κ²°κ³Ό 및 결과뢄석 4.2.1 μΆ”μ • κ²°κ³Ό 4.2.2 μƒλŒ€μ  μ€‘μš”λ„ 4.2.3 ν•œκ³„μ§€λΆˆμ˜μ‚¬μ•‘ 4.2.4 직접탄λ ₯μ„± 4.2.5 민감도 뢄석 4.2.6 μžμœ¨μ£Όν–‰μžλ™μ°¨ 인프라 μž¬μ› 마련 λ°©μ•ˆ 뢄석 제 5μž₯ κ²°λ‘  및 μ‹œμ‚¬μ  μ°Έκ³ λ¬Έν—Œ 뢀둝: 섀문지Maste
    corecore