Fast and accurate computation of orthogonal moments for texture analysis
C. Di Ruberto, L. Putzu, G. Rodriguez

TL;DR
This paper introduces a fast, stable recurrence-based algorithm for computing orthogonal moments in images, significantly improving efficiency and accuracy for texture analysis and classification tasks.
Contribution
It presents a novel recurrence relation approach for orthogonal moments, enabling real-time computation and better texture classification performance.
Findings
Recurrence formulation reduces computational complexity.
Recurrence-based moments improve classification accuracy.
Orthogonal moments outperform state-of-the-art descriptors in some cases.
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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
