Name
Abstract | ||
|---|---|---|
Image compression is a crucial step in image processing area. Image Fourier transforms is the classical algorithm which can convert image from spatial domain to frequency domain. Because of its good concentrative property with transform energy, Fourier transform has been widely applied in image coding, image segmentation, image reconstruction. This paper adopts Radix-4 Fast Fourier transform (Radix-4 FFT) to realize the limit distortion for image coding, and to discuss the feasibility and the advantage of Fourier transform for image compression. It aims to deal with the existing complex and time-consuming of Fourier transform, according to the symmetric conjugate of the image by Fourier transform to reduce data storage and computing complexity. Using Radix-4 FFT can also reduce algorithm time-consuming, it designs three different compression requirements of nonuniform quantification tables for different demands of image quality and compression ratio. Take the standard image Lena as experimental data using the presented method, the results show that the implementation by Radix- 4 FFT is simple, the effect is ideal and lower time-consuming. © 2011 ACADEMY PUBLISHER. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.4304/jnw.6.7.1041-1048 | JNW |
Keywords | Field | DocType |
coding and decoding,compression ratio,fourier transform,image compression,quantization table list | Top-hat transform,Computer vision,Split-radix FFT algorithm,Computer science,Prime-factor FFT algorithm,Short-time Fourier transform,Fast Fourier transform,Artificial intelligence,Discrete Fourier transform,Fractional Fourier transform,Image compression | Journal |
Volume | Issue | Citations |
6 | 7 | 1 |
PageRank | References | Authors |
0.36 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juanli Hu | 1 | 10 | 2.63 |
| Jiabin Deng | 2 | 7 | 1.21 |
| Juebo Wu | 3 | 14 | 3.27 |