3a8384238e631285beeeea70719f971ab0e74246
2 * filter_deinterlace.c -- deinterlace filter
3 * Copyright (C) 2003-2004 Ushodaya Enterprises Limited
4 * Author: Charles Yates <charles.yates@pandora.be>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software Foundation,
18 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
21 #include "filter_deinterlace.h"
23 #include <framework/mlt_frame.h>
28 /* Linear Blend filter - C version contributed by Rogerio Brito.
29 This algorithm has the same interface as the other functions.
31 The destination "screen" (pdst) is constructed from the source
32 screen (psrc[0]) line by line.
34 The i-th line of the destination screen is the average of 3 lines
35 from the source screen: the (i-1)-th, i-th and (i+1)-th lines, with
36 the i-th line having weight 2 in the computation.
39 * each line on pdst doesn't depend on previous lines;
40 * due to the way the algorithm is defined, the first & last lines of the
41 screen aren't deinterlaced.
44 static void deinterlace_yuv( uint8_t *pdst
, uint8_t *psrc
, int width
, int height
)
47 register uint8_t *l0
, *l1
, *l2
, *l3
;
49 l0
= pdst
; // target line
50 l1
= psrc
; // 1st source line
51 l2
= l1
+ width
; // 2nd source line = line that follows l1
52 l3
= l2
+ width
; // 3rd source line = line that follows l2
54 // Copy the first line
55 memcpy(l0
, l1
, width
);
58 for (y
= 1; y
< height
-1; ++y
)
60 // computes avg of: l1 + 2*l2 + l3
61 for (x
= 0; x
< width
; ++x
)
62 l0
[x
] = (l1
[x
] + (l2
[x
]<<1) + l3
[x
]) >> 2;
64 // updates the line pointers
65 l1
= l2
; l2
= l3
; l3
+= width
;
70 memcpy(l0
, l1
, width
);
76 static int filter_get_image( mlt_frame
this, uint8_t **image
, mlt_image_format
*format
, int *width
, int *height
, int writable
)
80 // Check that we want progressive and we aren't already progressive
81 if ( *format
== mlt_image_yuv422
&&
82 !mlt_properties_get_int( mlt_frame_properties( this ), "progressive" ) &&
83 mlt_properties_get_int( mlt_frame_properties( this ), "consumer_deinterlace" ) )
85 // Get the input image
86 error
= mlt_frame_get_image( this, image
, format
, width
, height
, 1 );
88 // Deinterlace the image
89 deinterlace_yuv( *image
, *image
, *width
* 2, *height
);
91 // Make sure that others know the frame is deinterlaced
92 mlt_properties_set_int( mlt_frame_properties( this ), "progressive", 1 );
96 // Get the input image
97 error
= mlt_frame_get_image( this, image
, format
, width
, height
, writable
);
103 /** Deinterlace filter processing - this should be lazy evaluation here...
106 static mlt_frame
deinterlace_process( mlt_filter
this, mlt_frame frame
)
108 mlt_frame_push_get_image( frame
, filter_get_image
);
112 /** Constructor for the filter.
115 mlt_filter
filter_deinterlace_init( void *arg
)
117 mlt_filter
this = mlt_filter_new( );
119 this->process
= deinterlace_process
;