Skip to main content

Fundamental Linear Transforms

  • Chapter
  • First Online:
Handbook of Image Processing and Computer Vision

Abstract

In this chapter, the fundamental linear transformations that have immediate application in the field of image processing, in particular, to extract the essential characteristics contained in the images are described. These characteristics, which effectively summarize the global informational features of the image, are then used for other image processing tasks such as classification, compression, description, etc. Linear transforms are also used, as global operators, to improve the visual qualities of an image (enhancement), to attenuate noise (restoration), or to reduce the dimensionality of the data (data reduction). Typically, a linear transform, geometrically, can be seen as a mathematical operator that projects (transforms) the input data into a new output space, which in many cases better highlights the content of the input data. The one of greatest interest is the unitary transform, that is, a linear operator with the characteristic of being invertible, with a kernel (the transformation matrix) that satisfies the orthogonality conditions. It follows that the inverse transform is also realized as an inner product between the coefficients and the rows of the inverse matrix of the transformation. Each transformation is characterized by a transformation matrix. The desired effects on an image can be made by operating directly in the spectral domain of the transforms and then reconstructing the image by the inverse transform, thus observing the results on the spatial domain. With the unitary transformations, the concept of digital filtering is generalized by operating in the spectral domain of a generic transformation, such as the transforms: Cosine, Haar, Walsh, etc. For some of these transformations (DCT, Hadamard, Walsh, Haar) the transformation matrix is not characterized by input data. With those transformation matrices that are independent of the input data, it is possible to implement fast image compression algorithms, especially useful for transmission. Finally, the wavelet transform is described which is characterized for its ability to be accurate in detecting frequency content together with spatial or temporal localization information, thus overcoming the limits of the Fourier transform with which spatial localization of spectral content is lost.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Firmware is a set of sequential instructions (software program) stored in an electronic device (an integrated, an electronic board,...) that implement a certain algorithm. The word consists of two terms: firm with the meaning of stable which in this case indicates the immediate modifiability of the instructions, while ware indicates the hardware component that includes a memory (read-only or rewritable for software update), computing unit and communication unit with other devices. In other words, the firmware includes the two software and hardware components.

  2. 2.

    The ORL Database of Faces is an archive of AT&T Laboratories Cambridge that contains a set of faces acquired between 1992 and 1994 to test algorithms in the context of face recognition.

  3. 3.

    By virtue of the Sampling Theorem, a low-pass filtered signal can be represented by half of its samples, since its maximum bandwidth has been halved.

  4. 4.

    A QMF filter allows to split a signal into two subsampled signals that can then be rebuilt without aliasing. A pair of QMR filters are used as a filter bank to split an input signal into two bands. The resulting low-pass and high-pass signals, from the original signal, are normally reduced by a factor of 2.

