Fast progressive reconstruction of images in DCT domain

Author

Miaou, Shaou Gang ; Tou, Julius T.

Author_Institution

Dept. of Electr. Eng., Florida Univ., Gainesville, FL, USA

fYear

1993

fDate

7-9 Mar 1993

Firstpage

503

Lastpage

507

Abstract

Progressive image transmission (PIT) using the discrete cosine transform (DCT) is considered. An approach to fast progressive reconstruction (FPR) of DCT images is presented. The approach is based on the observation that typical input matrices to IDCT are sparse in PIT. By exploiting the sparsity of a matrix, nonzero elements in the matrix can be processed separately and efficiently. The approach allows any scanning patterns including the zig-zag scan and those incorporating human visual sensitivity. This flexibility distinguishes it from recent approaches to FPR of DCT images

Keywords

computational complexity; discrete cosine transforms; human factors; image reconstruction; matrix multiplication; sensitivity; sparse matrices; visual communication; DCT images; discrete cosine transform; fast progressive reconstruction; human visual sensitivity; matrix sparsity; progressive image transmission; scanning patterns; Discrete Fourier transforms; Discrete cosine transforms; Frequency; Image communication; Image reconstruction; Image retrieval; Quantization; Sparse matrices; Testing; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

System Theory, 1993. Proceedings SSST '93., Twenty-Fifth Southeastern Symposium on

Conference_Location

Tuscaloosa, AL

ISSN

0094-2898

Print_ISBN

0-8186-3560-6

Type

conf

DOI

10.1109/SSST.1993.522831

Filename

522831