2020
DOI: 10.1007/978-3-030-39875-0_26
|View full text |Cite
|
Sign up to set email alerts
|

Hardware Design of 8 × 8 and 16 × 16 2D Discrete Cosine Transform with N/2 Equations for Image Compression

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…Noninvertible transformation enabled with orthogonal transforms that transform from pattern space to feature space with less dimensionality. Orthogonal transforms like walsh-hadamard, discrete-fourier, slant, and Haar were considered for different applications because they have fast computing algorithms [3]- [10] for them. Karhunen-loeve transform (KLT) is optimal with respect to the following: variance distribution [3], Estimation mean-square error criterion [4], [6] and rate-distortion function [6], lacks an algorithm that enables its fast computation [3].…”
Section: Introductionmentioning
confidence: 99%
“…Noninvertible transformation enabled with orthogonal transforms that transform from pattern space to feature space with less dimensionality. Orthogonal transforms like walsh-hadamard, discrete-fourier, slant, and Haar were considered for different applications because they have fast computing algorithms [3]- [10] for them. Karhunen-loeve transform (KLT) is optimal with respect to the following: variance distribution [3], Estimation mean-square error criterion [4], [6] and rate-distortion function [6], lacks an algorithm that enables its fast computation [3].…”
Section: Introductionmentioning
confidence: 99%