Skip to main content
SpringerLink
Log in

Fast computation of inverse Meixner moments transform using Clenshaw’s formula

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Orthogonal moments are recognized as useful tools for object representation and image analysis. It was shown that they have better image representation capability than the continuous orthogonal moments. One problem concerning the use of moments is the high computational cost, which may limit where the online computation is required. In this paper, we propose a recursive method based on Clenshaw’s recurrence formula that can be implemented to transform kernels of Meixner moments and its inverse for fast computation. There is no need for the proposed method to compute the Meixner polynomial values of various orders on various data points, where the computational complexity is reduced. Experimental results show that the proposed method performs better than the existing methods in term of computation speed and the effectiveness of image reconstruction capability in both noise-free and noisy conditions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Aburdene MF, Zheng J, Kozick RJ (1995) Computation of discrete cosine transform using Clenshaw’s recurrence formula. IEEE Signal Processing Lett 2:155–156

    Article  Google Scholar 

  2. Chau LP, Siu WC (1994) Recursive algorithm for the discrete cosine transform with general lengths. Electron Lett 30(3):197–198

    Article  Google Scholar 

  3. Chau LP, Siu WC (2000) Efficient recursive algorithm for the inverse discrete cosine transform. IEEE Signal Processing, Lett 7:276–277

    Article  Google Scholar 

  4. Hosny KM (2011) Image representation using accurate orthogonal Gegenbauer moments. Pattern Recogn Lett 32(6):795–804

    Article  Google Scholar 

  5. Hosny KM (2012) Fast computation of accurate Gaussian–Hermite moments for image processing applications. Digit Signal Process 22:476–485

    Article  MathSciNet  Google Scholar 

  6. Hu MK (1962) Visual pattern recognition by moment invariants. IRE Trans Inform Theory IT-8:179–187

    MATH  Google Scholar 

  7. Jahid T, Hmimid A, Karmouni H, Sayyouri M, Qjidaa H, Rezzouk A (2017) Image analysis by Meixner moments and a digital filter. Multimed Tools Appl:1–21

  8. Jahid T, Karmouni H, Sayyouri M et al (2018) Fast Algorithm of 3D Discrete Image Orthogonal Moments Computation Based on 3D Cuboid. Journal of Mathematical Imaging and Vision:1–21

  9. Karmouni H, Hmimid A, Jahid T, Sayyouri M, Qjidaa H, Rezzouk A (2018) Fast and Stable Computation of the Charlier Moments and Their Inverses Using Digital Filters and Image Block Representation. Circuits Syst Signal Process. https://doi.org/10.1007/s00034-018-0755-2

    Article  Google Scholar 

  10. Karmouni H, Jahid T, Sayyouri M et al (2017) Fast 3D image reconstruction by cuboids and 3D Charlier’s moments. J Real-Time Image Proc 2019:1–17

    Google Scholar 

  11. Karmouni H, Jahid T, Sayyouri M et al (2019) Fast Reconstruction of 3D Images Using Charlier Discrete Orthogonal Moments. Circuits, Systems, and Signal Processing, p:1–28

    Article  Google Scholar 

  12. Khotanzad A, Hong YH (1990) Invariant image recognition by Zernike moments. IEEE Trans Pattern Anal Mach Int 12:489–497

    Article  Google Scholar 

  13. Koekoek R, Lesky PA, Swarttouw RF. (2010). Hypergeometric orthogonal polynomials and their qanalogues. Springer Monographs in Mathematics, Library of Congress Control Number, 2010923797

  14. Kozick RJ, Aburdene MF (2000) Methods for designing efficient parallel-recursive filter structures for computing discrete transforms. Telecommun Syst 13(1):69–80

    Article  Google Scholar 

  15. Lan X, Ma AJ, Yuen PC, Chellappa R (2015) Joint sparse representation and robust feature-level fusion for multi-cue visual tracking. IEEE Trans Image Process 24(12):5826–5841

    Article  MathSciNet  Google Scholar 

  16. Lan X, Ye M, Shao R, Zhong B, Jain DK, Zhou H (2019) Online Non-negative Multi-modality Feature Template Learning for RGB-assisted Infrared Tracking. IEEE Access

  17. Lan X, Ye M, Shao R, Zhong B, Yuen PC, Zhou H (2019) Learning Modality-Consistency Feature Templates: A Robust RGB-Infrared Tracking System. IEEE Trans Ind Electron

  18. Lan X, Ye M, Zhang S, Zhou H, Yuen PC (2018) Modality-correlation-aware sparse representation for RGB-infrared object tracking. Pattern Recogn Lett

  19. Lan X, Zhang S, Yuen PC, Chellappa R (2017) Learning common and feature-specific patterns: a novel multiple-sparse-representation-based tracker. IEEE Trans Image Process 27(4):2022–2037

    Article  MathSciNet  Google Scholar 

  20. Mukundan R (2004) Some computational aspects of discrete orthonormal moments. IEEE Trans Image Process 13(8):1055–1059

    Article  MathSciNet  Google Scholar 

  21. Mukundan R, Ong SH, Lee PA (2001) Image analysis by Tchebichef moments. IEEE Trans Image Process 10(9):1357–1364

    Article  MathSciNet  Google Scholar 

  22. Nikiforov AF, Suslov SK, Uvarov B (1991) Classical orthogonal polynomials of a discrete variable. Springer, New York

    Book  Google Scholar 

  23. Nikolajevic V, Fettweis G (2003) Computation of forward and inverse MDCT using Clenshaw’s recurrence formula. IEEE Trans Signal Processing 51:1439–1444

    Article  MathSciNet  Google Scholar 

  24. Press W, Teukolsky SA, Vetterling WT et al (1992) Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Cambridge, p 1992

    MATH  Google Scholar 

  25. Sayyouri M, Hmimd A, Qjidaa H (2012) A fast computation of Charlier moments for binary and gray-scale images. Information Science and Technology Colloquium (CIST), Fez, pp 101–105

    Google Scholar 

  26. Sayyouri M, Hmimd A, Qjidaa H (2012) A Fast Computation of Hahn Moments for Binary and Gray-Scale Images. IEEE, International Conference on Complex Systems ICCS’12, Agadir, pp 1–6

    Google Scholar 

  27. Teague MR (1980) Image analysis via the general theory of moments. J Opt Soc Am A 70:920–930

    Article  MathSciNet  Google Scholar 

  28. Wang Z, Jullien GA, Miller WC (1994) Recursive algorithms for the forward and inverse discrete cosine transform with arbitrary length. IEEE Signal Processing Lett 1:101–102

    Article  Google Scholar 

  29. Wang GB, Wang SG (2004) Parallel recursive computation of the inverse Legendre moment transforms for signal and image reconstruction. IEEE Signal Processing Lett 11(12):929–932

    Article  Google Scholar 

  30. Wang GB, Wang SG (2006) Recursive Computation of Tchebichef Moment and its inverse transform. Pattern Recogn 39:47–56

    Article  Google Scholar 

  31. Yap PT, Paramesran R, Ong SH (2003) Image analysis by Krawtchouk moments. IEEE Trans Image Process 12(11):1367–1377

    Article  MathSciNet  Google Scholar 

  32. Yap PT, Raveendran P, Ong SH (2007) Image analysis using Hahn moments. IEEE Trans Pattern Anal Mach Int 29(11):2057–2062

    Article  Google Scholar 

  33. Zhang H, Shu HZ, Haigron P, Li BS, Luo LM (2010) Construction of a complete set of orthogonal Fourier– Mellin moment invariants for pattern recognition applications. Image Vis Comput 28(1):38–44

    Article  Google Scholar 

  34. Zhu H, Liu M, Shu H, Zhang H, Luo L (2010) General form for obtaining discrete orthogonal moments. IET Image Process 4(5):335–352

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous referees whose careful reviews and detailed comments helped improve the readability of this paper.

Author information

Authors and Affiliations

  1. CED-ST, STIC, Laboratory of Electronic Signals and Systems of Information LESSI, Faculty of Science Dhar El Mahrez, University Sidi Mohamed Ben Abdellah, Fez, Morocco

    Hicham Karmouni, Tarik Jahid, Abdeslam Hmimid & Hassan Qjidaa

  2. Engineering, Systems and Applications Laboratory, National School of Applied Sciences, Sidi Mohamed Ben Abdellah University, BP 72, My Abdallah Avenue Km. 5 Imouzzer Road, Fez, Morocco

    Mhamed Sayyouri

Authors
  1. Hicham Karmouni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tarik Jahid
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abdeslam Hmimid
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mhamed Sayyouri
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hassan Qjidaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hicham Karmouni.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interest regarding the publication of this paper.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Karmouni, H., Jahid, T., Hmimid, A. et al. Fast computation of inverse Meixner moments transform using Clenshaw’s formula. Multimed Tools Appl 78, 31245–31265 (2019). https://doi.org/10.1007/s11042-019-07961-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-019-07961-y

Keywords

Search

Navigation