libopenjpeg/dwt.c

   1 /*
   2  * Copyright (c) 2001-2002, David Janssens
   3  * Copyright (c) 2002-2003, Yannick Verschueren
   4  * Copyright (c) 2002-2003,  Communications and remote sensing Laboratory, Universite catholique de Louvain, Belgium
   5  * All rights reserved.
   6  *
   7  * Redistribution and use in source and binary forms, with or without
   8  * modification, are permitted provided that the following conditions
   9  * are met:
  10  * 1. Redistributions of source code must retain the above copyright
  11  *    notice, this list of conditions and the following disclaimer.
  12  * 2. Redistributions in binary form must reproduce the above copyright
  13  *    notice, this list of conditions and the following disclaimer in the
  14  *    documentation and/or other materials provided with the distribution.
  15  *
  16  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
  17  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  18  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  19  * ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  20  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  21  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  22  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  23  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  24  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  25  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  26  * POSSIBILITY OF SUCH DAMAGE.
  27  */
  28
  29 #include "dwt.h"
  30 #include "int.h"
  31 #include "fix.h"
  32 #include "tcd.h"
  33 #include <stdlib.h>
  34 #include <stdio.h>
  35
  36 #define S(i) a[x*(i)*2]
  37 #define D(i) a[x*(1+(i)*2)]
  38 #define S_(i) ((i)<0?S(0):((i)>=sn?S(sn-1):S(i)))
  39 #define D_(i) ((i)<0?D(0):((i)>=dn?D(dn-1):D(i)))
  40 /* new */
  41 #define SS_(i) ((i)<0?S(0):((i)>=dn?S(dn-1):S(i)))
  42 #define DD_(i) ((i)<0?D(0):((i)>=sn?D(sn-1):D(i)))
  43
  44 /* <summary> */
  45 /* This table contains the norms of the 5-3 wavelets for different bands.  */
  46 /* </summary> */
  47 double dwt_norms[4][10] = {
  48         {1.000, 1.500, 2.750, 5.375, 10.68, 21.34, 42.67, 85.33, 170.7, 341.3},
  49         {1.038, 1.592, 2.919, 5.703, 11.33, 22.64, 45.25, 90.48, 180.9},
  50         {1.038, 1.592, 2.919, 5.703, 11.33, 22.64, 45.25, 90.48, 180.9},
  51         {.7186, .9218, 1.586, 3.043, 6.019, 12.01, 24.00, 47.97, 95.93}
  52 };
  53
  54 /* <summary> */
  55 /* This table contains the norms of the 9-7 wavelets for different bands.  */
  56 /* </summary> */
  57 double dwt_norms_real[4][10] = {
  58         {1.000, 1.965, 4.177, 8.403, 16.90, 33.84, 67.69, 135.3, 270.6, 540.9},
  59         {2.022, 3.989, 8.355, 17.04, 34.27, 68.63, 137.3, 274.6, 549.0},
  60         {2.022, 3.989, 8.355, 17.04, 34.27, 68.63, 137.3, 274.6, 549.0},
  61         {2.080, 3.865, 8.307, 17.18, 34.71, 69.59, 139.3, 278.6, 557.2}
  62 };
  63
  64 /* Add Patrick */
  65 static int *b = NULL;
  66 static int lastSizeOfB = 0;
  67
  68
  69 void dwt_clean()
  70 {
  71         if (b != NULL) {
  72                 free(b);
  73         }
  74         b = NULL;
  75         lastSizeOfB = 0;
  76 }
  77
  78 /* \ Add Patrick */
  79
  80 /* <summary> */
  81 /* Forward lazy transform. */
  82 /* </summary> */
  83 void dwt_deinterleave(int *a, int n, int x, int res, int cas)
  84 {
  85         int dn, sn, i;
  86         sn = res;
  87         dn = n - res;
  88         if (lastSizeOfB != n) {
  89                 if (b != NULL)
  90                         free(b);
  91                 b = (int *) malloc(n * sizeof(int));
  92                 lastSizeOfB = n;
  93         }
  94
  95         if (cas) {
  96                 for (i = 0; i < sn; i++)
  97                         b[i] = a[(2 * i + 1) * x];
  98                 for (i = 0; i < dn; i++)
  99                         b[sn + i] = a[2 * i * x];
 100         } else {
 101                 for (i = 0; i < sn; i++)
 102                         b[i] = a[2 * i * x];
 103                 for (i = 0; i < dn; i++)
 104                         b[sn + i] = a[(2 * i + 1) * x];
 105         }
 106         for (i = 0; i < n; i++)
 107                 a[i * x] = b[i];
 108 }
 109
 110 /* <summary> */
 111 /* Forward lazy transform. */
 112 /* </summary> */
 113 void dwt_deinterleave_real(int *a, int n, int x, int res, int cas)
 114 {
 115         int dn, sn, i;
 116         sn = res;
 117         dn = n - res;
 118
 119         if (lastSizeOfB != n) {
 120                 if (b != NULL)
 121                         free(b);
 122                 b = (int *) malloc(n * sizeof(int));
 123                 lastSizeOfB = n;
 124         }
 125
 126         if (cas) {
 127                 for (i = 0; i < sn; i++)
 128                         b[i] = a[(2 * i + 1) * x];
 129                 for (i = 0; i < dn; i++)
 130                         b[sn + i] = a[2 * i * x];
 131         } else {
 132                 for (i = 0; i < sn; i++)
 133                         b[i] = a[2 * i * x];
 134                 for (i = 0; i < dn; i++)
 135                         b[sn + i] = a[(2 * i + 1) * x];
 136         }
 137         for (i = 0; i < n; i++)
 138                 a[i * x] = b[i];
 139
 140 }
 141
 142 /* <summary> */
 143 /* Inverse lazy transform. */
 144 /* </summary> */
 145 void dwt_interleave(int *a, int n, int x, int res, int cas)
 146 {
 147         int dn, sn, i;
 148         sn = res;
 149         dn = n - res;
 150
 151         if (lastSizeOfB != n) {
 152                 if (b != NULL)
 153                         free(b);
 154                 b = (int *) malloc(n * sizeof(int));
 155                 lastSizeOfB = n;
 156         }
 157
 158         if (cas) {
 159                 for (i = 0; i < sn; i++)
 160                         b[2 * i + 1] = a[i * x];
 161                 for (i = 0; i < dn; i++)
 162                         b[2 * i] = a[(sn + i) * x];
 163         } else {
 164                 for (i = 0; i < sn; i++)
 165                         b[2 * i] = a[i * x];
 166                 for (i = 0; i < dn; i++)
 167                         b[2 * i + 1] = a[(sn + i) * x];
 168         }
 169         for (i = 0; i < n; i++)
 170                 a[i * x] = b[i];
 171 }
 172
 173 /* <summary> */
 174 /* Inverse lazy transform. */
 175 /* </summary> */
 176 void dwt_interleave_real(int *a, int n, int x, int res, int cas)
 177 {
 178         int dn, sn, i;
 179         sn = res;
 180         dn = n - res;
 181
 182         if (lastSizeOfB != n) {
 183                 if (b != NULL)
 184                         free(b);
 185                 b = (int *) malloc(n * sizeof(int));
 186                 lastSizeOfB = n;
 187         }
 188
 189         if (cas) {
 190                 for (i = 0; i < sn; i++)
 191                         b[2 * i + 1] = a[i * x];
 192                 for (i = 0; i < dn; i++)
 193                         b[2 * i] = a[(sn + i) * x];
 194         } else {
 195                 for (i = 0; i < sn; i++)
 196                         b[2 * i] = a[i * x];
 197                 for (i = 0; i < dn; i++)
 198                         b[2 * i + 1] = a[(sn + i) * x];
 199         }
 200         for (i = 0; i < n; i++)
 201                 a[i * x] = b[i];
 202
 203 }
 204
 205 /* <summary> */
 206 /* Forward 5-3 wavelet tranform in 1-D. */
 207 /* </summary> */
 208 void dwt_encode_1(int *a, int n, int x, int res, int cas)
 209 {
 210         int dn, sn, i = 0;
 211         sn = res;
 212         dn = n - res;
 213
 214         if (cas) {
 215                 if (!sn && dn == 1)                                     /* NEW :  CASE ONE ELEMENT */
 216                         S(i) *= 2;
 217                 else {
 218                         for (i = 0; i < dn; i++)
 219                                 S(i) -= (DD_(i) + DD_(i - 1)) >> 1;
 220                         for (i = 0; i < sn; i++)
 221                                 D(i) += (SS_(i) + SS_(i + 1) + 2) >> 2;
 222                 }
 223         } else {
 224                 if ((dn > 0) || (sn > 1)) {  /* NEW :  CASE ONE ELEMENT */
 225                         for (i = 0; i < dn; i++)
 226                                 D(i) -= (S_(i) + S_(i + 1)) >> 1;
 227                         for (i = 0; i < sn; i++)
 228                                 S(i) += (D_(i - 1) + D_(i) + 2) >> 2;
 229                 }
 230         }
 231         dwt_deinterleave(a, n, x, res, cas);
 232 }
 233
 234 /* <summary> */
 235 /* Inverse 5-3 wavelet tranform in 1-D. */
 236 /* </summary> */
 237 void dwt_decode_1(int *a, int n, int x, int res, int cas)
 238 {
 239         int dn, sn, i = 0;
 240         /* dn=n/2; */
 241         /* sn=(n+1)/2; */
 242         sn = res;
 243         dn = n - res;
 244
 245         dwt_interleave(a, n, x, res, cas);
 246         if (cas) {
 247                 if (!sn && dn == 1)                                     /* NEW :  CASE ONE ELEMENT */
 248                         S(i) /= 2;
 249                 else {
 250                         for (i = 0; i < sn; i++)
 251                                 D(i) -= (SS_(i) + SS_(i + 1) + 2) >> 2;
 252                         for (i = 0; i < dn; i++)
 253                                 S(i) += (DD_(i) + DD_(i - 1)) >> 1;
 254                 }
 255         } else {
 256                 if ((dn > 0) || (sn > 1)) { /* NEW :  CASE ONE ELEMENT */
 257                         for (i = 0; i < sn; i++)
 258                                 S(i) -= (D_(i - 1) + D_(i) + 2) >> 2;
 259                         for (i = 0; i < dn; i++)
 260                                 D(i) += (S_(i) + S_(i + 1)) >> 1;
 261                 }
 262         }
 263 }
 264
 265 /* <summary> */
 266 /* Forward 5-3 wavelet tranform in 2-D. */
 267 /* </summary> */
 268 void dwt_encode(int *a, int w, int h, tcd_tilecomp_t * tilec, int l)
 269 {
 270         int i, j, rw, rh, rw1, rh1;
 271         int previous_rw, previous_rh, previous_rw1, previous_rh1;
 272
 273         for (i = 0; i < l; i++) {
 274                 int cas_col = 0;
 275                 int cas_row = 0;
 276                 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
 277                 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
 278                 rw1 =
 279                         tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
 280                 rh1 =
 281                         tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
 282
 283                 /* Check the different cases for that it's necessary to invert high pass and low pass filter */
 284
 285                 if (tilec->previous_row) {
 286                         previous_rw =
 287                                 tilec->resolutions[l - i].previous_x1 - tilec->resolutions[l -
 288                                                                                                                                                                                                                                                                          i].
 289                                 previous_x0;
 290                         previous_rw1 =
 291                                 tilec->resolutions[l - i - 1].previous_x1 - tilec->resolutions[l -
 292                                                                                                                                                                                                                                                                                          i -
 293                                                                                                                                                                                                                                                                                          1].
 294                                 previous_x0;
 295                         /* inversion on the previous and propagation of the inversion on the other tile */
 296                         if ((previous_rw1 > previous_rw - previous_rw1 && rw1 == rw - rw1)
 297                                         || (tilec->resolutions[l - i - 1].cas_row
 298                                                         && previous_rw1 == previous_rw - previous_rw1))
 299                                 cas_row = 1;
 300                 }
 301
 302                 if (tilec->previous_col) {
 303                         previous_rh =
 304                                 tilec->resolutions[l - i].previous_y1 - tilec->resolutions[l -
 305                                                                                                                                                                                                                                                                          i].
 306                                 previous_y0;
 307                         previous_rh1 =
 308                                 tilec->resolutions[l - i - 1].previous_y1 - tilec->resolutions[l -
 309                                                                                                                                                                                                                                                                                          i -
 310                                                                                                                                                                                                                                                                                          1].
 311                                 previous_y0;
 312                         /* inversion on the previous and propagation of the inversion on the other tile */
 313                         if ((previous_rh1 > previous_rh - previous_rh1 && rh1 == rh - rh1)
 314                                         || (tilec->resolutions[l - i - 1].cas_col
 315                                                         && previous_rh1 == previous_rh - previous_rh1))
 316                                 cas_col = 1;
 317                 }
 318
 319                 /* subband LL shorter than LH or HL */
 320                 if (rw1 < rw - rw1)
 321                         cas_row = 1;
 322                 if (rh1 < rh - rh1)
 323                         cas_col = 1;
 324
 325                 /* OFFSET IMAGE (If origin of the resolution is odd and first tile on the row or column) */
 326                 if (!tilec->previous_row && ((tilec->resolutions[l - i].x0 % 2) == 1))
 327                         cas_row = 1;
 328                 if (!tilec->previous_col && ((tilec->resolutions[l - i].y0 % 2) == 1))
 329                         cas_col = 1;
 330
 331                 tilec->resolutions[l - i - 1].cas_row = cas_row;
 332                 tilec->resolutions[l - i - 1].cas_col = cas_col;
 333
 334                 for (j = 0; j < rw; j++)
 335                         dwt_encode_1(a + j, rh, w, rh1, cas_col);
 336                 for (j = 0; j < rh; j++)
 337                         dwt_encode_1(a + j * w, rw, 1, rw1, cas_row);
 338         }
 339
 340         dwt_clean();
 341 }
 342
 343 /* <summary> */
 344 /* Inverse 5-3 wavelet tranform in 2-D. */
 345 /* </summary> */
 346 void dwt_decode(int *a, int w, int h, tcd_tilecomp_t * tilec, int l,
 347                                                                 tcd_tilecomp_t * row_tilec, tcd_tilecomp_t * col_tilec)
 348 {
 349         int i, j, rw, rh, rw1, rh1;
 350         int previous_rw, previous_rh, previous_rw1, previous_rh1;
 351         for (i = l - 1; i >= 0; i--) {
 352                 int cas_col = 0;
 353                 int cas_row = 0;
 354
 355                 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
 356                 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
 357                 rw1 =
 358                         tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
 359                 rh1 =
 360                         tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
 361
 362                 if (tilec->previous_row) {
 363                         previous_rw =
 364                                 tilec->resolutions[l - i].previous_x1 - tilec->resolutions[l -
 365                                                                                                                                                                                                                                                                          i].
 366                                 previous_x0;
 367                         previous_rw1 =
 368                                 tilec->resolutions[l - i - 1].previous_x1 - tilec->resolutions[l -
 369                                                                                                                                                                                                                                                                                          i -
 370                                                                                                                                                                                                                                                                                          1].
 371                                 previous_x0;
 372                         if ((previous_rw1 > previous_rw - previous_rw1 && rw1 == rw - rw1)
 373                                         || (row_tilec->resolutions[l - i - 1].cas_row
 374                                                         && previous_rw1 == previous_rw - previous_rw1))
 375                                 cas_row = 1;
 376                 }
 377
 378                 if (tilec->previous_col) {
 379                         previous_rh =
 380                                 tilec->resolutions[l - i].previous_y1 - tilec->resolutions[l -
 381                                                                                                                                                                                                                                                                          i].
 382                                 previous_y0;
 383                         previous_rh1 =
 384                                 tilec->resolutions[l - i - 1].previous_y1 - tilec->resolutions[l -
 385                                                                                                                                                                                                                                                                                          i -
 386                                                                                                                                                                                                                                                                                          1].
 387                                 previous_y0;
 388                         if ((previous_rh1 > previous_rh - previous_rh1 && rh1 == rh - rh1)
 389                                         || (col_tilec->resolutions[l - i - 1].cas_col
 390                                                         && previous_rh1 == previous_rh - previous_rh1))
 391                                 cas_col = 1;
 392                 }
 393
 394                 if (rw1 < rw - rw1)
 395                         cas_row = 1;
 396                 if (rh1 < rh - rh1)
 397                         cas_col = 1;
 398
 399                 /* OFFSET IMAGE (If origin of the resolution is odd and first tile on the row or column) */
 400                 if (!tilec->previous_row && ((tilec->resolutions[l - i].x0 % 2) == 1))
 401                         cas_row = 1;
 402                 if (!tilec->previous_col && ((tilec->resolutions[l - i].y0 % 2) == 1))
 403                         cas_col = 1;
 404
 405                 tilec->resolutions[l - i - 1].cas_row = cas_row;
 406                 tilec->resolutions[l - i - 1].cas_col = cas_col;
 407
 408                 for (j = 0; j < rh; j++)
 409                         dwt_decode_1(a + j * w, rw, 1, rw1, cas_row);
 410                 for (j = 0; j < rw; j++)
 411                         dwt_decode_1(a + j, rh, w, rh1, cas_col);
 412         }
 413         dwt_clean();
 414 }
 415
 416 /* <summary> */
 417 /* Get gain of 5-3 wavelet transform. */
 418 /* </summary> */
 419 int dwt_getgain(int orient)
 420 {
 421         if (orient == 0)
 422                 return 0;
 423         if (orient == 1 || orient == 2)
 424                 return 1;
 425         return 2;
 426 }
 427
 428 /* <summary> */
 429 /* Get norm of 5-3 wavelet. */
 430 /* </summary> */
 431 double dwt_getnorm(int level, int orient)
 432 {
 433         return dwt_norms[orient][level];
 434 }
 435
 436 /* <summary> */
 437 /* Forward 9-7 wavelet transform in 1-D. */
 438 /* </summary> */
 439 void dwt_encode_1_real(int *a, int n, int x, int res, int cas)
 440 {
 441         int dn, sn, i = 0;
 442         dn = n - res;
 443         sn = res;
 444
 445         if (cas) {
 446                 if ((sn > 0) || (dn > 1)) {  /* NEW :  CASE ONE ELEMENT */
 447                         for (i = 0; i < dn; i++)
 448                                 S(i) -= fix_mul(DD_(i) + DD_(i - 1), 12993);
 449                         for (i = 0; i < sn; i++)
 450                                 D(i) -= fix_mul(SS_(i) + SS_(i + 1), 434);
 451                         for (i = 0; i < dn; i++)
 452                                 S(i) += fix_mul(DD_(i) + DD_(i - 1), 7233);
 453                         for (i = 0; i < sn; i++)
 454                                 D(i) += fix_mul(SS_(i) + SS_(i + 1), 3633);
 455                         for (i = 0; i < dn; i++)
 456                                 S(i) = fix_mul(S(i), 5038);
 457                         for (i = 0; i < sn; i++)
 458                                 D(i) = fix_mul(D(i), 6660);
 459                 }
 460         } else {
 461           if ((dn > 0) || (sn > 1)) {  /* NEW :  CASE ONE ELEMENT */
 462                         for (i = 0; i < dn; i++)
 463                                 D(i) -= fix_mul(S_(i) + S_(i + 1), 12993);
 464                         for (i = 0; i < sn; i++)
 465                                 S(i) -= fix_mul(D_(i - 1) + D_(i), 434);
 466                         for (i = 0; i < dn; i++)
 467                                 D(i) += fix_mul(S_(i) + S_(i + 1), 7233);
 468                         for (i = 0; i < sn; i++)
 469                                 S(i) += fix_mul(D_(i - 1) + D_(i), 3633);
 470                         for (i = 0; i < dn; i++)
 471                                 D(i) = fix_mul(D(i), 5038);
 472                         for (i = 0; i < sn; i++)
 473                                 S(i) = fix_mul(S(i), 6660);
 474                 }
 475         }
 476         dwt_deinterleave_real(a, n, x, res, cas);
 477 }
 478
 479 /* <summary> */
 480 /* Inverse 9-7 wavelet transform in 1-D. */
 481 /* </summary> */
 482 void dwt_decode_1_real(int *a, int n, int x, int res, int cas)
 483 {
 484         int dn, sn, i = 0;
 485         dn = n - res;
 486         sn = res;
 487         dwt_interleave_real(a, n, x, res, cas);
 488         if (cas) {
 489                 if ((sn > 0) || (dn > 1)) {  /* NEW :  CASE ONE ELEMENT */
 490                         for (i = 0; i < sn; i++)
 491                                 D(i) = fix_mul(D(i), 10076);
 492                         for (i = 0; i < dn; i++)
 493                                 S(i) = fix_mul(S(i), 13320);
 494                         for (i = 0; i < sn; i++)
 495                                 D(i) -= fix_mul(SS_(i) + SS_(i + 1), 3633);
 496                         for (i = 0; i < dn; i++)
 497                                 S(i) -= fix_mul(DD_(i) + DD_(i - 1), 7233);
 498                         for (i = 0; i < sn; i++)
 499                                 D(i) += fix_mul(SS_(i) + SS_(i + 1), 434);
 500                         for (i = 0; i < dn; i++)
 501                                 S(i) += fix_mul(DD_(i) + DD_(i - 1), 12993);
 502                 }
 503         } else {
 504                 if ((dn > 0) || (sn > 1)) {  /* NEW :  CASE ONE ELEMENT */
 505                         for (i = 0; i < sn; i++)
 506                                 S(i) = fix_mul(S(i), 10076);
 507                         for (i = 0; i < dn; i++)
 508                                 D(i) = fix_mul(D(i), 13320);
 509                         for (i = 0; i < sn; i++)
 510                                 S(i) -= fix_mul(D_(i - 1) + D_(i), 3633);
 511                         for (i = 0; i < dn; i++)
 512                                 D(i) -= fix_mul(S_(i) + S_(i + 1), 7233);
 513                         for (i = 0; i < sn; i++)
 514                                 S(i) += fix_mul(D_(i - 1) + D_(i), 434);
 515                         for (i = 0; i < dn; i++)
 516                                 D(i) += fix_mul(S_(i) + S_(i + 1), 12993);
 517                 }
 518         }
 519 }
 520
 521 /* <summary> */
 522 /* Forward 9-7 wavelet transform in 2-D. */
 523 /* </summary> */
 524
 525 void dwt_encode_real(int *a, int w, int h, tcd_tilecomp_t * tilec, int l)
 526 {
 527         int i, j, rw, rh, rw1, rh1;
 528         int previous_rw, previous_rh, previous_rw1, previous_rh1;
 529
 530         for (i = 0; i < l; i++) {
 531                 int cas_col = 0;
 532                 int cas_row = 0;
 533                 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
 534                 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
 535                 rw1 =
 536                         tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
 537                 rh1 =
 538                         tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
 539
 540                 if (tilec->previous_row) {
 541                         previous_rw =
 542                                 tilec->resolutions[l - i].previous_x1 - tilec->resolutions[l -
 543                                                                                                                                                                                                                                                                          i].
 544                                 previous_x0;
 545                         previous_rw1 =
 546                                 tilec->resolutions[l - i - 1].previous_x1 - tilec->resolutions[l -
 547                                                                                                                                                                                                                                                                                          i -
 548                                                                                                                                                                                                                                                                                          1].
 549                                 previous_x0;
 550                         if ((previous_rw1 > previous_rw - previous_rw1 && rw1 == rw - rw1)
 551                                         || (tilec->resolutions[l - i - 1].cas_row
 552                                                         && previous_rw1 == previous_rw - previous_rw1))
 553                                 cas_row = 1;
 554                 }
 555
 556                 if (tilec->previous_col) {
 557                         previous_rh =
 558                                 tilec->resolutions[l - i].previous_y1 - tilec->resolutions[l -
 559                                                                                                                                                                                                                                                                          i].
 560                                 previous_y0;
 561                         previous_rh1 =
 562                                 tilec->resolutions[l - i - 1].previous_y1 - tilec->resolutions[l -
 563                                                                                                                                                                                                                                                                                          i -
 564                                                                                                                                                                                                                                                                                          1].
 565                                 previous_y0;
 566                         if ((previous_rh1 > previous_rh - previous_rh1 && rh1 == rh - rh1)
 567                                         || (tilec->resolutions[l - i - 1].cas_col
 568                                                         && previous_rh1 == previous_rh - previous_rh1))
 569                                 cas_col = 1;
 570                 }
 571
 572                 if (rw1 < rw - rw1)
 573                         cas_row = 1;
 574                 if (rh1 < rh - rh1)
 575                         cas_col = 1;
 576
 577                 /* OFFSET IMAGE (If origin of the resolution is odd and first tile on the row or column) */
 578                 if (!tilec->previous_row && ((tilec->resolutions[l - i].x0 % 2) == 1))
 579                         cas_row = 1;
 580                 if (!tilec->previous_col && ((tilec->resolutions[l - i].y0 % 2) == 1))
 581                         cas_col = 1;
 582
 583                 tilec->resolutions[l - i - 1].cas_row = cas_row;
 584                 tilec->resolutions[l - i - 1].cas_col = cas_col;
 585
 586                 for (j = 0; j < rw; j++)
 587                         dwt_encode_1_real(a + j, rh, w, rh1, cas_col);
 588                 for (j = 0; j < rh; j++)
 589                         dwt_encode_1_real(a + j * w, rw, 1, rw1, cas_row);
 590         }
 591 }
 592
 593 /* <summary> */
 594 /* Inverse 9-7 wavelet transform in 2-D. */
 595 /* </summary> */
 596 void dwt_decode_real(int *a, int w, int h, tcd_tilecomp_t * tilec, int l,
 597                                                                                  tcd_tilecomp_t * row_tilec,
 598                                                                                  tcd_tilecomp_t * col_tilec)
 599 {
 600         int i, j, rw, rh, rw1, rh1;
 601         int previous_rw, previous_rh, previous_rw1, previous_rh1;
 602
 603         for (i = l - 1; i >= 0; i--) {
 604                 int cas_col = 0;
 605                 int cas_row = 0;
 606
 607                 rw = tilec->resolutions[l - i].x1 - tilec->resolutions[l - i].x0;
 608                 rh = tilec->resolutions[l - i].y1 - tilec->resolutions[l - i].y0;
 609                 rw1 =
 610                         tilec->resolutions[l - i - 1].x1 - tilec->resolutions[l - i - 1].x0;
 611                 rh1 =
 612                         tilec->resolutions[l - i - 1].y1 - tilec->resolutions[l - i - 1].y0;
 613
 614                 if (tilec->previous_row) {
 615                         previous_rw =
 616                                 tilec->resolutions[l - i].previous_x1 - tilec->resolutions[l -
 617                                                                                                                                                                                                                                                                          i].
 618                                 previous_x0;
 619                         previous_rw1 =
 620                                 tilec->resolutions[l - i - 1].previous_x1 - tilec->resolutions[l -
 621                                                                                                                                                                                                                                                                                          i -
 622                                                                                                                                                                                                                                                                                          1].
 623                                 previous_x0;
 624                         if ((previous_rw1 > previous_rw - previous_rw1 && rw1 == rw - rw1)
 625                                         || (row_tilec->resolutions[l - i - 1].cas_row
 626                                                         && previous_rw1 == previous_rw - previous_rw1))
 627                                 cas_row = 1;
 628                 }
 629
 630                 if (tilec->previous_col) {
 631                         previous_rh =
 632                                 tilec->resolutions[l - i].previous_y1 - tilec->resolutions[l -
 633                                                                                                                                                                                                                                                                          i].
 634                                 previous_y0;
 635                         previous_rh1 =
 636                                 tilec->resolutions[l - i - 1].previous_y1 - tilec->resolutions[l -
 637                                                                                                                                                                                                                                                                                          i -
 638                                                                                                                                                                                                                                                                                          1].
 639                                 previous_y0;
 640                         if ((previous_rh1 > previous_rh - previous_rh1 && rh1 == rh - rh1)
 641                                         || (col_tilec->resolutions[l - i - 1].cas_col
 642                                                         && previous_rh1 == previous_rh - previous_rh1))
 643                                 cas_col = 1;
 644                 }
 645
 646                 if (rw1 < rw - rw1)
 647                         cas_row = 1;
 648                 if (rh1 < rh - rh1)
 649                         cas_col = 1;
 650
 651                 /* OFFSET IMAGE (If origin of the resolution is odd and first tile on the row or column) */
 652                 if (!tilec->previous_row && ((tilec->resolutions[l - i].x0 % 2) == 1))
 653                         cas_row = 1;
 654                 if (!tilec->previous_col && ((tilec->resolutions[l - i].y0 % 2) == 1))
 655                         cas_col = 1;
 656
 657                 tilec->resolutions[l - i - 1].cas_row = cas_row;
 658                 tilec->resolutions[l - i - 1].cas_col = cas_col;
 659
 660                 for (j = 0; j < rh; j++)
 661                         dwt_decode_1_real(a + j * w, rw, 1, rw1, cas_row);
 662                 for (j = 0; j < rw; j++)
 663                         dwt_decode_1_real(a + j, rh, w, rh1, cas_col);
 664         }
 665 }
 666
 667 /* <summary> */
 668 /* Get gain of 9-7 wavelet transform. */
 669 /* </summary> */
 670 int dwt_getgain_real(int orient)
 671 {
 672         return 0;
 673 }
 674
 675 /* <summary> */
 676 /* Get norm of 9-7 wavelet. */
 677 /* </summary> */
 678 double dwt_getnorm_real(int level, int orient)
 679 {
 680         return dwt_norms_real[orient][level];
 681 }