vf_deshake.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560
  1. /*
  2. * Copyright (C) 2010 Georg Martius <georg.martius@web.de>
  3. * Copyright (C) 2010 Daniel G. Taylor <dan@programmer-art.org>
  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. * @file
  23. * fast deshake / depan video filter
  24. *
  25. * SAD block-matching motion compensation to fix small changes in
  26. * horizontal and/or vertical shift. This filter helps remove camera shake
  27. * from hand-holding a camera, bumping a tripod, moving on a vehicle, etc.
  28. *
  29. * Algorithm:
  30. * - For each frame with one previous reference frame
  31. * - For each block in the frame
  32. * - If contrast > threshold then find likely motion vector
  33. * - For all found motion vectors
  34. * - Find most common, store as global motion vector
  35. * - Find most likely rotation angle
  36. * - Transform image along global motion
  37. *
  38. * TODO:
  39. * - Fill frame edges based on previous/next reference frames
  40. * - Fill frame edges by stretching image near the edges?
  41. * - Can this be done quickly and look decent?
  42. *
  43. * Dark Shikari links to http://wiki.videolan.org/SoC_x264_2010#GPU_Motion_Estimation_2
  44. * for an algorithm similar to what could be used here to get the gmv
  45. * It requires only a couple diamond searches + fast downscaling
  46. *
  47. * Special thanks to Jason Kotenko for his help with the algorithm and my
  48. * inability to see simple errors in C code.
  49. */
  50. #include "avfilter.h"
  51. #include "formats.h"
  52. #include "internal.h"
  53. #include "video.h"
  54. #include "libavutil/common.h"
  55. #include "libavutil/mem.h"
  56. #include "libavutil/opt.h"
  57. #include "libavutil/pixdesc.h"
  58. #include "libavutil/qsort.h"
  59. #include "deshake.h"
  60. #define OFFSET(x) offsetof(DeshakeContext, x)
  61. #define FLAGS AV_OPT_FLAG_VIDEO_PARAM|AV_OPT_FLAG_FILTERING_PARAM
  62. static const AVOption deshake_options[] = {
  63. { "x", "set x for the rectangular search area", OFFSET(cx), AV_OPT_TYPE_INT, {.i64=-1}, -1, INT_MAX, .flags = FLAGS },
  64. { "y", "set y for the rectangular search area", OFFSET(cy), AV_OPT_TYPE_INT, {.i64=-1}, -1, INT_MAX, .flags = FLAGS },
  65. { "w", "set width for the rectangular search area", OFFSET(cw), AV_OPT_TYPE_INT, {.i64=-1}, -1, INT_MAX, .flags = FLAGS },
  66. { "h", "set height for the rectangular search area", OFFSET(ch), AV_OPT_TYPE_INT, {.i64=-1}, -1, INT_MAX, .flags = FLAGS },
  67. { "rx", "set x for the rectangular search area", OFFSET(rx), AV_OPT_TYPE_INT, {.i64=16}, 0, MAX_R, .flags = FLAGS },
  68. { "ry", "set y for the rectangular search area", OFFSET(ry), AV_OPT_TYPE_INT, {.i64=16}, 0, MAX_R, .flags = FLAGS },
  69. { "edge", "set edge mode", OFFSET(edge), AV_OPT_TYPE_INT, {.i64=FILL_MIRROR}, FILL_BLANK, FILL_COUNT-1, FLAGS, "edge"},
  70. { "blank", "fill zeroes at blank locations", 0, AV_OPT_TYPE_CONST, {.i64=FILL_BLANK}, INT_MIN, INT_MAX, FLAGS, "edge" },
  71. { "original", "original image at blank locations", 0, AV_OPT_TYPE_CONST, {.i64=FILL_ORIGINAL}, INT_MIN, INT_MAX, FLAGS, "edge" },
  72. { "clamp", "extruded edge value at blank locations", 0, AV_OPT_TYPE_CONST, {.i64=FILL_CLAMP}, INT_MIN, INT_MAX, FLAGS, "edge" },
  73. { "mirror", "mirrored edge at blank locations", 0, AV_OPT_TYPE_CONST, {.i64=FILL_MIRROR}, INT_MIN, INT_MAX, FLAGS, "edge" },
  74. { "blocksize", "set motion search blocksize", OFFSET(blocksize), AV_OPT_TYPE_INT, {.i64=8}, 4, 128, .flags = FLAGS },
  75. { "contrast", "set contrast threshold for blocks", OFFSET(contrast), AV_OPT_TYPE_INT, {.i64=125}, 1, 255, .flags = FLAGS },
  76. { "search", "set search strategy", OFFSET(search), AV_OPT_TYPE_INT, {.i64=EXHAUSTIVE}, EXHAUSTIVE, SEARCH_COUNT-1, FLAGS, "smode" },
  77. { "exhaustive", "exhaustive search", 0, AV_OPT_TYPE_CONST, {.i64=EXHAUSTIVE}, INT_MIN, INT_MAX, FLAGS, "smode" },
  78. { "less", "less exhaustive search", 0, AV_OPT_TYPE_CONST, {.i64=SMART_EXHAUSTIVE}, INT_MIN, INT_MAX, FLAGS, "smode" },
  79. { "filename", "set motion search detailed log file name", OFFSET(filename), AV_OPT_TYPE_STRING, {.str=NULL}, .flags = FLAGS },
  80. { "opencl", "ignored", OFFSET(opencl), AV_OPT_TYPE_BOOL, {.i64=0}, 0, 1, .flags = FLAGS },
  81. { NULL }
  82. };
  83. AVFILTER_DEFINE_CLASS(deshake);
  84. static int cmp(const void *a, const void *b)
  85. {
  86. return FFDIFFSIGN(*(const double *)a, *(const double *)b);
  87. }
  88. /**
  89. * Cleaned mean (cuts off 20% of values to remove outliers and then averages)
  90. */
  91. static double clean_mean(double *values, int count)
  92. {
  93. double mean = 0;
  94. int cut = count / 5;
  95. int x;
  96. AV_QSORT(values, count, double, cmp);
  97. for (x = cut; x < count - cut; x++) {
  98. mean += values[x];
  99. }
  100. return mean / (count - cut * 2);
  101. }
  102. /**
  103. * Find the most likely shift in motion between two frames for a given
  104. * macroblock. Test each block against several shifts given by the rx
  105. * and ry attributes. Searches using a simple matrix of those shifts and
  106. * chooses the most likely shift by the smallest difference in blocks.
  107. */
  108. static void find_block_motion(DeshakeContext *deshake, uint8_t *src1,
  109. uint8_t *src2, int cx, int cy, int stride,
  110. IntMotionVector *mv)
  111. {
  112. int x, y;
  113. int diff;
  114. int smallest = INT_MAX;
  115. int tmp, tmp2;
  116. #define CMP(i, j) deshake->sad(src1 + cy * stride + cx, stride,\
  117. src2 + (j) * stride + (i), stride)
  118. if (deshake->search == EXHAUSTIVE) {
  119. // Compare every possible position - this is sloooow!
  120. for (y = -deshake->ry; y <= deshake->ry; y++) {
  121. for (x = -deshake->rx; x <= deshake->rx; x++) {
  122. diff = CMP(cx - x, cy - y);
  123. if (diff < smallest) {
  124. smallest = diff;
  125. mv->x = x;
  126. mv->y = y;
  127. }
  128. }
  129. }
  130. } else if (deshake->search == SMART_EXHAUSTIVE) {
  131. // Compare every other possible position and find the best match
  132. for (y = -deshake->ry + 1; y < deshake->ry; y += 2) {
  133. for (x = -deshake->rx + 1; x < deshake->rx; x += 2) {
  134. diff = CMP(cx - x, cy - y);
  135. if (diff < smallest) {
  136. smallest = diff;
  137. mv->x = x;
  138. mv->y = y;
  139. }
  140. }
  141. }
  142. // Hone in on the specific best match around the match we found above
  143. tmp = mv->x;
  144. tmp2 = mv->y;
  145. for (y = tmp2 - 1; y <= tmp2 + 1; y++) {
  146. for (x = tmp - 1; x <= tmp + 1; x++) {
  147. if (x == tmp && y == tmp2)
  148. continue;
  149. diff = CMP(cx - x, cy - y);
  150. if (diff < smallest) {
  151. smallest = diff;
  152. mv->x = x;
  153. mv->y = y;
  154. }
  155. }
  156. }
  157. }
  158. if (smallest > 512) {
  159. mv->x = -1;
  160. mv->y = -1;
  161. }
  162. emms_c();
  163. //av_log(NULL, AV_LOG_ERROR, "%d\n", smallest);
  164. //av_log(NULL, AV_LOG_ERROR, "Final: (%d, %d) = %d x %d\n", cx, cy, mv->x, mv->y);
  165. }
  166. /**
  167. * Find the contrast of a given block. When searching for global motion we
  168. * really only care about the high contrast blocks, so using this method we
  169. * can actually skip blocks we don't care much about.
  170. */
  171. static int block_contrast(uint8_t *src, int x, int y, int stride, int blocksize)
  172. {
  173. int highest = 0;
  174. int lowest = 255;
  175. int i, j, pos;
  176. for (i = 0; i <= blocksize * 2; i++) {
  177. // We use a width of 16 here to match the sad function
  178. for (j = 0; j <= 15; j++) {
  179. pos = (y + i) * stride + (x + j);
  180. if (src[pos] < lowest)
  181. lowest = src[pos];
  182. else if (src[pos] > highest) {
  183. highest = src[pos];
  184. }
  185. }
  186. }
  187. return highest - lowest;
  188. }
  189. /**
  190. * Find the rotation for a given block.
  191. */
  192. static double block_angle(int x, int y, int cx, int cy, IntMotionVector *shift)
  193. {
  194. double a1, a2, diff;
  195. a1 = atan2(y - cy, x - cx);
  196. a2 = atan2(y - cy + shift->y, x - cx + shift->x);
  197. diff = a2 - a1;
  198. return (diff > M_PI) ? diff - 2 * M_PI :
  199. (diff < -M_PI) ? diff + 2 * M_PI :
  200. diff;
  201. }
  202. /**
  203. * Find the estimated global motion for a scene given the most likely shift
  204. * for each block in the frame. The global motion is estimated to be the
  205. * same as the motion from most blocks in the frame, so if most blocks
  206. * move one pixel to the right and two pixels down, this would yield a
  207. * motion vector (1, -2).
  208. */
  209. static void find_motion(DeshakeContext *deshake, uint8_t *src1, uint8_t *src2,
  210. int width, int height, int stride, Transform *t)
  211. {
  212. int x, y;
  213. IntMotionVector mv = {0, 0};
  214. int count_max_value = 0;
  215. int contrast;
  216. int pos;
  217. int center_x = 0, center_y = 0;
  218. double p_x, p_y;
  219. av_fast_malloc(&deshake->angles, &deshake->angles_size, width * height / (16 * deshake->blocksize) * sizeof(*deshake->angles));
  220. // Reset counts to zero
  221. for (x = 0; x < deshake->rx * 2 + 1; x++) {
  222. for (y = 0; y < deshake->ry * 2 + 1; y++) {
  223. deshake->counts[x][y] = 0;
  224. }
  225. }
  226. pos = 0;
  227. // Find motion for every block and store the motion vector in the counts
  228. for (y = deshake->ry; y < height - deshake->ry - (deshake->blocksize * 2); y += deshake->blocksize * 2) {
  229. // We use a width of 16 here to match the sad function
  230. for (x = deshake->rx; x < width - deshake->rx - 16; x += 16) {
  231. // If the contrast is too low, just skip this block as it probably
  232. // won't be very useful to us.
  233. contrast = block_contrast(src2, x, y, stride, deshake->blocksize);
  234. if (contrast > deshake->contrast) {
  235. //av_log(NULL, AV_LOG_ERROR, "%d\n", contrast);
  236. find_block_motion(deshake, src1, src2, x, y, stride, &mv);
  237. if (mv.x != -1 && mv.y != -1) {
  238. deshake->counts[mv.x + deshake->rx][mv.y + deshake->ry] += 1;
  239. if (x > deshake->rx && y > deshake->ry)
  240. deshake->angles[pos++] = block_angle(x, y, 0, 0, &mv);
  241. center_x += mv.x;
  242. center_y += mv.y;
  243. }
  244. }
  245. }
  246. }
  247. if (pos) {
  248. center_x /= pos;
  249. center_y /= pos;
  250. t->angle = clean_mean(deshake->angles, pos);
  251. if (t->angle < 0.001)
  252. t->angle = 0;
  253. } else {
  254. t->angle = 0;
  255. }
  256. // Find the most common motion vector in the frame and use it as the gmv
  257. for (y = deshake->ry * 2; y >= 0; y--) {
  258. for (x = 0; x < deshake->rx * 2 + 1; x++) {
  259. //av_log(NULL, AV_LOG_ERROR, "%5d ", deshake->counts[x][y]);
  260. if (deshake->counts[x][y] > count_max_value) {
  261. t->vec.x = x - deshake->rx;
  262. t->vec.y = y - deshake->ry;
  263. count_max_value = deshake->counts[x][y];
  264. }
  265. }
  266. //av_log(NULL, AV_LOG_ERROR, "\n");
  267. }
  268. p_x = (center_x - width / 2.0);
  269. p_y = (center_y - height / 2.0);
  270. t->vec.x += (cos(t->angle)-1)*p_x - sin(t->angle)*p_y;
  271. t->vec.y += sin(t->angle)*p_x + (cos(t->angle)-1)*p_y;
  272. // Clamp max shift & rotation?
  273. t->vec.x = av_clipf(t->vec.x, -deshake->rx * 2, deshake->rx * 2);
  274. t->vec.y = av_clipf(t->vec.y, -deshake->ry * 2, deshake->ry * 2);
  275. t->angle = av_clipf(t->angle, -0.1, 0.1);
  276. //av_log(NULL, AV_LOG_ERROR, "%d x %d\n", avg->x, avg->y);
  277. }
  278. static int deshake_transform_c(AVFilterContext *ctx,
  279. int width, int height, int cw, int ch,
  280. const float *matrix_y, const float *matrix_uv,
  281. enum InterpolateMethod interpolate,
  282. enum FillMethod fill, AVFrame *in, AVFrame *out)
  283. {
  284. int i = 0, ret = 0;
  285. const float *matrixs[3];
  286. int plane_w[3], plane_h[3];
  287. matrixs[0] = matrix_y;
  288. matrixs[1] = matrixs[2] = matrix_uv;
  289. plane_w[0] = width;
  290. plane_w[1] = plane_w[2] = cw;
  291. plane_h[0] = height;
  292. plane_h[1] = plane_h[2] = ch;
  293. for (i = 0; i < 3; i++) {
  294. // Transform the luma and chroma planes
  295. ret = avfilter_transform(in->data[i], out->data[i], in->linesize[i], out->linesize[i],
  296. plane_w[i], plane_h[i], matrixs[i], interpolate, fill);
  297. if (ret < 0)
  298. return ret;
  299. }
  300. return ret;
  301. }
  302. static av_cold int init(AVFilterContext *ctx)
  303. {
  304. DeshakeContext *deshake = ctx->priv;
  305. deshake->refcount = 20; // XXX: add to options?
  306. deshake->blocksize /= 2;
  307. deshake->blocksize = av_clip(deshake->blocksize, 4, 128);
  308. if (deshake->rx % 16) {
  309. av_log(ctx, AV_LOG_ERROR, "rx must be a multiple of 16\n");
  310. return AVERROR_PATCHWELCOME;
  311. }
  312. if (deshake->filename)
  313. deshake->fp = fopen(deshake->filename, "w");
  314. if (deshake->fp)
  315. fwrite("Ori x, Avg x, Fin x, Ori y, Avg y, Fin y, Ori angle, Avg angle, Fin angle, Ori zoom, Avg zoom, Fin zoom\n", sizeof(char), 104, deshake->fp);
  316. // Quadword align left edge of box for MMX code, adjust width if necessary
  317. // to keep right margin
  318. if (deshake->cx > 0) {
  319. deshake->cw += deshake->cx - (deshake->cx & ~15);
  320. deshake->cx &= ~15;
  321. }
  322. deshake->transform = deshake_transform_c;
  323. av_log(ctx, AV_LOG_VERBOSE, "cx: %d, cy: %d, cw: %d, ch: %d, rx: %d, ry: %d, edge: %d blocksize: %d contrast: %d search: %d\n",
  324. deshake->cx, deshake->cy, deshake->cw, deshake->ch,
  325. deshake->rx, deshake->ry, deshake->edge, deshake->blocksize * 2, deshake->contrast, deshake->search);
  326. return 0;
  327. }
  328. static int query_formats(AVFilterContext *ctx)
  329. {
  330. static const enum AVPixelFormat pix_fmts[] = {
  331. AV_PIX_FMT_YUV420P, AV_PIX_FMT_YUV422P, AV_PIX_FMT_YUV444P, AV_PIX_FMT_YUV410P,
  332. AV_PIX_FMT_YUV411P, AV_PIX_FMT_YUV440P, AV_PIX_FMT_YUVJ420P, AV_PIX_FMT_YUVJ422P,
  333. AV_PIX_FMT_YUVJ444P, AV_PIX_FMT_YUVJ440P, AV_PIX_FMT_NONE
  334. };
  335. AVFilterFormats *fmts_list = ff_make_format_list(pix_fmts);
  336. if (!fmts_list)
  337. return AVERROR(ENOMEM);
  338. return ff_set_common_formats(ctx, fmts_list);
  339. }
  340. static int config_props(AVFilterLink *link)
  341. {
  342. DeshakeContext *deshake = link->dst->priv;
  343. deshake->ref = NULL;
  344. deshake->last.vec.x = 0;
  345. deshake->last.vec.y = 0;
  346. deshake->last.angle = 0;
  347. deshake->last.zoom = 0;
  348. return 0;
  349. }
  350. static av_cold void uninit(AVFilterContext *ctx)
  351. {
  352. DeshakeContext *deshake = ctx->priv;
  353. av_frame_free(&deshake->ref);
  354. av_freep(&deshake->angles);
  355. deshake->angles_size = 0;
  356. if (deshake->fp)
  357. fclose(deshake->fp);
  358. }
  359. static int filter_frame(AVFilterLink *link, AVFrame *in)
  360. {
  361. DeshakeContext *deshake = link->dst->priv;
  362. AVFilterLink *outlink = link->dst->outputs[0];
  363. AVFrame *out;
  364. Transform t = {{0},0}, orig = {{0},0};
  365. float matrix_y[9], matrix_uv[9];
  366. float alpha = 2.0 / deshake->refcount;
  367. char tmp[256];
  368. int ret = 0;
  369. const AVPixFmtDescriptor *desc = av_pix_fmt_desc_get(link->format);
  370. const int chroma_width = AV_CEIL_RSHIFT(link->w, desc->log2_chroma_w);
  371. const int chroma_height = AV_CEIL_RSHIFT(link->h, desc->log2_chroma_h);
  372. int aligned;
  373. out = ff_get_video_buffer(outlink, outlink->w, outlink->h);
  374. if (!out) {
  375. av_frame_free(&in);
  376. return AVERROR(ENOMEM);
  377. }
  378. av_frame_copy_props(out, in);
  379. aligned = !((intptr_t)in->data[0] & 15 | in->linesize[0] & 15);
  380. deshake->sad = av_pixelutils_get_sad_fn(4, 4, aligned, deshake); // 16x16, 2nd source unaligned
  381. if (!deshake->sad)
  382. return AVERROR(EINVAL);
  383. if (deshake->cx < 0 || deshake->cy < 0 || deshake->cw < 0 || deshake->ch < 0) {
  384. // Find the most likely global motion for the current frame
  385. find_motion(deshake, (deshake->ref == NULL) ? in->data[0] : deshake->ref->data[0], in->data[0], link->w, link->h, in->linesize[0], &t);
  386. } else {
  387. uint8_t *src1 = (deshake->ref == NULL) ? in->data[0] : deshake->ref->data[0];
  388. uint8_t *src2 = in->data[0];
  389. deshake->cx = FFMIN(deshake->cx, link->w);
  390. deshake->cy = FFMIN(deshake->cy, link->h);
  391. if ((unsigned)deshake->cx + (unsigned)deshake->cw > link->w) deshake->cw = link->w - deshake->cx;
  392. if ((unsigned)deshake->cy + (unsigned)deshake->ch > link->h) deshake->ch = link->h - deshake->cy;
  393. // Quadword align right margin
  394. deshake->cw &= ~15;
  395. src1 += deshake->cy * in->linesize[0] + deshake->cx;
  396. src2 += deshake->cy * in->linesize[0] + deshake->cx;
  397. find_motion(deshake, src1, src2, deshake->cw, deshake->ch, in->linesize[0], &t);
  398. }
  399. // Copy transform so we can output it later to compare to the smoothed value
  400. orig.vec.x = t.vec.x;
  401. orig.vec.y = t.vec.y;
  402. orig.angle = t.angle;
  403. orig.zoom = t.zoom;
  404. // Generate a one-sided moving exponential average
  405. deshake->avg.vec.x = alpha * t.vec.x + (1.0 - alpha) * deshake->avg.vec.x;
  406. deshake->avg.vec.y = alpha * t.vec.y + (1.0 - alpha) * deshake->avg.vec.y;
  407. deshake->avg.angle = alpha * t.angle + (1.0 - alpha) * deshake->avg.angle;
  408. deshake->avg.zoom = alpha * t.zoom + (1.0 - alpha) * deshake->avg.zoom;
  409. // Remove the average from the current motion to detect the motion that
  410. // is not on purpose, just as jitter from bumping the camera
  411. t.vec.x -= deshake->avg.vec.x;
  412. t.vec.y -= deshake->avg.vec.y;
  413. t.angle -= deshake->avg.angle;
  414. t.zoom -= deshake->avg.zoom;
  415. // Invert the motion to undo it
  416. t.vec.x *= -1;
  417. t.vec.y *= -1;
  418. t.angle *= -1;
  419. // Write statistics to file
  420. if (deshake->fp) {
  421. snprintf(tmp, 256, "%f, %f, %f, %f, %f, %f, %f, %f, %f, %f, %f, %f\n", orig.vec.x, deshake->avg.vec.x, t.vec.x, orig.vec.y, deshake->avg.vec.y, t.vec.y, orig.angle, deshake->avg.angle, t.angle, orig.zoom, deshake->avg.zoom, t.zoom);
  422. fwrite(tmp, sizeof(char), strlen(tmp), deshake->fp);
  423. }
  424. // Turn relative current frame motion into absolute by adding it to the
  425. // last absolute motion
  426. t.vec.x += deshake->last.vec.x;
  427. t.vec.y += deshake->last.vec.y;
  428. t.angle += deshake->last.angle;
  429. t.zoom += deshake->last.zoom;
  430. // Shrink motion by 10% to keep things centered in the camera frame
  431. t.vec.x *= 0.9;
  432. t.vec.y *= 0.9;
  433. t.angle *= 0.9;
  434. // Store the last absolute motion information
  435. deshake->last.vec.x = t.vec.x;
  436. deshake->last.vec.y = t.vec.y;
  437. deshake->last.angle = t.angle;
  438. deshake->last.zoom = t.zoom;
  439. // Generate a luma transformation matrix
  440. avfilter_get_matrix(t.vec.x, t.vec.y, t.angle, 1.0 + t.zoom / 100.0, matrix_y);
  441. // Generate a chroma transformation matrix
  442. avfilter_get_matrix(t.vec.x / (link->w / chroma_width), t.vec.y / (link->h / chroma_height), t.angle, 1.0 + t.zoom / 100.0, matrix_uv);
  443. // Transform the luma and chroma planes
  444. ret = deshake->transform(link->dst, link->w, link->h, chroma_width, chroma_height,
  445. matrix_y, matrix_uv, INTERPOLATE_BILINEAR, deshake->edge, in, out);
  446. // Cleanup the old reference frame
  447. av_frame_free(&deshake->ref);
  448. if (ret < 0)
  449. goto fail;
  450. // Store the current frame as the reference frame for calculating the
  451. // motion of the next frame
  452. deshake->ref = in;
  453. return ff_filter_frame(outlink, out);
  454. fail:
  455. av_frame_free(&out);
  456. return ret;
  457. }
  458. static const AVFilterPad deshake_inputs[] = {
  459. {
  460. .name = "default",
  461. .type = AVMEDIA_TYPE_VIDEO,
  462. .filter_frame = filter_frame,
  463. .config_props = config_props,
  464. },
  465. { NULL }
  466. };
  467. static const AVFilterPad deshake_outputs[] = {
  468. {
  469. .name = "default",
  470. .type = AVMEDIA_TYPE_VIDEO,
  471. },
  472. { NULL }
  473. };
  474. AVFilter ff_vf_deshake = {
  475. .name = "deshake",
  476. .description = NULL_IF_CONFIG_SMALL("Stabilize shaky video."),
  477. .priv_size = sizeof(DeshakeContext),
  478. .init = init,
  479. .uninit = uninit,
  480. .query_formats = query_formats,
  481. .inputs = deshake_inputs,
  482. .outputs = deshake_outputs,
  483. .priv_class = &deshake_class,
  484. };