(A) study on the domain decomposition methods for the total variation minimization = 총변이 최소화 문제에 대한 영역분할법에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 320
  • Download : 0
We propose nonoverlapping domain decomposition methods for solving total variation minimization problem. We decompose the domain of the dual problem into nonoverlapping rectangular subdomains, in which the local total variation problems are solved. We change the local dual problems into the equivalent primal form which reproduces the original problem at small dimension. Sequential and parallel algorithms are presented. The convergence of both algorithms is analyzed and numerical results are presented.
Advisors
Lee, Chang-Ockresearcher이창옥researcher
Description
한국과학기술원 :수리과학과,
Publisher
한국과학기술원
Issue Date
2016
Identifier
325007
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 수리과학과, 2016.2 ,[iv, 31 p. :]

Keywords

Total Variation; Domain Decomposition; Parallel Computation; Image Processing; Convex Optimization; 총변이; 영역분할법; 병렬계산; 영상처리; 최적화문제

URI
http://hdl.handle.net/10203/222195
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=648180&flag=dissertation
Appears in Collection
MA-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0