270

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 1, JANUARY 2011

TABLE II COLOR-IMAGE DENOISING: OUTPUT PSNR COMPARISON BETWEEN [1] AND THE PROPOSED METHOD

An Improved Image Compression Algorithm Using Binary Space Partition Scheme and Geometric Wavelets
Garima Chopra and A. K. Pal

TABLE III RUNNING TIME COMPARISON BETWEEN [1] AND THE PROPOSED METHOD

AbstractGeometric wavelet is a recent development in the eld of multivariate nonlinear piecewise polynomials approximation. The present study improves the geometric wavelet (GW) image coding method by using the slope intercept representation of the straight line in the binary space partition scheme. The performance of the proposed algorithm is compared with the wavelet transform-based compression methods such as the embedded zerotree wavelet (EZW), the set partitioning in hierarchical trees (SPIHT) and the embedded block coding with optimized truncation (EBCOT), and other recently developed sparse geometric representation based compression algorithms. The proposed image compression algorithm outperforms the EZW, the Bandelets and the GW algorithm. The presented algorithm reports a gain of 0.22 dB over the GW method at the compression ratio of 64 for the Cameraman test image. Index TermsBinary space partition scheme, image compression, geometric wavelets, piecewise polynomial approximation and sparse geometric representations.

I. INTRODUCTION Digital images are ubiquitous in many application areas as diverse as internet browsing, medical sciences, astronomy and remote sensing. Once personal computers gained the capacity to display sophisticated pictures as digital images, people started to seek methods for efcient representation of these digital pictures in order to simplify their transmission and save disk space. At this point image compression became very important and highly applicable and since then it has been the researchers favorite. The eld of image compression has a wide spectrum ranging from classical lossless techniques and popular transform approaches to the more recent segmentation based (or second generation) coding methods. Further, compression techniques can be classied into lossless and lossy techniques [1]. The lossless techniques allow to compress an image without losing any information while the images reproduced by the lossy techniques are not very perfect. In the past decades, the discrete cosine transform (DCT) has been the most popular for compression because it provides optimal performance and can be implemented at a reasonable cost. Several compression algorithms, such as the JPEG standard [2] for still images and the MPEG standard [3] for video images are based on DCT [4]. However, the EZW [5], the SPIHT [6], the SPECK [7], the EBCOT [8] algorithms and the current JPEG 2000 [9] standard are based on the discrete wavelet transform (DWT) [10][12]. DWT has the ability to solve the blocking effect introduced by DCT, it also reduces the correlation between the neighboring pixels and gives multi scale sparse representation of the image. In spite of providing excellent results in terms of rate-distortion compression, the transform-based coding methods do not take an advantage of the underlying geometry of the edge singularities in an image. From
Manuscript received December 11, 2009; revised April 14, 2010; accepted June 15, 2010. Date of publication July 08, 2010; date of current version December 17, 2010. This work was supported in part by G. B. Pant University of Agriculture and Technology, Pantnagar, India, and a Junior Research Fellowship provided by the Council of Scientic and Industrial Research, Human Resource Development Group, New Delhi, India. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Eero P. Simoncelli. The authors are with the College of Basic Sciences and Humanities, G. B. Pant University of Agriculture and Technology, 263145 Pantnagar, India (e-mail: garima.chopra@gmail.com; arun_pal1969@yahoo.co.in). Digital Object Identier 10.1109/TIP.2010.2056378

IV. CONCLUSION The proposed modication in this comment achieves better denoising results than [1], especially the changing of the DCT to make the algorithm more consistent and introduce less artifacts than original method. Due to the decrease in block size, the time complexity is also lower in the proposed method. ACKNOWLEDGMENT The authors would like to thank X. Qu (Xiamen Univesity) and A. Christodoulou (University of Illinois at Urbana-Champaign) for their helpful discussions and the anonymous reviewers for their insightful reviews.

REFERENCES
[1] K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, Image denoising by sparse 3D transform-domain collaborative ltering, IEEE Trans. Image Process., vol. 16, no. 8, pp. 20802095, Aug. 2007. [2] S. Lansel, D. Donoho, and T. Weissman, DenoiseLab: A standard test set and evaluation method to compare denoising algorithms, Stanford University, Stanford, CA [Online]. Available: http://www.stanford.edu/slansel/DenoiseLab/ [3] K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, A nonlocal and shape-adaptive transform-domain collaborative ltering, in Proc. Int. Workshop Local and Non-Local Approx. Image Process., Lausanne, Switzerland, Aug. 2008, pp. 179186. [4] K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, BM3D image denoising with shape-adaptive principal component analysis, in Proc. Workshop Signal Process. Adaptive Sparse Structured Represent., Saint-Malo, France, Apr. 2009.

