[FFmpeg-devel] [PATCH] [2/??] [3/3] Filter graphs - Parser for a graph description
Tue Mar 18 23:13:25 CET 2008
Michael Niedermayer wrote:
> On Tue, Mar 18, 2008 at 09:29:51AM +0000, vmrsss wrote:
> > (F) If I understood your examples correctly (which I might have
> > not)`, there is still one missing ingredient: a feedback
> > combinator, say !, which takes a filter with at least one input and
> > at least one output stream and feeds back the first output to the
> > first input. For instance, let's look at the examples you have been
> > discussing in this thread:
> > (1)
> > > in --> scale --> crop --> picInPic --> rotate --> split --> out
> > > ^ |
> > > | |
> > > delay<-------------------/
> > becomes: scale,crop, !( picInPic, rotate, split, delay * nop ) --
> > in fact the duplicated stream from split is fed to delay and
> > delay's output is then fed back to picInPic (if that was the sense
> > of the example, of course...)
> How does the following work in your system?
If I understood correctly, this would look like this:
* (swap, !(swap*nop,nop*swap,filter2))
Well, not very beautiful, but at least, it is possible to describe such
a filter chain.
I suppose this would not exactly be a common filter chain, and I also
suppose that filter1 and filter2 would naturally be designed so that
their "natural" self-feedback in and out pad would be the first pad.
This would highly simplify this filter graph. Here is an example of
the exact same graph, with ideally ordered filters pad:
!(swap*nop, !( !filter1 * !filter2, nop*swap*nop, swap,nop,nop))
So IMO, this case just show that "mathematical" description allows
to represent complex graph as well as the original description.
But it don't show which one is the most simple/intuitive to
describe commonly used graph (ie. graph with no feedback or at
most one feedback).
More information about the ffmpeg-devel