mirror of
https://gitlab.freedesktop.org/gstreamer/gstreamer.git
synced 2024-11-10 11:29:55 +00:00
fa81d7c15d
Original commit message from CVS: * gst/deinterlace2/tvtime/greedyh.c: (deinterlace_frame_di_greedyh): Only build the assembly optimized implementations on x86.
323 lines
8.1 KiB
C
323 lines
8.1 KiB
C
/*
|
|
*
|
|
* GStreamer
|
|
* Copyright (C) 2004 Billy Biggs <vektor@dumbterm.net>
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Library General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2 of the License, or (at your option) any later version.
|
|
*
|
|
* This library 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
|
|
* Library General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Library General Public
|
|
* License along with this library; if not, write to the
|
|
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
* Boston, MA 02111-1307, USA.
|
|
*/
|
|
|
|
/*
|
|
* Relicensed for GStreamer from GPL to LGPL with permit from Billy Biggs.
|
|
* See: http://bugzilla.gnome.org/show_bug.cgi?id=163578
|
|
*/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
# include "config.h"
|
|
#endif
|
|
|
|
#include "greedyh.h"
|
|
#include "greedyhmacros.h"
|
|
|
|
#include <stdlib.h>
|
|
#include "_stdint.h"
|
|
#include <string.h>
|
|
|
|
#include "gst/gst.h"
|
|
#include "plugins.h"
|
|
#include "gstdeinterlace2.h"
|
|
|
|
static const unsigned int GreedyMaxComb = 5;
|
|
static const unsigned int GreedyMotionThreshold = 25;
|
|
static const unsigned int GreedyMotionSense = 30;
|
|
|
|
void
|
|
greedyDScaler_C (uint8_t * L1, uint8_t * L2, uint8_t * L3, uint8_t * L2P,
|
|
uint8_t * Dest, int size)
|
|
{
|
|
int Pos;
|
|
uint8_t l1_l, l1_1_l, l3_l, l3_1_l;
|
|
uint8_t l1_c, l1_1_c, l3_c, l3_1_c;
|
|
uint8_t avg_l, avg_c, avg_l_1, avg_c_1;
|
|
uint8_t avg_l__1 = 0, avg_c__1 = 0;
|
|
uint8_t avg_s_l, avg_s_c;
|
|
uint8_t avg_sc_l, avg_sc_c;
|
|
uint8_t best_l, best_c;
|
|
uint16_t mov_l;
|
|
uint8_t out_l, out_c;
|
|
uint8_t l2_l, l2_c, lp2_l, lp2_c;
|
|
uint8_t l2_l_diff, l2_c_diff, lp2_l_diff, lp2_c_diff;
|
|
uint8_t min_l, min_c, max_l, max_c;
|
|
|
|
for (Pos = 0; Pos < size; Pos += 2) {
|
|
l1_l = L1[0];
|
|
l1_c = L1[1];
|
|
l3_l = L3[0];
|
|
l3_c = L3[1];
|
|
|
|
if (Pos == size - 1) {
|
|
l1_1_l = l1_l;
|
|
l1_1_c = l1_c;
|
|
l3_1_l = l3_l;
|
|
l3_1_c = l3_c;
|
|
} else {
|
|
l1_1_l = L1[2];
|
|
l1_1_c = L1[3];
|
|
l3_1_l = L3[2];
|
|
l3_1_c = L3[3];
|
|
}
|
|
|
|
/* Average of L1 and L3 */
|
|
avg_l = (l1_l + l3_l) / 2;
|
|
avg_c = (l1_c + l3_c) / 2;
|
|
|
|
if (Pos == 0) {
|
|
avg_l__1 = avg_l;
|
|
avg_c__1 = avg_c;
|
|
}
|
|
|
|
/* Average of next L1 and next L3 */
|
|
avg_l_1 = (l1_1_l + l3_1_l) / 2;
|
|
avg_c_1 = (l1_1_c + l3_1_c) / 2;
|
|
|
|
/* Calculate average of one pixel forward and previous */
|
|
avg_s_l = (avg_l__1 + avg_l_1) / 2;
|
|
avg_s_c = (avg_c__1 + avg_c_1) / 2;
|
|
|
|
/* Calculate average of center and surrounding pixels */
|
|
avg_sc_l = (avg_l + avg_s_l) / 2;
|
|
avg_sc_c = (avg_c + avg_s_c) / 2;
|
|
|
|
/* move forward */
|
|
avg_l__1 = avg_l;
|
|
avg_c__1 = avg_c;
|
|
|
|
/* Get best L2/L2P, i.e. least diff from above average */
|
|
l2_l = L2[0];
|
|
l2_c = L2[1];
|
|
lp2_l = L2P[0];
|
|
lp2_c = L2P[1];
|
|
|
|
l2_l_diff = ABS (l2_l - avg_sc_l);
|
|
l2_c_diff = ABS (l2_c - avg_sc_c);
|
|
|
|
lp2_l_diff = ABS (lp2_l - avg_sc_l);
|
|
lp2_c_diff = ABS (lp2_c - avg_sc_c);
|
|
|
|
if (l2_l_diff > lp2_l_diff)
|
|
best_l = lp2_l;
|
|
else
|
|
best_l = l2_l;
|
|
|
|
if (l2_c_diff > lp2_c_diff)
|
|
best_c = lp2_c;
|
|
else
|
|
best_c = l2_c;
|
|
|
|
/* Clip this best L2/L2P by L1/L3 and allow to differ by GreedyMaxComb */
|
|
max_l = MAX (l1_l, l3_l);
|
|
min_l = MIN (l1_l, l3_l);
|
|
|
|
if (max_l < 256 - GreedyMaxComb)
|
|
max_l += GreedyMaxComb;
|
|
else
|
|
max_l = 255;
|
|
|
|
if (min_l > GreedyMaxComb)
|
|
min_l -= GreedyMaxComb;
|
|
else
|
|
min_l = 0;
|
|
|
|
max_c = MAX (l1_c, l3_c);
|
|
min_c = MIN (l1_c, l3_c);
|
|
|
|
if (max_c < 256 - GreedyMaxComb)
|
|
max_c += GreedyMaxComb;
|
|
else
|
|
max_c = 255;
|
|
|
|
if (min_c > GreedyMaxComb)
|
|
min_c -= GreedyMaxComb;
|
|
else
|
|
min_c = 0;
|
|
|
|
out_l = CLAMP (best_l, min_l, max_l);
|
|
out_c = CLAMP (best_c, min_c, max_c);
|
|
|
|
/* Do motion compensation for luma, i.e. how much
|
|
* the weave pixel differs */
|
|
mov_l = ABS (l2_l - lp2_l);
|
|
if (mov_l > GreedyMotionThreshold)
|
|
mov_l -= GreedyMotionThreshold;
|
|
else
|
|
mov_l = 0;
|
|
|
|
mov_l = mov_l * GreedyMotionSense;
|
|
if (mov_l > 256)
|
|
mov_l = 256;
|
|
|
|
/* Weighted sum on clipped weave pixel and average */
|
|
out_l = (out_l * (256 - mov_l) + avg_sc_l * mov_l) / 256;
|
|
|
|
Dest[0] = out_l;
|
|
Dest[1] = out_c;
|
|
|
|
Dest += 2;
|
|
L1 += 2;
|
|
L2 += 2;
|
|
L3 += 2;
|
|
L2P += 2;
|
|
}
|
|
}
|
|
|
|
#ifdef HAVE_CPU_I386
|
|
|
|
#define IS_MMXEXT
|
|
#define SIMD_TYPE MMXEXT
|
|
#define FUNCT_NAME greedyDScaler_MMXEXT
|
|
#include "greedyh.asm"
|
|
#undef SIMD_TYPE
|
|
#undef IS_MMXEXT
|
|
#undef FUNCT_NAME
|
|
|
|
#define IS_TDNOW
|
|
#define SIMD_TYPE TDNOW
|
|
#define FUNCT_NAME greedyDScaler_3DNOW
|
|
#include "greedyh.asm"
|
|
#undef SIMD_TYPE
|
|
#undef IS_TDNOW
|
|
#undef FUNCT_NAME
|
|
|
|
#define IS_MMX
|
|
#define SIMD_TYPE MMX
|
|
#define FUNCT_NAME greedyDScaler_MMX
|
|
#include "greedyh.asm"
|
|
#undef SIMD_TYPE
|
|
#undef IS_MMX
|
|
#undef FUNCT_NAME
|
|
|
|
#endif
|
|
|
|
static void
|
|
deinterlace_frame_di_greedyh (GstDeinterlace2 * object)
|
|
{
|
|
void (*func) (uint8_t * L1, uint8_t * L2, uint8_t * L3, uint8_t * L2P,
|
|
uint8_t * Dest, int size);
|
|
|
|
int InfoIsOdd = 0;
|
|
int Line;
|
|
unsigned int Pitch = object->field_stride;
|
|
|
|
unsigned char *L1; // ptr to Line1, of 3
|
|
unsigned char *L2; // ptr to Line2, the weave line
|
|
unsigned char *L3; // ptr to Line3
|
|
|
|
unsigned char *L2P; // ptr to prev Line2
|
|
unsigned char *Dest = GST_BUFFER_DATA (object->out_buf);
|
|
|
|
#ifdef HAVE_CPU_I386
|
|
if (object->cpu_feature_flags & OIL_IMPL_FLAG_MMXEXT) {
|
|
func = greedyDScaler_MMXEXT;
|
|
} else if (object->cpu_feature_flags & OIL_IMPL_FLAG_3DNOW) {
|
|
func = greedyDScaler_3DNOW;
|
|
} else if (object->cpu_feature_flags & OIL_IMPL_FLAG_MMX) {
|
|
func = greedyDScaler_MMX;
|
|
} else {
|
|
func = greedyDScaler_C;
|
|
}
|
|
#else
|
|
func = greedyDScaler_C;
|
|
#endif
|
|
|
|
// copy first even line no matter what, and the first odd line if we're
|
|
// processing an EVEN field. (note diff from other deint rtns.)
|
|
|
|
if (object->field_history[object->history_count - 1].flags ==
|
|
PICTURE_INTERLACED_BOTTOM) {
|
|
InfoIsOdd = 1;
|
|
|
|
L1 = GST_BUFFER_DATA (object->field_history[object->history_count - 2].buf);
|
|
L2 = GST_BUFFER_DATA (object->field_history[object->history_count - 1].buf);
|
|
L3 = L1 + Pitch;
|
|
L2P =
|
|
GST_BUFFER_DATA (object->field_history[object->history_count - 3].buf);
|
|
|
|
// copy first even line
|
|
memcpy (Dest, L1, object->line_length);
|
|
Dest += object->output_stride;
|
|
} else {
|
|
InfoIsOdd = 0;
|
|
L1 = GST_BUFFER_DATA (object->field_history[object->history_count - 2].buf);
|
|
L2 = GST_BUFFER_DATA (object->field_history[object->history_count -
|
|
1].buf) + Pitch;
|
|
L3 = L1 + Pitch;
|
|
L2P =
|
|
GST_BUFFER_DATA (object->field_history[object->history_count - 3].buf) +
|
|
Pitch;
|
|
|
|
// copy first even line
|
|
memcpy (Dest, GST_BUFFER_DATA (object->field_history[0].buf),
|
|
object->line_length);
|
|
Dest += object->output_stride;
|
|
// then first odd line
|
|
memcpy (Dest, L1, object->line_length);
|
|
Dest += object->output_stride;
|
|
}
|
|
|
|
for (Line = 0; Line < (object->field_height - 1); ++Line) {
|
|
func (L1, L2, L3, L2P, Dest, object->line_length);
|
|
Dest += object->output_stride;
|
|
memcpy (Dest, L3, object->line_length);
|
|
Dest += object->output_stride;
|
|
|
|
L1 += Pitch;
|
|
L2 += Pitch;
|
|
L3 += Pitch;
|
|
L2P += Pitch;
|
|
}
|
|
|
|
if (InfoIsOdd) {
|
|
memcpy (Dest, L2, object->line_length);
|
|
}
|
|
}
|
|
|
|
static deinterlace_method_t greedyh_method = {
|
|
0, //DEINTERLACE_PLUGIN_API_VERSION,
|
|
"Motion Adaptive: Advanced Detection",
|
|
"AdaptiveAdvanced",
|
|
4,
|
|
0,
|
|
0,
|
|
0,
|
|
0,
|
|
0,
|
|
deinterlace_frame_di_greedyh,
|
|
{"Uses heuristics to detect motion in the input",
|
|
"frames and reconstruct image detail where",
|
|
"possible. Use this for high quality output",
|
|
"even on monitors set to an arbitrary refresh",
|
|
"rate.",
|
|
"",
|
|
"Advanced detection uses linear interpolation",
|
|
"where motion is detected, using a four-field",
|
|
"buffer. This is the Greedy: High Motion",
|
|
"deinterlacer from DScaler."}
|
|
};
|
|
|
|
deinterlace_method_t *
|
|
dscaler_greedyh_get_method (void)
|
|
{
|
|
return &greedyh_method;
|
|
}
|