1*a97c2a1fSXin Li /******************************************************************************
2*a97c2a1fSXin Li *
3*a97c2a1fSXin Li * Copyright (C) 2015 The Android Open Source Project
4*a97c2a1fSXin Li *
5*a97c2a1fSXin Li * Licensed under the Apache License, Version 2.0 (the "License");
6*a97c2a1fSXin Li * you may not use this file except in compliance with the License.
7*a97c2a1fSXin Li * You may obtain a copy of the License at:
8*a97c2a1fSXin Li *
9*a97c2a1fSXin Li * http://www.apache.org/licenses/LICENSE-2.0
10*a97c2a1fSXin Li *
11*a97c2a1fSXin Li * Unless required by applicable law or agreed to in writing, software
12*a97c2a1fSXin Li * distributed under the License is distributed on an "AS IS" BASIS,
13*a97c2a1fSXin Li * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14*a97c2a1fSXin Li * See the License for the specific language governing permissions and
15*a97c2a1fSXin Li * limitations under the License.
16*a97c2a1fSXin Li *
17*a97c2a1fSXin Li *****************************************************************************
18*a97c2a1fSXin Li * Originally developed and contributed by Ittiam Systems Pvt. Ltd, Bangalore
19*a97c2a1fSXin Li */
20*a97c2a1fSXin Li /**
21*a97c2a1fSXin Li *******************************************************************************
22*a97c2a1fSXin Li * @file
23*a97c2a1fSXin Li * ideint_cac.c
24*a97c2a1fSXin Li *
25*a97c2a1fSXin Li * @brief
26*a97c2a1fSXin Li * This file include the definitions of the combing artifact check function
27*a97c2a1fSXin Li * of the de-interlacer and some variant of that.
28*a97c2a1fSXin Li *
29*a97c2a1fSXin Li * @author
30*a97c2a1fSXin Li * Ittiam
31*a97c2a1fSXin Li *
32*a97c2a1fSXin Li * @par List of Functions:
33*a97c2a1fSXin Li * cac_4x8()
34*a97c2a1fSXin Li * ideint_cac()
35*a97c2a1fSXin Li *
36*a97c2a1fSXin Li * @remarks
37*a97c2a1fSXin Li * In the de-interlacer workspace, cac is not a seperate assembly module as
38*a97c2a1fSXin Li * it comes along with the de_int_decision() function. But in C-Model, to
39*a97c2a1fSXin Li * keep the things cleaner, it was made to be a separate function during
40*a97c2a1fSXin Li * cac experiments long after the assembly was written by Mudit.
41*a97c2a1fSXin Li *
42*a97c2a1fSXin Li *******************************************************************************
43*a97c2a1fSXin Li */
44*a97c2a1fSXin Li /*****************************************************************************/
45*a97c2a1fSXin Li /* File Includes */
46*a97c2a1fSXin Li /*****************************************************************************/
47*a97c2a1fSXin Li /* System include files */
48*a97c2a1fSXin Li #include <stdio.h>
49*a97c2a1fSXin Li #include <stdint.h>
50*a97c2a1fSXin Li #include <string.h>
51*a97c2a1fSXin Li #include <stdlib.h>
52*a97c2a1fSXin Li
53*a97c2a1fSXin Li /* User include files */
54*a97c2a1fSXin Li #include "icv_datatypes.h"
55*a97c2a1fSXin Li #include "icv_macros.h"
56*a97c2a1fSXin Li #include "icv.h"
57*a97c2a1fSXin Li #include "icv_variance.h"
58*a97c2a1fSXin Li #include "icv_sad.h"
59*a97c2a1fSXin Li #include "ideint.h"
60*a97c2a1fSXin Li #include "ideint_defs.h"
61*a97c2a1fSXin Li #include "ideint_structs.h"
62*a97c2a1fSXin Li #include "ideint_cac.h"
63*a97c2a1fSXin Li
64*a97c2a1fSXin Li /**
65*a97c2a1fSXin Li *******************************************************************************
66*a97c2a1fSXin Li *
67*a97c2a1fSXin Li * @brief
68*a97c2a1fSXin Li * Combing artifact check function for 8x4 block
69*a97c2a1fSXin Li *
70*a97c2a1fSXin Li * @par Description
71*a97c2a1fSXin Li * Adjacent and alternate SADs are calculated by row based and column-based
72*a97c2a1fSXin Li * collapsing. The adjacent and alternate SADs are then compared with some
73*a97c2a1fSXin Li * biasing to get CAC
74*a97c2a1fSXin Li *
75*a97c2a1fSXin Li * @param[in] pu1_top
76*a97c2a1fSXin Li * Top field
77*a97c2a1fSXin Li *
78*a97c2a1fSXin Li * @param[in] pu1_bot
79*a97c2a1fSXin Li * Bottom field
80*a97c2a1fSXin Li *
81*a97c2a1fSXin Li * @param[in] top_strd
82*a97c2a1fSXin Li * Top field Stride
83*a97c2a1fSXin Li *
84*a97c2a1fSXin Li * @param[in] bot_strd
85*a97c2a1fSXin Li * Bottom field stride
86*a97c2a1fSXin Li *
87*a97c2a1fSXin Li * @param[in] pi4_adj_sad
88*a97c2a1fSXin Li * Pointer to return adjacent SAD
89*a97c2a1fSXin Li *
90*a97c2a1fSXin Li * @param[in] pi4_alt_sad
91*a97c2a1fSXin Li * Pointer to return alternate SAD
92*a97c2a1fSXin Li *
93*a97c2a1fSXin Li * @returns
94*a97c2a1fSXin Li * combing artifact flag (1 = detected, 0 = not detected)
95*a97c2a1fSXin Li *
96*a97c2a1fSXin Li * @remarks
97*a97c2a1fSXin Li *
98*a97c2a1fSXin Li *******************************************************************************
99*a97c2a1fSXin Li */
cac_4x8(UWORD8 * pu1_top,UWORD8 * pu1_bot,WORD32 top_strd,WORD32 bot_strd)100*a97c2a1fSXin Li static WORD32 cac_4x8(UWORD8 *pu1_top,
101*a97c2a1fSXin Li UWORD8 *pu1_bot,
102*a97c2a1fSXin Li WORD32 top_strd,
103*a97c2a1fSXin Li WORD32 bot_strd)
104*a97c2a1fSXin Li {
105*a97c2a1fSXin Li WORD32 ca;
106*a97c2a1fSXin Li WORD32 adj;
107*a97c2a1fSXin Li WORD32 alt;
108*a97c2a1fSXin Li UWORD8 *pu1_tmp_top;
109*a97c2a1fSXin Li UWORD8 *pu1_tmp_bot;
110*a97c2a1fSXin Li WORD32 i;
111*a97c2a1fSXin Li WORD32 j;
112*a97c2a1fSXin Li UWORD8 *pu1_top_0;
113*a97c2a1fSXin Li UWORD8 *pu1_top_1;
114*a97c2a1fSXin Li UWORD8 *pu1_top_2;
115*a97c2a1fSXin Li UWORD8 *pu1_top_3;
116*a97c2a1fSXin Li UWORD8 *pu1_bot_0;
117*a97c2a1fSXin Li UWORD8 *pu1_bot_1;
118*a97c2a1fSXin Li UWORD8 *pu1_bot_2;
119*a97c2a1fSXin Li UWORD8 *pu1_bot_3;
120*a97c2a1fSXin Li WORD32 rsum_csum_thresh;
121*a97c2a1fSXin Li WORD32 sad_bias_mult_shift;
122*a97c2a1fSXin Li WORD32 sad_bias_additive;
123*a97c2a1fSXin Li
124*a97c2a1fSXin Li WORD32 diff_sum;
125*a97c2a1fSXin Li WORD32 top_row_end_incr;
126*a97c2a1fSXin Li WORD32 bot_row_end_incr;
127*a97c2a1fSXin Li
128*a97c2a1fSXin Li ca = 0;
129*a97c2a1fSXin Li
130*a97c2a1fSXin Li adj = 0;
131*a97c2a1fSXin Li alt = 0;
132*a97c2a1fSXin Li
133*a97c2a1fSXin Li rsum_csum_thresh = RSUM_CSUM_THRESH;
134*a97c2a1fSXin Li sad_bias_additive = SAD_BIAS_ADDITIVE;
135*a97c2a1fSXin Li sad_bias_mult_shift = SAD_BIAS_MULT_SHIFT;
136*a97c2a1fSXin Li
137*a97c2a1fSXin Li /*************************************************************************/
138*a97c2a1fSXin Li /* In the adjacent sad calculation by row-method, the absolute */
139*a97c2a1fSXin Li /* difference is taken between the adjacent rows. The pixels of the diff */
140*a97c2a1fSXin Li /* row, thus obtained, are then summed up. If this sum of absolute */
141*a97c2a1fSXin Li /* differace (sad) is greater than a threshold value, it is added to the */
142*a97c2a1fSXin Li /* adjcacent SAD value. */
143*a97c2a1fSXin Li /*************************************************************************/
144*a97c2a1fSXin Li
145*a97c2a1fSXin Li /*************************************************************************/
146*a97c2a1fSXin Li /* Adj dif: Row based */
147*a97c2a1fSXin Li /*************************************************************************/
148*a97c2a1fSXin Li
149*a97c2a1fSXin Li pu1_tmp_top = pu1_top;
150*a97c2a1fSXin Li pu1_tmp_bot = pu1_bot;
151*a97c2a1fSXin Li
152*a97c2a1fSXin Li top_row_end_incr = top_strd - SUB_BLK_WD;
153*a97c2a1fSXin Li bot_row_end_incr = bot_strd - SUB_BLK_WD;
154*a97c2a1fSXin Li
155*a97c2a1fSXin Li /*************************************************************************/
156*a97c2a1fSXin Li /* The outer-loop runs for BLK_HT/2 times, because one pixel */
157*a97c2a1fSXin Li /* is touched only once. */
158*a97c2a1fSXin Li /*************************************************************************/
159*a97c2a1fSXin Li for(j = 0; j < BLK_HT; j += 4)
160*a97c2a1fSXin Li {
161*a97c2a1fSXin Li WORD32 sum_1, sum_2, sum_3, sum_4;
162*a97c2a1fSXin Li WORD32 sum_diff;
163*a97c2a1fSXin Li
164*a97c2a1fSXin Li /*********************************************************************/
165*a97c2a1fSXin Li /* Because the 8x4 is split into two halves of 4x4, the width of the */
166*a97c2a1fSXin Li /* block is now 4. */
167*a97c2a1fSXin Li /*********************************************************************/
168*a97c2a1fSXin Li sum_1 = 0;
169*a97c2a1fSXin Li sum_2 = 0;
170*a97c2a1fSXin Li
171*a97c2a1fSXin Li for(i = 0; i < SUB_BLK_WD; i ++)
172*a97c2a1fSXin Li {
173*a97c2a1fSXin Li sum_1 += *pu1_tmp_top++;
174*a97c2a1fSXin Li sum_2 += *pu1_tmp_bot++;
175*a97c2a1fSXin Li }
176*a97c2a1fSXin Li
177*a97c2a1fSXin Li sum_diff = ABS_DIF(sum_1, sum_2);
178*a97c2a1fSXin Li
179*a97c2a1fSXin Li /*********************************************************************/
180*a97c2a1fSXin Li /* Thresholding. */
181*a97c2a1fSXin Li /*********************************************************************/
182*a97c2a1fSXin Li if(sum_diff >= rsum_csum_thresh)
183*a97c2a1fSXin Li adj += sum_diff;
184*a97c2a1fSXin Li
185*a97c2a1fSXin Li pu1_tmp_top += top_row_end_incr;
186*a97c2a1fSXin Li pu1_tmp_bot += bot_row_end_incr;
187*a97c2a1fSXin Li
188*a97c2a1fSXin Li
189*a97c2a1fSXin Li sum_3 = 0;
190*a97c2a1fSXin Li sum_4 = 0;
191*a97c2a1fSXin Li
192*a97c2a1fSXin Li for(i = 0; i < SUB_BLK_WD; i ++)
193*a97c2a1fSXin Li {
194*a97c2a1fSXin Li sum_3 += *pu1_tmp_top++;
195*a97c2a1fSXin Li sum_4 += *pu1_tmp_bot++;
196*a97c2a1fSXin Li }
197*a97c2a1fSXin Li
198*a97c2a1fSXin Li sum_diff = ABS_DIF(sum_3, sum_4);
199*a97c2a1fSXin Li
200*a97c2a1fSXin Li /*********************************************************************/
201*a97c2a1fSXin Li /* Thresholding. */
202*a97c2a1fSXin Li /*********************************************************************/
203*a97c2a1fSXin Li if(sum_diff >= rsum_csum_thresh)
204*a97c2a1fSXin Li adj += sum_diff;
205*a97c2a1fSXin Li
206*a97c2a1fSXin Li pu1_tmp_top += top_row_end_incr;
207*a97c2a1fSXin Li pu1_tmp_bot += bot_row_end_incr;
208*a97c2a1fSXin Li
209*a97c2a1fSXin Li /*************************************************************************/
210*a97c2a1fSXin Li /* Alt diff : Row based */
211*a97c2a1fSXin Li /*************************************************************************/
212*a97c2a1fSXin Li alt += ABS_DIF(sum_1, sum_3);
213*a97c2a1fSXin Li alt += ABS_DIF(sum_2, sum_4);
214*a97c2a1fSXin Li
215*a97c2a1fSXin Li }
216*a97c2a1fSXin Li
217*a97c2a1fSXin Li /*************************************************************************/
218*a97c2a1fSXin Li /* In the adjacent sad calculation by column-method, the rows of both */
219*a97c2a1fSXin Li /* the fields are averaged separately and then summed across the column. */
220*a97c2a1fSXin Li /* The difference of the two values, thus obtained, is added to the */
221*a97c2a1fSXin Li /* adjacent sad value, if it is beyond the threshold. */
222*a97c2a1fSXin Li /*************************************************************************/
223*a97c2a1fSXin Li
224*a97c2a1fSXin Li pu1_top_0 = pu1_top;
225*a97c2a1fSXin Li pu1_top_1 = pu1_top_0 + top_strd;
226*a97c2a1fSXin Li pu1_top_2 = pu1_top_1 + top_strd;
227*a97c2a1fSXin Li pu1_top_3 = pu1_top_2 + top_strd;
228*a97c2a1fSXin Li
229*a97c2a1fSXin Li pu1_bot_0 = pu1_bot;
230*a97c2a1fSXin Li pu1_bot_1 = pu1_bot_0 + bot_strd;
231*a97c2a1fSXin Li pu1_bot_2 = pu1_bot_1 + bot_strd;
232*a97c2a1fSXin Li pu1_bot_3 = pu1_bot_2 + bot_strd;
233*a97c2a1fSXin Li
234*a97c2a1fSXin Li /*************************************************************************/
235*a97c2a1fSXin Li /* Adj dif: Col based */
236*a97c2a1fSXin Li /*************************************************************************/
237*a97c2a1fSXin Li diff_sum = 0;
238*a97c2a1fSXin Li
239*a97c2a1fSXin Li /*************************************************************************/
240*a97c2a1fSXin Li /* As the DSP implementation of this modules is anyway going to assume */
241*a97c2a1fSXin Li /* the size of the block to the fixed (8x4 or two 4x4's), the height of */
242*a97c2a1fSXin Li /* block is also kept to be 8, to have a clean implementation. */
243*a97c2a1fSXin Li /*************************************************************************/
244*a97c2a1fSXin Li for(i = 0; i < SUB_BLK_WD; i ++)
245*a97c2a1fSXin Li {
246*a97c2a1fSXin Li WORD32 val_1;
247*a97c2a1fSXin Li WORD32 val_2;
248*a97c2a1fSXin Li WORD32 tmp_1, tmp_2;
249*a97c2a1fSXin Li WORD32 tmp_diff;
250*a97c2a1fSXin Li
251*a97c2a1fSXin Li tmp_1 = AVG(pu1_top_0[i], pu1_top_1[i]);
252*a97c2a1fSXin Li tmp_2 = AVG(pu1_top_2[i], pu1_top_3[i]);
253*a97c2a1fSXin Li val_1 = AVG(tmp_1, tmp_2);
254*a97c2a1fSXin Li
255*a97c2a1fSXin Li tmp_1 = AVG(pu1_bot_0[i], pu1_bot_1[i]);
256*a97c2a1fSXin Li tmp_2 = AVG(pu1_bot_2[i], pu1_bot_3[i]);
257*a97c2a1fSXin Li val_2 = AVG(tmp_1, tmp_2);
258*a97c2a1fSXin Li
259*a97c2a1fSXin Li tmp_diff = ABS_DIF(val_1, val_2);
260*a97c2a1fSXin Li
261*a97c2a1fSXin Li if(tmp_diff >= (rsum_csum_thresh >> 2))
262*a97c2a1fSXin Li diff_sum += tmp_diff;
263*a97c2a1fSXin Li }
264*a97c2a1fSXin Li
265*a97c2a1fSXin Li
266*a97c2a1fSXin Li adj += diff_sum << 2;
267*a97c2a1fSXin Li
268*a97c2a1fSXin Li /*************************************************************************/
269*a97c2a1fSXin Li /* Alt diff : Col based */
270*a97c2a1fSXin Li /*************************************************************************/
271*a97c2a1fSXin Li diff_sum = 0;
272*a97c2a1fSXin Li
273*a97c2a1fSXin Li for(i = 0; i < SUB_BLK_WD; i ++)
274*a97c2a1fSXin Li {
275*a97c2a1fSXin Li WORD32 val_1;
276*a97c2a1fSXin Li WORD32 val_2;
277*a97c2a1fSXin Li WORD32 tmp_1, tmp_2;
278*a97c2a1fSXin Li WORD32 tmp_diff;
279*a97c2a1fSXin Li
280*a97c2a1fSXin Li tmp_1 = AVG(pu1_top_0[i], pu1_bot_0[i]);
281*a97c2a1fSXin Li tmp_2 = AVG(pu1_top_2[i], pu1_bot_2[i]);
282*a97c2a1fSXin Li val_1 = AVG(tmp_1, tmp_2);
283*a97c2a1fSXin Li
284*a97c2a1fSXin Li tmp_1 = AVG(pu1_top_1[i], pu1_bot_1[i]);
285*a97c2a1fSXin Li tmp_2 = AVG(pu1_top_3[i], pu1_bot_3[i]);
286*a97c2a1fSXin Li val_2 = AVG(tmp_1, tmp_2);
287*a97c2a1fSXin Li
288*a97c2a1fSXin Li tmp_diff = ABS_DIF(val_1, val_2);
289*a97c2a1fSXin Li
290*a97c2a1fSXin Li diff_sum += tmp_diff;
291*a97c2a1fSXin Li }
292*a97c2a1fSXin Li
293*a97c2a1fSXin Li /*************************************************************************/
294*a97c2a1fSXin Li /* because of the averaging used in place of summation, a factor of 4 is */
295*a97c2a1fSXin Li /* needed while adding the the diff_sum to the sad. */
296*a97c2a1fSXin Li /*************************************************************************/
297*a97c2a1fSXin Li
298*a97c2a1fSXin Li alt += diff_sum << 2;
299*a97c2a1fSXin Li
300*a97c2a1fSXin Li pu1_top += SUB_BLK_WD;
301*a97c2a1fSXin Li pu1_bot += SUB_BLK_WD;
302*a97c2a1fSXin Li
303*a97c2a1fSXin Li alt += (alt >> sad_bias_mult_shift) + (sad_bias_additive >> 1);
304*a97c2a1fSXin Li ca = (alt < adj);
305*a97c2a1fSXin Li
306*a97c2a1fSXin Li return ca;
307*a97c2a1fSXin Li }
308*a97c2a1fSXin Li
309*a97c2a1fSXin Li /**
310*a97c2a1fSXin Li *******************************************************************************
311*a97c2a1fSXin Li *
312*a97c2a1fSXin Li * @brief
313*a97c2a1fSXin Li * Combing artifact check function for 8x8 block
314*a97c2a1fSXin Li *
315*a97c2a1fSXin Li * @par Description
316*a97c2a1fSXin Li * Determines CAC for 8x8 block by calling 8x4 CAC function
317*a97c2a1fSXin Li *
318*a97c2a1fSXin Li * @param[in] pu1_top
319*a97c2a1fSXin Li * Top field
320*a97c2a1fSXin Li *
321*a97c2a1fSXin Li * @param[in] pu1_bot
322*a97c2a1fSXin Li * Bottom field
323*a97c2a1fSXin Li *
324*a97c2a1fSXin Li * @param[in] top_strd
325*a97c2a1fSXin Li * Top field Stride
326*a97c2a1fSXin Li *
327*a97c2a1fSXin Li * @param[in] bot_strd
328*a97c2a1fSXin Li * Bottom field stride
329*a97c2a1fSXin Li *
330*a97c2a1fSXin Li * @returns
331*a97c2a1fSXin Li * combing artifact flag (1 = detected, 0 = not detected)
332*a97c2a1fSXin Li *
333*a97c2a1fSXin Li * @remarks
334*a97c2a1fSXin Li *
335*a97c2a1fSXin Li *******************************************************************************
336*a97c2a1fSXin Li */
ideint_cac_8x8(UWORD8 * pu1_top,UWORD8 * pu1_bot,WORD32 top_strd,WORD32 bot_strd)337*a97c2a1fSXin Li WORD32 ideint_cac_8x8(UWORD8 *pu1_top,
338*a97c2a1fSXin Li UWORD8 *pu1_bot,
339*a97c2a1fSXin Li WORD32 top_strd,
340*a97c2a1fSXin Li WORD32 bot_strd)
341*a97c2a1fSXin Li {
342*a97c2a1fSXin Li WORD32 ca; /* combing artifact result */
343*a97c2a1fSXin Li WORD32 k;
344*a97c2a1fSXin Li
345*a97c2a1fSXin Li ca = 0;
346*a97c2a1fSXin Li /*************************************************************************/
347*a97c2a1fSXin Li /* This loop runs for the two halves of the 4x8 block. */
348*a97c2a1fSXin Li /*************************************************************************/
349*a97c2a1fSXin Li for(k = 0; k < 2; k ++)
350*a97c2a1fSXin Li {
351*a97c2a1fSXin Li ca |= cac_4x8(pu1_top, pu1_bot, top_strd, bot_strd);
352*a97c2a1fSXin Li
353*a97c2a1fSXin Li pu1_top += SUB_BLK_WD;
354*a97c2a1fSXin Li pu1_bot += SUB_BLK_WD;
355*a97c2a1fSXin Li
356*a97c2a1fSXin Li /* If Combing Artifact is detected, then return. Else continue to
357*a97c2a1fSXin Li * check the next half
358*a97c2a1fSXin Li */
359*a97c2a1fSXin Li if(ca)
360*a97c2a1fSXin Li return ca;
361*a97c2a1fSXin Li }
362*a97c2a1fSXin Li
363*a97c2a1fSXin Li return ca;
364*a97c2a1fSXin Li }
365*a97c2a1fSXin Li
366