Acceleration of Gaussian Filter with Short Window Length Using DCT-1

Takahiro Yano, Kenjiro Sugimoto, Yoshimitsu Kuroki, Seiichiro Kamata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents an accelerated constant-time Gaussian filter (O(1) GF) specialized in short window length where constant-time (O(1)) means that computational complexity per pixel does not depend on filter window length. Our method is extensively designed based on the idea of O(1) GF based on Discrete Cosine Transform (DCT). This framework approximates a Gaussian kernel by a linear sum of cosine terms and then convolves each cosine term in O(1) per pixel using sliding transform. Importantly, if window length is short, DCT-1 consists of easily-computable cosine values such as 0, \pm\frac{1}{2} and ±1. This behavior is not satisfied in other DCT types. From this fact, our method accelerates the sliding transform by employing DCT-1 focusing on short window length. Experiments show that our method overcomes naive Gaussian convolution and existing O(1) GF in terms of computational time. Interestingly, the results also reveal that, without truncating negligible terms, our method runs faster than convolution.

Original languageEnglish
Title of host publication2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages129-132
Number of pages4
ISBN (Electronic)9789881476852
DOIs
Publication statusPublished - 2019 Mar 4
Event10th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Honolulu, United States
Duration: 2018 Nov 122018 Nov 15

Publication series

Name2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings

Conference

Conference10th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018
CountryUnited States
CityHonolulu
Period18/11/1218/11/15

Fingerprint

Discrete cosine transforms
Convolution
Pixels
Computational complexity
Experiments

ASJC Scopus subject areas

  • Information Systems

Cite this

Yano, T., Sugimoto, K., Kuroki, Y., & Kamata, S. (2019). Acceleration of Gaussian Filter with Short Window Length Using DCT-1. In 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings (pp. 129-132). [8659511] (2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/APSIPA.2018.8659511

Acceleration of Gaussian Filter with Short Window Length Using DCT-1. / Yano, Takahiro; Sugimoto, Kenjiro; Kuroki, Yoshimitsu; Kamata, Seiichiro.

2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 129-132 8659511 (2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yano, T, Sugimoto, K, Kuroki, Y & Kamata, S 2019, Acceleration of Gaussian Filter with Short Window Length Using DCT-1. in 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings., 8659511, 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 129-132, 10th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018, Honolulu, United States, 18/11/12. https://doi.org/10.23919/APSIPA.2018.8659511
Yano T, Sugimoto K, Kuroki Y, Kamata S. Acceleration of Gaussian Filter with Short Window Length Using DCT-1. In 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. p. 129-132. 8659511. (2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings). https://doi.org/10.23919/APSIPA.2018.8659511
Yano, Takahiro ; Sugimoto, Kenjiro ; Kuroki, Yoshimitsu ; Kamata, Seiichiro. / Acceleration of Gaussian Filter with Short Window Length Using DCT-1. 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 129-132 (2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings).
@inproceedings{f9a110ee73094eb7871b4337d9471957,
title = "Acceleration of Gaussian Filter with Short Window Length Using DCT-1",
abstract = "This paper presents an accelerated constant-time Gaussian filter (O(1) GF) specialized in short window length where constant-time (O(1)) means that computational complexity per pixel does not depend on filter window length. Our method is extensively designed based on the idea of O(1) GF based on Discrete Cosine Transform (DCT). This framework approximates a Gaussian kernel by a linear sum of cosine terms and then convolves each cosine term in O(1) per pixel using sliding transform. Importantly, if window length is short, DCT-1 consists of easily-computable cosine values such as 0, \pm\frac{1}{2} and ±1. This behavior is not satisfied in other DCT types. From this fact, our method accelerates the sliding transform by employing DCT-1 focusing on short window length. Experiments show that our method overcomes naive Gaussian convolution and existing O(1) GF in terms of computational time. Interestingly, the results also reveal that, without truncating negligible terms, our method runs faster than convolution.",
author = "Takahiro Yano and Kenjiro Sugimoto and Yoshimitsu Kuroki and Seiichiro Kamata",
year = "2019",
month = "3",
day = "4",
doi = "10.23919/APSIPA.2018.8659511",
language = "English",
series = "2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "129--132",
booktitle = "2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings",

}

TY - GEN

T1 - Acceleration of Gaussian Filter with Short Window Length Using DCT-1

AU - Yano, Takahiro

AU - Sugimoto, Kenjiro

AU - Kuroki, Yoshimitsu

AU - Kamata, Seiichiro

PY - 2019/3/4

Y1 - 2019/3/4

N2 - This paper presents an accelerated constant-time Gaussian filter (O(1) GF) specialized in short window length where constant-time (O(1)) means that computational complexity per pixel does not depend on filter window length. Our method is extensively designed based on the idea of O(1) GF based on Discrete Cosine Transform (DCT). This framework approximates a Gaussian kernel by a linear sum of cosine terms and then convolves each cosine term in O(1) per pixel using sliding transform. Importantly, if window length is short, DCT-1 consists of easily-computable cosine values such as 0, \pm\frac{1}{2} and ±1. This behavior is not satisfied in other DCT types. From this fact, our method accelerates the sliding transform by employing DCT-1 focusing on short window length. Experiments show that our method overcomes naive Gaussian convolution and existing O(1) GF in terms of computational time. Interestingly, the results also reveal that, without truncating negligible terms, our method runs faster than convolution.

AB - This paper presents an accelerated constant-time Gaussian filter (O(1) GF) specialized in short window length where constant-time (O(1)) means that computational complexity per pixel does not depend on filter window length. Our method is extensively designed based on the idea of O(1) GF based on Discrete Cosine Transform (DCT). This framework approximates a Gaussian kernel by a linear sum of cosine terms and then convolves each cosine term in O(1) per pixel using sliding transform. Importantly, if window length is short, DCT-1 consists of easily-computable cosine values such as 0, \pm\frac{1}{2} and ±1. This behavior is not satisfied in other DCT types. From this fact, our method accelerates the sliding transform by employing DCT-1 focusing on short window length. Experiments show that our method overcomes naive Gaussian convolution and existing O(1) GF in terms of computational time. Interestingly, the results also reveal that, without truncating negligible terms, our method runs faster than convolution.

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

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

U2 - 10.23919/APSIPA.2018.8659511

DO - 10.23919/APSIPA.2018.8659511

M3 - Conference contribution

AN - SCOPUS:85063442690

T3 - 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings

SP - 129

EP - 132

BT - 2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2018 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -