| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /* | ||
| 2 | * Copyright (c) 2014 Nicholas Robbins | ||
| 3 | * | ||
| 4 | * This file is part of FFmpeg. | ||
| 5 | * | ||
| 6 | * FFmpeg is free software; you can redistribute it and/or | ||
| 7 | * modify it under the terms of the GNU Lesser General Public | ||
| 8 | * License as published by the Free Software Foundation; either | ||
| 9 | * version 2.1 of the License, or (at your option) any later version. | ||
| 10 | * | ||
| 11 | * FFmpeg is distributed in the hope that it will be useful, | ||
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
| 14 | * Lesser General Public License for more details. | ||
| 15 | * | ||
| 16 | * You should have received a copy of the GNU Lesser General Public | ||
| 17 | * License along with FFmpeg; if not, write to the Free Software | ||
| 18 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | ||
| 19 | */ | ||
| 20 | |||
| 21 | /** | ||
| 22 | * @file | ||
| 23 | * remove judder in video stream | ||
| 24 | * | ||
| 25 | * Algorithm: | ||
| 26 | * - If the old packets had PTS of old_pts[i]. Replace these with new | ||
| 27 | * value based on the running average of the last n=cycle frames. So | ||
| 28 | * | ||
| 29 | * new_pts[i] = Sum(k=i-n+1, i, old_pts[k])/n | ||
| 30 | * + (old_pts[i]-old_pts[i-n])*(n-1)/2n | ||
| 31 | * | ||
| 32 | * For any repeating pattern of length n of judder this will produce | ||
| 33 | * an even progression of PTS's. | ||
| 34 | * | ||
| 35 | * - In order to avoid calculating this sum ever frame, a running tally | ||
| 36 | * is maintained in ctx->new_pts. Each frame the new term at the start | ||
| 37 | * of the sum is added, the one and the end is removed, and the offset | ||
| 38 | * terms (second line in formula above) are recalculated. | ||
| 39 | * | ||
| 40 | * - To aid in this a ringbuffer of the last n-2 PTS's is maintained in | ||
| 41 | * ctx->ringbuff. With the indices of the first two and last two entries | ||
| 42 | * stored in i1, i2, i3, & i4. | ||
| 43 | * | ||
| 44 | * - To ensure that the new PTS's are integers, time_base is divided | ||
| 45 | * by 2n. This removes the division in the new_pts calculation. | ||
| 46 | * | ||
| 47 | * - frame_rate is also multiplied by 2n to allow the frames to fall | ||
| 48 | * where they may in what may now be a VFR output. This produces more | ||
| 49 | * even output then setting frame_rate=1/0 in practice. | ||
| 50 | */ | ||
| 51 | |||
| 52 | #include "libavutil/mem.h" | ||
| 53 | #include "libavutil/opt.h" | ||
| 54 | #include "avfilter.h" | ||
| 55 | #include "filters.h" | ||
| 56 | |||
| 57 | typedef struct DejudderContext { | ||
| 58 | const AVClass *class; | ||
| 59 | int64_t *ringbuff; | ||
| 60 | int i1, i2, i3, i4; | ||
| 61 | int64_t new_pts; | ||
| 62 | int start_count; | ||
| 63 | |||
| 64 | /* options */ | ||
| 65 | int cycle; | ||
| 66 | } DejudderContext; | ||
| 67 | |||
| 68 | #define OFFSET(x) offsetof(DejudderContext, x) | ||
| 69 | #define FLAGS AV_OPT_FLAG_FILTERING_PARAM | AV_OPT_FLAG_VIDEO_PARAM | ||
| 70 | |||
| 71 | static const AVOption dejudder_options[] = { | ||
| 72 | {"cycle", "set the length of the cycle to use for dejuddering", | ||
| 73 | OFFSET(cycle), AV_OPT_TYPE_INT, {.i64 = 4}, 2, 240, .flags = FLAGS}, | ||
| 74 | {NULL} | ||
| 75 | }; | ||
| 76 | |||
| 77 | AVFILTER_DEFINE_CLASS(dejudder); | ||
| 78 | |||
| 79 | ✗ | static int config_out_props(AVFilterLink *outlink) | |
| 80 | { | ||
| 81 | ✗ | FilterLink *outl = ff_filter_link(outlink); | |
| 82 | ✗ | AVFilterContext *ctx = outlink->src; | |
| 83 | ✗ | DejudderContext *s = ctx->priv; | |
| 84 | ✗ | AVFilterLink *inlink = outlink->src->inputs[0]; | |
| 85 | ✗ | FilterLink *inl = ff_filter_link(inlink); | |
| 86 | |||
| 87 | ✗ | outlink->time_base = av_mul_q(inlink->time_base, av_make_q(1, 2 * s->cycle)); | |
| 88 | ✗ | outl->frame_rate = av_mul_q(inl->frame_rate, av_make_q(2 * s->cycle, 1)); | |
| 89 | |||
| 90 | ✗ | av_log(ctx, AV_LOG_VERBOSE, "cycle:%d\n", s->cycle); | |
| 91 | |||
| 92 | ✗ | return 0; | |
| 93 | } | ||
| 94 | |||
| 95 | ✗ | static av_cold int dejudder_init(AVFilterContext *ctx) | |
| 96 | { | ||
| 97 | ✗ | DejudderContext *s = ctx->priv; | |
| 98 | |||
| 99 | ✗ | s->ringbuff = av_calloc(s->cycle + 2, sizeof(*s->ringbuff)); | |
| 100 | ✗ | if (!s->ringbuff) | |
| 101 | ✗ | return AVERROR(ENOMEM); | |
| 102 | |||
| 103 | ✗ | s->new_pts = 0; | |
| 104 | ✗ | s->i1 = 0; | |
| 105 | ✗ | s->i2 = 1; | |
| 106 | ✗ | s->i3 = 2; | |
| 107 | ✗ | s->i4 = 3; | |
| 108 | ✗ | s->start_count = s->cycle + 2; | |
| 109 | |||
| 110 | ✗ | return 0; | |
| 111 | } | ||
| 112 | |||
| 113 | ✗ | static av_cold void dejudder_uninit(AVFilterContext *ctx) | |
| 114 | { | ||
| 115 | ✗ | DejudderContext *s = ctx->priv; | |
| 116 | |||
| 117 | ✗ | av_freep(&(s->ringbuff)); | |
| 118 | ✗ | } | |
| 119 | |||
| 120 | ✗ | static int filter_frame(AVFilterLink *inlink, AVFrame *frame) | |
| 121 | { | ||
| 122 | int k; | ||
| 123 | ✗ | AVFilterContext *ctx = inlink->dst; | |
| 124 | ✗ | AVFilterLink *outlink = ctx->outputs[0]; | |
| 125 | ✗ | DejudderContext *s = ctx->priv; | |
| 126 | ✗ | int64_t *judbuff = s->ringbuff; | |
| 127 | ✗ | int64_t next_pts = frame->pts; | |
| 128 | int64_t offset; | ||
| 129 | |||
| 130 | ✗ | if (next_pts == AV_NOPTS_VALUE) | |
| 131 | ✗ | return ff_filter_frame(outlink, frame); | |
| 132 | |||
| 133 | ✗ | if (s->start_count) { | |
| 134 | ✗ | s->start_count--; | |
| 135 | ✗ | s->new_pts = next_pts * 2 * s->cycle; | |
| 136 | } else { | ||
| 137 | ✗ | if (next_pts < judbuff[s->i2]) { | |
| 138 | ✗ | offset = next_pts + judbuff[s->i3] - judbuff[s->i4] - judbuff[s->i1]; | |
| 139 | ✗ | for (k = 0; k < s->cycle + 2; k++) | |
| 140 | ✗ | judbuff[k] += offset; | |
| 141 | } | ||
| 142 | ✗ | s->new_pts += (s->cycle - 1) * (judbuff[s->i3] - judbuff[s->i1]) | |
| 143 | ✗ | + (s->cycle + 1) * (next_pts - judbuff[s->i4]); | |
| 144 | } | ||
| 145 | |||
| 146 | ✗ | judbuff[s->i2] = next_pts; | |
| 147 | ✗ | s->i1 = s->i2; | |
| 148 | ✗ | s->i2 = s->i3; | |
| 149 | ✗ | s->i3 = s->i4; | |
| 150 | ✗ | s->i4 = (s->i4 + 1) % (s->cycle + 2); | |
| 151 | |||
| 152 | ✗ | frame->pts = s->new_pts; | |
| 153 | |||
| 154 | ✗ | for (k = 0; k < s->cycle + 2; k++) | |
| 155 | ✗ | av_log(ctx, AV_LOG_DEBUG, "%"PRId64"\t", judbuff[k]); | |
| 156 | ✗ | av_log(ctx, AV_LOG_DEBUG, "next=%"PRId64", new=%"PRId64"\n", next_pts, frame->pts); | |
| 157 | |||
| 158 | ✗ | return ff_filter_frame(outlink, frame); | |
| 159 | } | ||
| 160 | |||
| 161 | static const AVFilterPad dejudder_inputs[] = { | ||
| 162 | { | ||
| 163 | .name = "default", | ||
| 164 | .type = AVMEDIA_TYPE_VIDEO, | ||
| 165 | .filter_frame = filter_frame, | ||
| 166 | }, | ||
| 167 | }; | ||
| 168 | |||
| 169 | static const AVFilterPad dejudder_outputs[] = { | ||
| 170 | { | ||
| 171 | .name = "default", | ||
| 172 | .type = AVMEDIA_TYPE_VIDEO, | ||
| 173 | .config_props = config_out_props, | ||
| 174 | }, | ||
| 175 | }; | ||
| 176 | |||
| 177 | const AVFilter ff_vf_dejudder = { | ||
| 178 | .name = "dejudder", | ||
| 179 | .description = NULL_IF_CONFIG_SMALL("Remove judder produced by pullup."), | ||
| 180 | .priv_size = sizeof(DejudderContext), | ||
| 181 | .priv_class = &dejudder_class, | ||
| 182 | FILTER_INPUTS(dejudder_inputs), | ||
| 183 | FILTER_OUTPUTS(dejudder_outputs), | ||
| 184 | .init = dejudder_init, | ||
| 185 | .uninit = dejudder_uninit, | ||
| 186 | }; | ||
| 187 |