Image coding with geometric wavelets

This paper describes a new and efficient method for low bit-rate image coding which is based on recent development in the theory of multivariate nonlinear piecewise polynomial approximation. It combines a binary space partition scheme with geometric wavelet (GW) tree approximation so as to efficient...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 16(2007), 1 vom: 29. Jan., Seite 69-77
1. Verfasser: Alani, Dror (VerfasserIn)
Weitere Verfasser: Averbuch, Amir, Dekel, Shai
Format: Aufsatz
Sprache:English
Veröffentlicht: 2007
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM168258404
003 DE-627
005 20231223114721.0
007 tu
008 231223s2007 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0561.xml 
035 |a (DE-627)NLM168258404 
035 |a (NLM)17283766 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Alani, Dror  |e verfasserin  |4 aut 
245 1 0 |a Image coding with geometric wavelets 
264 1 |c 2007 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 28.02.2007 
500 |a Date Revised 26.10.2019 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a This paper describes a new and efficient method for low bit-rate image coding which is based on recent development in the theory of multivariate nonlinear piecewise polynomial approximation. It combines a binary space partition scheme with geometric wavelet (GW) tree approximation so as to efficiently capture curve singularities and provide a sparse representation of the image. The GW method successfully competes with state-of-the-art wavelet methods such as the EZW, SPIHT, and EBCOT algorithms. We report a gain of about 0.4 dB over the SPIHT and EBCOT algorithms at the bit-rate 0.0625 bits-per-pixels (bpp). It also outperforms other recent methods that are based on "sparse geometric representation." For example, we report a gain of 0.27 dB over the Bandelets algorithm at 0.1 bpp. Although the algorithm is computationally intensive, its time complexity can be significantely reduced by collecting a "global" GW n-term approximation to the image from a collection of GW trees, each constructed separately over tiles of the image 
650 4 |a Journal Article 
700 1 |a Averbuch, Amir  |e verfasserin  |4 aut 
700 1 |a Dekel, Shai  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 16(2007), 1 vom: 29. Jan., Seite 69-77  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:16  |g year:2007  |g number:1  |g day:29  |g month:01  |g pages:69-77 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 16  |j 2007  |e 1  |b 29  |c 01  |h 69-77