1057-7149/$26.00 2010 IEEE

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 1, JANUARY 2011

271

the mid 80s there have been many attempts to design second generation image coding techniques that exploit the geometry of the edge singularities of an image. Recently, many image compression algorithms such as the Bandelets [13], the Prune tree [14], the Prune-Join tree [14], and the GW image coding method [15] based on the sparse geometric representation have been introduced. The present study is envisaged to improve the GW image coding [15] method. The slope intercept form of the straight line is used in the binary space partition scheme (BSP). The number of quantized bisecting lines is enlarged and hence probability of minimizing the cost functional and nding the optimal cut of the domain is increased.

Quantization step size of parameter p corresponding to orientation i is max(cos i ; sin i ). B. Geometric Wavelet Geometric wavelet is the recent development in the eld of multivariate nonlinear piecewise polynomial approximation [19], [20] and appears for the rst time in [21]. Geometric wavelets have been considered in context of image compression in [15]. Geometric wavelet, 9
associated with the subdomain
0 and function f is given by
1 1 9
= 9
(f ) = 1
(Q
0 Q
)

II. BASIC CONCEPTS The basic concepts of the BSP technique and the geometric wavelet are described as follows: A. Binary Space Partitioning Technique Segmentation techniques partition the digital image into a set of different geometric regions which are approximated by simple functions (low order polynomials). Segmentation based image coding methods were introduced during the early 1980 [16], [17]. Since then, many segmentation techniques have been developed and among them the BSP scheme [18] is a simple and effective method. The most challenging aspect of a segmentation based coding approach is to balance between a small number of geometrically simple regions and the smoothness of the image signal within these regions. BSP scheme achieves the above balance by using a simple, yet exible description of the images. It has wide applications in the eld of image processing and computer graphics. This technique subdivides an initial convex domain into two subdomains by intersecting it with a hyperplane. In image processing applications, the convex domain is the plane on which a straight line acts as a hyperplane. The subdivision process is performed to minimize the given cost functional. The BSP approach partitions the desired image recursively by straight lines in a hierarchical manner. In a convex polygonal domain
with a function f 2 L2 ([0; 1]2 ), BSP algorithm is applied to nd two subdomains
0 and
00 and two bivariate linear polynomials Q
and Q
by using the least square method to minimize the cost functional

(3)

where
0 is a child of
in a BSP tree, i.e.,
0 
and Q
; Q
are the polynomial approximations found by (1). Like isotropic wavelets [22], 9
is a local difference component that belongs to the detail space between two levels in the BSP tree, a low resolution level associated with
and a high resolution level associated with
0 . Geometric wavelets also satisfy the vanishing moment property i.e., if f is locally a polynomial over
then minimizing of (1) gives Q
= Q
= f , and therefore 9
= 0. However, unlike classical wavelets, geometric wavelets do not satisfy the two scale relation and the biorthogonality property. They do not form even a basis of L2 , nevertheless they can be used in the adaptive approximation [19], [21]. If P is a full BSP tree, then under certain mild conditions onP , we have [21]

f
where

9
(f ); a:e: in [0; 1]2

(4)

1 1 9[0;1] = 9[0;1] (f ) = 1[0;1]

Q[0;1] :

(5)

GW image coding algorithm [15] is based on the fact that among all the geometric wavelets only a few wavelets have large norm. Once all the geometric wavelets are created, they are sorted according to their L2 norm, i.e.,

kf 0 Q
k + kf 0 Q
k
2

 9

 9

 111

(6)

(1) and then the sparse geometric representation is extracted using the greedy methodology of nonlinear approximation. Thereafter, function f is approximated using the n-term geometric wavelet sum

The same process is applied on the resulting subdomains

