2014
DOI: 10.1155/2014/276241
|View full text |Cite
|
Sign up to set email alerts
|

Fast Transforms in Image Processing: Compression, Restoration, and Resampling

Abstract: Transform image processing methods are methods that work in domains of image transforms, such as Discrete Fourier, Discrete Cosine, Wavelet, and alike. They proved to be very efficient in image compression, in image restoration, in image resampling, and in geometrical transformations and can be traced back to early 1970s. The paper reviews these methods, with emphasis on their comparison and relationships, from the very first steps of transform image compression methods to adaptive and local adaptive filters … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0
1

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 62 publications
0
6
0
1
Order By: Relevance
“…Fourier transforms have also been extensively utilized in many image-processing applications. For example, it can be used for image transformation and compression [42,43]. Shi et al [44] used 2D Fourier transforms that also employed a hash function to take advantage of the sparsity in the frequency domain to estimate the largest k coefficients.…”
Section: Related Workmentioning
confidence: 99%
“…Fourier transforms have also been extensively utilized in many image-processing applications. For example, it can be used for image transformation and compression [42,43]. Shi et al [44] used 2D Fourier transforms that also employed a hash function to take advantage of the sparsity in the frequency domain to estimate the largest k coefficients.…”
Section: Related Workmentioning
confidence: 99%
“…In this study, we present a methodology to derive the columns of matrix B from DCT basis functions [38] as they can be used to enforce a predefined temporal structure for the subspace on which the data are projected. To model low frequency information in fMRI data, DCT provides a continuous periodic signal structure, which has the benefit of compactness [39]. DCT basis functions b k (n) are defined for 0 ≤ n < (N − 1) time points as:…”
Section: Selection Of Basesmentioning
confidence: 99%
“…It is a separable transform and due to its energy compaction properties it is commonly used for image and video compression in widely used JPEG and MPEG formats. DCT is one of the transformation methods with the best energy compaction properties on natural images [39]. Karhunen-Loève transform is considered to be optimal in signal decorrelation, however it transforms signal via unique basis functions that are not separable and need to be estimated for every image.…”
Section: Discrete Cosine Transformmentioning
confidence: 99%