2 * Copyright (c) 2001-2003, David Janssens
3 * Copyright (c) 2002-2003, Yannick Verschueren
4 * Copyright (c) 2003-2005, Francois Devaux and Antonin Descampe
5 * Copyright (c) 2005, Herv� Drolon, FreeImage Team
6 * Copyright (c) 2002-2005, Communications and remote sensing Laboratory, Universite catholique de Louvain, Belgium
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
19 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
22 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 * POSSIBILITY OF SUCH DAMAGE.
33 * This is a modified version of the openjpeg dwt.c file.
34 * Average speed improvement compared to the original file (measured on
35 * my own machine, a P4 running at 3.0 GHz):
36 * 5x3 wavelets about 2 times faster
37 * 9x7 wavelets about 3 times faster
38 * for both, encoding and decoding.
40 * The better performance is caused by doing the 1-dimensional DWT
41 * within a temporary buffer where the data can be accessed sequential
42 * for both directions, horizontal and vertical. The 2d vertical DWT was
43 * the major bottleneck in the former version.
45 * I have also removed the "Add Patrick" part because it is not longer
49 * -Ive (aka Reiner Wahler)
50 * mail: ive@lilysoft.com
54 #include "opj_includes.h"
57 #define D(i) a[(1+(i)*2)]
58 #define S_(i) ((i)<0?S(0):((i)>=sn?S(sn-1):S(i)))
59 #define D_(i) ((i)<0?D(0):((i)>=dn?D(dn-1):D(i)))
61 #define SS_(i) ((i)<0?S(0):((i)>=dn?S(dn-1):S(i)))
62 #define DD_(i) ((i)<0?D(0):((i)>=sn?D(sn-1):D(i)))
65 /* This table contains the norms of the 5-3 wavelets for different bands. */
67 static const double dwt_norms[4][10] = {
68 {1.000, 1.500, 2.750, 5.375, 10.68, 21.34, 42.67, 85.33, 170.7, 341.3},
69 {1.038, 1.592, 2.919, 5.703, 11.33, 22.64, 45.25, 90.48, 180.9},
70 {1.038, 1.592, 2.919, 5.703, 11.33, 22.64, 45.25, 90.48, 180.9},
71 {.7186, .9218, 1.586, 3.043, 6.019, 12.01, 24.00, 47.97, 95.93}
75 /* This table contains the norms of the 9-7 wavelets for different bands. */
77 static const double dwt_norms_real[4][10] = {
78 {1.000, 1.965, 4.177, 8.403, 16.90, 33.84, 67.69, 135.3, 270.6, 540.9},
79 {2.022, 3.989, 8.355, 17.04, 34.27, 68.63, 137.3, 274.6, 549.0},
80 {2.022, 3.989, 8.355, 17.04, 34.27, 68.63, 137.3, 274.6, 549.0},
81 {2.080, 3.865, 8.307, 17.18, 34.71, 69.59, 139.3, 278.6, 557.2}
85 ==========================================================
87 ==========================================================
91 /* Forward lazy transform (horizontal). */
93 static void dwt_deinterleave_h(int *a, int *b, int dn, int sn, int cas) {
95 for (i=0; i<sn; i++) b[i]=a[2*i+cas];
96 for (i=0; i<dn; i++) b[sn+i]=a[(2*i+1-cas)];
100 /* Forward lazy transform (vertical). */
102 static void dwt_deinterleave_v(int *a, int *b, int dn, int sn, int x, int cas) {
104 for (i=0; i<sn; i++) b[i*x]=a[2*i+cas];
105 for (i=0; i<dn; i++) b[(sn+i)*x]=a[(2*i+1-cas)];
109 /* Inverse lazy transform (horizontal). */
111 static void dwt_interleave_h(int *a, int *b, int dn, int sn, int cas) {
117 for (i = 0; i < sn; i++) {
124 for (i = 0; i < dn; i++) {
132 /* Inverse lazy transform (vertical). */
134 static void dwt_interleave_v(int *a, int *b, int dn, int sn, int x, int cas) {
140 for (i = 0; i < sn; i++) {
147 for (i = 0; i < dn; i++) {
156 /* Forward 5-3 wavelet tranform in 1-D. */
158 static void dwt_encode_1(int *a, int dn, int sn, int cas) {
162 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
163 for (i = 0; i < dn; i++) D(i) -= (S_(i) + S_(i + 1)) >> 1;
164 for (i = 0; i < sn; i++) S(i) += (D_(i - 1) + D_(i) + 2) >> 2;
167 if (!sn && dn == 1) /* NEW : CASE ONE ELEMENT */
170 for (i = 0; i < dn; i++) S(i) -= (DD_(i) + DD_(i - 1)) >> 1;
171 for (i = 0; i < sn; i++) D(i) += (SS_(i) + SS_(i + 1) + 2) >> 2;
177 /* Inverse 5-3 wavelet tranform in 1-D. */
179 static void dwt_decode_1(int *a, int dn, int sn, int cas) {
183 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
184 for (i = 0; i < sn; i++) S(i) -= (D_(i - 1) + D_(i) + 2) >> 2;
185 for (i = 0; i < dn; i++) D(i) += (S_(i) + S_(i + 1)) >> 1;
188 if (!sn && dn == 1) /* NEW : CASE ONE ELEMENT */
191 for (i = 0; i < sn; i++) D(i) -= (SS_(i) + SS_(i + 1) + 2) >> 2;
192 for (i = 0; i < dn; i++) S(i) += (DD_(i) + DD_(i - 1)) >> 1;
198 /* Forward 9-7 wavelet transform in 1-D. */
200 static void dwt_encode_1_real(int *a, int dn, int sn, int cas) {
203 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
204 for (i = 0; i < dn; i++)
205 D(i) -= fix_mul(S_(i) + S_(i + 1), 12993);
206 for (i = 0; i < sn; i++)
207 S(i) -= fix_mul(D_(i - 1) + D_(i), 434);
208 for (i = 0; i < dn; i++)
209 D(i) += fix_mul(S_(i) + S_(i + 1), 7233);
210 for (i = 0; i < sn; i++)
211 S(i) += fix_mul(D_(i - 1) + D_(i), 3633);
212 for (i = 0; i < dn; i++)
213 D(i) = fix_mul(D(i), 5038); /*5038 */
214 for (i = 0; i < sn; i++)
215 S(i) = fix_mul(S(i), 6659); /*6660 */
218 if ((sn > 0) || (dn > 1)) { /* NEW : CASE ONE ELEMENT */
219 for (i = 0; i < dn; i++)
220 S(i) -= fix_mul(DD_(i) + DD_(i - 1), 12993);
221 for (i = 0; i < sn; i++)
222 D(i) -= fix_mul(SS_(i) + SS_(i + 1), 434);
223 for (i = 0; i < dn; i++)
224 S(i) += fix_mul(DD_(i) + DD_(i - 1), 7233);
225 for (i = 0; i < sn; i++)
226 D(i) += fix_mul(SS_(i) + SS_(i + 1), 3633);
227 for (i = 0; i < dn; i++)
228 S(i) = fix_mul(S(i), 5038); /*5038 */
229 for (i = 0; i < sn; i++)
230 D(i) = fix_mul(D(i), 6659); /*6660 */
236 /* Inverse 9-7 wavelet transform in 1-D. */
238 static void dwt_decode_1_real(int *a, int dn, int sn, int cas) {
241 if ((dn > 0) || (sn > 1)) { /* NEW : CASE ONE ELEMENT */
242 for (i = 0; i < sn; i++)
243 S(i) = fix_mul(S(i), 10078); /* 10076 */
244 for (i = 0; i < dn; i++)
245 D(i) = fix_mul(D(i), 13318); /* 13320 */
246 for (i = 0; i < sn; i++)
247 S(i) -= fix_mul(D_(i - 1) + D_(i), 3633);
248 for (i = 0; i < dn; i++)
249 D(i) -= fix_mul(S_(i) + S_(i + 1), 7233);
250 for (i = 0; i < sn; i++)
251 S(i) += fix_mul(D_(i - 1) + D_(i), 434);
252 for (i = 0; i < dn; i++)
253 D(i) += fix_mul(S_(i) + S_(i + 1), 12994); /* 12993 */
256 if ((sn > 0) || (dn > 1)) { /* NEW : CASE ONE ELEMENT */
257 for (i = 0; i < sn; i++)
258 D(i) = fix_mul(D(i), 10078); /* 10076 */
259 for (i = 0; i < dn; i++)
260 S(i) = fix_mul(S(i), 13318); /* 13320 */
261 for (i = 0; i < sn; i++)
262 D(i) -= fix_mul(SS_(i) + SS_(i + 1), 3633);
263 for (i = 0; i < dn; i++)
264 S(i) -= fix_mul(DD_(i) + DD_(i - 1), 7233);
265 for (i = 0; i < sn; i++)
266 D(i) += fix_mul(SS_(i) + SS_(i + 1), 434);
267 for (i = 0; i < dn; i++)
268 S(i) += fix_mul(DD_(i) + DD_(i - 1), 12994); /* 12993 */
273 static void dwt_encode_stepsize(int stepsize, int numbps, opj_stepsize_t *bandno_stepsize) {
275 p = int_floorlog2(stepsize) - 13;
276 n = 11 - int_floorlog2(stepsize);
277 bandno_stepsize->mant = (n < 0 ? stepsize >> -n : stepsize << n) & 0x7ff;
278 bandno_stepsize->expn = numbps - p;
282 ==========================================================
284 ==========================================================
288 /* Forward 5-3 wavelet tranform in 2-D. */
290 void dwt_encode(opj_tcd_tilecomp_t * tilec) {
297 w = tilec->x1-tilec->x0;
298 l = tilec->numresolutions-1;
301 for (i = 0; i < l; i++) {
302 int rw; /* width of the resolution level computed */
303 int rh; /* heigth of the resolution level computed */
304 int rw1; /* width of the resolution level once lower than computed one */
305 int rh1; /* height of the resolution level once lower than computed one */
306 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
307 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
310 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
311 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
312 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
313 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
315 cas_row = tilec->resolutions[l - i].x0 % 2;
316 cas_col = tilec->resolutions[l - i].y0 % 2;
320 bj = (int*)opj_malloc(rh * sizeof(int));
321 for (j = 0; j < rw; j++) {
323 for (k = 0; k < rh; k++) bj[k] = aj[k*w];
324 dwt_encode_1(bj, dn, sn, cas_col);
325 dwt_deinterleave_v(bj, aj, dn, sn, w, cas_col);
331 bj = (int*)opj_malloc(rw * sizeof(int));
332 for (j = 0; j < rh; j++) {
334 for (k = 0; k < rw; k++) bj[k] = aj[k];
335 dwt_encode_1(bj, dn, sn, cas_row);
336 dwt_deinterleave_h(bj, aj, dn, sn, cas_row);
344 /* Inverse 5-3 wavelet tranform in 2-D. */
346 void dwt_decode(opj_tcd_tilecomp_t * tilec, int stop) {
353 w = tilec->x1-tilec->x0;
354 l = tilec->numresolutions-1;
357 for (i = l - 1; i >= stop; i--) {
358 int rw; /* width of the resolution level computed */
359 int rh; /* heigth of the resolution level computed */
360 int rw1; /* width of the resolution level once lower than computed one */
361 int rh1; /* height of the resolution level once lower than computed one */
362 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
363 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
366 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
367 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
368 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
369 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
371 cas_row = tilec->resolutions[l - i].x0 % 2;
372 cas_col = tilec->resolutions[l - i].y0 % 2;
376 bj = (int*)opj_malloc(rw * sizeof(int));
377 for (j = 0; j < rh; j++) {
379 dwt_interleave_h(aj, bj, dn, sn, cas_row);
380 dwt_decode_1(bj, dn, sn, cas_row);
381 for (k = 0; k < rw; k++) aj[k] = bj[k];
387 bj = (int*)opj_malloc(rh * sizeof(int));
388 for (j = 0; j < rw; j++) {
390 dwt_interleave_v(aj, bj, dn, sn, w, cas_col);
391 dwt_decode_1(bj, dn, sn, cas_col);
392 for (k = 0; k < rh; k++) aj[k * w] = bj[k];
400 /* Get gain of 5-3 wavelet transform. */
402 int dwt_getgain(int orient) {
405 if (orient == 1 || orient == 2)
411 /* Get norm of 5-3 wavelet. */
413 double dwt_getnorm(int level, int orient) {
414 return dwt_norms[orient][level];
418 /* Forward 9-7 wavelet transform in 2-D. */
421 void dwt_encode_real(opj_tcd_tilecomp_t * tilec) {
428 w = tilec->x1-tilec->x0;
429 l = tilec->numresolutions-1;
432 for (i = 0; i < l; i++) {
433 int rw; /* width of the resolution level computed */
434 int rh; /* heigth of the resolution level computed */
435 int rw1; /* width of the resolution level once lower than computed one */
436 int rh1; /* height of the resolution level once lower than computed one */
437 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
438 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
441 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
442 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
443 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
444 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
446 cas_row = tilec->resolutions[l - i].x0 % 2;
447 cas_col = tilec->resolutions[l - i].y0 % 2;
451 bj = (int*)opj_malloc(rh * sizeof(int));
452 for (j = 0; j < rw; j++) {
454 for (k = 0; k < rh; k++) bj[k] = aj[k*w];
455 dwt_encode_1_real(bj, dn, sn, cas_col);
456 dwt_deinterleave_v(bj, aj, dn, sn, w, cas_col);
462 bj = (int*)opj_malloc(rw * sizeof(int));
463 for (j = 0; j < rh; j++) {
465 for (k = 0; k < rw; k++) bj[k] = aj[k];
466 dwt_encode_1_real(bj, dn, sn, cas_row);
467 dwt_deinterleave_h(bj, aj, dn, sn, cas_row);
475 /* Inverse 9-7 wavelet transform in 2-D. */
477 void dwt_decode_real(opj_tcd_tilecomp_t * tilec, int stop) {
484 w = tilec->x1-tilec->x0;
485 l = tilec->numresolutions-1;
488 for (i = l-1; i >= stop; i--) {
489 int rw; /* width of the resolution level computed */
490 int rh; /* heigth of the resolution level computed */
491 int rw1; /* width of the resolution level once lower than computed one */
492 int rh1; /* height of the resolution level once lower than computed one */
493 int cas_col; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
494 int cas_row; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
497 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
498 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
499 rw1= tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
500 rh1= tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
502 cas_col = tilec->resolutions[l - i].x0 % 2; /* 0 = non inversion on horizontal filtering 1 = inversion between low-pass and high-pass filtering */
503 cas_row = tilec->resolutions[l - i].y0 % 2; /* 0 = non inversion on vertical filtering 1 = inversion between low-pass and high-pass filtering */
507 bj = (int*)opj_malloc(rw * sizeof(int));
508 for (j = 0; j < rh; j++) {
510 dwt_interleave_h(aj, bj, dn, sn, cas_col);
511 dwt_decode_1_real(bj, dn, sn, cas_col);
512 for (k = 0; k < rw; k++) aj[k] = bj[k];
518 bj = (int*)opj_malloc(rh * sizeof(int));
519 for (j = 0; j < rw; j++) {
521 dwt_interleave_v(aj, bj, dn, sn, w, cas_row);
522 dwt_decode_1_real(bj, dn, sn, cas_row);
523 for (k = 0; k < rh; k++) aj[k * w] = bj[k];
531 /* Get gain of 9-7 wavelet transform. */
533 int dwt_getgain_real(int orient) {
538 /* Get norm of 9-7 wavelet. */
540 double dwt_getnorm_real(int level, int orient) {
541 return dwt_norms_real[orient][level];
544 void dwt_calc_explicit_stepsizes(opj_tccp_t * tccp, int prec) {
545 int numbands, bandno;
546 numbands = 3 * tccp->numresolutions - 2;
547 for (bandno = 0; bandno < numbands; bandno++) {
549 int resno, level, orient, gain;
551 resno = (bandno == 0) ? 0 : ((bandno - 1) / 3 + 1);
552 orient = (bandno == 0) ? 0 : ((bandno - 1) % 3 + 1);
553 level = tccp->numresolutions - 1 - resno;
554 gain = (tccp->qmfbid == 0) ? 0 : ((orient == 0) ? 0 : (((orient == 1) || (orient == 2)) ? 1 : 2));
555 if (tccp->qntsty == J2K_CCP_QNTSTY_NOQNT) {
558 double norm = dwt_norms_real[orient][level];
559 stepsize = (1 << (gain + 1)) / norm;
561 dwt_encode_stepsize((int) floor(stepsize * 8192.0), prec + gain, &tccp->stepsizes[bandno]);