Abstract
In this paper we introduce a method for fast computation of Krawtchouk moments by using of cascaded digital filters. The proposed method based on the outputs of cascaded digital filters operating as accumulators are combined with a simplified Krawtchouk polynomials to form Krawtchouk moments depends on the formulation of Krawtchouk polynomials in terms of binomial functions. The theoretical framework of the proposed method is validated by an experiment on the computation of the Krawtchouk moments then the results are compared to method recursive. Experimental results show that both the proposed algorithm to compute Krawtchouk moments perform better than recursive method in term of computation speed. Finally, the performances of the computational Krawtchouk moments by proposed method in describing images were measured in terms of the image reconstruction by matrix representation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
