1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391
|
/*///////////////////////////////////////////////////////////////////////////
// $Id: DI_TwoFrame.c,v 1.6 2006/04/12 01:43:21 mschimek Exp $
/////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2000 Steven Grimm. All rights reserved.
/////////////////////////////////////////////////////////////////////////////
//
// This file is subject to the terms of the GNU General Public License as
// published by the Free Software Foundation. A copy of this license is
// included with this software distribution in the file COPYING. If you
// do not have a copy, you may obtain a copy by writing to the Free
// Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
//
// This software is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details
///////////////////////////////////////////////////////////////////////////////
// Change Log
//
// Date Developer Changes
//
// 30 Dec 2000 Mark Rejhon Split into separate module
//
/////////////////////////////////////////////////////////////////////////////
// CVS Log
//
// $Log: DI_TwoFrame.c,v $
// Revision 1.6 2006/04/12 01:43:21 mschimek
// s/CPU_FEATURE_SSE/CPU_FEATURE_SSE_INT.
//
// Revision 1.5 2005/06/28 19:17:10 mschimek
// *** empty log message ***
//
// Revision 1.4 2005/06/28 00:47:43 mschimek
// Cleaned up.
// Replaced longs by ints for proper operation on LP64 machines. Code
// assumes option values cast to int.
// AltiVec compile fixes.
//
// Revision 1.3.2.5 2005/06/17 02:54:20 mschimek
// *** empty log message ***
//
// Revision 1.3.2.4 2005/05/31 02:40:34 mschimek
// *** empty log message ***
//
// Revision 1.3.2.3 2005/05/20 05:45:14 mschimek
// *** empty log message ***
//
// Revision 1.3.2.2 2005/05/17 19:58:32 mschimek
// *** empty log message ***
//
// Revision 1.3.2.1 2005/05/05 09:46:01 mschimek
// *** empty log message ***
//
// Revision 1.3 2005/03/30 21:26:54 mschimek
// Integrated and converted the MMX code to vector intrinsics.
//
// Revision 1.2 2005/02/05 22:19:14 mschimek
// Completed l18n.
//
// Revision 1.1 2005/01/08 14:34:04 mschimek
// TomsMoCompMethod, MoComp2Method, VideoWeaveMethod, VideoBobMethod,
// TwoFrameMethod, OldGameMethod, Greedy2FrameMethod, GreedyMethod,
// DI_GreedyHSettings: Localized.
//
// Revision 1.2 2004/11/15 23:03:19 michael
// *** empty log message ***
//
// Revision 1.1 2004/11/14 15:35:14 michael
// *** empty log message ***
//
// Revision 1.6 2002/06/18 19:46:07 adcockj
// Changed appliaction Messages to use WM_APP instead of WM_USER
//
// Revision 1.5 2002/06/13 12:10:24 adcockj
// Move to new Setings dialog for filers, video deint and advanced settings
//
// Revision 1.4 2001/07/13 16:13:33 adcockj
// Added CVS tags and removed tabs
//
///////////////////////////////////////////////////////////////////////////*/
#include "windows.h"
#include "DS_Deinterlace.h"
extern int TwoFrameTemporalTolerance;
extern int TwoFrameSpatialTolerance;
SIMD_FN_PROTOS (DEINTERLACE_FUNC, DeinterlaceFieldTwoFrame);
#if SIMD & (CPU_FEATURE_MMX | CPU_FEATURE_3DNOW | \
CPU_FEATURE_SSE_INT | CPU_FEATURE_SSE2 | CPU_FEATURE_ALTIVEC)
/*/////////////////////////////////////////////////////////////////////////////
// Deinterlace the latest field, attempting to weave wherever it won't cause
// visible artifacts.
//
// The data from the most recently captured field is always copied to the
// overlay verbatim. For the data from the previous field, the following
// algorithm is applied to each pixel.
//
// We use the following notation for the top, middle, and bottom pixels
// of concern:
//
// Field 1 | Field 2 | Field 3 | Field 4 |
// | T0 | | T1 | scanline we copied in last iteration
// M0 | | M1 | | interm. scanline from altern. field
// | B0 | | B1 | scanline we just copied
//
// We will weave M1 into the image if any of the following is true:
// - M1 is similar to either B1 or T1. This indicates that no weave
// artifacts would be visible. The SpatialTolerance setting controls
// how far apart the luminances can be before pixels are considered
// non-similar.
// - T1 and B1 and M1 are old. In that case any weave artifact that
// appears isn't due to fast motion, since it was there in the previous
// frame too. By "old" I mean similar to their counterparts in the
// previous frame; TemporalTolerance controls the maximum squared
// luminance difference above which a pixel is considered "new".
//
// Pixels are processed 4 at a time using MMX instructions.
//
// SQUARING NOTE:
// We square luminance differences to amplify the effects of large
// differences and to avoid dealing with negative differences. Unfortunately,
// we can't compare the square of difference directly against a threshold,
// thanks to the lack of an MMX unsigned compare instruction. The
// problem is that if we had two pixels with luminance 0 and 255,
// the difference squared would be 65025, which is a negative
// 16-bit signed value and would thus compare less than a threshold.
// We get around this by dividing all the luminance values by two before
// squaring them; this results in an effective maximum luminance
// difference of 127, whose square (16129) is safely comparable.
*/
static always_inline v16
cmpsqdiff (v16 a,
v16 b,
v16 thresh)
{
v16 t;
vu16 m;
#if SIMD == CPU_FEATURE_ALTIVEC
t = vsubs16 (a, b);
m = vmullo16 (t, t);
return (v16) vcmpgtu16 (m, (vu16) thresh);
#else
/* MMX/SSE/SSE2 has no cmpgtu */
t = vsr16 (vsubs16 (a, b), 1);
m = vmullo16 (t, t);
return (v16) vcmpgt16 ((v16) m, thresh);
#endif
}
BOOL
SIMD_NAME (DeinterlaceFieldTwoFrame) (TDeinterlaceInfo *pInfo)
{
v16 qwSpatialTolerance;
v16 qwTemporalTolerance;
uint8_t *Dest;
const uint8_t *YVal0;
const uint8_t *YVal1;
const uint8_t *OVal0;
const uint8_t *OVal1;
unsigned int byte_width;
unsigned int height;
unsigned long dst_padding;
unsigned long src_padding;
unsigned long dst_bpl;
unsigned long src_bpl;
if (SIMD == CPU_FEATURE_SSE2) {
if (((unsigned long) pInfo->Overlay |
(unsigned long) pInfo->PictureHistory[0]->pData |
(unsigned long) pInfo->PictureHistory[1]->pData |
(unsigned long) pInfo->PictureHistory[2]->pData |
(unsigned long) pInfo->PictureHistory[3]->pData |
(unsigned long) pInfo->OverlayPitch |
(unsigned long) pInfo->InputPitch |
(unsigned long) pInfo->LineLength) & 15)
return DeinterlaceFieldTwoFrame_SSE (pInfo);
}
#if SIMD == CPU_FEATURE_ALTIVEC
qwSpatialTolerance = vsplat16 (TwoFrameSpatialTolerance);
qwTemporalTolerance = vsplat16 (TwoFrameTemporalTolerance);
#else
/* divide by 4 because of squaring behavior, see above */
qwSpatialTolerance = vsplat16 (TwoFrameSpatialTolerance / 4);
qwTemporalTolerance = vsplat16 (TwoFrameTemporalTolerance / 4);
#endif
byte_width = pInfo->LineLength;
dst_bpl = pInfo->OverlayPitch;
src_bpl = pInfo->InputPitch;
Dest = pInfo->Overlay;
YVal0 = pInfo->PictureHistory[0]->pData;
YVal1 = pInfo->PictureHistory[1]->pData;
OVal0 = pInfo->PictureHistory[2]->pData;
OVal1 = pInfo->PictureHistory[3]->pData;
/* copy first even line no matter what, and the first odd line if we're
processing an odd field. */
if (pInfo->PictureHistory[0]->Flags & PICTURE_INTERLACED_ODD) {
copy_line (Dest, YVal1, byte_width);
Dest += dst_bpl;
YVal1 += src_bpl;
OVal1 += src_bpl;
}
copy_line (Dest, YVal0, byte_width);
Dest += dst_bpl;
dst_padding = dst_bpl * 2 - byte_width;
src_padding = src_bpl - byte_width;
for (height = pInfo->FieldHeight - 1; height > 0; --height) {
unsigned int count;
for (count = byte_width / sizeof (vu8); count > 0; --count) {
vu8 T1, B1, M1, avg, mm0;
v16 lum_T0, lum_B0, lum_M0;
v16 lum_T1, lum_B1, lum_M1;
v16 mm3, mm4, mm5, mm7;
T1 = vload (YVal0, 0);
B1 = vload (YVal0, src_bpl);
YVal0 += sizeof (vu8);
/* Always use the most recent data verbatim. */
vstorent (Dest, dst_bpl, B1);
avg = fast_vavgu8 (T1, B1);
M1 = vload (YVal1, 0);
YVal1 += sizeof (vu8);
lum_T1 = yuyv2yy (T1);
lum_B1 = yuyv2yy (B1);
lum_M1 = yuyv2yy (M1);
/* Find out how different T1 and M1 are. */
mm3 = cmpsqdiff (lum_T1, lum_M1, qwSpatialTolerance);
/* Find out how different B1 and M1 are. */
mm4 = cmpsqdiff (lum_B1, lum_M1, qwSpatialTolerance);
/* We care about cases where M1 isn't different from its
neighbors T1 and B1. */
mm3 = vnand (mm3, mm4);
lum_M0 = yuyv2yy (vload (OVal1, 0));
OVal1 += sizeof (vu8);
/* Find out whether M1 is new. "New" means the square of
// the luminance difference between M1 and M0 is less than
// the temporal tolerance.
*/
mm7 = cmpsqdiff (lum_M1, lum_M0, qwTemporalTolerance);
lum_T0 = yuyv2yy (vload (OVal0, 0));
lum_B0 = yuyv2yy (vload (OVal0, src_bpl));
OVal0 += sizeof (vu8);
/* Find out whether T1 is new. */
mm4 = cmpsqdiff (lum_T1, lum_T0, qwTemporalTolerance);
/* Find out whether B1 is new. */
mm5 = cmpsqdiff (lum_B1, lum_B0, qwTemporalTolerance);
/* We care about cases where M1 is old
and either T1 or B1 is old. */
mm4 = vnor (mm7, vor (mm4, mm5));
/* Now figure out where we're going to weave (M1) and where
// we're going to bob (avg). We'll weave if all pixels are
// old or M1 isn't different from both its neighbors.
*/
mm0 = (vu8) vor (mm4, mm3);
mm0 = vsel (mm0, M1, avg);
vstorent (Dest, 0, mm0);
Dest += sizeof (vu8);
}
YVal0 += src_padding;
YVal1 += src_padding;
OVal0 += src_padding;
OVal1 += src_padding;
Dest += dst_padding;
}
/* Copy last odd line if we're processing an even field. */
if (pInfo->PictureHistory[0]->Flags & PICTURE_INTERLACED_EVEN) {
copy_line (Dest, YVal1, byte_width);
}
vempty ();
return TRUE;
}
#elif !SIMD
int TwoFrameTemporalTolerance = 300;
int TwoFrameSpatialTolerance = 600;
/*//////////////////////////////////////////////////////////////////////////
// Start of Settings related code
//////////////////////////////////////////////////////////////////////////*/
static const SETTING
DI_TwoFrameSettings [] = {
{
N_("2 Frame Spatial Tolerance"), SLIDER, 0, &TwoFrameSpatialTolerance,
600, 0, 5000, 10, 1,
NULL,
"Deinterlace", "TwoFrameSpatialTolerance", NULL,
},
{
N_("2 Frame Temporal Tolerance"), SLIDER, 0, &TwoFrameTemporalTolerance,
300, 0, 5000, 10, 1,
NULL,
"Deinterlace", "TwoFrameTemporalTolerance", NULL,
},
};
static const DEINTERLACE_METHOD
TwoFrameMethod = {
sizeof (DEINTERLACE_METHOD),
DEINTERLACE_CURRENT_VERSION,
N_("Video Deinterlace (2-Frame)"),
"2-Frame",
FALSE,
FALSE,
/* pfnAlgorithm */ NULL,
50,
60,
N_ELEMENTS (DI_TwoFrameSettings),
DI_TwoFrameSettings,
INDEX_VIDEO_2FRAME,
NULL,
NULL,
NULL,
NULL,
4,
0,
0,
0,
NULL,
0,
FALSE,
FALSE,
IDH_2FRAME,
};
DEINTERLACE_METHOD *
DI_TwoFrame_GetDeinterlacePluginInfo (void)
{
DEINTERLACE_FUNC *f;
DEINTERLACE_METHOD *m;
m = NULL;
f = SIMD_FN_SELECT (DeinterlaceFieldTwoFrame,
CPU_FEATURE_MMX | CPU_FEATURE_3DNOW |
CPU_FEATURE_SSE_INT | CPU_FEATURE_SSE2 |
CPU_FEATURE_ALTIVEC);
if (f) {
m = malloc (sizeof (*m));
*m = TwoFrameMethod;
m->pfnAlgorithm = f;
}
return m;
}
#endif /* !SIMD */
/*
Local Variables:
c-basic-offset: 4
End:
*/
|