The F-transform in Terms of Image Processing Tools

In the proposed contribution, we have discussed the usefulness of the higher degree $F^p$-transforms, $p=0,1$, for various tasks of image processing. We show that an image can be efficiently represented as a matrix of its F-transform components. We analyze the details and discuss advantages of this type of representation. We show that in a particular case, components of the $F^0$-transform can be obtained with the help of the operation of convolution, and components of the $F^1$-transform can be obtained with the help of convolution with three different kernels. We give image illustrations of all made assertions.