2004
DOI: 10.1109/tcsvt.2004.835150
|View full text |Cite
|
Sign up to set email alerts
|

Efficient, Low-Complexity Image Coding With a Set-Partitioning Embedded Block Coder

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
184
0
1

Year Published

2005
2005
2014
2014

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 328 publications
(188 citation statements)
references
References 13 publications
0
184
0
1
Order By: Relevance
“…An eventual open research work should be the adaptation of EBCOT to VSN constraints, taking advantage of some potential solutions to alleviate the workload and the complexity of the EBCOT algorithm. [46], where the authors suggest a compression algorithm that makes use of sets of pixels in the form of block when spanning wavelet subbands, instead of using trees as with EZW or SPIHT. SPECK algorithm starts by performing an appropriate subband transformation (usually, the DWT) on the input image, which allows its decomposition into a series of coefficients.…”
Section: Ebcot-based Schemes For Vsnmentioning
confidence: 99%
See 1 more Smart Citation
“…An eventual open research work should be the adaptation of EBCOT to VSN constraints, taking advantage of some potential solutions to alleviate the workload and the complexity of the EBCOT algorithm. [46], where the authors suggest a compression algorithm that makes use of sets of pixels in the form of block when spanning wavelet subbands, instead of using trees as with EZW or SPIHT. SPECK algorithm starts by performing an appropriate subband transformation (usually, the DWT) on the input image, which allows its decomposition into a series of coefficients.…”
Section: Ebcot-based Schemes For Vsnmentioning
confidence: 99%
“…A listless variant of SPECK image compression called LSK is suggested in [48]. LSK uses the block-partitioning policies of SPECK and does an explicit breadth first search, without the need for lists as in [46] or [50]. State information is kept in an array of fixed size that corresponds to the array of coefficient values, with two bits per coefficient to enable fast scanning of the bit planes.…”
Section: Speck Background Speck Is Introduced Inmentioning
confidence: 99%
“…Since redundancies within the hyper-cube can be more effectively removed, lossy compression has been widely used by many researchers, using typical approaches including vector quantisation (VQ) (Mendenhall and Merenyi 2008;Qian et al 2001;Qian 2006;Li et al 2014), principal component analysis (PCA) (Du and Fowler 2007;Zabalza, Ren, Wang, Zhang, et al 2014;Ren et al 2014) and transform-domain approaches (Kim, Xiong, and Pearlman 2000;Pearlman et al 2004;Said and Pearlman 1996). In Chen's work (Chen 1998), it was found that although it is simple, the VQ approach is inappropriate for low bit rate compression.…”
Section: Introductionmentioning
confidence: 99%
“…For two dimensions, starting with Shapiro's pioneering work on Embedded Zerotree Wavelet (EZW) coding [1] to the JPEG 2000 [2,3] image compression standard to the new 2D lossy-to-lossless compression algorithm recently standardized by the Consultative Committee for Space Data Systems (CCSDS) [4,5], SPC has served as an auxiliary component to the coding efficiency of wavelet-based approaches. SPC has also been successfully applied into several other well-known image coding algorithms including SPIHT [6], SPECK [7], SWEET [8], SBHP [9] and EZBC [10]. As an effective way of representing image data in the wavelet domain, SPC (sometimes combined with other entropy coding methods, such as arithmetic coding) takes advantage of the beneficial localization properties of wavelet transforms to achieve competitive rate-distortion performance.…”
Section: Introductionmentioning
confidence: 99%