References

  1. K.R. Rao, N. Ahmed, T. Natarajan, Discrete cosine transform. IEEE Trans. Comput. C23(1), 90–93 (1974)

    MathSciNet  MATH  Google Scholar 

  2. K.R. Castleman, Digital Image Processing, 1st edn. (Prentice Hall, Upper Saddle River, 1996). ISBN 0-13-211467-4

    Google Scholar 

  3. A.K. Jain, Fundamentals of Digital Image Processing, 1st edn. (Prentice Hall, Upper Saddle River, 1989). ISBN 0133361659

    Google Scholar 

  4. W.K. Pratt, Digital Image Processing (Wiley, New York, 1991)

    MATH  Google Scholar 

  5. R.N. Bracewell, The Hartley Transform (Oxford University Press, New York, 1986)

    MATH  Google Scholar 

  6. R.N. Bracewell, The fast hartley transform. Proc. IEEE 72(8), 1010–1018 (1984)

    Article  Google Scholar 

  7. R.E. Woods, R.C. Gonzalez, Digital Image Processing, 2nd edn. (Prentice Hall, Upper Saddle River, 2002). ISBN 0201180758

    Google Scholar 

  8. J.L. Walsh, A closed set of normal orthogonal functions. Amer. J. Math. 45(1), 5–24 (1923)

    Article  MathSciNet  Google Scholar 

  9. H.C. Andrews, B.R. Hunt, Digital Image Restoration (Prentice Hall, Upper Saddle River, 1977)

    Google Scholar 

  10. K. Pearson, On lines and planes of closest fit to systems of points in space. Philos. Mag. 2(11), 559–572 (1901)

    Article  Google Scholar 

  11. H. Hotelling, Analysis of a complex of statistical variables into principal components. J. Educ. Psychol. 24, 417–441 and 498–520 (1933)

    Article  Google Scholar 

  12. K. Karhunen, Uber lineare methoden in der wahrscheinlichkeitsrechnung. Ann. Acad. Sci. Fennicae. Ser. A. I. Math.-Phys. 37, 1–79 (1947)

    MathSciNet  MATH  Google Scholar 

  13. M. Loève, Probability Theory I, vol. I, 4th edn. (Springer, Berlin, 1977)

    Book  Google Scholar 

  14. I.T. Jolliffe, Principal Component Analysis, 2nd edn. (Springer New York, Inc., New York, 2002)

    MATH  Google Scholar 

  15. Q. Zhao, C. Lv, A universal pca for image compression, in Lecture Notes in Computer Science, vol. 3824 (2005), pp. 910–919

    Google Scholar 

  16. W. Ray, R. Driver, Further decomposition of the karhunen-loève series representation of a stationary random process. IEEE Trans. 16(6), 663–668 (1970)

    MathSciNet  MATH  Google Scholar 

  17. D. Qian, J.E. Fowler, Low-complexity principal component analysis for hyperspectral image compression. Int. J. High Perform. Comput. Appl. 22, 438–448 (2008)

    Article  Google Scholar 

  18. M. Turk, A. Pentland, Eigenfaces for recognition. Neuroscience 3(1), 71–86 (1991)

    Google Scholar 

  19. G. Strang, Linear Algebra and Its Applications, 4th edn. (Brooks Cole, Pacific Grove, 2006)

    MATH  Google Scholar 

  20. D. Gabor, Theory of communication. IEEE Proc. 93(26), 429–441 (1946)

    Google Scholar 

  21. J. Morlet, A. Grossmann, Decomposition of hardy functions into square integrable wavelets of constant shape. SIAM J. Math. Anal. 15(4), 723–736 (1984)

    Article  MathSciNet  Google Scholar 

  22. S.G. Mallat, A theory of multiresolution signal decomposition: the wavelet representation. IEEE Trans. Pattern Anal. Mach. Intell. 11(7), 674–693 (1989)

    Article  Google Scholar 

  23. Y. Meyer, Wavelets: Algorithms and Applications (Society for Industrial and Applied Mathematics, Philadelphia, 1993), pp. 13–31

    Google Scholar 

  24. I. Daubechies, Orthonormal bases of compactly supported wavelets. Commun. Pure Appl. Math. 41, 906–966 (1988)

    MathSciNet  MATH  Google Scholar 

  25. R. Ryan, A. Cohen, Wavelets and Multiscale Signal Processing, 1st edn. (Chapman and Hall, London, 1995)

    MATH  Google Scholar 

  26. M. Vetterli, C. Herley, Wavelets and filter banks: theory and design. IEEE Trans. Signal Process. 40, 2207–2232 (1992)

    Article  Google Scholar 

  27. I. Daubechies, J.-C. Feauveau, A. Cohen, Biorthogonal bases of compactly supported wavelets. Commun. Pure Appl. Math. 45(5), 485–560 (1992)

    Article  MathSciNet  Google Scholar 

  28. C.K. Chui, J.-Z. Wang, On compactly supported spline wavelets and a duality principle. Trans. Amer. Math. Soc. 330(2), 903–915 (1992)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arcangelo Distante .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Distante, A., Distante, C. (2020). Fundamental Linear Transforms. In: Handbook of Image Processing and Computer Vision. Springer, Cham. https://doi.org/10.1007/978-3-030-42374-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-42374-2_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-42373-5

  • Online ISBN: 978-3-030-42374-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics