2 * Copyright (c) 2001-2002, David Janssens
\r
3 * Copyright (c) 2002-2004, Yannick Verschueren
\r
4 * Copyright (c) 2002-2004, Communications and remote sensing Laboratory, Universite catholique de Louvain, Belgium
\r
5 * Copyright (c) 2005, Reiner Wahler
\r
6 * All rights reserved.
\r
8 * Redistribution and use in source and binary forms, with or without
\r
9 * modification, are permitted provided that the following conditions
\r
11 * 1. Redistributions of source code must retain the above copyright
\r
12 * notice, this list of conditions and the following disclaimer.
\r
13 * 2. Redistributions in binary form must reproduce the above copyright
\r
14 * notice, this list of conditions and the following disclaimer in the
\r
15 * documentation and/or other materials provided with the distribution.
\r
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
\r
18 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
\r
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
\r
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
\r
21 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
\r
22 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
\r
23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
\r
24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
\r
25 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
\r
26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
\r
27 * POSSIBILITY OF SUCH DAMAGE.
\r
32 * This is a modified version of the openjpeg dwt.c file.
\r
33 * Average speed improvement compared to the original file (measured on
\r
34 * my own machine, a P4 running at 3.0 GHz):
\r
35 * 5x3 wavelets about 2 times faster
\r
36 * 9x7 wavelets about 3 times faster
\r
37 * for both, encoding and decoding.
\r
39 * The better performance is caused by doing the 1-dimensional DWT
\r
40 * within a temporary buffer where the data can be accessed sequential
\r
41 * for both directions, horizontal and vertical. The 2d vertical DWT was
\r
42 * the major bottleneck in the former version.
\r
44 * I have also removed the "Add Patrick" part because it is not longer
\r
48 * -Ive (aka Reiner Wahler)
\r
49 * mail: ive@lilysoft.com
\r
59 #define S(i) a[(i)*2]
\r
60 #define D(i) a[(1+(i)*2)]
\r
61 #define S_(i) ((i)<0?S(0):((i)>=sn?S(sn-1):S(i)))
\r
62 #define D_(i) ((i)<0?D(0):((i)>=dn?D(dn-1):D(i)))
\r
64 #define SS_(i) ((i)<0?S(0):((i)>=dn?S(dn-1):S(i)))
\r
65 #define DD_(i) ((i)<0?D(0):((i)>=sn?D(sn-1):D(i)))
\r
68 /* This table contains the norms of the 5-3 wavelets for different bands. */
\r
70 double dwt_norms[4][10] = {
\r
71 {1.000, 1.500, 2.750, 5.375, 10.68, 21.34, 42.67, 85.33, 170.7, 341.3},
\r
72 {1.038, 1.592, 2.919, 5.703, 11.33, 22.64, 45.25, 90.48, 180.9},
\r
73 {1.038, 1.592, 2.919, 5.703, 11.33, 22.64, 45.25, 90.48, 180.9},
\r
74 {.7186, .9218, 1.586, 3.043, 6.019, 12.01, 24.00, 47.97, 95.93}
\r
78 /* This table contains the norms of the 9-7 wavelets for different bands. */
\r
80 double dwt_norms_real[4][10] = {
\r
81 {1.000, 1.965, 4.177, 8.403, 16.90, 33.84, 67.69, 135.3, 270.6, 540.9},
\r
82 {2.022, 3.989, 8.355, 17.04, 34.27, 68.63, 137.3, 274.6, 549.0},
\r
83 {2.022, 3.989, 8.355, 17.04, 34.27, 68.63, 137.3, 274.6, 549.0},
\r
84 {2.080, 3.865, 8.307, 17.18, 34.71, 69.59, 139.3, 278.6, 557.2}
\r
89 /* Forward lazy transform (horizontal). */
\r
91 void dwt_deinterleave_h(int *a, int *b, int dn, int sn, int cas) {
\r
93 for (i=0; i<sn; i++) b[i]=a[2*i+cas];
\r
94 for (i=0; i<dn; i++) b[sn+i]=a[(2*i+1-cas)];
\r
98 /* Forward lazy transform (vertical). */
\r
100 void dwt_deinterleave_v(int *a, int *b, int dn, int sn, int x, int cas) {
\r
102 for (i=0; i<sn; i++) b[i*x]=a[2*i+cas];
\r
103 for (i=0; i<dn; i++) b[(sn+i)*x]=a[(2*i+1-cas)];
\r
107 /* Inverse lazy transform (horizontal). */
\r
109 void dwt_interleave_h(int *a, int *b, int dn, int sn, int cas) {
\r
111 /* for (i=0; i<sn; i++) b[2*i+cas]=a[i];*/
\r
112 /* for (i=0; i<dn; i++) b[2*i+1-cas]=a[(sn+i)];*/
\r
117 for (i=0; i<sn; i++) {
\r
118 *bi = *ai; bi+=2; ai++;
\r
122 for (i=0; i<dn; i++) {
\r
123 *bi = *ai; bi+=2; ai++;
\r
128 /* Inverse lazy transform (vertical). */
\r
130 void dwt_interleave_v(int *a, int *b, int dn, int sn, int x, int cas) {
\r
132 /* for (i=0; i<sn; i++) b[2*i+cas]=a[i*x];*/
\r
133 /* for (i=0; i<dn; i++) b[2*i+1-cas]=a[(sn+i)*x];*/
\r
138 for (i=0; i<sn; i++) {
\r
139 *bi = *ai; bi+=2; ai+=x;
\r
143 for (i=0; i<dn; i++) {
\r
144 *bi = *ai; bi+=2; ai+=x;
\r
150 /* Forward 5-3 wavelet tranform in 1-D. */
\r
152 void dwt_encode_1(int *a, int dn, int sn, int cas)
\r
157 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
\r
158 for (i = 0; i < dn; i++) D(i) -= (S_(i) + S_(i + 1)) >> 1;
\r
159 for (i = 0; i < sn; i++) S(i) += (D_(i - 1) + D_(i) + 2) >> 2;
\r
162 if (!sn && dn == 1) /* NEW : CASE ONE ELEMENT */
\r
165 for (i = 0; i < dn; i++) S(i) -= (DD_(i) + DD_(i - 1)) >> 1;
\r
166 for (i = 0; i < sn; i++) D(i) += (SS_(i) + SS_(i + 1) + 2) >> 2;
\r
173 /* Inverse 5-3 wavelet tranform in 1-D. */
\r
175 void dwt_decode_1(int *a, int dn, int sn, int cas)
\r
180 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
\r
181 for (i = 0; i < sn; i++) S(i) -= (D_(i - 1) + D_(i) + 2) >> 2;
\r
182 for (i = 0; i < dn; i++) D(i) += (S_(i) + S_(i + 1)) >> 1;
\r
185 if (!sn && dn == 1) /* NEW : CASE ONE ELEMENT */
\r
188 for (i = 0; i < sn; i++) D(i) -= (SS_(i) + SS_(i + 1) + 2) >> 2;
\r
189 for (i = 0; i < dn; i++) S(i) += (DD_(i) + DD_(i - 1)) >> 1;
\r
196 /* Forward 5-3 wavelet tranform in 2-D. */
\r
198 void dwt_encode(tcd_tilecomp_t * tilec)
\r
206 w = tilec->x1-tilec->x0;
\r
207 l = tilec->numresolutions-1;
\r
210 for (i = 0; i < l; i++) {
\r
211 int rw; /* width of the resolution level computed */
\r
212 int rh; /* heigth of the resolution level computed */
\r
213 int rw1; /* width of the resolution level once lower than computed one */
\r
214 int rh1; /* height of the resolution level once lower than computed one */
\r
215 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
\r
216 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
\r
219 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
\r
220 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
\r
221 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
\r
222 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
\r
224 cas_row = tilec->resolutions[l - i].x0 % 2;
\r
225 cas_col = tilec->resolutions[l - i].y0 % 2;
\r
230 bj=(int*)malloc(rh*sizeof(int));
\r
231 for (j=0; j<rw; j++) {
\r
233 for (k=0; k<rh; k++) bj[k]=aj[k*w];
\r
234 dwt_encode_1(bj, dn, sn, cas_col);
\r
235 dwt_deinterleave_v(bj, aj, dn, sn, w, cas_col);
\r
241 bj=(int*)malloc(rw*sizeof(int));
\r
242 for (j=0; j<rh; j++) {
\r
244 for (k=0; k<rw; k++) bj[k]=aj[k];
\r
245 dwt_encode_1(bj, dn, sn, cas_row);
\r
246 dwt_deinterleave_h(bj, aj, dn, sn, cas_row);
\r
254 /* Inverse 5-3 wavelet tranform in 2-D. */
\r
256 void dwt_decode(tcd_tilecomp_t * tilec, int stop)
\r
264 w = tilec->x1-tilec->x0;
\r
265 l = tilec->numresolutions-1;
\r
268 for (i = l - 1; i >= stop; i--) {
\r
269 int rw; /* width of the resolution level computed */
\r
270 int rh; /* heigth of the resolution level computed */
\r
271 int rw1; /* width of the resolution level once lower than computed one */
\r
272 int rh1; /* height of the resolution level once lower than computed one */
\r
273 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
\r
274 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
\r
277 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
\r
278 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
\r
279 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
\r
280 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
\r
282 cas_row = tilec->resolutions[l - i].x0 % 2;
\r
283 cas_col = tilec->resolutions[l - i].y0 % 2;
\r
287 bj=(int*)malloc(rw*sizeof(int));
\r
288 for (j = 0; j < rh; j++) {
\r
290 dwt_interleave_h(aj, bj, dn, sn, cas_row);
\r
291 dwt_decode_1(bj, dn, sn, cas_row);
\r
292 for (k = 0; k < rw; k++) aj[k] = bj[k];
\r
298 bj=(int*)malloc(rh*sizeof(int));
\r
299 for (j = 0; j < rw; j++) {
\r
301 dwt_interleave_v(aj, bj, dn, sn, w, cas_col);
\r
302 dwt_decode_1(bj, dn, sn, cas_col);
\r
303 for (k = 0; k < rh; k++) aj[k * w] = bj[k];
\r
312 /* Get gain of 5-3 wavelet transform. */
\r
314 int dwt_getgain(int orient)
\r
318 if (orient == 1 || orient == 2)
\r
324 /* Get norm of 5-3 wavelet. */
\r
326 double dwt_getnorm(int level, int orient)
\r
328 return dwt_norms[orient][level];
\r
332 /* Forward 9-7 wavelet transform in 1-D. */
\r
334 void dwt_encode_1_real(int *a, int dn, int sn, int cas)
\r
338 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
\r
339 for (i = 0; i < dn; i++)
\r
340 D(i) -= fix_mul(S_(i) + S_(i + 1), 12993);
\r
341 for (i = 0; i < sn; i++)
\r
342 S(i) -= fix_mul(D_(i - 1) + D_(i), 434);
\r
343 for (i = 0; i < dn; i++)
\r
344 D(i) += fix_mul(S_(i) + S_(i + 1), 7233);
\r
345 for (i = 0; i < sn; i++)
\r
346 S(i) += fix_mul(D_(i - 1) + D_(i), 3633);
\r
347 for (i = 0; i < dn; i++)
\r
348 D(i) = fix_mul(D(i), 5038); /*5038 */
\r
349 for (i = 0; i < sn; i++)
\r
350 S(i) = fix_mul(S(i), 6659); /*6660 */
\r
353 if ((sn > 0) || (dn > 1)) { /* NEW : CASE ONE ELEMENT */
\r
354 for (i = 0; i < dn; i++)
\r
355 S(i) -= fix_mul(DD_(i) + DD_(i - 1), 12993);
\r
356 for (i = 0; i < sn; i++)
\r
357 D(i) -= fix_mul(SS_(i) + SS_(i + 1), 434);
\r
358 for (i = 0; i < dn; i++)
\r
359 S(i) += fix_mul(DD_(i) + DD_(i - 1), 7233);
\r
360 for (i = 0; i < sn; i++)
\r
361 D(i) += fix_mul(SS_(i) + SS_(i + 1), 3633);
\r
362 for (i = 0; i < dn; i++)
\r
363 S(i) = fix_mul(S(i), 5038); /*5038 */
\r
364 for (i = 0; i < sn; i++)
\r
365 D(i) = fix_mul(D(i), 6659); /*6660 */
\r
371 /* Inverse 9-7 wavelet transform in 1-D. */
\r
373 void dwt_decode_1_real(int *a, int dn, int sn, int cas)
\r
377 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
\r
378 for (i = 0; i < sn; i++)
\r
379 S(i) = fix_mul(S(i), 10078); /* 10076 */
\r
380 for (i = 0; i < dn; i++)
\r
381 D(i) = fix_mul(D(i), 13318); /* 13320 */
\r
382 for (i = 0; i < sn; i++)
\r
383 S(i) -= fix_mul(D_(i - 1) + D_(i), 3633);
\r
384 for (i = 0; i < dn; i++)
\r
385 D(i) -= fix_mul(S_(i) + S_(i + 1), 7233);
\r
386 for (i = 0; i < sn; i++)
\r
387 S(i) += fix_mul(D_(i - 1) + D_(i), 434);
\r
388 for (i = 0; i < dn; i++)
\r
389 D(i) += fix_mul(S_(i) + S_(i + 1), 12994); /* 12993 */
\r
392 if ((sn > 0) || (dn > 1)) { /* NEW : CASE ONE ELEMENT */
\r
393 for (i = 0; i < sn; i++)
\r
394 D(i) = fix_mul(D(i), 10078); /* 10076 */
\r
395 for (i = 0; i < dn; i++)
\r
396 S(i) = fix_mul(S(i), 13318); /* 13320 */
\r
397 for (i = 0; i < sn; i++)
\r
398 D(i) -= fix_mul(SS_(i) + SS_(i + 1), 3633);
\r
399 for (i = 0; i < dn; i++)
\r
400 S(i) -= fix_mul(DD_(i) + DD_(i - 1), 7233);
\r
401 for (i = 0; i < sn; i++)
\r
402 D(i) += fix_mul(SS_(i) + SS_(i + 1), 434);
\r
403 for (i = 0; i < dn; i++)
\r
404 S(i) += fix_mul(DD_(i) + DD_(i - 1), 12994); /* 12993 */
\r
410 /* Forward 9-7 wavelet transform in 2-D. */
\r
413 void dwt_encode_real(tcd_tilecomp_t * tilec)
\r
421 w = tilec->x1-tilec->x0;
\r
422 l = tilec->numresolutions-1;
\r
425 for (i = 0; i < l; i++) {
\r
426 int rw; /* width of the resolution level computed */
\r
427 int rh; /* heigth of the resolution level computed */
\r
428 int rw1; /* width of the resolution level once lower than computed one */
\r
429 int rh1; /* height of the resolution level once lower than computed one */
\r
430 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
\r
431 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
\r
434 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
\r
435 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
\r
436 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
\r
437 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
\r
439 cas_row = tilec->resolutions[l - i].x0 % 2;
\r
440 cas_col = tilec->resolutions[l - i].y0 % 2;
\r
444 bj=(int*)malloc(rh*sizeof(int));
\r
445 for (j = 0; j < rw; j++) {
\r
447 for (k = 0; k < rh; k++) bj[k] = aj[k*w];
\r
448 dwt_encode_1_real(bj, dn, sn, cas_col);
\r
449 dwt_deinterleave_v(bj, aj, dn, sn, w, cas_col);
\r
455 bj=(int*)malloc(rw*sizeof(int));
\r
456 for (j = 0; j < rh; j++) {
\r
458 for (k = 0; k < rw; k++) bj[k] = aj[k];
\r
459 dwt_encode_1_real(bj, dn, sn, cas_row);
\r
460 dwt_deinterleave_h(bj, aj, dn, sn, cas_row);
\r
468 /* Inverse 9-7 wavelet transform in 2-D. */
\r
470 void dwt_decode_real(tcd_tilecomp_t * tilec, int stop)
\r
479 w = tilec->x1-tilec->x0;
\r
480 l = tilec->numresolutions-1;
\r
483 for (i = l-1; i >= stop; i--) {
\r
484 int rw; /* width of the resolution level computed */
\r
485 int rh; /* heigth of the resolution level computed */
\r
486 int rw1; /* width of the resolution level once lower than computed one */
\r
487 int rh1; /* height of the resolution level once lower than computed one */
\r
488 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
\r
489 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
\r
492 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
\r
493 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
\r
494 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
\r
495 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
\r
497 cas_col = tilec->resolutions[l - i].x0 % 2; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
\r
498 cas_row = tilec->resolutions[l - i].y0 % 2; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
\r
502 bj = (int*)malloc(rw * sizeof(int));
\r
503 for (j = 0; j < rh; j++) {
\r
505 dwt_interleave_h(aj, bj, dn, sn, cas_col);
\r
506 dwt_decode_1_real(bj, dn, sn, cas_col);
\r
507 for (k = 0; k < rw; k++) aj[k] = bj[k];
\r
513 bj = (int*)malloc(rh * sizeof(int));
\r
514 for (j=0; j<rw; j++) {
\r
516 dwt_interleave_v(aj, bj, dn, sn, w, cas_row);
\r
517 dwt_decode_1_real(bj, dn, sn, cas_row);
\r
518 for (k = 0; k < rh; k++) aj[k * w] = bj[k];
\r
526 /* Get gain of 9-7 wavelet transform. */
\r
528 int dwt_getgain_real(int orient)
\r
535 /* Get norm of 9-7 wavelet. */
\r
537 double dwt_getnorm_real(int level, int orient)
\r
539 return dwt_norms_real[orient][level];
\r