2 * Copyright (c) 2002-2007, Communications and Remote Sensing Laboratory, Universite catholique de Louvain (UCL), Belgium
3 * Copyright (c) 2002-2007, Professor Benoit Macq
4 * Copyright (c) 2001-2003, David Janssens
5 * Copyright (c) 2002-2003, Yannick Verschueren
6 * Copyright (c) 2003-2007, Francois-Olivier Devaux and Antonin Descampe
7 * Copyright (c) 2005, Herve Drolon, FreeImage Team
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
20 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
23 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
34 * This is a modified version of the openjpeg dwt.c file.
35 * Average speed improvement compared to the original file (measured on
36 * my own machine, a P4 running at 3.0 GHz):
37 * 5x3 wavelets about 2 times faster
38 * 9x7 wavelets about 3 times faster
39 * for both, encoding and decoding.
41 * The better performance is caused by doing the 1-dimensional DWT
42 * within a temporary buffer where the data can be accessed sequential
43 * for both directions, horizontal and vertical. The 2d vertical DWT was
44 * the major bottleneck in the former version.
46 * I have also removed the "Add Patrick" part because it is not longer
50 * -Ive (aka Reiner Wahler)
51 * mail: ive@lilysoft.com
54 #include "opj_includes.h"
56 /** @defgroup DWT DWT - Implementation of a discrete wavelet transform */
59 /** @name Local static functions */
63 Forward lazy transform (horizontal)
65 static void dwt_deinterleave_h(int *a, int *b, int dn, int sn, int cas);
67 Forward lazy transform (vertical)
69 static void dwt_deinterleave_v(int *a, int *b, int dn, int sn, int x, int cas);
71 Inverse lazy transform (horizontal)
73 static void dwt_interleave_h(int *a, int *b, int dn, int sn, int cas);
75 Inverse lazy transform (vertical)
77 static void dwt_interleave_v(int *a, int *b, int dn, int sn, int x, int cas);
79 Forward 5-3 wavelet tranform in 1-D
81 static void dwt_encode_1(int *a, int dn, int sn, int cas);
83 Inverse 5-3 wavelet tranform in 1-D
85 static void dwt_decode_1(int *a, int dn, int sn, int cas);
87 Forward 9-7 wavelet transform in 1-D
89 static void dwt_encode_1_real(int *a, int dn, int sn, int cas);
91 Inverse 9-7 wavelet transform in 1-D
93 static void dwt_decode_1_real(int *a, int dn, int sn, int cas);
97 static void dwt_encode_stepsize(int stepsize, int numbps, opj_stepsize_t *bandno_stepsize);
103 #define S(i) a[(i)*2]
104 #define D(i) a[(1+(i)*2)]
105 #define S_(i) ((i)<0?S(0):((i)>=sn?S(sn-1):S(i)))
106 #define D_(i) ((i)<0?D(0):((i)>=dn?D(dn-1):D(i)))
108 #define SS_(i) ((i)<0?S(0):((i)>=dn?S(dn-1):S(i)))
109 #define DD_(i) ((i)<0?D(0):((i)>=sn?D(sn-1):D(i)))
112 /* This table contains the norms of the 5-3 wavelets for different bands. */
114 static const double dwt_norms[4][10] = {
115 {1.000, 1.500, 2.750, 5.375, 10.68, 21.34, 42.67, 85.33, 170.7, 341.3},
116 {1.038, 1.592, 2.919, 5.703, 11.33, 22.64, 45.25, 90.48, 180.9},
117 {1.038, 1.592, 2.919, 5.703, 11.33, 22.64, 45.25, 90.48, 180.9},
118 {.7186, .9218, 1.586, 3.043, 6.019, 12.01, 24.00, 47.97, 95.93}
122 /* This table contains the norms of the 9-7 wavelets for different bands. */
124 static const double dwt_norms_real[4][10] = {
125 {1.000, 1.965, 4.177, 8.403, 16.90, 33.84, 67.69, 135.3, 270.6, 540.9},
126 {2.022, 3.989, 8.355, 17.04, 34.27, 68.63, 137.3, 274.6, 549.0},
127 {2.022, 3.989, 8.355, 17.04, 34.27, 68.63, 137.3, 274.6, 549.0},
128 {2.080, 3.865, 8.307, 17.18, 34.71, 69.59, 139.3, 278.6, 557.2}
132 ==========================================================
134 ==========================================================
138 /* Forward lazy transform (horizontal). */
140 static void dwt_deinterleave_h(int *a, int *b, int dn, int sn, int cas) {
142 for (i=0; i<sn; i++) b[i]=a[2*i+cas];
143 for (i=0; i<dn; i++) b[sn+i]=a[(2*i+1-cas)];
147 /* Forward lazy transform (vertical). */
149 static void dwt_deinterleave_v(int *a, int *b, int dn, int sn, int x, int cas) {
151 for (i=0; i<sn; i++) b[i*x]=a[2*i+cas];
152 for (i=0; i<dn; i++) b[(sn+i)*x]=a[(2*i+1-cas)];
156 /* Inverse lazy transform (horizontal). */
158 static void dwt_interleave_h(int *a, int *b, int dn, int sn, int cas) {
164 for (i = 0; i < sn; i++) {
171 for (i = 0; i < dn; i++) {
179 /* Inverse lazy transform (vertical). */
181 static void dwt_interleave_v(int *a, int *b, int dn, int sn, int x, int cas) {
187 for (i = 0; i < sn; i++) {
194 for (i = 0; i < dn; i++) {
203 /* Forward 5-3 wavelet tranform in 1-D. */
205 static void dwt_encode_1(int *a, int dn, int sn, int cas) {
209 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
210 for (i = 0; i < dn; i++) D(i) -= (S_(i) + S_(i + 1)) >> 1;
211 for (i = 0; i < sn; i++) S(i) += (D_(i - 1) + D_(i) + 2) >> 2;
214 if (!sn && dn == 1) /* NEW : CASE ONE ELEMENT */
217 for (i = 0; i < dn; i++) S(i) -= (DD_(i) + DD_(i - 1)) >> 1;
218 for (i = 0; i < sn; i++) D(i) += (SS_(i) + SS_(i + 1) + 2) >> 2;
224 /* Inverse 5-3 wavelet tranform in 1-D. */
226 static void dwt_decode_1(int *a, int dn, int sn, int cas) {
230 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
231 for (i = 0; i < sn; i++) S(i) -= (D_(i - 1) + D_(i) + 2) >> 2;
232 for (i = 0; i < dn; i++) D(i) += (S_(i) + S_(i + 1)) >> 1;
235 if (!sn && dn == 1) /* NEW : CASE ONE ELEMENT */
238 for (i = 0; i < sn; i++) D(i) -= (SS_(i) + SS_(i + 1) + 2) >> 2;
239 for (i = 0; i < dn; i++) S(i) += (DD_(i) + DD_(i - 1)) >> 1;
245 /* Forward 9-7 wavelet transform in 1-D. */
247 static void dwt_encode_1_real(int *a, int dn, int sn, int cas) {
250 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
251 for (i = 0; i < dn; i++)
252 D(i) -= fix_mul(S_(i) + S_(i + 1), 12993);
253 for (i = 0; i < sn; i++)
254 S(i) -= fix_mul(D_(i - 1) + D_(i), 434);
255 for (i = 0; i < dn; i++)
256 D(i) += fix_mul(S_(i) + S_(i + 1), 7233);
257 for (i = 0; i < sn; i++)
258 S(i) += fix_mul(D_(i - 1) + D_(i), 3633);
259 for (i = 0; i < dn; i++)
260 D(i) = fix_mul(D(i), 5038); /*5038 */
261 for (i = 0; i < sn; i++)
262 S(i) = fix_mul(S(i), 6659); /*6660 */
265 if ((sn > 0) || (dn > 1)) { /* NEW : CASE ONE ELEMENT */
266 for (i = 0; i < dn; i++)
267 S(i) -= fix_mul(DD_(i) + DD_(i - 1), 12993);
268 for (i = 0; i < sn; i++)
269 D(i) -= fix_mul(SS_(i) + SS_(i + 1), 434);
270 for (i = 0; i < dn; i++)
271 S(i) += fix_mul(DD_(i) + DD_(i - 1), 7233);
272 for (i = 0; i < sn; i++)
273 D(i) += fix_mul(SS_(i) + SS_(i + 1), 3633);
274 for (i = 0; i < dn; i++)
275 S(i) = fix_mul(S(i), 5038); /*5038 */
276 for (i = 0; i < sn; i++)
277 D(i) = fix_mul(D(i), 6659); /*6660 */
283 /* Inverse 9-7 wavelet transform in 1-D. */
285 static void dwt_decode_1_real(int *a, int dn, int sn, int cas) {
288 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
289 for (i = 0; i < sn; i++)
290 S(i) = fix_mul(S(i), 10078); /* 10076 */
291 for (i = 0; i < dn; i++)
292 D(i) = fix_mul(D(i), 13318); /* 13320 */
293 for (i = 0; i < sn; i++)
294 S(i) -= fix_mul(D_(i - 1) + D_(i), 3633);
295 for (i = 0; i < dn; i++)
296 D(i) -= fix_mul(S_(i) + S_(i + 1), 7233);
297 for (i = 0; i < sn; i++)
298 S(i) += fix_mul(D_(i - 1) + D_(i), 434);
299 for (i = 0; i < dn; i++)
300 D(i) += fix_mul(S_(i) + S_(i + 1), 12994); /* 12993 */
303 if ((sn > 0) || (dn > 1)) { /* NEW : CASE ONE ELEMENT */
304 for (i = 0; i < sn; i++)
305 D(i) = fix_mul(D(i), 10078); /* 10076 */
306 for (i = 0; i < dn; i++)
307 S(i) = fix_mul(S(i), 13318); /* 13320 */
308 for (i = 0; i < sn; i++)
309 D(i) -= fix_mul(SS_(i) + SS_(i + 1), 3633);
310 for (i = 0; i < dn; i++)
311 S(i) -= fix_mul(DD_(i) + DD_(i - 1), 7233);
312 for (i = 0; i < sn; i++)
313 D(i) += fix_mul(SS_(i) + SS_(i + 1), 434);
314 for (i = 0; i < dn; i++)
315 S(i) += fix_mul(DD_(i) + DD_(i - 1), 12994); /* 12993 */
320 static void dwt_encode_stepsize(int stepsize, int numbps, opj_stepsize_t *bandno_stepsize) {
322 p = int_floorlog2(stepsize) - 13;
323 n = 11 - int_floorlog2(stepsize);
324 bandno_stepsize->mant = (n < 0 ? stepsize >> -n : stepsize << n) & 0x7ff;
325 bandno_stepsize->expn = numbps - p;
329 ==========================================================
331 ==========================================================
335 /* Forward 5-3 wavelet tranform in 2-D. */
337 void dwt_encode(opj_tcd_tilecomp_t * tilec) {
344 w = tilec->x1-tilec->x0;
345 l = tilec->numresolutions-1;
348 for (i = 0; i < l; i++) {
349 int rw; /* width of the resolution level computed */
350 int rh; /* heigth of the resolution level computed */
351 int rw1; /* width of the resolution level once lower than computed one */
352 int rh1; /* height of the resolution level once lower than computed one */
353 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
354 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
357 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
358 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
359 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
360 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
362 cas_row = tilec->resolutions[l - i].x0 % 2;
363 cas_col = tilec->resolutions[l - i].y0 % 2;
367 bj = (int*)opj_malloc(rh * sizeof(int));
368 for (j = 0; j < rw; j++) {
370 for (k = 0; k < rh; k++) bj[k] = aj[k*w];
371 dwt_encode_1(bj, dn, sn, cas_col);
372 dwt_deinterleave_v(bj, aj, dn, sn, w, cas_col);
378 bj = (int*)opj_malloc(rw * sizeof(int));
379 for (j = 0; j < rh; j++) {
381 for (k = 0; k < rw; k++) bj[k] = aj[k];
382 dwt_encode_1(bj, dn, sn, cas_row);
383 dwt_deinterleave_h(bj, aj, dn, sn, cas_row);
391 /* Inverse 5-3 wavelet tranform in 2-D. */
393 void dwt_decode(opj_tcd_tilecomp_t * tilec, int stop) {
400 w = tilec->x1-tilec->x0;
401 l = tilec->numresolutions-1;
404 for (i = l - 1; i >= stop; i--) {
405 int rw; /* width of the resolution level computed */
406 int rh; /* heigth of the resolution level computed */
407 int rw1; /* width of the resolution level once lower than computed one */
408 int rh1; /* height of the resolution level once lower than computed one */
409 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
410 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
413 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
414 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
415 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
416 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
418 cas_row = tilec->resolutions[l - i].x0 % 2;
419 cas_col = tilec->resolutions[l - i].y0 % 2;
423 bj = (int*)opj_malloc(rw * sizeof(int));
424 for (j = 0; j < rh; j++) {
426 dwt_interleave_h(aj, bj, dn, sn, cas_row);
427 dwt_decode_1(bj, dn, sn, cas_row);
428 for (k = 0; k < rw; k++) aj[k] = bj[k];
434 bj = (int*)opj_malloc(rh * sizeof(int));
435 for (j = 0; j < rw; j++) {
437 dwt_interleave_v(aj, bj, dn, sn, w, cas_col);
438 dwt_decode_1(bj, dn, sn, cas_col);
439 for (k = 0; k < rh; k++) aj[k * w] = bj[k];
447 /* Get gain of 5-3 wavelet transform. */
449 int dwt_getgain(int orient) {
452 if (orient == 1 || orient == 2)
458 /* Get norm of 5-3 wavelet. */
460 double dwt_getnorm(int level, int orient) {
461 return dwt_norms[orient][level];
465 /* Forward 9-7 wavelet transform in 2-D. */
468 void dwt_encode_real(opj_tcd_tilecomp_t * tilec) {
475 w = tilec->x1-tilec->x0;
476 l = tilec->numresolutions-1;
479 for (i = 0; i < l; i++) {
480 int rw; /* width of the resolution level computed */
481 int rh; /* heigth of the resolution level computed */
482 int rw1; /* width of the resolution level once lower than computed one */
483 int rh1; /* height of the resolution level once lower than computed one */
484 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
485 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
488 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
489 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
490 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
491 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
493 cas_row = tilec->resolutions[l - i].x0 % 2;
494 cas_col = tilec->resolutions[l - i].y0 % 2;
498 bj = (int*)opj_malloc(rh * sizeof(int));
499 for (j = 0; j < rw; j++) {
501 for (k = 0; k < rh; k++) bj[k] = aj[k*w];
502 dwt_encode_1_real(bj, dn, sn, cas_col);
503 dwt_deinterleave_v(bj, aj, dn, sn, w, cas_col);
509 bj = (int*)opj_malloc(rw * sizeof(int));
510 for (j = 0; j < rh; j++) {
512 for (k = 0; k < rw; k++) bj[k] = aj[k];
513 dwt_encode_1_real(bj, dn, sn, cas_row);
514 dwt_deinterleave_h(bj, aj, dn, sn, cas_row);
522 /* Inverse 9-7 wavelet transform in 2-D. */
524 void dwt_decode_real(opj_tcd_tilecomp_t * tilec, int stop) {
531 w = tilec->x1-tilec->x0;
532 l = tilec->numresolutions-1;
535 for (i = l-1; i >= stop; i--) {
536 int rw; /* width of the resolution level computed */
537 int rh; /* heigth of the resolution level computed */
538 int rw1; /* width of the resolution level once lower than computed one */
539 int rh1; /* height of the resolution level once lower than computed one */
540 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
541 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
544 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
545 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
546 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
547 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
549 cas_col = tilec->resolutions[l - i].x0 % 2; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
550 cas_row = tilec->resolutions[l - i].y0 % 2; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
554 bj = (int*)opj_malloc(rw * sizeof(int));
555 for (j = 0; j < rh; j++) {
557 dwt_interleave_h(aj, bj, dn, sn, cas_col);
558 dwt_decode_1_real(bj, dn, sn, cas_col);
559 for (k = 0; k < rw; k++) aj[k] = bj[k];
565 bj = (int*)opj_malloc(rh * sizeof(int));
566 for (j = 0; j < rw; j++) {
568 dwt_interleave_v(aj, bj, dn, sn, w, cas_row);
569 dwt_decode_1_real(bj, dn, sn, cas_row);
570 for (k = 0; k < rh; k++) aj[k * w] = bj[k];
578 /* Get gain of 9-7 wavelet transform. */
580 int dwt_getgain_real(int orient) {
586 /* Get norm of 9-7 wavelet. */
588 double dwt_getnorm_real(int level, int orient) {
589 return dwt_norms_real[orient][level];
592 void dwt_calc_explicit_stepsizes(opj_tccp_t * tccp, int prec) {
593 int numbands, bandno;
594 numbands = 3 * tccp->numresolutions - 2;
595 for (bandno = 0; bandno < numbands; bandno++) {
597 int resno, level, orient, gain;
599 resno = (bandno == 0) ? 0 : ((bandno - 1) / 3 + 1);
600 orient = (bandno == 0) ? 0 : ((bandno - 1) % 3 + 1);
601 level = tccp->numresolutions - 1 - resno;
602 gain = (tccp->qmfbid == 0) ? 0 : ((orient == 0) ? 0 : (((orient == 1) || (orient == 2)) ? 1 : 2));
603 if (tccp->qntsty == J2K_CCP_QNTSTY_NOQNT) {
606 double norm = dwt_norms_real[orient][level];
607 stepsize = (1 << (gain)) / norm;
609 dwt_encode_stepsize((int) floor(stepsize * 8192.0), prec + gain, &tccp->stepsizes[bandno]);