Fast and accurate computation of orthogonal moments for texture analysis

Abstract

In this work we describe a fast and stable algorithm for the computation of the orthogonal moments of an image. Indeed, orthogonal moments are characterized by a high discriminative power, but some of their possible formulations are characterized by a large computational complexity, which limits their real-time application. This paper describes in detail an approach based on recurrence relations, and proposes an optimized Matlab implementation of the corresponding computational procedure, aiming to solve the above limitations and put at the community's disposal an efficient and easy to use software. In our experiments we evaluate the effectiveness of the recurrence formulation, as well as its performance for the reconstruction task, in comparison to the closed form representation, often used in the literature. The results show a sensible reduction in the computational complexity, together with a greater accuracy in reconstruction. In order to assess and compare the accuracy of the computed moments in texture analysis, we perform classification experiments on six wellknown databases of texture images. Again, the recurrence formulation performs better in classification than the closed form representation. More importantly, if computed from the GLCM of the image using the proposed stable procedure, the orthogonal moments outperform in some situations some of the most diffused state-of-the-art descriptors for texture classification.

Cassava disease recognition from low‐quality images using enhanced data augmentation model and deep learning

“…Orthogonal functions provide a set of basis functions for representing any function in the function space. Here we use the Chebyshev orthogonal functions (Di Ruberto et al, 2018). To our knowledge, these functions have not been used before in the context of histogram equalization or data augmentation for image processing and classification tasks.…”

Road surface classification based on LBP and GLCM features using kNN classifier

“…Gray level co-occurrence matrix (GLCM) is categorized as texture analysis and it is considered the most common and convenient algorithm [15], which process an image and reflect its second-order conditional probability value of pixel combination (i,j) and has a specific angle (θ), distance (d), and with different intensity [16]. Usually the intensity is 8x8 or 16x16 as it will not produce a lot of redundant information [17].…”

Image Retrieval Using the Fused Perceptual Color Histogram

“…Dubey et al proposed a multichannel decoded LBP method and utilized it for CBIR [ 16 ]. Roberto et al proposed the orthogonal moments for texture classification [ 17 ]. A set of Gabor filters with different frequencies and orientations can mimic the perception of the human visual system (HVS).…”