Fast global image smoothing based on weighted least squares

Dongbo Min, Sunghwan Choi, Jiangbo Lu, Bumsub Ham, Kwanghoon Sohn, Minh N. Do

Research output: Contribution to journalArticle

142 Citations (Scopus)

Abstract

This paper presents an efficient technique for performing a spatially inhomogeneous edge-preserving image smoothing, called fast global smoother. Focusing on sparse Laplacian matrices consisting of a data term and a prior term (typically defined using four or eight neighbors for 2D image), our approach efficiently solves such global objective functions. In particular, we approximate the solution of the memory- and computation-intensive large linear system, defined over a d-dimensional spatial domain, by solving a sequence of 1D subsystems. Our separable implementation enables applying a linear-time tridiagonal matrix algorithm to solve d three-point Laplacian matrices iteratively. Our approach combines the best of two paradigms, i.e., efficient edge-preserving filters and optimization-based smoothing. Our method has a comparable runtime to the fast edge-preserving filters, but its global optimization formulation overcomes many limitations of the local filtering approaches. Our method also achieves high-quality results as the state-of-the-art optimization-based techniques, but runs ∼10-30 times faster. Besides, considering the flexibility in defining an objective function, we further propose generalized fast algorithms that perform Lγ norm smoothing ( 0<γ <2) and support an aggregated (robust) data term for handling imprecise data constraints. We demonstrate the effectiveness and efficiency of our techniques in a range of image processing and computer graphics applications.

Original languageEnglish
Article number6942220
Pages (from-to)5638-5653
Number of pages16
JournalIEEE Transactions on Image Processing
Volume23
Issue number12
DOIs
Publication statusPublished - 2014 Dec 1

Fingerprint

Data handling
Global optimization
Computer graphics
Linear systems
Image processing
Data storage equipment

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Graphics and Computer-Aided Design

Cite this

Min, Dongbo ; Choi, Sunghwan ; Lu, Jiangbo ; Ham, Bumsub ; Sohn, Kwanghoon ; Do, Minh N. / Fast global image smoothing based on weighted least squares. In: IEEE Transactions on Image Processing. 2014 ; Vol. 23, No. 12. pp. 5638-5653.
@article{cef66391759b43cebe36c2f78c02398a,
title = "Fast global image smoothing based on weighted least squares",
abstract = "This paper presents an efficient technique for performing a spatially inhomogeneous edge-preserving image smoothing, called fast global smoother. Focusing on sparse Laplacian matrices consisting of a data term and a prior term (typically defined using four or eight neighbors for 2D image), our approach efficiently solves such global objective functions. In particular, we approximate the solution of the memory- and computation-intensive large linear system, defined over a d-dimensional spatial domain, by solving a sequence of 1D subsystems. Our separable implementation enables applying a linear-time tridiagonal matrix algorithm to solve d three-point Laplacian matrices iteratively. Our approach combines the best of two paradigms, i.e., efficient edge-preserving filters and optimization-based smoothing. Our method has a comparable runtime to the fast edge-preserving filters, but its global optimization formulation overcomes many limitations of the local filtering approaches. Our method also achieves high-quality results as the state-of-the-art optimization-based techniques, but runs ∼10-30 times faster. Besides, considering the flexibility in defining an objective function, we further propose generalized fast algorithms that perform Lγ norm smoothing ( 0<γ <2) and support an aggregated (robust) data term for handling imprecise data constraints. We demonstrate the effectiveness and efficiency of our techniques in a range of image processing and computer graphics applications.",
author = "Dongbo Min and Sunghwan Choi and Jiangbo Lu and Bumsub Ham and Kwanghoon Sohn and Do, {Minh N.}",
year = "2014",
month = "12",
day = "1",
doi = "10.1109/TIP.2014.2366600",
language = "English",
volume = "23",
pages = "5638--5653",
journal = "IEEE Transactions on Image Processing",
issn = "1057-7149",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

Fast global image smoothing based on weighted least squares. / Min, Dongbo; Choi, Sunghwan; Lu, Jiangbo; Ham, Bumsub; Sohn, Kwanghoon; Do, Minh N.

In: IEEE Transactions on Image Processing, Vol. 23, No. 12, 6942220, 01.12.2014, p. 5638-5653.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Fast global image smoothing based on weighted least squares

AU - Min, Dongbo

AU - Choi, Sunghwan

AU - Lu, Jiangbo

AU - Ham, Bumsub

AU - Sohn, Kwanghoon

AU - Do, Minh N.

PY - 2014/12/1

Y1 - 2014/12/1

N2 - This paper presents an efficient technique for performing a spatially inhomogeneous edge-preserving image smoothing, called fast global smoother. Focusing on sparse Laplacian matrices consisting of a data term and a prior term (typically defined using four or eight neighbors for 2D image), our approach efficiently solves such global objective functions. In particular, we approximate the solution of the memory- and computation-intensive large linear system, defined over a d-dimensional spatial domain, by solving a sequence of 1D subsystems. Our separable implementation enables applying a linear-time tridiagonal matrix algorithm to solve d three-point Laplacian matrices iteratively. Our approach combines the best of two paradigms, i.e., efficient edge-preserving filters and optimization-based smoothing. Our method has a comparable runtime to the fast edge-preserving filters, but its global optimization formulation overcomes many limitations of the local filtering approaches. Our method also achieves high-quality results as the state-of-the-art optimization-based techniques, but runs ∼10-30 times faster. Besides, considering the flexibility in defining an objective function, we further propose generalized fast algorithms that perform Lγ norm smoothing ( 0<γ <2) and support an aggregated (robust) data term for handling imprecise data constraints. We demonstrate the effectiveness and efficiency of our techniques in a range of image processing and computer graphics applications.

AB - This paper presents an efficient technique for performing a spatially inhomogeneous edge-preserving image smoothing, called fast global smoother. Focusing on sparse Laplacian matrices consisting of a data term and a prior term (typically defined using four or eight neighbors for 2D image), our approach efficiently solves such global objective functions. In particular, we approximate the solution of the memory- and computation-intensive large linear system, defined over a d-dimensional spatial domain, by solving a sequence of 1D subsystems. Our separable implementation enables applying a linear-time tridiagonal matrix algorithm to solve d three-point Laplacian matrices iteratively. Our approach combines the best of two paradigms, i.e., efficient edge-preserving filters and optimization-based smoothing. Our method has a comparable runtime to the fast edge-preserving filters, but its global optimization formulation overcomes many limitations of the local filtering approaches. Our method also achieves high-quality results as the state-of-the-art optimization-based techniques, but runs ∼10-30 times faster. Besides, considering the flexibility in defining an objective function, we further propose generalized fast algorithms that perform Lγ norm smoothing ( 0<γ <2) and support an aggregated (robust) data term for handling imprecise data constraints. We demonstrate the effectiveness and efficiency of our techniques in a range of image processing and computer graphics applications.

UR - http://www.scopus.com/inward/record.url?scp=84913537051&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84913537051&partnerID=8YFLogxK

U2 - 10.1109/TIP.2014.2366600

DO - 10.1109/TIP.2014.2366600

M3 - Article

AN - SCOPUS:84913537051

VL - 23

SP - 5638

EP - 5653

JO - IEEE Transactions on Image Processing

JF - IEEE Transactions on Image Processing

SN - 1057-7149

IS - 12

M1 - 6942220

ER -