以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：25

、訪客IP：3.144.46.105

姓名	蔡承璋(Cheng-Chang Tsai)  查詢紙本館藏	畢業系所	數學系
論文名稱	一種基於稀疏字典學習的單一影像填補 (A Sparse Dictionary Learning-Based Method for Single Image Inpainting)
相關論文	★ 遲滯型細胞神經網路似駝峰行進波之研究 ★ 穩態不可壓縮那維爾-史托克問題的最小平方有限元素法之片狀線性數值解 ★ Global Exponential Stability of Modified RTD-based Two-Neuron Networks with Discrete Time Delays ★ 二維穩態不可壓縮磁流體問題的迭代最小平方有限元素法之數值計算 ★ 兩種迭代最小平方有限元素法求解不可壓縮那維爾-史托克方程組之研究 ★ 非線性耦合動力網路的同步現象分析 ★ 邊界層和內部層問題的穩定化有限元素法 ★ 數種不連續有限元素法求解對流佔優問題之數值研究 ★ 某個流固耦合問題的有限元素法數值模擬 ★ 高階投影法求解那維爾-史托克方程組 ★ 非靜態反應-對流-擴散方程的高階緊緻有限差分解法 ★ 二維非線性淺水波方程的Lax-Wendroff差分數值解 ★ Numerical Computation of a Direct-Forcing Immersed Boundary Method for Simulating the Interaction of Fluid with Moving Solid Objects ★ On Two Immersed Boundary Methods for Simulating the Dynamics of Fluid-Structure Interaction Problems ★ 生成對抗網路在影像填補的應用 ★ 非穩態複雜流體的人造壓縮性直接施力沉浸邊界法數值模擬
檔案	[Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載] 本電子論文使用權限為同意立即開放。 已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。 請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。
摘要(中)	影像填補是一種影像處理的技術，主要的目的是利用得到的資訊去填補待填補的區域。影像填補的問題已經有許多不同的處理方法，主要分為三個類別：以擴散為基礎的方法、以補丁為基礎的方法、和深度學習法。本文採用稀疏表示與字典學習的架構，這樣的架構屬於以補丁為基礎的方法，主要的優勢是能較好地填補紋理的部分，相對於深度學習法利用許多不同的影像取得填補所需的資訊，本文所採用的方法則是利用同一張影像中待填補區以外的區域所得到的資訊進行填補，所以稱為單一影像填補方法。在整個方法中，字典扮演著最關鍵的角色，然而訓練一本字典通常需要相當長的時間，這是字典學習的最大缺點。為了改善這個問題，本文提出了一個基於分治法的演算法，主要的想法是經由解決許多較小問題，從而得到本來問題的解答，藉由這個演算法可以更有效率地訓練一本字典。最後，我們進行多個數值實驗以驗證該演算法的性能。
摘要(英)	Image inpainting is a technique that fills in the pixels in a missing data region. There are many different approaches in the literature for dealing with image inpainting problems. These approaches are categorized into three classes: diffusion-based methods, patch-based methods, and deep learning methods. In this thesis, we study image inpainting based on the dictionary learning and sparse representation framework, which is a patch-based method. Such an approach generally has better image texture results. Compared to deep learning methods, which acquire information from multiple images, our framework, called single-image inpainting, trains a dictionary with the information from the same image. However, training an efficient dictionary usually takes a lot of time. Therefore, we propose an algorithm based on the divide-and-conquer concept for learning a dictionary, which is computationally more efficient. We verify the algorithm’s performance with several test problems.
關鍵字(中)	★ 影像處理 ★ 影像填補 ★ 稀疏表示 ★ 字典學習 ★ ADMM	關鍵字(英)	★ image processing ★ image inpainting ★ sparse representation ★ dictionary learning ★ ADMM
論文目次	目錄 1 前言 1 2 稀疏表示與字典學習 4 2.1 稀疏表示 4 2.2 字典學習 9 3 單一影像填補 13 3.1 像素編碼 13 3.2 影像補丁分群 14 3.3 字典建構 16 3.4 影像填補 16 4 數值實驗 18 4.1 小面積影像填補 18 4.2 大面積影像填補 21 5 結語 24 參考文獻 26
參考文獻	[1] M. Bertalmio, G. Sapiro, V. Caselles, and C. Ballester, Image inpainting, SIGGRAPH′00: Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, 2000, pp. 417-424. [2] G. Liu, F. A. Reda, K. J. Shih, T.-C. Wang, A. Tao, and B. Catanzaro, Image inpainting for irregular holes using partial convolutions, Proceedings of the European Conference on Computer Vision (ECCV), 2018, pp. 85-100. [3] D. L. Donoho, Compressed sensing, IEEE Transactions on Information Theory, 52 (2006), pp. 1289-1306. [4] S. Mukherjee and C. S. Seelamantula, A divide-and-conquer dictionary learning algorithm and its performance analysis, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2016, pp. 4712-4716. [5] A. Criminisi, P. Perez, and K. Toyama, Region filling and object removal by exemplar-based image inpainting, IEEE Transactions on Image Processing, 13 (2004), pp. 1200-1212. [6] B. K. Natarajan, Sparse approximate solutions to linear systems, SIAM Journal on Computing, 24 (1995), pp. 227-234. [7] D. L. Donoho, For most large underdetermined systems of linear equations the minimal `1-norm solution is also the sparsest solution, Communications on Pure and Applied Mathematics, 59 (2006), pp. 797-829. [8] R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society: Series B (Methodological), 58 (1996), pp. 267-288. [9] S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers, Foundations and Trends in Machine Learning, 3 (2010), pp. 1-122. [10] N. Parikh and S. Boyd, Proximal algorithms, Foundations and Trends in Machine Learning, 1 (2014), pp. 127-239. [11] Z. Zhang, Y. Xu, J. Yang, X. Li, and D. Zhang, A survey of sparse representation: algorithms and applications, IEEE Access, 3 (2015), pp. 490-530. [12] R. Rubinstein, A. M. Bruckstein, and M. Elad, Dictionaries for sparse representation modeling, Proceedings of the IEEE, Vol 98, 2010, pp. 1045-1057. [13] B. Shen, W. Hu, Y. Zhang, and Y.-J. Zhang, Image inpainting via sparse representation, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2009, pp. 697-700.
指導教授	楊肅煜	審核日期	2022-7-15
推文	facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu
網路書籤	Google bookmarks   del.icio.us   hemidemi   myshare