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.

387 lines
9.4KB

  1. /*
  2. * Discrete wavelet transform
  3. * Copyright (c) 2007 Kamil Nowosad
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * FFmpeg is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * Discrete wavelet transform
  23. * @file
  24. * @author Kamil Nowosad
  25. */
  26. #include "j2k_dwt.h"
  27. const static float scale97[] = {1.625786, 1.230174};
  28. static inline void extend53(int *p, int i0, int i1)
  29. {
  30. p[i0 - 1] = p[i0 + 1];
  31. p[i1 ] = p[i1 - 2];
  32. p[i0 - 2] = p[i0 + 2];
  33. p[i1 + 1] = p[i1 - 3];
  34. }
  35. static inline void extend97(float *p, int i0, int i1)
  36. {
  37. int i;
  38. for (i = 1; i <= 4; i++){
  39. p[i0 - i] = p[i0 + i];
  40. p[i1 + i - 1] = p[i1 - i - 1];
  41. }
  42. }
  43. static void sd_1d53(int *p, int i0, int i1)
  44. {
  45. int i;
  46. if (i1 == i0 + 1)
  47. return;
  48. extend53(p, i0, i1);
  49. for (i = (i0+1)/2 - 1; i < (i1+1)/2; i++)
  50. p[2*i+1] -= (p[2*i] + p[2*i+2]) >> 1;
  51. for (i = (i0+1)/2; i < (i1+1)/2; i++)
  52. p[2*i] += (p[2*i-1] + p[2*i+1] + 2) >> 2;
  53. }
  54. static void dwt_encode53(DWTContext *s, int *t)
  55. {
  56. int lev,
  57. w = s->linelen[s->ndeclevels-1][0];
  58. int *line = s->linebuf;
  59. line += 3;
  60. for (lev = s->ndeclevels-1; lev >= 0; lev--){
  61. int lh = s->linelen[lev][0],
  62. lv = s->linelen[lev][1],
  63. mh = s->mod[lev][0],
  64. mv = s->mod[lev][1],
  65. lp;
  66. int *l;
  67. // HOR_SD
  68. l = line + mh;
  69. for (lp = 0; lp < lv; lp++){
  70. int i, j = 0;
  71. for (i = 0; i < lh; i++)
  72. l[i] = t[w*lp + i];
  73. sd_1d53(line, mh, mh + lh);
  74. // copy back and deinterleave
  75. for (i = mh; i < lh; i+=2, j++)
  76. t[w*lp + j] = l[i];
  77. for (i = 1-mh; i < lh; i+=2, j++)
  78. t[w*lp + j] = l[i];
  79. }
  80. // VER_SD
  81. l = line + mv;
  82. for (lp = 0; lp < lh; lp++) {
  83. int i, j = 0;
  84. for (i = 0; i < lv; i++)
  85. l[i] = t[w*i + lp];
  86. sd_1d53(line, mv, mv + lv);
  87. // copy back and deinterleave
  88. for (i = mv; i < lv; i+=2, j++)
  89. t[w*j + lp] = l[i];
  90. for (i = 1-mv; i < lv; i+=2, j++)
  91. t[w*j + lp] = l[i];
  92. }
  93. }
  94. }
  95. static void sd_1d97(float *p, int i0, int i1)
  96. {
  97. int i;
  98. if (i1 == i0 + 1)
  99. return;
  100. extend97(p, i0, i1);
  101. i0++; i1++;
  102. for (i = i0/2 - 2; i < i1/2 + 1; i++)
  103. p[2*i+1] -= 1.586134 * (p[2*i] + p[2*i+2]);
  104. for (i = i0/2 - 1; i < i1/2 + 1; i++)
  105. p[2*i] -= 0.052980 * (p[2*i-1] + p[2*i+1]);
  106. for (i = i0/2 - 1; i < i1/2; i++)
  107. p[2*i+1] += 0.882911 * (p[2*i] + p[2*i+2]);
  108. for (i = i0/2; i < i1/2; i++)
  109. p[2*i] += 0.443506 * (p[2*i-1] + p[2*i+1]);
  110. }
  111. static void dwt_encode97(DWTContext *s, int *t)
  112. {
  113. int lev,
  114. w = s->linelen[s->ndeclevels-1][0];
  115. float *line = s->linebuf;
  116. line += 5;
  117. for (lev = s->ndeclevels-1; lev >= 0; lev--){
  118. int lh = s->linelen[lev][0],
  119. lv = s->linelen[lev][1],
  120. mh = s->mod[lev][0],
  121. mv = s->mod[lev][1],
  122. lp;
  123. float *l;
  124. // HOR_SD
  125. l = line + mh;
  126. for (lp = 0; lp < lv; lp++){
  127. int i, j = 0;
  128. for (i = 0; i < lh; i++)
  129. l[i] = t[w*lp + i];
  130. sd_1d97(line, mh, mh + lh);
  131. // copy back and deinterleave
  132. for (i = mh; i < lh; i+=2, j++)
  133. t[w*lp + j] = scale97[mh] * l[i] / 2;
  134. for (i = 1-mh; i < lh; i+=2, j++)
  135. t[w*lp + j] = scale97[mh] * l[i] / 2;
  136. }
  137. // VER_SD
  138. l = line + mv;
  139. for (lp = 0; lp < lh; lp++) {
  140. int i, j = 0;
  141. for (i = 0; i < lv; i++)
  142. l[i] = t[w*i + lp];
  143. sd_1d97(line, mv, mv + lv);
  144. // copy back and deinterleave
  145. for (i = mv; i < lv; i+=2, j++)
  146. t[w*j + lp] = scale97[mv] * l[i] / 2;
  147. for (i = 1-mv; i < lv; i+=2, j++)
  148. t[w*j + lp] = scale97[mv] * l[i] / 2;
  149. }
  150. }
  151. }
  152. static void sr_1d53(int *p, int i0, int i1)
  153. {
  154. int i;
  155. if (i1 == i0 + 1)
  156. return;
  157. extend53(p, i0, i1);
  158. for (i = i0/2; i < i1/2 + 1; i++)
  159. p[2*i] -= (p[2*i-1] + p[2*i+1] + 2) >> 2;
  160. for (i = i0/2; i < i1/2; i++)
  161. p[2*i+1] += (p[2*i] + p[2*i+2]) >> 1;
  162. }
  163. static void dwt_decode53(DWTContext *s, int *t)
  164. {
  165. int lev,
  166. w = s->linelen[s->ndeclevels-1][0];
  167. int *line = s->linebuf;
  168. line += 3;
  169. for (lev = 0; lev < s->ndeclevels; lev++){
  170. int lh = s->linelen[lev][0],
  171. lv = s->linelen[lev][1],
  172. mh = s->mod[lev][0],
  173. mv = s->mod[lev][1],
  174. lp;
  175. int *l;
  176. // HOR_SD
  177. l = line + mh;
  178. for (lp = 0; lp < lv; lp++){
  179. int i, j = 0;
  180. // copy with interleaving
  181. for (i = mh; i < lh; i+=2, j++)
  182. l[i] = t[w*lp + j];
  183. for (i = 1-mh; i < lh; i+=2, j++)
  184. l[i] = t[w*lp + j];
  185. sr_1d53(line, mh, mh + lh);
  186. for (i = 0; i < lh; i++)
  187. t[w*lp + i] = l[i];
  188. }
  189. // VER_SD
  190. l = line + mv;
  191. for (lp = 0; lp < lh; lp++){
  192. int i, j = 0;
  193. // copy with interleaving
  194. for (i = mv; i < lv; i+=2, j++)
  195. l[i] = t[w*j + lp];
  196. for (i = 1-mv; i < lv; i+=2, j++)
  197. l[i] = t[w*j + lp];
  198. sr_1d53(line, mv, mv + lv);
  199. for (i = 0; i < lv; i++)
  200. t[w*i + lp] = l[i];
  201. }
  202. }
  203. }
  204. static void sr_1d97(float *p, int i0, int i1)
  205. {
  206. int i;
  207. if (i1 == i0 + 1)
  208. return;
  209. extend97(p, i0, i1);
  210. for (i = i0/2 - 1; i < i1/2 + 2; i++)
  211. p[2*i] -= 0.443506 * (p[2*i-1] + p[2*i+1]);
  212. for (i = i0/2 - 1; i < i1/2 + 1; i++)
  213. p[2*i+1] -= 0.882911 * (p[2*i] + p[2*i+2]);
  214. for (i = i0/2; i < i1/2 + 1; i++)
  215. p[2*i] += 0.052980 * (p[2*i-1] + p[2*i+1]);
  216. for (i = i0/2; i < i1/2; i++)
  217. p[2*i+1] += 1.586134 * (p[2*i] + p[2*i+2]);
  218. }
  219. static void dwt_decode97(DWTContext *s, int *t)
  220. {
  221. int lev,
  222. w = s->linelen[s->ndeclevels-1][0];
  223. float *line = s->linebuf;
  224. line += 5;
  225. for (lev = 0; lev < s->ndeclevels; lev++){
  226. int lh = s->linelen[lev][0],
  227. lv = s->linelen[lev][1],
  228. mh = s->mod[lev][0],
  229. mv = s->mod[lev][1],
  230. lp;
  231. float *l;
  232. // HOR_SD
  233. l = line + mh;
  234. for (lp = 0; lp < lv; lp++){
  235. int i, j = 0;
  236. // copy with interleaving
  237. for (i = mh; i < lh; i+=2, j++)
  238. l[i] = scale97[1-mh] * t[w*lp + j];
  239. for (i = 1-mh; i < lh; i+=2, j++)
  240. l[i] = scale97[1-mh] * t[w*lp + j];
  241. sr_1d97(line, mh, mh + lh);
  242. for (i = 0; i < lh; i++)
  243. t[w*lp + i] = l[i];
  244. }
  245. // VER_SD
  246. l = line + mv;
  247. for (lp = 0; lp < lh; lp++){
  248. int i, j = 0;
  249. // copy with interleaving
  250. for (i = mv; i < lv; i+=2, j++)
  251. l[i] = scale97[1-mv] * t[w*j + lp];
  252. for (i = 1-mv; i < lv; i+=2, j++)
  253. l[i] = scale97[1-mv] * t[w*j + lp];
  254. sr_1d97(line, mv, mv + lv);
  255. for (i = 0; i < lv; i++)
  256. t[w*i + lp] = l[i];
  257. }
  258. }
  259. }
  260. int ff_j2k_dwt_init(DWTContext *s, uint16_t border[2][2], int decomp_levels, int type)
  261. {
  262. int i, j, lev = decomp_levels, maxlen,
  263. b[2][2];
  264. if ((unsigned)decomp_levels >= FF_DWT_MAX_DECLVLS)
  265. return AVERROR_INVALIDDATA;
  266. s->ndeclevels = decomp_levels;
  267. s->type = type;
  268. for (i = 0; i < 2; i++)
  269. for(j = 0; j < 2; j++)
  270. b[i][j] = border[i][j];
  271. maxlen = FFMAX(b[0][1] - b[0][0],
  272. b[1][1] - b[1][0]);
  273. while(--lev >= 0){
  274. for (i = 0; i < 2; i++){
  275. s->linelen[lev][i] = b[i][1] - b[i][0];
  276. s->mod[lev][i] = b[i][0] & 1;
  277. for (j = 0; j < 2; j++)
  278. b[i][j] = (b[i][j] + 1) >> 1;
  279. }
  280. }
  281. if (type == FF_DWT97)
  282. s->linebuf = av_malloc((maxlen + 12) * sizeof(float));
  283. else if (type == FF_DWT53)
  284. s->linebuf = av_malloc((maxlen + 6) * sizeof(int));
  285. else
  286. return -1;
  287. if (!s->linebuf)
  288. return AVERROR(ENOMEM);
  289. return 0;
  290. }
  291. int ff_j2k_dwt_encode(DWTContext *s, int *t)
  292. {
  293. switch(s->type){
  294. case FF_DWT97:
  295. dwt_encode97(s, t); break;
  296. case FF_DWT53:
  297. dwt_encode53(s, t); break;
  298. default:
  299. return -1;
  300. }
  301. return 0;
  302. }
  303. int ff_j2k_dwt_decode(DWTContext *s, int *t)
  304. {
  305. switch(s->type){
  306. case FF_DWT97:
  307. dwt_decode97(s, t); break;
  308. case FF_DWT53:
  309. dwt_decode53(s, t); break;
  310. default:
  311. return -1;
  312. }
  313. return 0;
  314. }
  315. void ff_j2k_dwt_destroy(DWTContext *s)
  316. {
  317. av_freep(&s->linebuf);
  318. }