Fast computation of Krawtchouk moments

The paper describes the calculation of the Krawtchouk Moments (KMs) from an image, which is a computationally demanding task. We present two original methods that use the outputs of cascaded digital filters in deriving KMs. The first approach uses the digital filter outputs to form geometric moments...

Full description

Saved in:
Bibliographic Details
Main Authors: Asli, B.H.S., Flusser, J.
Format: Article
Published: Elsevier 2014
Online Access:http://eprints.um.edu.my/11641/
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Malaya
id my.um.eprints.11641
record_format eprints
spelling my.um.eprints.116412015-01-06T01:57:18Z http://eprints.um.edu.my/11641/ Fast computation of Krawtchouk moments Asli, B.H.S. Flusser, J. The paper describes the calculation of the Krawtchouk Moments (KMs) from an image, which is a computationally demanding task. We present two original methods that use the outputs of cascaded digital filters in deriving KMs. The first approach uses the digital filter outputs to form geometric moments (GMs) and the KMs are obtained via GMs. The second method uses a direct relationship to obtain KMs from the digital filter outputs. This is possible thanks to the formulation of Krawtchouk polynomials in terms of binomial functions, which are equivalent to the digital filter outputs. In this study, the performance of the proposed techniques is compared with other existing methods of KMs calculation. The experimental study shows that the first and the second proposed techniques perform 57% and 87% faster than the recurrence method for a real image of a size 128 x 128 pixels, which performs a significant improvement. (C) 2014 Elsevier Inc. All rights reserved. Elsevier 2014 Article PeerReviewed Asli, B.H.S. and Flusser, J. (2014) Fast computation of Krawtchouk moments. Information Sciences, 288. pp. 73-86.
institution Universiti Malaya
building UM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaya
content_source UM Research Repository
url_provider http://eprints.um.edu.my/
description The paper describes the calculation of the Krawtchouk Moments (KMs) from an image, which is a computationally demanding task. We present two original methods that use the outputs of cascaded digital filters in deriving KMs. The first approach uses the digital filter outputs to form geometric moments (GMs) and the KMs are obtained via GMs. The second method uses a direct relationship to obtain KMs from the digital filter outputs. This is possible thanks to the formulation of Krawtchouk polynomials in terms of binomial functions, which are equivalent to the digital filter outputs. In this study, the performance of the proposed techniques is compared with other existing methods of KMs calculation. The experimental study shows that the first and the second proposed techniques perform 57% and 87% faster than the recurrence method for a real image of a size 128 x 128 pixels, which performs a significant improvement. (C) 2014 Elsevier Inc. All rights reserved.
format Article
author Asli, B.H.S.
Flusser, J.
spellingShingle Asli, B.H.S.
Flusser, J.
Fast computation of Krawtchouk moments
author_facet Asli, B.H.S.
Flusser, J.
author_sort Asli, B.H.S.
title Fast computation of Krawtchouk moments
title_short Fast computation of Krawtchouk moments
title_full Fast computation of Krawtchouk moments
title_fullStr Fast computation of Krawtchouk moments
title_full_unstemmed Fast computation of Krawtchouk moments
title_sort fast computation of krawtchouk moments
publisher Elsevier
publishDate 2014
url http://eprints.um.edu.my/11641/
_version_ 1643689105531338752