Image compression via Quadtree decomposition of wavelets

E. Shusterman, M. Feder

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this work we propose a simple, yet efficient algorithm for image compression. At the first step we obtain the multi-resolution representation of an image. Next, by building Quadtrees in three directions and coding them by the algorithm proposed in [4], we try to exploit the residual correlation between and within different resolution levels. As it shown by simulations, the proposed algorithm performs well without any pre/post-processing.

Original languageEnglish
Title of host publicationConference Record of the 29th Asilomar Conference on Signals, Systems and Computers, ACSSC 1995
EditorsAvtar Singh
PublisherIEEE Computer Society
Pages1424-1428
Number of pages5
ISBN (Electronic)0818673702
DOIs
StatePublished - 1995
Event29th Asilomar Conference on Signals, Systems and Computers, ACSSC 1995 - Pacific Grove, United States
Duration: 30 Oct 19951 Nov 1995

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
Volume2
ISSN (Print)1058-6393

Conference

Conference29th Asilomar Conference on Signals, Systems and Computers, ACSSC 1995
Country/TerritoryUnited States
CityPacific Grove
Period30/10/951/11/95

Fingerprint

Dive into the research topics of 'Image compression via Quadtree decomposition of wavelets'. Together they form a unique fingerprint.

Cite this