You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

665 lines
18KB

  1. /*
  2. * Discrete wavelet transform
  3. * Copyright (c) 2007 Kamil Nowosad
  4. * Copyright (c) 2013 Nicolas Bertrand <nicoinattendu@gmail.com>
  5. *
  6. * This file is part of FFmpeg.
  7. *
  8. * FFmpeg is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU Lesser General Public
  10. * License as published by the Free Software Foundation; either
  11. * version 2.1 of the License, or (at your option) any later version.
  12. *
  13. * FFmpeg is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * Lesser General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU Lesser General Public
  19. * License along with FFmpeg; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. */
  22. /**
  23. * @file
  24. * Discrete wavelet transform
  25. */
  26. #include "libavutil/avassert.h"
  27. #include "libavutil/common.h"
  28. #include "libavutil/mem.h"
  29. #include "jpeg2000dwt.h"
  30. #include "internal.h"
  31. /* Defines for 9/7 DWT lifting parameters.
  32. * Parameters are in float. */
  33. #define F_LFTG_ALPHA 1.586134342059924f
  34. #define F_LFTG_BETA 0.052980118572961f
  35. #define F_LFTG_GAMMA 0.882911075530934f
  36. #define F_LFTG_DELTA 0.443506852043971f
  37. #define F_LFTG_K 1.230174104914001f
  38. #define F_LFTG_X 1.625732422f
  39. /* FIXME: Why use 1.625732422 instead of 1/F_LFTG_K?
  40. * Incorrect value in JPEG2000 norm.
  41. * see (ISO/IEC 15444:1 (version 2002) F.3.8.2 */
  42. /* Lifting parameters in integer format.
  43. * Computed as param = (float param) * (1 << 16) */
  44. #define I_LFTG_ALPHA 103949
  45. #define I_LFTG_BETA 3472
  46. #define I_LFTG_GAMMA 57862
  47. #define I_LFTG_DELTA 29066
  48. #define I_LFTG_K 80621
  49. #define I_LFTG_X 106544
  50. static inline void extend53(int *p, int i0, int i1)
  51. {
  52. p[i0 - 1] = p[i0 + 1];
  53. p[i1] = p[i1 - 2];
  54. p[i0 - 2] = p[i0 + 2];
  55. p[i1 + 1] = p[i1 - 3];
  56. }
  57. static inline void extend97_float(float *p, int i0, int i1)
  58. {
  59. int i;
  60. for (i = 1; i <= 4; i++) {
  61. p[i0 - i] = p[i0 + i];
  62. p[i1 + i - 1] = p[i1 - i - 1];
  63. }
  64. }
  65. static inline void extend97_int(int32_t *p, int i0, int i1)
  66. {
  67. int i;
  68. for (i = 1; i <= 4; i++) {
  69. p[i0 - i] = p[i0 + i];
  70. p[i1 + i - 1] = p[i1 - i - 1];
  71. }
  72. }
  73. static void sd_1d53(int *p, int i0, int i1)
  74. {
  75. int i;
  76. if (i1 <= i0 + 1) {
  77. if (i0 == 1)
  78. p[1] <<= 1;
  79. return;
  80. }
  81. extend53(p, i0, i1);
  82. for (i = (i0+1)/2 - 1; i < (i1+1)/2; i++)
  83. p[2*i+1] -= (p[2*i] + p[2*i+2]) >> 1;
  84. for (i = (i0+1)/2; i < (i1+1)/2; i++)
  85. p[2*i] += (p[2*i-1] + p[2*i+1] + 2) >> 2;
  86. }
  87. static void dwt_encode53(DWTContext *s, int *t)
  88. {
  89. int lev,
  90. w = s->linelen[s->ndeclevels-1][0];
  91. int *line = s->i_linebuf;
  92. line += 3;
  93. for (lev = s->ndeclevels-1; lev >= 0; lev--){
  94. int lh = s->linelen[lev][0],
  95. lv = s->linelen[lev][1],
  96. mh = s->mod[lev][0],
  97. mv = s->mod[lev][1],
  98. lp;
  99. int *l;
  100. // VER_SD
  101. l = line + mv;
  102. for (lp = 0; lp < lh; lp++) {
  103. int i, j = 0;
  104. for (i = 0; i < lv; i++)
  105. l[i] = t[w*i + lp];
  106. sd_1d53(line, mv, mv + lv);
  107. // copy back and deinterleave
  108. for (i = mv; i < lv; i+=2, j++)
  109. t[w*j + lp] = l[i];
  110. for (i = 1-mv; i < lv; i+=2, j++)
  111. t[w*j + lp] = l[i];
  112. }
  113. // HOR_SD
  114. l = line + mh;
  115. for (lp = 0; lp < lv; lp++){
  116. int i, j = 0;
  117. for (i = 0; i < lh; i++)
  118. l[i] = t[w*lp + i];
  119. sd_1d53(line, mh, mh + lh);
  120. // copy back and deinterleave
  121. for (i = mh; i < lh; i+=2, j++)
  122. t[w*lp + j] = l[i];
  123. for (i = 1-mh; i < lh; i+=2, j++)
  124. t[w*lp + j] = l[i];
  125. }
  126. }
  127. }
  128. static void sd_1d97_float(float *p, int i0, int i1)
  129. {
  130. int i;
  131. if (i1 <= i0 + 1) {
  132. if (i0 == 1)
  133. p[1] *= F_LFTG_X;
  134. else
  135. p[0] *= F_LFTG_K;
  136. return;
  137. }
  138. extend97_float(p, i0, i1);
  139. i0++; i1++;
  140. for (i = i0/2 - 2; i < i1/2 + 1; i++)
  141. p[2*i+1] -= 1.586134 * (p[2*i] + p[2*i+2]);
  142. for (i = i0/2 - 1; i < i1/2 + 1; i++)
  143. p[2*i] -= 0.052980 * (p[2*i-1] + p[2*i+1]);
  144. for (i = i0/2 - 1; i < i1/2; i++)
  145. p[2*i+1] += 0.882911 * (p[2*i] + p[2*i+2]);
  146. for (i = i0/2; i < i1/2; i++)
  147. p[2*i] += 0.443506 * (p[2*i-1] + p[2*i+1]);
  148. }
  149. static void dwt_encode97_float(DWTContext *s, float *t)
  150. {
  151. int lev,
  152. w = s->linelen[s->ndeclevels-1][0];
  153. float *line = s->f_linebuf;
  154. line += 5;
  155. for (lev = s->ndeclevels-1; lev >= 0; lev--){
  156. int lh = s->linelen[lev][0],
  157. lv = s->linelen[lev][1],
  158. mh = s->mod[lev][0],
  159. mv = s->mod[lev][1],
  160. lp;
  161. float *l;
  162. av_assert1(!mh && !mv);
  163. // HOR_SD
  164. l = line + mh;
  165. for (lp = 0; lp < lv; lp++){
  166. int i, j = 0;
  167. for (i = 0; i < lh; i++)
  168. l[i] = t[w*lp + i];
  169. sd_1d97_float(line, mh, mh + lh);
  170. // copy back and deinterleave
  171. for (i = mh; i < lh; i+=2, j++)
  172. t[w*lp + j] = F_LFTG_X * l[i] / 2;
  173. for (i = 1-mh; i < lh; i+=2, j++)
  174. t[w*lp + j] = F_LFTG_K * l[i] / 2;
  175. }
  176. // VER_SD
  177. l = line + mv;
  178. for (lp = 0; lp < lh; lp++) {
  179. int i, j = 0;
  180. for (i = 0; i < lv; i++)
  181. l[i] = t[w*i + lp];
  182. sd_1d97_float(line, mv, mv + lv);
  183. // copy back and deinterleave
  184. for (i = mv; i < lv; i+=2, j++)
  185. t[w*j + lp] = F_LFTG_X * l[i] / 2;
  186. for (i = 1-mv; i < lv; i+=2, j++)
  187. t[w*j + lp] = F_LFTG_K * l[i] / 2;
  188. }
  189. }
  190. }
  191. static void sd_1d97_int(int *p, int i0, int i1)
  192. {
  193. int i;
  194. if (i1 <= i0 + 1) {
  195. if (i0 == 1)
  196. p[1] = (p[1] * I_LFTG_X + (1<<15)) >> 16;
  197. else
  198. p[0] = (p[0] * I_LFTG_K + (1<<15)) >> 16;
  199. return;
  200. }
  201. extend97_int(p, i0, i1);
  202. i0++; i1++;
  203. for (i = i0/2 - 2; i < i1/2 + 1; i++)
  204. p[2 * i + 1] -= (I_LFTG_ALPHA * (p[2 * i] + p[2 * i + 2]) + (1 << 15)) >> 16;
  205. for (i = i0/2 - 1; i < i1/2 + 1; i++)
  206. p[2 * i] -= (I_LFTG_BETA * (p[2 * i - 1] + p[2 * i + 1]) + (1 << 15)) >> 16;
  207. for (i = i0/2 - 1; i < i1/2; i++)
  208. p[2 * i + 1] += (I_LFTG_GAMMA * (p[2 * i] + p[2 * i + 2]) + (1 << 15)) >> 16;
  209. for (i = i0/2; i < i1/2; i++)
  210. p[2 * i] += (I_LFTG_DELTA * (p[2 * i - 1] + p[2 * i + 1]) + (1 << 15)) >> 16;
  211. }
  212. static void dwt_encode97_int(DWTContext *s, int *t)
  213. {
  214. int lev,
  215. w = s->linelen[s->ndeclevels-1][0];
  216. int *line = s->i_linebuf;
  217. line += 5;
  218. for (lev = s->ndeclevels-1; lev >= 0; lev--){
  219. int lh = s->linelen[lev][0],
  220. lv = s->linelen[lev][1],
  221. mh = s->mod[lev][0],
  222. mv = s->mod[lev][1],
  223. lp;
  224. int *l;
  225. av_assert1(!mh && !mv);
  226. // VER_SD
  227. l = line + mv;
  228. for (lp = 0; lp < lh; lp++) {
  229. int i, j = 0;
  230. for (i = 0; i < lv; i++)
  231. l[i] = t[w*i + lp];
  232. sd_1d97_int(line, mv, mv + lv);
  233. // copy back and deinterleave
  234. for (i = mv; i < lv; i+=2, j++)
  235. t[w*j + lp] = ((l[i] * I_LFTG_X) + (1 << 16)) >> 17;
  236. for (i = 1-mv; i < lv; i+=2, j++)
  237. t[w*j + lp] = ((l[i] * I_LFTG_K) + (1 << 16)) >> 17;
  238. }
  239. // HOR_SD
  240. l = line + mh;
  241. for (lp = 0; lp < lv; lp++){
  242. int i, j = 0;
  243. for (i = 0; i < lh; i++)
  244. l[i] = t[w*lp + i];
  245. sd_1d97_int(line, mh, mh + lh);
  246. // copy back and deinterleave
  247. for (i = mh; i < lh; i+=2, j++)
  248. t[w*lp + j] = ((l[i] * I_LFTG_X) + (1 << 16)) >> 17;
  249. for (i = 1-mh; i < lh; i+=2, j++)
  250. t[w*lp + j] = ((l[i] * I_LFTG_K) + (1 << 16)) >> 17;
  251. }
  252. }
  253. }
  254. static void sr_1d53(int *p, int i0, int i1)
  255. {
  256. int i;
  257. if (i1 <= i0 + 1) {
  258. if (i0 == 1)
  259. p[1] >>= 1;
  260. return;
  261. }
  262. extend53(p, i0, i1);
  263. for (i = i0 / 2; i < i1 / 2 + 1; i++)
  264. p[2 * i] -= (p[2 * i - 1] + p[2 * i + 1] + 2) >> 2;
  265. for (i = i0 / 2; i < i1 / 2; i++)
  266. p[2 * i + 1] += (p[2 * i] + p[2 * i + 2]) >> 1;
  267. }
  268. static void dwt_decode53(DWTContext *s, int *t)
  269. {
  270. int lev;
  271. int w = s->linelen[s->ndeclevels - 1][0];
  272. int32_t *line = s->i_linebuf;
  273. line += 3;
  274. for (lev = 0; lev < s->ndeclevels; lev++) {
  275. int lh = s->linelen[lev][0],
  276. lv = s->linelen[lev][1],
  277. mh = s->mod[lev][0],
  278. mv = s->mod[lev][1],
  279. lp;
  280. int *l;
  281. // HOR_SD
  282. l = line + mh;
  283. for (lp = 0; lp < lv; lp++) {
  284. int i, j = 0;
  285. // copy with interleaving
  286. for (i = mh; i < lh; i += 2, j++)
  287. l[i] = t[w * lp + j];
  288. for (i = 1 - mh; i < lh; i += 2, j++)
  289. l[i] = t[w * lp + j];
  290. sr_1d53(line, mh, mh + lh);
  291. for (i = 0; i < lh; i++)
  292. t[w * lp + i] = l[i];
  293. }
  294. // VER_SD
  295. l = line + mv;
  296. for (lp = 0; lp < lh; lp++) {
  297. int i, j = 0;
  298. // copy with interleaving
  299. for (i = mv; i < lv; i += 2, j++)
  300. l[i] = t[w * j + lp];
  301. for (i = 1 - mv; i < lv; i += 2, j++)
  302. l[i] = t[w * j + lp];
  303. sr_1d53(line, mv, mv + lv);
  304. for (i = 0; i < lv; i++)
  305. t[w * i + lp] = l[i];
  306. }
  307. }
  308. }
  309. static void sr_1d97_float(float *p, int i0, int i1)
  310. {
  311. int i;
  312. if (i1 <= i0 + 1) {
  313. if (i0 == 1)
  314. p[1] *= F_LFTG_K/2;
  315. else
  316. p[0] *= F_LFTG_X/2;
  317. return;
  318. }
  319. extend97_float(p, i0, i1);
  320. for (i = i0 / 2 - 1; i < i1 / 2 + 2; i++)
  321. p[2 * i] -= F_LFTG_DELTA * (p[2 * i - 1] + p[2 * i + 1]);
  322. /* step 4 */
  323. for (i = i0 / 2 - 1; i < i1 / 2 + 1; i++)
  324. p[2 * i + 1] -= F_LFTG_GAMMA * (p[2 * i] + p[2 * i + 2]);
  325. /*step 5*/
  326. for (i = i0 / 2; i < i1 / 2 + 1; i++)
  327. p[2 * i] += F_LFTG_BETA * (p[2 * i - 1] + p[2 * i + 1]);
  328. /* step 6 */
  329. for (i = i0 / 2; i < i1 / 2; i++)
  330. p[2 * i + 1] += F_LFTG_ALPHA * (p[2 * i] + p[2 * i + 2]);
  331. }
  332. static void dwt_decode97_float(DWTContext *s, float *t)
  333. {
  334. int lev;
  335. int w = s->linelen[s->ndeclevels - 1][0];
  336. float *line = s->f_linebuf;
  337. float *data = t;
  338. /* position at index O of line range [0-5,w+5] cf. extend function */
  339. line += 5;
  340. for (lev = 0; lev < s->ndeclevels; lev++) {
  341. int lh = s->linelen[lev][0],
  342. lv = s->linelen[lev][1],
  343. mh = s->mod[lev][0],
  344. mv = s->mod[lev][1],
  345. lp;
  346. float *l;
  347. // HOR_SD
  348. l = line + mh;
  349. for (lp = 0; lp < lv; lp++) {
  350. int i, j = 0;
  351. // copy with interleaving
  352. for (i = mh; i < lh; i += 2, j++)
  353. l[i] = data[w * lp + j] * F_LFTG_K;
  354. for (i = 1 - mh; i < lh; i += 2, j++)
  355. l[i] = data[w * lp + j] * F_LFTG_X;
  356. sr_1d97_float(line, mh, mh + lh);
  357. for (i = 0; i < lh; i++)
  358. data[w * lp + i] = l[i];
  359. }
  360. // VER_SD
  361. l = line + mv;
  362. for (lp = 0; lp < lh; lp++) {
  363. int i, j = 0;
  364. // copy with interleaving
  365. for (i = mv; i < lv; i += 2, j++)
  366. l[i] = data[w * j + lp] * F_LFTG_K;
  367. for (i = 1 - mv; i < lv; i += 2, j++)
  368. l[i] = data[w * j + lp] * F_LFTG_X;
  369. sr_1d97_float(line, mv, mv + lv);
  370. for (i = 0; i < lv; i++)
  371. data[w * i + lp] = l[i];
  372. }
  373. }
  374. }
  375. static void sr_1d97_int(int32_t *p, int i0, int i1)
  376. {
  377. int i;
  378. if (i1 <= i0 + 1) {
  379. if (i0 == 1)
  380. p[1] = (p[1] * I_LFTG_K + (1<<16)) >> 17;
  381. else
  382. p[0] = (p[0] * I_LFTG_X + (1<<16)) >> 17;
  383. return;
  384. }
  385. extend97_int(p, i0, i1);
  386. for (i = i0 / 2 - 1; i < i1 / 2 + 2; i++)
  387. p[2 * i] -= (I_LFTG_DELTA * (p[2 * i - 1] + p[2 * i + 1]) + (1 << 15)) >> 16;
  388. /* step 4 */
  389. for (i = i0 / 2 - 1; i < i1 / 2 + 1; i++)
  390. p[2 * i + 1] -= (I_LFTG_GAMMA * (p[2 * i] + p[2 * i + 2]) + (1 << 15)) >> 16;
  391. /*step 5*/
  392. for (i = i0 / 2; i < i1 / 2 + 1; i++)
  393. p[2 * i] += (I_LFTG_BETA * (p[2 * i - 1] + p[2 * i + 1]) + (1 << 15)) >> 16;
  394. /* step 6 */
  395. for (i = i0 / 2; i < i1 / 2; i++)
  396. p[2 * i + 1] += (I_LFTG_ALPHA * (p[2 * i] + p[2 * i + 2]) + (1 << 15)) >> 16;
  397. }
  398. static void dwt_decode97_int(DWTContext *s, int32_t *t)
  399. {
  400. int lev;
  401. int w = s->linelen[s->ndeclevels - 1][0];
  402. int32_t *line = s->i_linebuf;
  403. int32_t *data = t;
  404. /* position at index O of line range [0-5,w+5] cf. extend function */
  405. line += 5;
  406. for (lev = 0; lev < s->ndeclevels; lev++) {
  407. int lh = s->linelen[lev][0],
  408. lv = s->linelen[lev][1],
  409. mh = s->mod[lev][0],
  410. mv = s->mod[lev][1],
  411. lp;
  412. int32_t *l;
  413. // HOR_SD
  414. l = line + mh;
  415. for (lp = 0; lp < lv; lp++) {
  416. int i, j = 0;
  417. // rescale with interleaving
  418. for (i = mh; i < lh; i += 2, j++)
  419. l[i] = ((data[w * lp + j] * I_LFTG_K) + (1 << 15)) >> 16;
  420. for (i = 1 - mh; i < lh; i += 2, j++)
  421. l[i] = ((data[w * lp + j] * I_LFTG_X) + (1 << 15)) >> 16;
  422. sr_1d97_int(line, mh, mh + lh);
  423. for (i = 0; i < lh; i++)
  424. data[w * lp + i] = l[i];
  425. }
  426. // VER_SD
  427. l = line + mv;
  428. for (lp = 0; lp < lh; lp++) {
  429. int i, j = 0;
  430. // rescale with interleaving
  431. for (i = mv; i < lv; i += 2, j++)
  432. l[i] = ((data[w * j + lp] * I_LFTG_K) + (1 << 15)) >> 16;
  433. for (i = 1 - mv; i < lv; i += 2, j++)
  434. l[i] = ((data[w * j + lp] * I_LFTG_X) + (1 << 15)) >> 16;
  435. sr_1d97_int(line, mv, mv + lv);
  436. for (i = 0; i < lv; i++)
  437. data[w * i + lp] = l[i];
  438. }
  439. }
  440. }
  441. int ff_jpeg2000_dwt_init(DWTContext *s, uint16_t border[2][2],
  442. int decomp_levels, int type)
  443. {
  444. int i, j, lev = decomp_levels, maxlen,
  445. b[2][2];
  446. s->ndeclevels = decomp_levels;
  447. s->type = type;
  448. for (i = 0; i < 2; i++)
  449. for (j = 0; j < 2; j++)
  450. b[i][j] = border[i][j];
  451. maxlen = FFMAX(b[0][1] - b[0][0],
  452. b[1][1] - b[1][0]);
  453. while (--lev >= 0)
  454. for (i = 0; i < 2; i++) {
  455. s->linelen[lev][i] = b[i][1] - b[i][0];
  456. s->mod[lev][i] = b[i][0] & 1;
  457. for (j = 0; j < 2; j++)
  458. b[i][j] = (b[i][j] + 1) >> 1;
  459. }
  460. switch (type) {
  461. case FF_DWT97:
  462. s->f_linebuf = av_malloc_array((maxlen + 12), sizeof(*s->f_linebuf));
  463. if (!s->f_linebuf)
  464. return AVERROR(ENOMEM);
  465. break;
  466. case FF_DWT97_INT:
  467. s->i_linebuf = av_malloc_array((maxlen + 12), sizeof(*s->i_linebuf));
  468. if (!s->i_linebuf)
  469. return AVERROR(ENOMEM);
  470. break;
  471. case FF_DWT53:
  472. s->i_linebuf = av_malloc_array((maxlen + 6), sizeof(*s->i_linebuf));
  473. if (!s->i_linebuf)
  474. return AVERROR(ENOMEM);
  475. break;
  476. default:
  477. return -1;
  478. }
  479. return 0;
  480. }
  481. int ff_dwt_encode(DWTContext *s, void *t)
  482. {
  483. switch(s->type){
  484. case FF_DWT97:
  485. dwt_encode97_float(s, t); break;
  486. case FF_DWT97_INT:
  487. dwt_encode97_int(s, t); break;
  488. case FF_DWT53:
  489. dwt_encode53(s, t); break;
  490. default:
  491. return -1;
  492. }
  493. return 0;
  494. }
  495. int ff_dwt_decode(DWTContext *s, void *t)
  496. {
  497. switch (s->type) {
  498. case FF_DWT97:
  499. dwt_decode97_float(s, t);
  500. break;
  501. case FF_DWT97_INT:
  502. dwt_decode97_int(s, t);
  503. break;
  504. case FF_DWT53:
  505. dwt_decode53(s, t);
  506. break;
  507. default:
  508. return -1;
  509. }
  510. return 0;
  511. }
  512. void ff_dwt_destroy(DWTContext *s)
  513. {
  514. av_freep(&s->f_linebuf);
  515. av_freep(&s->i_linebuf);
  516. }
  517. #ifdef TEST
  518. #include "libavutil/lfg.h"
  519. #define MAX_W 256
  520. int main(void) {
  521. int array[MAX_W * MAX_W];
  522. int ref [MAX_W * MAX_W];
  523. AVLFG prng;
  524. int i,j;
  525. DWTContext s1={{{0}}}, *s= &s1;
  526. uint16_t border[2][2];
  527. int ret, decomp_levels;
  528. av_lfg_init(&prng, 1);
  529. for (i = 0; i<MAX_W * MAX_W; i++)
  530. array[i] = ref[i] = av_lfg_get(&prng) % 2048;
  531. for (i = 0; i < 40; i++) {
  532. for (j=0; j<4; j++)
  533. border[0][j] = av_lfg_get(&prng) % MAX_W;
  534. if (border[0][0] >= border[0][1] || border[1][0] >= border[1][1])
  535. continue;
  536. decomp_levels = av_lfg_get(&prng) % FF_DWT_MAX_DECLVLS;
  537. ret = ff_jpeg2000_dwt_init(s, border, decomp_levels, FF_DWT53);
  538. if (ret < 0) {
  539. fprintf(stderr, "ff_jpeg2000_dwt_init failed\n");
  540. return 1;
  541. }
  542. ret = ff_dwt_encode(s, array);
  543. if (ret < 0) {
  544. fprintf(stderr, "ff_dwt_encode failed\n");
  545. return 1;
  546. }
  547. ret = ff_dwt_decode(s, array);
  548. if (ret < 0) {
  549. fprintf(stderr, "ff_dwt_encode failed\n");
  550. return 1;
  551. }
  552. for (j = 0; j<MAX_W * MAX_W; j++)
  553. if (array[j] != ref[j]) {
  554. fprintf(stderr, "missmatch at %d (%d != %d) decomp:%d border %d %d %d %d\n",
  555. j, array[j], ref[j],decomp_levels, border[0][0], border[0][1], border[1][0], border[1][1]);
  556. return 2;
  557. }
  558. ff_dwt_destroy(s);
  559. }
  560. return 0;
  561. }
  562. #endif