{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T20:13:18Z","timestamp":1770840798566,"version":"3.50.1"},"reference-count":46,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T00:00:00Z","timestamp":1630627200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the initial value of the KP parameter. In addition, a new diagonal recurrence relation is introduced and used in the proposed algorithm. The diagonal recurrence algorithm was derived from the existing n direction and x direction recurrence algorithms. The diagonal and existing recurrence algorithms were subsequently exploited to compute the KP coefficients. First, the KP coefficients were computed for one partition after dividing the KP plane into four. To compute the KP coefficients in the other partitions, the symmetry relations were exploited. The performance evaluation of the proposed recurrence algorithm was determined through different comparisons which were carried out in state-of-the-art works in terms of reconstruction error, polynomial size, and computation cost. The obtained results indicate that the proposed algorithm is reliable and computes lesser coefficients when compared to the existing algorithms across wide ranges of parameter values of p and polynomial sizes N. The results also show that the improvement ratio of the computed coefficients ranges from 18.64% to 81.55% in comparison to the existing algorithms. Besides this, the proposed algorithm can generate polynomials of an order \u223c8.5 times larger than those generated using state-of-the-art algorithms.<\/jats:p>","DOI":"10.3390\/e23091162","type":"journal-article","created":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T10:59:12Z","timestamp":1630925952000},"page":"1162","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3965-5018","authenticated-orcid":false,"given":"Khaled A.","family":"AL-Utaibi","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, University of Ha\u2019il, Ha\u2019il 682507, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6439-0082","authenticated-orcid":false,"given":"Sadiq H.","family":"Abdulhussain","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, University of Baghdad, Al-Jadriya, Baghdad 10071, Iraq"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4121-0843","authenticated-orcid":false,"given":"Basheera M.","family":"Mahmmod","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, University of Baghdad, Al-Jadriya, Baghdad 10071, Iraq"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5686-2759","authenticated-orcid":false,"given":"Marwah Abdulrazzaq","family":"Naser","sequence":"additional","affiliation":[{"name":"Department of Architectural Engineering, University of Baghdad, Al-Jadriya, Baghdad 10071, Iraq"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7937-3093","authenticated-orcid":false,"given":"Muntadher","family":"Alsabah","sequence":"additional","affiliation":[{"name":"Department of Electronic and Electrical Engineering, University of Sheffield, Sheffield S1 4ET, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4796-0581","authenticated-orcid":false,"given":"Sadiq M.","family":"Sait","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Interdisciplinary Research Center for Intelligent Secure Systems, Research Institute, King Fahd University of Petroleum & Minerals, Dhahran 31261, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,9,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Chen, Y., Lin, W., Wen, Y., Wang, B., Zhang, S., Zhang, Y., and Yu, S. (2020). Image Signal Transmission Passing over a Barrier enabled by Optical Accelerating Beams. Imaging Systems and Applications, Optical Society of America.","DOI":"10.1364\/COSI.2020.JF1E.5"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Park, K., Chae, M., and Cho, J.H. (2021). Image Pre-Processing Method of Machine Learning for Edge Detection with Image Signal Processor Enhancement. Micromachines, 12.","DOI":"10.3390\/mi12010073"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Xiao, H. (2020, January 20\u201323). A Nonlinear Modulation Algorithm based on Orthogonal Polynomial in MIMO Radar. Proceedings of the 2020 International Conference on Microwave and Millimeter Wave Technology (ICMMT), Shanghai, China.","DOI":"10.1109\/ICMMT49418.2020.9386969"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Radeaf, H.S., Mahmmod, B.M., Abdulhussain, S.H., and Al-Jumaeily, D. (2019). A steganography based on orthogonal moments. ICICT \u201919\u2014International Conference on Information and Communication Technology, ACM Press.","DOI":"10.1145\/3321289.3321324"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Naser, M.A., Alsabah, M., Mahmmod, B.M., Noordin, N.K., Abdulhussain, S.H., and Baker, T. (2020). Downlink Training Design for FDD Massive MIMO Systems in the Presence of Colored Noise. Electronics, 9.","DOI":"10.3390\/electronics9122155"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"108793","DOI":"10.1109\/ACCESS.2021.3100799","article-title":"Sum Rate Maximization Versus MSE Minimization in FDD Massive MIMO Systems With Short Coherence Time","volume":"9","author":"Alsabah","year":"2021","journal-title":"IEEE Access"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"103158","DOI":"10.1016\/j.dsp.2021.103158","article-title":"Introducing the Discrete Path Transform (DPT) and its applications in signal analysis, artefact removal, and spoken word recognition","volume":"117","author":"Guido","year":"2021","journal-title":"Digit. Signal Process."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1080\/19401493.2020.1868577","article-title":"Parametric PGD model used with orthogonal polynomials to assess efficiently the building\u2019s envelope thermal performance","volume":"14","author":"Azam","year":"2021","journal-title":"J. Build. Perform. Simul."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Antonir, A., Wijenayake, C., and Ignjatovi\u0107, A. (2021, January 22\u201328). Acquisition of high bandwidth signals by sampling an analog chromatic derivatives filterbank. Proceedings of the 2021 IEEE International Symposium on Circuits and Systems (ISCAS), Daegu, Korea.","DOI":"10.1109\/ISCAS51556.2021.9401478"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"102731","DOI":"10.1016\/j.jvcir.2019.102731","article-title":"Spline-like Chebyshev polynomial model for compressive imaging","volume":"66","author":"Tafro","year":"2020","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Abdulhussain, S.H., Mahmmod, B.M., Naser, M.A., Alsabah, M.Q., Ali, R., and Al-Haddad, S.A.R. (2021). A Robust Handwritten Numeral Recognition Using Hybrid Orthogonal Polynomials and Moments. Sensors, 21.","DOI":"10.3390\/s21061999"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Barranco-Chamorro, I., and Grentzelos, C. (2020). Some uses of orthogonal polynomials in statistical inference. Comput. Math. Methods, e1144.","DOI":"10.1002\/cmm4.1144"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.dsp.2012.09.018","article-title":"Image retrieval using edge based shape similarity with multiresolution enhanced orthogonal polynomials model","volume":"23","author":"Krishnamoorthy","year":"2013","journal-title":"Digit. Signal Process."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"106412","DOI":"10.1109\/ACCESS.2021.3100139","article-title":"Fast Shot Boundary Detection Based on Separable Moments and Support Vector Machine","volume":"9","author":"Idan","year":"2021","journal-title":"IEEE Access"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Nafees, S., Rice, S.H., and Phillips, C. (September, January 29). Analyzing Genomic Data Using Tensor-based Orthogonal Polynomials. Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, Washington, DC, USA.","DOI":"10.1145\/3233547.3233682"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.ins.2015.10.039","article-title":"Account classification in online social networks with LBCA and wavelets","volume":"332","author":"Igawa","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1927469","DOI":"10.1080\/23311916.2021.1927469","article-title":"Content-based image retrieval: A review of recent trends","volume":"8","author":"Hameed","year":"2021","journal-title":"Cogent Eng."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1950050","DOI":"10.1142\/S0219691319500504","article-title":"Hyperspectral image classification using wavelet transform-based smooth ordering","volume":"17","author":"Yang","year":"2019","journal-title":"Int. J. Wavelets Multiresolut. Inf. Process."},{"key":"ref_19","unstructured":"Silvestrov, S., and Ran\u010di\u0107, M. (2016). Fractional-Wavelet Analysis of Positive definite Distributions and Wavelets on D\u2032(C). Engineering Mathematics II, Springer International Publishing."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Jassim, W.A., and Raveendran, P. (2012, January 10\u201312). Face recognition using discrete Tchebichef-Krawtchouk transform. Proceedings of the 2012 IEEE International Symposium on Multimedia, Irvine, CA, USA.","DOI":"10.1109\/ISM.2012.31"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"012102","DOI":"10.1088\/1757-899X\/1090\/1\/012102","article-title":"Speech Enhancement Algorithm Based on a Hybrid Estimator","volume":"Volume 1090","author":"Mahmmod","year":"2021","journal-title":"IOP Conference Series: Materials Science and Engineering"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Abdulhussain, S.H., Ramli, A.R., Hussain, A.J., Mahmmod, B.M., and Jassim, W.A. (2019, January 15\u201316). Orthogonal polynomial embedded image kernel. Proceedings of the International Conference on Information and Communication Technology, Baghdad, Iraq.","DOI":"10.1145\/3321289.3321310"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"4285","DOI":"10.1007\/s11042-015-2475-y","article-title":"Hiding depth information in compressed 2D image\/video using reversible watermarking","volume":"75","author":"Wang","year":"2016","journal-title":"Multimed. Tools Appl."},{"key":"ref_24","unstructured":"Wang, Y., Vilermo, M., and Yaroslavsky, L. (2000). Energy compaction property of the MDCT in comparison with other transforms. Audio Engineering Society Convention 109, Audio Engineering Society."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Mahmmod, B.M., Abdul-Hadi, A.M., Abdulhussain, S.H., and Hussien, A. (2020). On Computational Aspects of Krawtchouk Polynomials for High Orders. J. Imaging, 6.","DOI":"10.3390\/jimaging6080081"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1763553","DOI":"10.1080\/23311916.2020.1763553","article-title":"On the computational aspects of Charlier polynomials","volume":"7","author":"Abdulhussain","year":"2020","journal-title":"Cogent Eng."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1049\/iet-ipr.2009.0195","article-title":"General form for obtaining discrete orthogonal moments","volume":"4","author":"Zhu","year":"2010","journal-title":"LET Image Process."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1109\/83.941859","article-title":"Image analysis by Tchebichef moments","volume":"10","author":"Mukundan","year":"2001","journal-title":"IEEE Trans. Image Process."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"143","DOI":"10.21123\/bsj.2008.5.1.143-148","article-title":"Orthogonal functions solving linear functional differential equationsusing chebyshev polynomial","volume":"5","author":"Mizel","year":"2008","journal-title":"Baghdad Sci. J."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Abdulhussain, S.H., and Mahmmod, B.M. (2021). Fast and efficient recursive algorithm of Meixner polynomials. J. Real-Time Image Process., 1\u201313.","DOI":"10.1007\/s11554-021-01093-z"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TIP.2003.818019","article-title":"Image analysis by krawtchouk moments","volume":"12","author":"Yap","year":"2003","journal-title":"IEEE Trans. Image Process."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Yap, P.T., and Paramesran, R. (2004, January 24). Local watermarks based on Krawtchouk moments. Proceedings of the 2004 IEEE Region 10 Conference TENCON 2004, Chiang Mai, Thailand.","DOI":"10.1109\/TENCON.2004.1414534"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Akhmedova, F., and Liao, S. (2019). Face Recognition with Discrete Orthogonal Moments. Recent Advances in Computer Vision, Springer.","DOI":"10.1007\/978-3-030-03000-1_8"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"3985","DOI":"10.1007\/s11042-013-1808-y","article-title":"Image watermarking via separable moments","volume":"74","author":"Tsougenis","year":"2015","journal-title":"Multimed. Tools Appl."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/TIT.2018.2823704","article-title":"Binary LCD codes and self-orthogonal codes from a generic construction","volume":"65","author":"Zhou","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.laa.2019.01.005","article-title":"On characterizing integral zeros of Krawtchouk polynomials by quantum entanglement","volume":"567","author":"Heo","year":"2019","journal-title":"Linear Algebra Appl."},{"key":"ref_37","unstructured":"Pierce, J.R. (2012). An Introduction to Information Theory: Symbols, Signals and Noise, Courier Corporation."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1358","DOI":"10.1109\/34.735809","article-title":"On the accuracy of Zernike moments for image analysis","volume":"20","author":"Liao","year":"1998","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/34.485554","article-title":"On image analysis by moments","volume":"18","author":"Liao","year":"1996","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_40","unstructured":"Kamgar-Parsi, B., and Kamgar-Parsi, B. (1993). Evaluation of quantization error in computer vision. Physics-Based Vision: Principles and Practice: Radiometry, Volume 1, CRC Press."},{"key":"ref_41","unstructured":"Yap, P.T., Raveendran, P., and Ong, S.H. (2002, January 12\u201317). Krawtchouk moments as a new set of discrete orthogonal moments for image reconstruction. Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN\u201902 (Cat. No.02CH37290), Honolulu, HI, USA."},{"key":"ref_42","first-page":"713","article-title":"New orthogonal polynomials for speech signal and image processing","volume":"6","author":"Jassim","year":"2012","journal-title":"LET Signal Process."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.patrec.2009.12.007","article-title":"A symmetry and bi-recursive algorithm of accurately computing Krawtchouk moments","volume":"31","author":"Zhang","year":"2010","journal-title":"Pattern Recognit. Lett."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10851-017-0758-9","article-title":"Fast Recursive Computation of Krawtchouk Polynomials","volume":"60","author":"Abdulhussain","year":"2018","journal-title":"J. Math. Imaging Vis."},{"key":"ref_45","unstructured":"Abramowitz, M., and Stegun, I.A. (1964). Handbook of Mathematical Functions: With Formulas, Graphs, and Mathematical Tables, Dover Publications."},{"key":"ref_46","unstructured":"Jain, A.K. (1989). Fundamentals of Digital Image Processing, Prentice-Hall, Inc."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/9\/1162\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:56:11Z","timestamp":1760165771000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/9\/1162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,3]]},"references-count":46,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2021,9]]}},"alternative-id":["e23091162"],"URL":"https:\/\/doi.org\/10.3390\/e23091162","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,3]]}}}