2001
DOI: 10.1016/s0030-4018(01)01462-6
|View full text |Cite
|
Sign up to set email alerts
|

Image representation and compression with the fractional Fourier transform

Abstract: We discuss the application of fractional Fourier transform-based ®ltering con®gurations to image representation and compression. An image can be approximately represented (and stored or transmitted) as the coe cients of the minimum mean square ®ltering con®guration approximating the image matrix. An order of magnitude compression is possible with moderate errors with the raw method. While inferior to commonly available compression algorithms, the results presented correspond to the basic method without any re®… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 35 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…When FrFT is analyzed in discrete domain there are many definitions of Discrete Fractional Fourier Transform (DFrFT) [16]. FrFT computation involves following steps:…”
Section: Fractional Fourier Transformmentioning
confidence: 99%
“…When FrFT is analyzed in discrete domain there are many definitions of Discrete Fractional Fourier Transform (DFrFT) [16]. FrFT computation involves following steps:…”
Section: Fractional Fourier Transformmentioning
confidence: 99%
“…Their fractional variants also play a promising tool in analyzing time-varying signals and images. Existing literature [1][2][3][4] depict the importance of the fractional order transforms in the signal and image processing.…”
Section: Introductionmentioning
confidence: 99%
“…Noteworthy discrete fractional transforms, such as the discrete fractional Fourier transform (DFrFT) [1][2][3], discrete fractional Hartley transform [4], discrete fractional cosine and sine transforms [5], discrete fractional Hadamard transform (DFrHT) [6] have been defined. They are widely used in various fields of science and technology, including image representation and compression [7], image encryption [8], digital watermarking [9], adaptive filtering [10,11] and others. Among these transforms, the DFrFT has been applied in most practical contexts.…”
Section: Introductionmentioning
confidence: 99%