0 and
00 . This procedure is repeated until some exit criterion is met. The bisecting lines of the BSP scheme in [15], [18] are uniformly quantized using the normal representation of the straight line i.e., p = x cos  + y sin  , where p is the normal distance between the line and an origin point close to the subdivided domain and  is the angle between the lines normal and the x axis. The set of possible bisecting lines in [15], [18] is discritized by the parameters  and p of the normal representation of the line. Quantization step size of the parameter  depends upon the size of the polygonal domain which is dened as the smallest power of two, which is larger than the diameter of the bounding box [15]. Quantization step size of  in [15] is (35)=(2 1 #), where # is the number of line orientations and is given by

j =1

(7)

where n is the number of wavelets used in the sparse representation. This sum is the generalization of the classical greedy wavelet n-term approximation [22], [23].

III. PROPOSED ALGORITHM The proposed algorithm consists of ve steps as given below: 1) construction of BSP forest; 2) sparse geometric representation extraction; 3) encoding; 4) rate distortion optimization process; and 5) decoding.

# = min 2j 2 MN
p  1

(2)

where M and N are the dimensions of the bounding box. The size of quantization step of parameter p in [15] depends on the orientation  .

272

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 1, JANUARY 2011

Fig. 1. Tilling of cameraman image of size 256

2 256.
Fig. 3. Quantization step size of 1 which reveals new set of pixels for 8 = 45.

polygonal domain dened in [15] and given by (2). Thus, the discrete set of line orientations for the polygon
is

5 8 = i 1 #8 ; where i = 1; 2; 3; . . . . . . ; #8 0 1:
i

(10)

Fig. 2. Parameters 8 and c of slope intercept form of line.

The difference between the proposed algorithm and the GW method lies in the rst step, i.e., the construction of the BSP forest. In the proposed method slope intercept form of a straight line is used. A. Construction of BSP Forest In [15], [18] BSP scheme is applied by using the normal form of the straight line, but in the proposed method slope intercept form of the line, i.e.,

While discussing the range and the quantization step size of the parameter c for the domain
, two cases 8 6= 90 and 8 = 90 are considered. 1) If 8 6= 90, then the minimum and the maximum value of the intercept c is given by

cmin (8) =
and

min (xv;yv) f(yv 0 yc) 0 tan8(xv 0 xc)g

(xv;yv)

cmax (8) =

max f(yv 0 yc) 0 tan8(xv 0 xc)g

= mx + c

(8)

is considered, where m is the slope and c is the intercept on the y axis. Thus, probability of minimizing the cost functional given in (1) is increased. BSP method is computationally intensive, therefore, considered image is rst tiled as indicated in Fig. 1 and then the BSP algorithm is applied separately on each tile, thereby resulting in a BSP forest. Tile size is generally taken as 128 2 128. It is not possible to quantize the parameter m, as it is unbounded, has value innity for the straight lines which are parallel to y axis. This problem is solved by using the new parameter 8 in place of m in (8), where 8 is the angle between the line and the x axis in the anticlockwise direction (Fig. 2). Equation (8) reduces to

respectively, where (xv; yv ) belongs to the vertex set of

and (xc; yc) is the corner vertex of the bounding box. Thus, range of the parameter c is the function of orientation 8. Quantization step size of the parameter c is taken as 1 unit because it is the smallest value that reveals a new set of pixels as depicted in Fig. 3. So, for each 8i 6= 90, we have

= cmin (8 ) + j; j = 0; 1; . . . ; dcmax (8 )e: (11) 2) If 8 = 90, then the straight line becomes parallel to the y axis and has the form x 0 xc = c, where c is the intercept on the x
cij
i i

axis. The minimum and the maximum values of the intercept are dened by

cmin (90) = minfxv 0 xcg

xv

and

= tan 8:x + c

(9)

cmax (90) = maxfxv 0 xcg

xv

In order to nd the range of the parameter 8 for the domain

, four cases are considered: Case 1) if 8 is in the interval [0; 5=2], BSP line is given by (9); Case 2) if 8 2 [5=2; 5], it can be set to 5=2 + 80 , where 80 2 [0; 5=2], then (9) becomes y = 0 cot80 1 x + c; Case 3) equation (9) reduces to y = tan80 1 x + c, in case 8 lies in the third quadrant; Case 4) when 8 is in the fourth quadrant, BSP line becomes y = 0 cot 80 1 x + c. From the above cases, we nd that the equations of the straight lines in Case 3) and Case 4) are similar to those of Case 1) and Case 2), respectively. Hence, the range where 8 takes values is [0; 5]. Uniform quantization step size of 8 is (5)=(#8), where #8 is the size of the

respectively. Step size is taken as 1 unit (Fig. 4) due to the same fact as given in Case 1). Thus for 8i = 90, we have

