View in EDS HTML Full Text PDF Full Text

Fast data-independent KLT approximations based on integer functions.

Saved in:
Bibliographic Details
Title: Fast data-independent KLT approximations based on integer functions.
Authors: Radunz, A. P.1 (AUTHOR) apr1@de.ufpe.br, Coelho, D. F. G.2 (AUTHOR), Bayer, F. M.3 (AUTHOR), Cintra, R. J.2 (AUTHOR), Madanayake, A.4 (AUTHOR)
Source: Multimedia Tools & Applications. Aug2024, Vol. 83 Issue 26, p67303-67325. 23p.
Subjects: Integer approximations, Field programmable gate arrays, Image compression, Video compression, Computational complexity
Abstract: The Karhunen-Loève transform (KLT) stands as a well-established discrete transform, demonstrating optimal characteristics in data decorrelation and dimensionality reduction. Its ability to condense energy compression into a select few main components has rendered it instrumental in various applications within image compression frameworks. However, computing the KLT depends on the covariance matrix of the input data, which makes it difficult to develop fast algorithms for its implementation. Approximations for the KLT, utilizing specific rounding functions, have been introduced to reduce its computational complexity. Therefore, our paper introduces a category of low-complexity, data-independent KLT approximations, employing a range of round-off functions. The design methodology of the approximate transform is defined for any block-length N , but emphasis is given to transforms of N = 8 due to its wide use in image and video compression. The proposed transforms perform well when compared to the exact KLT and approximations considering classical performance measures. For particular scenarios, our proposed transforms demonstrated superior performance when compared to KLT approximations documented in the literature. We also developed fast algorithms for the proposed transforms, further reducing the arithmetic cost associated with their implementation. Evaluation of field programmable gate array (FPGA) hardware implementation metrics was conducted. Practical applications in image encoding showed the relevance of the proposed transforms. In fact, we showed that one of the proposed transforms outperformed the exact KLT given certain compression ratios. [ABSTRACT FROM AUTHOR]
Copyright of Multimedia Tools & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 178530010
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Fast data-independent KLT approximations based on integer functions.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Radunz%2C+A%2E P%2E%22">Radunz, A. P.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> apr1@de.ufpe.br</i><br /><searchLink fieldCode="AR" term="%22Coelho%2C+D%2E F%2E G%2E%22">Coelho, D. F. G.</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Bayer%2C+F%2E M%2E%22">Bayer, F. M.</searchLink><relatesTo>3</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Cintra%2C+R%2E J%2E%22">Cintra, R. J.</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Madanayake%2C+A%2E%22">Madanayake, A.</searchLink><relatesTo>4</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Multimedia+Tools+%26+Applications%22">Multimedia Tools & Applications</searchLink>. Aug2024, Vol. 83 Issue 26, p67303-67325. 23p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Integer+approximations%22">Integer approximations</searchLink><br /><searchLink fieldCode="DE" term="%22Field+programmable+gate+arrays%22">Field programmable gate arrays</searchLink><br /><searchLink fieldCode="DE" term="%22Image+compression%22">Image compression</searchLink><br /><searchLink fieldCode="DE" term="%22Video+compression%22">Video compression</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The Karhunen-Loève transform (KLT) stands as a well-established discrete transform, demonstrating optimal characteristics in data decorrelation and dimensionality reduction. Its ability to condense energy compression into a select few main components has rendered it instrumental in various applications within image compression frameworks. However, computing the KLT depends on the covariance matrix of the input data, which makes it difficult to develop fast algorithms for its implementation. Approximations for the KLT, utilizing specific rounding functions, have been introduced to reduce its computational complexity. Therefore, our paper introduces a category of low-complexity, data-independent KLT approximations, employing a range of round-off functions. The design methodology of the approximate transform is defined for any block-length N , but emphasis is given to transforms of N = 8 due to its wide use in image and video compression. The proposed transforms perform well when compared to the exact KLT and approximations considering classical performance measures. For particular scenarios, our proposed transforms demonstrated superior performance when compared to KLT approximations documented in the literature. We also developed fast algorithms for the proposed transforms, further reducing the arithmetic cost associated with their implementation. Evaluation of field programmable gate array (FPGA) hardware implementation metrics was conducted. Practical applications in image encoding showed the relevance of the proposed transforms. In fact, we showed that one of the proposed transforms outperformed the exact KLT given certain compression ratios. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Multimedia Tools & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=178530010
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11042-024-18159-2
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 23
        StartPage: 67303
    Subjects:
      – SubjectFull: Integer approximations
        Type: general
      – SubjectFull: Field programmable gate arrays
        Type: general
      – SubjectFull: Image compression
        Type: general
      – SubjectFull: Video compression
        Type: general
      – SubjectFull: Computational complexity
        Type: general
    Titles:
      – TitleFull: Fast data-independent KLT approximations based on integer functions.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Radunz, A. P.
      – PersonEntity:
          Name:
            NameFull: Coelho, D. F. G.
      – PersonEntity:
          Name:
            NameFull: Bayer, F. M.
      – PersonEntity:
          Name:
            NameFull: Cintra, R. J.
      – PersonEntity:
          Name:
            NameFull: Madanayake, A.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 11
              M: 08
              Text: Aug2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 13807501
          Numbering:
            – Type: volume
              Value: 83
            – Type: issue
              Value: 26
          Titles:
            – TitleFull: Multimedia Tools & Applications
              Type: main
ResultId 1