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
['Gil Ben-Artzi', 'Hagit Hel-Or', 'Yacov Hel-Or']
The Gray-Code Filter Kernels