cij

= cmin (8 ) + j;
i

= 0; 1; . . . ; dcmax (90)e:

(12)

Some of the discrete pairs f8i ; cij g given by (10)(12) are out of range possibilities [15]. The encoder and the decoder do not consider such pairs. The number of bisecting lines available for the partitioning of tile of dimension 128 2 128 in [15] is 15740, but in the proposed algorithm this availability number increases to 60664. Hence, this method has better possibility to minimize the cost functional (1). There is no analytical solution to (1) so brute-force search is applied over a nite discrete predetermined set of bisecting lines. The minimum values of the cost functional (1) on the initial partitioning of each

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 1, JANUARY 2011

273

Fig. 4. Quantization step size of 1 which reveals new set of pixels for 8 = 90.

TABLE I MINIMUM VALUE OF COST FUNCTIONAL (1) ON APPLYING THE BSP SCHEME FOR FIRST TIME ON EACH OF THE TILE OF THE CAMERAMAN IMAGE

encoded. The encoding process is applied repeatedly for each of the geometric wavelet tree nodes in each tile. 1) Encoding Geometry of the Support of the Wavelet: The following information is encoded for each of the participating node
: 1) number of children of
that participate in the sparse representation; 2) in case only one child is participating, then whether it is the left or the right child; 3) if
is not a leaf node, then the line that bisects
is encoded using the slope intercept form. In [15] the term rst child is used, but here we are distinguishing between two children as the left child and the right child. Left child and right child are dened as the sets of the pixels satisfying the inequality y 0 tan 8:x  c and y 0 tan8:x > c, respectively. The leaf node is encoded by using the bit 1. Codes 00 and 01 are used for the one child symbol and the two children symbol, respectively. If only 1 child of
is participating in the sparse representation, then this event is encoded by using an additional bit. In case node is not a leaf node, then the indexes of the parameter 8 (10) and c (11), (12) of the bisecting line are encoded using the variable length coding. 2) Encoding the Coefcients of the Wavelet Polynomial: This encoding step is similar to that of the GW method. The coefcients of the wavelet polynomial are quantized and encoded using the orthonormal basis. Let V1 (x; y ) = 1; V2 (x; y ) = x and V3 (x; y ) = y , then the set fV1 ; V2 ; V3 g is the standard basis for the vector space of bivariate linear polynomials. This standard basis is orthonormalised by using the Gram Schmidt procedure. An orthonormal basis of 51 (
), where 51 (
) is the set of all bivariate linear polynomials over
is given by

of the four tiles of the Cameraman test image are given in Table I. Data presented in Table I show that in the proposed method the obtained minimum values for the tiles numbered (1), (2), and (4) (Fig. 1) is less than that of the GW method. This recursive process of subdividing the polygon
is terminated when either the area of the domain
is too is sufciently small. small or the approximation error kf 0 Q
kL B. Sparse Geometric Representation Extraction BSP forest constructed in the Step 1 consists of large number of nodes. Geometric wavelet is created for each node and thereafter they are sorted (6) according to their contribution. Sparse geometric representation is extracted using greedy approximation methodology, where n wavelets are selected from the joint list of geometric wavelets over all tiles. For the efcient encoding of extracted BSP forest it is necessary that if a child is present in the sparse representation then the parent should also be there, i.e., each BSP tree should be connected. Instead of encoding an n-term tree approximation, we generate an n + k geometric wavelet tree by considering more k nodes. The penalty for imposing the condition of the connected tree structure is not very huge, since there is high probability that if a child is signicant all its ancestors are also signicant. The encoding of the geometry of the extracted connected tree structure saves bits as only optimal cut is to be encoded. C. Encoding There are two types of information to be encoded, the geometry of the support of the wavelets participating in the sparse representation and the polynomial coefcients of the wavelet. Before encoding the extracted BSP forest, a small header is written to the compressed le. Header consists of the minimum and maximum values of the coefcients (14) of the participating wavelet and the image graylevels. Out of header size of 26 bytes, 24 are used in the storage of the minimum and the maximum values of the coefcients while 2 bytes are utilized to store the extremal values of the image. Root geometric wavelets have maximum contribution in the approximation so each root wavelet is

U1 U3

= kV1 k ; V =

V2 0 hV2 ; U1 i 1 U1 U2 = kV2 0 hV2 ; U1 i 1 U1 k 1 V3 0 hV3 ; U1 i 1 U1 0 hV3 ; U2 i 1 U2 kV3 0 hV3 ; U1 i 1 U1 0 hV3 ; U2 i 1 U2 k

