O(1) transposed bilateral filtering for optimization

Kenjiro Sugimoto; Keiichiro Shirai; Seiichiro Kamata

doi:10.1109/APSIPA.2014.7041763

O(1) transposed bilateral filtering for optimization

Kenjiro Sugimoto, Keiichiro Shirai, Seiichiro Kamata

Graduate School of Information, Production and Systems

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper presents an essential algorithm for optimization-based image processing using the bilateral filter (BLF), called constant-time transposed BLF (O(1) TBLF). Some iterative solvers for optimization problems require a pair of filters defined as multiplying a filter matrix or its transpose to vectorized images. Since the BLF can be described as a matrix form, its paired filter also exists, called a TBLF in this paper. BLF-based optimization achieves high smoothing performance; whereas, it requires much high computational complexity due to iterating both BLF and TBLF many times. Hence, this paper designs an O(1) TBLF algorithm to accelerate the iterative process. Experiments show that our O(1) TBLF runs in low complexity regardless of its filter window size and works effectively for flash/no-flash image integration via BLF-based optimization.

Original language	English
Title of host publication	2014 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Print)	9786163618238
DOIs	https://doi.org/10.1109/APSIPA.2014.7041763
Publication status	Published - 2014 Feb 12
Event	2014 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2014 - Chiang Mai, Thailand Duration: 2014 Dec 9 → 2014 Dec 12

Other

Other	2014 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2014
Country	Thailand
City	Chiang Mai
Period	14/12/9 → 14/12/12

ASJC Scopus subject areas

Signal Processing
Information Systems

Access to Document

10.1109/APSIPA.2014.7041763

Fingerprint Dive into the research topics of 'O(1) transposed bilateral filtering for optimization'. Together they form a unique fingerprint.

Cite this

Sugimoto, K., Shirai, K., & Kamata, S. (2014). O(1) transposed bilateral filtering for optimization. In 2014 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2014 [7041763] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/APSIPA.2014.7041763

O(1) transposed bilateral filtering for optimization. / Sugimoto, Kenjiro; Shirai, Keiichiro; Kamata, Seiichiro.

2014 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2014. Institute of Electrical and Electronics Engineers Inc., 2014. 7041763.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sugimoto, K, Shirai, K & Kamata, S 2014, O(1) transposed bilateral filtering for optimization. in 2014 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2014., 7041763, Institute of Electrical and Electronics Engineers Inc., 2014 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2014, Chiang Mai, Thailand, 14/12/9. https://doi.org/10.1109/APSIPA.2014.7041763

@inproceedings{7386931d996b4598b8901b58b56bb336,

title = "O(1) transposed bilateral filtering for optimization",

abstract = "This paper presents an essential algorithm for optimization-based image processing using the bilateral filter (BLF), called constant-time transposed BLF (O(1) TBLF). Some iterative solvers for optimization problems require a pair of filters defined as multiplying a filter matrix or its transpose to vectorized images. Since the BLF can be described as a matrix form, its paired filter also exists, called a TBLF in this paper. BLF-based optimization achieves high smoothing performance; whereas, it requires much high computational complexity due to iterating both BLF and TBLF many times. Hence, this paper designs an O(1) TBLF algorithm to accelerate the iterative process. Experiments show that our O(1) TBLF runs in low complexity regardless of its filter window size and works effectively for flash/no-flash image integration via BLF-based optimization.",

author = "Kenjiro Sugimoto and Keiichiro Shirai and Seiichiro Kamata",

year = "2014",

month = feb,

day = "12",

doi = "10.1109/APSIPA.2014.7041763",

language = "English",

isbn = "9786163618238",

booktitle = "2014 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2014",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2014 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2014 ; Conference date: 09-12-2014 Through 12-12-2014",

}

TY - GEN

T1 - O(1) transposed bilateral filtering for optimization

AU - Sugimoto, Kenjiro

AU - Shirai, Keiichiro

AU - Kamata, Seiichiro

PY - 2014/2/12

Y1 - 2014/2/12

N2 - This paper presents an essential algorithm for optimization-based image processing using the bilateral filter (BLF), called constant-time transposed BLF (O(1) TBLF). Some iterative solvers for optimization problems require a pair of filters defined as multiplying a filter matrix or its transpose to vectorized images. Since the BLF can be described as a matrix form, its paired filter also exists, called a TBLF in this paper. BLF-based optimization achieves high smoothing performance; whereas, it requires much high computational complexity due to iterating both BLF and TBLF many times. Hence, this paper designs an O(1) TBLF algorithm to accelerate the iterative process. Experiments show that our O(1) TBLF runs in low complexity regardless of its filter window size and works effectively for flash/no-flash image integration via BLF-based optimization.

AB - This paper presents an essential algorithm for optimization-based image processing using the bilateral filter (BLF), called constant-time transposed BLF (O(1) TBLF). Some iterative solvers for optimization problems require a pair of filters defined as multiplying a filter matrix or its transpose to vectorized images. Since the BLF can be described as a matrix form, its paired filter also exists, called a TBLF in this paper. BLF-based optimization achieves high smoothing performance; whereas, it requires much high computational complexity due to iterating both BLF and TBLF many times. Hence, this paper designs an O(1) TBLF algorithm to accelerate the iterative process. Experiments show that our O(1) TBLF runs in low complexity regardless of its filter window size and works effectively for flash/no-flash image integration via BLF-based optimization.

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

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

U2 - 10.1109/APSIPA.2014.7041763

DO - 10.1109/APSIPA.2014.7041763

M3 - Conference contribution

AN - SCOPUS:84949924132

SN - 9786163618238

BT - 2014 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA 2014

Y2 - 9 December 2014 through 12 December 2014

ER -