By Topic

The Gray-Code Filter Kernels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ben-Artzi, G. ; Dept. of Math., Bar-Ilan Univ., Ramat-Gan ; Hel-Or, H. ; Hel-Or, Y.

In this paper, we introduce a family of filter kernels, the gray-code kernels (GCK) and demonstrate their use in image analysis. Filtering an image with a sequence of gray-code kernels is highly efficient and requires only two operations per pixel for each filter kernel, independent of the size or dimension of the kernel. We show that the family of kernels is large and includes the Walsh-Hadamard kernels, among others. The GCK can be used to approximate any desired kernel and, as such forms, a complete representation. The efficiency of computation using a sequence of GCK filters can be exploited for various real-time applications, such as, pattern detection, feature extraction, texture analysis, texture synthesis, and more

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:29 ,  Issue: 3 )