(13)

where inner product and norm are associated with the space L2 (
). Let

9 =  1 U1 +  1 U2 + 1 U3

(14)

be the representation of the geometric wavelet 9 2 51 (

) in the orthonormal basis. A bit allocation scheme is applied depending upon the distribution functions of the coefcients ;  and of the wavelets participating in the sparse representation. Fig. 5 shows that there is a very high probability for the coefcients ;  and to be small. Some large coefcients are also present due to root wavelets. Four bins are used to model the absolute value of the coefcients; bin limits are computed and passed to the decoder. In case all the three coefcients of the wavelet are small, i.e., they are present in the bin containing zero, then this event is encoded using single bit, but if any one of them is not small then the bin number of each coefcient is encoded. After this quantized bits are written to the compressed le. D. Rate Distortion Optimization Process After the encoding step a rate distortion optimization process is performed in order to attain the desired bit rate. Pruning iterations are applied, where at each iteration the leaf node with minimal R-D slope is pruned until the desired rate is achieved. This method is very common and has been used in the case of isotropic wavelets [8] and in sparse geometric representation [14]. E. Decoding In this step compressed bit stream is read to nd whether the participating node is the leaf node, has 1 child or 2 children. If one child is

274

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 1, JANUARY 2011

Fig. 5. Histogram of the wavelet coefcients of Lena. Upper left: histogram of . Upper right: histogram of  . Bottom: histogram of .

participating then by using bit stream, it is found that whether it is left or right. If at least one of the children belongs to the sparse representation, then the indexes of 8 and c are decoded and using these index parameters 8i (10) and cij (11), (12) of optimal cut are calculated. Thereafter, using this optimal cut, domain is partitioned into two subdomains; and depending upon the situation vertex set of only one child or both children is found. An orthonormal basis was used during the encoding of the coefcients of geometric wavelet. Thus, before using the decoded geometric wavelets in n-term sum (7), its representation in the standard basis is found. This process is repeated until entire bit stream is read. IV. RESULTS The proposed algorithm is implemented using MATLAB and tested on the still images of Lena and Cameraman of sizes 512 2 512 and 256 2 256, respectively and bit depth 8. The PSNR (peak signal to noise ratio) based on MSE (mean square error) is used as a measure of quality. MSE and PSNR are given by the following relations:

TABLE II PSNR VALUES FOR LENA TEST IMAGE

where n 2 m is the image size, xi;j is the initial image and yi;j is the reconstructed image. MSE and PSNR are inversely proportional to each other and higher value of the PSNR produces better image compression. The performance of proposed method is compared against six algorithms. The PSNR values obtained by this method for the Lena image are compared with those obtained by the EZW [5], the SPIHT [6], the

2 PSNR = 10 log10 (255) MSE

1 MSE = n 2 m

=1 j =1

(x 0 y )2
i;j i;j

EBCOT [8], the Bandelets [13] and the GW [15] algorithms (Table II). Data presented in Table II show that the proposed method outperforms the EZW [5], the Bandelets [13] and the GW [15] methods at all the bit rates. At the compression ratios of 256 and 128, proposed method performs better than the SPIHT [6] and the EBCOT [8] algorithm, but for the ratio of 64 the EBCOT [8] algorithm has the highest PSNR value. The performance of the proposed algorithm for the Cameraman image is compared with the SPIHT [6], the Kakadu [24], and the GW [15] methods (Table III). Fig. 6 shows reconstructed images of Cameraman using the proposed method and the GW method. The proposed method reports a gain of 0.22 dB over the GW method at the compression ratio of 64 for the Cameraman image. V. CONCLUSION In this correspondence, we have proposed an improved image compression algorithm using binary space partitioning scheme and geo-

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 1, JANUARY 2011

275

Fig. 6. Left: reconstructed cameraman image at CR of 64 using proposed method. Right: reconstructed cameraman image at CR of 64 using GW method.

TABLE III PSNR VALUE FOR CAMERAMAN TEST IMAGE

metric wavelets. The presented method produces the PSNR values that are competitive with the state-of-art coders in literature. The advantage of this method is the improvement in the PSNR values at high and medium bit rates. In the proposed algorithm slope intercept form of the straight line is used and it has increased the domain of the bisecting lines and hence at each step of the BSP there is better possibility of minimizing the cost functional.

