DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Lee, Chang-Ock | - |
dc.contributor.advisor | 이창옥 | - |
dc.contributor.author | Hong, Chan-Pyo | - |
dc.contributor.author | 홍찬표 | - |
dc.date.accessioned | 2011-12-14T04:56:59Z | - |
dc.date.available | 2011-12-14T04:56:59Z | - |
dc.date.issued | 2010 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=455183&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/42233 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 수리과학과, 2010.08, [ v, 20 p. ] | - |
dc.description.abstract | Image deblurring problems are often solved by finding minimizer of a suitable objective function. However, in practice, there are constraints in the minimization process. In this thesis, we consider an image deblurring model and discuss several optimization methods for the box-constrained minimization problems. Furthermore, we compare the complexity of them. Among them, a new gradient based approach, ISTA, is noteworthy. However, gradient based algorithms are known to converge quite slowly. Hence we present a two-step algorithm, FISTA, which preserves the computational simplicity of ISTA, but global convergence rate is significantly better. Numerical experiments for each methods are also included. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | constrained optimization | - |
dc.subject | least squares algorithm | - |
dc.subject | image deblurring | - |
dc.subject | ISTA | - |
dc.subject | 최적화 | - |
dc.subject | 최소자승법 | - |
dc.subject | 영상번짐제거 | - |
dc.subject | FISTA | - |
dc.title | Least Squares Algorithms for Box-Constrained Image Deblurring | - |
dc.title.alternative | 구간 제약조건이 있는 영상번짐제거 문제의 최소자승 알고리듬 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 455183/325007 | - |
dc.description.department | 한국과학기술원 : 수리과학과, | - |
dc.identifier.uid | 020084149 | - |
dc.contributor.localauthor | Lee, Chang-Ock | - |
dc.contributor.localauthor | 이창옥 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.