Algorithmic modifications to SPIHT

U. Bayazit; W. A. Pearlman

Algorithmic modifications to SPIHT

U. Bayazit^*
, W. A. Pearlman

^*Corresponding author for this work

Isik University

Research output: Contribution to conference › Paper › peer-review

10 Citations (Scopus)

Abstract

This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit universal traits common to the real world images. Approximately 1-2% compression gain (bit rate reduction for a given mean squared error) has been obtained for the images in our test suite by incorporating all of the proposed modifications into SPIHT.

Original language	English
Pages	800-803
Number of pages	4
Publication status	Published - 2001
Externally published	Yes
Event	IEEE International Conference on Image Processing (ICIP) - Thessaloniki, Greece Duration: 7 Oct 2001 → 10 Oct 2001

Conference

Conference	IEEE International Conference on Image Processing (ICIP)
Country/Territory	Greece
City	Thessaloniki
Period	7/10/01 → 10/10/01

Cite this

@conference{c0514cdddd884dfea909299547249829,

title = "Algorithmic modifications to SPIHT",

abstract = "This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit universal traits common to the real world images. Approximately 1-2\% compression gain (bit rate reduction for a given mean squared error) has been obtained for the images in our test suite by incorporating all of the proposed modifications into SPIHT.",

author = "U. Bayazit and Pearlman, \{W. A.\}",

year = "2001",

language = "English",

pages = "800--803",

note = "IEEE International Conference on Image Processing (ICIP) ; Conference date: 07-10-2001 Through 10-10-2001",

}

TY - CONF

T1 - Algorithmic modifications to SPIHT

AU - Bayazit, U.

AU - Pearlman, W. A.

PY - 2001

Y1 - 2001

N2 - This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit universal traits common to the real world images. Approximately 1-2% compression gain (bit rate reduction for a given mean squared error) has been obtained for the images in our test suite by incorporating all of the proposed modifications into SPIHT.

AB - This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit universal traits common to the real world images. Approximately 1-2% compression gain (bit rate reduction for a given mean squared error) has been obtained for the images in our test suite by incorporating all of the proposed modifications into SPIHT.

UR - https://www.scopus.com/pages/publications/0035160228

M3 - Paper

AN - SCOPUS:0035160228

SP - 800

EP - 803

T2 - IEEE International Conference on Image Processing (ICIP)

Y2 - 7 October 2001 through 10 October 2001

ER -

Algorithmic modifications to SPIHT

Abstract

Conference

Other files and links

Fingerprint

Cite this