REFERENCES
[1] M. A. Losada, G. Tohumoglu, D. Fraile, and A. Artes, Multi-iteration wavelet zerotree coding for image compression, Sci. Signal Process., vol. 80, pp. 12811287, 2000. [2] G. K. Wallace, The JPEG still-picture compression standard, Commun. ACM, vol. 34, pp. 3044, Apr. 1991. [3] MPEG-2video, ITU-T-Recommendation H.262-ISO/IEC 13818-2, Jan. 1995. [4] K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications. New York: Academic, 1990. [5] J. M. Shapiro, Embedded image coding using zerotrees of wavelet coefcients, IEEE Trans. Signal Process., vol. 41, no. 12, pp. 34453462, Dec. 1993. [6] A. Said and W. A. Pearlman, A new, fast and efcient image codec based on set portioning in hierarchical trees, IEEE Trans. Circuits Syst. Video Technol., vol. 6, no. 3, pp. 243250, Jun. 1996. [7] A. Islam and W. A. Pearlman, An embedded and efcient low complexity hierarchical image coder, in Proc. SPIE, Jan. 1999, vol. 3653, pp. 294305. [8] D. Tauban, High performance scalable image compression with EBCOT, IEEE Trans. Image Process., vol. 9, no. 7, pp. 11581170, Jul. 2000.

[9] A. Skodras, C. Christopoulos, and T. Ebrahimi, The JPEG2000 still image compression standard, IEEE Signal Process. Mag., vol. 18, pp. 3658, Sep. 2001. [10] I. Daubechies, The wavelet transform, time frequency localization and signal analysis, IEEE Trans. Inf. Theory, vol. 36, no. 9, pp. 9611005, Sep. 1990. [11] S. Mallat, A theory of multiresolution signal decomposition: The wavelet representation, IEEE Trans. Pattern Anal. Mach. Intell., vol. 11, no. 7, pp. 674693, Jul. 1989. [12] M. Antonini, M. Barlaud, P. Mathieu, and I. Daubchies, Image coding using wavelet transform, IEEE Trans. Image Process., vol. 1, no. 4, pp. 205220, Apr. 1992. [13] E. L. Pennec and S. Mallat, Sparse geometric image representation with bandelets, IEEE Trans. Image Process., vol. 14, no. 4, pp. 423438, Apr. 2005. [14] R. Shukla, P. L. Daragotti, M. N. Do, and M. Vetterli, Rate-distortion optimized tree structured compression algorithms for piecewise polynomial images, IEEE Trans. Image Process., vol. 14, no. 3, pp. 343359, Mar. 2005. [15] D. Alani, A. Averbuch, and S. Dekel, Image coding with geometric wavelets, IEEE Trans. Image Process., vol. 16, no. 1, pp. 6977, Jan. 2007. [16] M. Kocher and M. Kunt, A contour-texture approach to image coding, in Proc. ICASSP, 1982, pp. 436440. [17] M. Kunt, A. Ikonomopoulos, and M. Koche, Second generation image coding techniques, Proc. IEEE, vol. 73, no. 4, pp. 549574, Apr. 1985. [18] H. Radha, M. Vetterli, and R. Leonardi, Image compression using binary space partitioning trees, IEEE Trans. Image Process., vol. 5, no. 12, pp. 16101624, Dec. 1996. [19] B. Karaivanov and P. Petrushev, Nonlinear piecewise polynomial approximation beyond Besov spaces, Appl. Comput. Harmon. Anal., vol. 15, no. 3, pp. 177223, 2003. [20] B. Karaivanov, P. Petrushev, and R. Sharpley, Algorithms for nonlinear piecewise polynomial approximation: Theoretical aspects, Trans. Amer. Math. Soc., vol. 355, pp. 25852631, 2003. [21] S. Dekel and D. Leviatan, Adaptive multivariate approximation using binary space partitions and geometric wavelets, SIAM J. Numer. Anal., vol. 43, no. 2, pp. 707732, 2005. [22] R. DeVore, Nonlinear approximation, Acta Numer., vol. 7, pp. 51150, 1998. [23] V. N. Temlyakov, Nonlinear methods of approximation, Found. Comput. Math., vol. 3, no. 3, pp. 33107, 2003. [24] Kakadu JPEG2000 Software V4.5 [Online]. Available: http://www. kakadusoftware.com/