Algorithmic modifications to SPIHT

U. Bayazit; W. A. Pearlman

Algorithmic modifications to SPIHT

U. Bayazit^*, W. A. Pearlman

^*Bu çalışma için yazışmadan sorumlu yazar

Isik University

Araştırma sonucu: Konferansa katkı › Yazı › bilirkişi

10 Atıf (Scopus)

Özet

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.

Orijinal dil	İngilizce
Sayfalar	800-803
Sayfa sayısı	4
Yayın durumu	Yayınlandı - 2001
Harici olarak yayınlandı	Evet
Etkinlik	IEEE International Conference on Image Processing (ICIP) - Thessaloniki, Greece Süre: 7 Eki 2001 → 10 Eki 2001

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???	IEEE International Conference on Image Processing (ICIP)
Ülke/Bölge	Greece
Şehir	Thessaloniki
Periyot	7/10/01 → 10/10/01

Diğer Dosyalar ve Linkler

Link to publication in Scopus

Alıntı Yap

@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 - http://www.scopus.com/inward/record.url?scp=0035160228&partnerID=8YFLogxK

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

Özet

???event.eventtypes.event.conference???

Diğer Dosyalar ve Linkler

Parmak izi

Alıntı Yap