Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 민동보 | * |
dc.date.accessioned | 2019-11-19T16:30:23Z | - |
dc.date.available | 2019-11-19T16:30:23Z | - |
dc.date.issued | 2017 | * |
dc.identifier.issn | 1057-7149 | * |
dc.identifier.issn | 1941-0042 | * |
dc.identifier.other | OAK-25970 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/251902 | - |
dc.description.abstract | Edge-preserving smoothing (EPS) can be formulated as minimizing an objective function that consists of data and regularization terms. At the price of high-computational cost, this global EPS approach is more robust and versatile than a local one that typically has a form of weighted averaging. In this paper, we introduce an efficient decomposition-based method for global EPS that minimizes the objective function of L-2 data and (possibly non-smooth and non-convex) regularization terms in linear time. Different from previous decomposition-based methods, which require solving a large linear system, our approach solves an equivalent constrained optimization problem, resulting in a sequence of 1-D sub-problems. This enables applying fast linear time solver for weighted-least squares and -L-1 smoothing problems. An alternating direction method of multipliers algorithm is adopted to guarantee fast convergence. Our method is fully parallelizable, and its runtime is even comparable to the state-of-the-art local EPS approaches. We also propose a family of fast majorization-minimization algorithms that minimize an objective with non-convex regularization terms. Experimental results demonstrate the effectiveness and flexibility of our approach in a range of image processing and computational photography applications. | * |
dc.language | English | * |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | * |
dc.subject | Edge-preserving image smoothing | * |
dc.subject | joint image filtering | * |
dc.subject | weighted-least squares | * |
dc.subject | alternating minimization | * |
dc.subject | majorization-minimization algorithm | * |
dc.title | Fast Domain Decomposition for Global Image Smoothing | * |
dc.type | Article | * |
dc.relation.issue | 8 | * |
dc.relation.volume | 26 | * |
dc.relation.index | SCIE | * |
dc.relation.index | SCOPUS | * |
dc.relation.startpage | 4079 | * |
dc.relation.lastpage | 4091 | * |
dc.relation.journaltitle | IEEE TRANSACTIONS ON IMAGE PROCESSING | * |
dc.identifier.doi | 10.1109/TIP.2017.2710621 | * |
dc.identifier.wosid | WOS:000404286300007 | * |
dc.author.google | Kim, Youngjung | * |
dc.author.google | Min, Dongbo | * |
dc.author.google | Ham, Bumsub | * |
dc.author.google | Sohn, Kwanghoon | * |
dc.contributor.scopusid | 민동보(7201669172) | * |
dc.date.modifydate | 20240322133757 | * |