Menu

Svn Commit Log


Commit Date  
[r2469] by ulatec

The BUGS section used to say there was a need for a dynamic noise
reduction tool. We now have 2.

2004-11-10 15:53:05 Tree
[r2468] by ulatec

Changed reference to "yuvdenoise -I" to "yuvdeinterlace".

2004-11-10 15:50:34 Tree
[r2467] by stefan_fendt

*** empty log message ***

2004-11-10 15:22:48 Tree
[r2466] by ulatec

Rewrote the top-level denoising. The search-border is no longer used.
For every pixel-group, the denoiser now keeps the match-count-throttle
matches with the lowest SAD, and flood-fills each until the resulting
region is at least match-size-throttle pixel-groups big, then applies
that region right then and there. This new algorithm is a lot simpler
than the previous one, but seems to work a lot better.

Also, a nasty bug was fixed in the way the extent of applied regions
are removed from the search-window cells. VERY nasty bug. It
technically produced broken data.

Image quality has improved DRAMATICALLY. Performance has increased from
anywhere between 20% (for normal video) to 35% (for pathological video).

2004-11-10 05:15:43 Tree
[r2465] by ulatec

Purge() now takes an x/y offset, to allow moved regions to be processed
correctly.

2004-11-10 05:11:44 Tree
[r2464] by ulatec

Now purges the pixel-sorter tree every 10 frames, instead of every 100
frames. Changing algorithms require changing fudge factors...

2004-11-10 05:11:05 Tree
[r2463] by ulatec

Changed the default match-size throttle (since it means something
different now).

2004-11-10 05:10:29 Tree
[r2462] by stefan_fendt

partly implemented general-sampling-theorem interpolation.
The image-quality now is far far better. memory handly is
a remaining problem, as some functions need to overshoot for
reasons of speed...
So it may not work on MACs/PPC... :((

2004-11-05 08:30:18 Tree
[r2461] by sms00

Need to add the $extra_cflags to CXXFLAGS for the C++ modules (mpeg2enc and mplex)

2004-11-05 00:46:45 Tree
[r2460] by sms00

min = 2 * abs(*(frame+x+(y-1)*width) - *(frame+x+(y+1)*width)) is a lot
better (especially inside a double nested loop) than:
d = *(frame+x+(y-1)*width) - *(frame+x+(y+1)*width) ;
min = d < 0 ? -d:d;
d = *(frame+x+(y-1)*width) - *(frame+x+(y+1)*width) ;
min += d < 0 ? -d:d;
Also do a bit of tidying (unused/unneded ABS macro removed)

2004-11-05 00:15:29 Tree
Older >
Monday.com Logo