Re: Averaging preprocessor

On Tue 17 December 2002 19:48, Jarno Elonen wrote:
> Hi,
>
> I've been thinking of a little preprocessing method that would
> make video material (and especially animation) more efficient to
> compress:
>
>   a) divide the stream into blocks
>   c) for each block, decide if the contents is still essentially
>      the same as in last N frames (i.e. nothing has occluded the
>      picture, picture has not moved and there has not been a cut
>      in the video)
>   d) if so, add block's values to those last N frame's
>   e) if not, calculate an average and use it to replace all
>      blocks that contributed to it

Hmm, I can't see why this would be better than for example MPEG=20
simply reusing a block in the next frame at the same location. The=20
only difference is the averaging, which would indeed save some=20
noise, but I don't see how it would be more efficient to compress.

Then again, I may just not get it :-).

Lourens

--=20
GPG public key: http://home.student.utwente.nl/l.e.veen/lourens.key

--- >8 ----
List archives:  http://www.xiph.org/archives/
Ogg project homepage: http://www.xiph.org/ogg/
To unsubscribe from this list, send a message to '[email protected]'
containing only the word 'unsubscribe' in the body.  No subject is needed.
Unsubscribe messages sent to the list will be ignored/filtered.