Skip to main content
Log in

Methods of Synthesis of Efficient Orthogonal Transforms of High and Low Correlation and Their Fast Algorithms for Coding and Compressing Digital Images

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Based on recurrent matrix methods of synthesis of orthogonal transforms, efficient fast algorithms are developed that need only output data rearrangement. These transforms are tested on non-separable and correlation models. A comparative analysis of these transforms and the well-known slant and Walsh transforms is given in respect to the following characteristics: transformation efficiency, maximum reducible bits, mean-square error of basis truncation, transform coding efficiency and computational complexity.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. W. K. Cham and R. J. Clarke, “Application of the principle of dyadic symmetry to the generation of orthogonal transforms,” IEE Proc. F., Commun., Radar and Signal Process., 133, No. 3, 264-270 (1986).

    Google Scholar 

  2. L. O. Gnativ and O. S. Shevchuk, “Methods of synthesis of high-efficient transforms and their fast algorithms,” in: Proc. Intern. Conf on Problems of Calculations Optimization, October 6-8, 1997, Kiev [in Russian], Inst. Cybern. NASU, Kiev (1997), pp. 75-80.

    Google Scholar 

  3. L. A. Gnativ and E. S. Shevchuk, “High-performance generalized oblique Walsh transforms for compression of digital images,” Probl. Upravl. Inform., No. 5, 112-118 (2000).

  4. L. A. Gnativ, “Methods of synthesis of new orthonormal basis systems of generalized slant transforms and their fast algorithms for coding images,” Probl. Upravl. Inform., No. 4, 128-140 (2000).

  5. O. S. Shevchuk, “On some transforms used for coding images,” in: Computer Mathematics. Calculations Optimization (Collection of Scientific Papers) [in Ukrainian], Vol. 1, Kiev (2001), pp. 407-416.

    Google Scholar 

  6. Z. Wang, “The phase shift cosine transform,” Acta Electron. Sinica, 14, No. 6, 11-19 (1986).

    Google Scholar 

  7. W. K. Cham, “Development of integer cosine transforms by the principle of dyadic symmetry,” IEE Proc., 136, Pt. I, No. 4, 276-282 (1989).

    Google Scholar 

  8. T. R. Natarajan and N. Ahmed, “Performance evaluation for transform coding using a nonseparable covariance model,” IEEE Trans. Commun., COM-26, Feb., No. 2, 310-312 (1978).

  9. A. N. Akansu and R. A. Haddad, “Factorization of the coefficient variance matrix in orthogonal transforms,” IEEE Trans. on Signal Processing, 39, No. 3, 714-718 (1991).

    Google Scholar 

  10. R. Zelinski and P. Noll, “Adaptive transform coding of speech signals,” IEEE Trans. Acoust., Speech, Signal Processing, ASSP 25, Aug., No. 8, 299-309 (1977).

  11. N. S. Jayant and P. Noll, Digital Coding of Waveforms, Prentice-Hall, Englwood Cliffs (NJ) (1984), pp. 56-58.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gnativ, L.A., Shevchuk, E.S. Methods of Synthesis of Efficient Orthogonal Transforms of High and Low Correlation and Their Fast Algorithms for Coding and Compressing Digital Images. Cybernetics and Systems Analysis 38, 879–890 (2002). https://doi.org/10.1023/A:1022996005721

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022996005721

Navigation