// Prior to coding a given prediction block, of size bsize at (mi_row, mi_col), // check if we should reset the segment_id, and update the cyclic_refresh map // and segmentation map. void vp9_cyclic_refresh_update_segment(VP9_COMP *const cpi, MODE_INFO *const mi, int mi_row, int mi_col, BLOCK_SIZE bsize, int64_t rate, int64_t dist, int skip, struct macroblock_plane *const p) { const VP9_COMMON *const cm = &cpi->common; CYCLIC_REFRESH *const cr = cpi->cyclic_refresh; const int bw = num_8x8_blocks_wide_lookup[bsize]; const int bh = num_8x8_blocks_high_lookup[bsize]; const int xmis = VPXMIN(cm->mi_cols - mi_col, bw); const int ymis = VPXMIN(cm->mi_rows - mi_row, bh); const int block_index = mi_row * cm->mi_cols + mi_col; int refresh_this_block = candidate_refresh_aq(cr, mi, rate, dist, bsize); // Default is to not update the refresh map. int new_map_value = cr->map[block_index]; int x = 0; int y = 0; int is_skin = 0; if (refresh_this_block == 0 && bsize <= BLOCK_16X16 && cpi->use_skin_detection) { is_skin = vp9_compute_skin_block(p[0].src.buf, p[1].src.buf, p[2].src.buf, p[0].src.stride, p[1].src.stride, bsize, 0, 0); if (is_skin) refresh_this_block = 1; } if (cpi->oxcf.rc_mode == VPX_VBR && mi->ref_frame[0] == GOLDEN_FRAME) refresh_this_block = 0; // If this block is labeled for refresh, check if we should reset the // segment_id. if (cyclic_refresh_segment_id_boosted(mi->segment_id)) { mi->segment_id = refresh_this_block; // Reset segment_id if it will be skipped. if (skip) mi->segment_id = CR_SEGMENT_ID_BASE; } // Update the cyclic refresh map, to be used for setting segmentation map // for the next frame. If the block will be refreshed this frame, mark it // as clean. The magnitude of the -ve influences how long before we consider // it for refresh again. if (cyclic_refresh_segment_id_boosted(mi->segment_id)) { new_map_value = -cr->time_for_refresh; } else if (refresh_this_block) { // Else if it is accepted as candidate for refresh, and has not already // been refreshed (marked as 1) then mark it as a candidate for cleanup // for future time (marked as 0), otherwise don't update it. if (cr->map[block_index] == 1) new_map_value = 0; } else { // Leave it marked as block that is not candidate for refresh. new_map_value = 1; } // Update entries in the cyclic refresh map with new_map_value, and // copy mbmi->segment_id into global segmentation map. for (y = 0; y < ymis; y++) for (x = 0; x < xmis; x++) { int map_offset = block_index + y * cm->mi_cols + x; cr->map[map_offset] = new_map_value; cpi->segmentation_map[map_offset] = mi->segment_id; } }
void vp9_compute_skin_sb(VP9_COMP *const cpi, BLOCK_SIZE bsize, int mi_row, int mi_col) { int i, j, num_bl; VP9_COMMON *const cm = &cpi->common; const uint8_t *src_y = cpi->Source->y_buffer; const uint8_t *src_u = cpi->Source->u_buffer; const uint8_t *src_v = cpi->Source->v_buffer; const int src_ystride = cpi->Source->y_stride; const int src_uvstride = cpi->Source->uv_stride; const int y_bsize = 4 << b_width_log2_lookup[bsize]; const int uv_bsize = y_bsize >> 1; const int shy = (y_bsize == 8) ? 3 : 4; const int shuv = shy - 1; const int fac = y_bsize / 8; const int y_shift = src_ystride * (mi_row << 3) + (mi_col << 3); const int uv_shift = src_uvstride * (mi_row << 2) + (mi_col << 2); const int mi_row_limit = VPXMIN(mi_row + 8, cm->mi_rows - 2); const int mi_col_limit = VPXMIN(mi_col + 8, cm->mi_cols - 2); src_y += y_shift; src_u += uv_shift; src_v += uv_shift; for (i = mi_row; i < mi_row_limit; i += fac) { num_bl = 0; for (j = mi_col; j < mi_col_limit; j += fac) { int consec_zeromv = 0; int bl_index = i * cm->mi_cols + j; int bl_index1 = bl_index + 1; int bl_index2 = bl_index + cm->mi_cols; int bl_index3 = bl_index2 + 1; // Don't detect skin on the boundary. if (i == 0 || j == 0) continue; if (bsize == BLOCK_8X8) consec_zeromv = cpi->consec_zero_mv[bl_index]; else consec_zeromv = VPXMIN(cpi->consec_zero_mv[bl_index], VPXMIN(cpi->consec_zero_mv[bl_index1], VPXMIN(cpi->consec_zero_mv[bl_index2], cpi->consec_zero_mv[bl_index3]))); cpi->skin_map[bl_index] = vp9_compute_skin_block(src_y, src_u, src_v, src_ystride, src_uvstride, bsize, consec_zeromv, 0); num_bl++; src_y += y_bsize; src_u += uv_bsize; src_v += uv_bsize; } src_y += (src_ystride << shy) - (num_bl << shy); src_u += (src_uvstride << shuv) - (num_bl << shuv); src_v += (src_uvstride << shuv) - (num_bl << shuv); } // Remove isolated skin blocks (none of its neighbors are skin) and isolated // non-skin blocks (all of its neighbors are skin). // Skip 4 corner blocks which have only 3 neighbors to remove isolated skin // blocks. Skip superblock borders to remove isolated non-skin blocks. for (i = mi_row; i < mi_row_limit; i += fac) { for (j = mi_col; j < mi_col_limit; j += fac) { int bl_index = i * cm->mi_cols + j; int num_neighbor = 0; int mi, mj; int non_skin_threshold = 8; // Skip 4 corners. if ((i == mi_row && (j == mi_col || j == mi_col_limit - fac)) || (i == mi_row_limit - fac && (j == mi_col || j == mi_col_limit - fac))) continue; // There are only 5 neighbors for non-skin blocks on the border. if (i == mi_row || i == mi_row_limit - fac || j == mi_col || j == mi_col_limit - fac) non_skin_threshold = 5; for (mi = -fac; mi <= fac; mi += fac) { for (mj = -fac; mj <= fac; mj += fac) { if (i + mi >= mi_row && i + mi < mi_row_limit && j + mj >= mi_col && j + mj < mi_col_limit) { int bl_neighbor_index = (i + mi) * cm->mi_cols + j + mj; if (cpi->skin_map[bl_neighbor_index]) num_neighbor++; } } } if (cpi->skin_map[bl_index] && num_neighbor < 2) cpi->skin_map[bl_index] = 0; if (!cpi->skin_map[bl_index] && num_neighbor == non_skin_threshold) cpi->skin_map[bl_index] = 1; } } }