/* The copyright in this software is being made available under the BSD * License, included below. This software may be subject to other third party * and contributor rights, including patent rights, and no such rights are * granted under this license. * * Copyright (c) 2010-2012, ITU/ISO/IEC * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * * Redistributions of source code must retain the above copyright notice, * this list of conditions and the following disclaimer. * * Redistributions in binary form must reproduce the above copyright notice, * this list of conditions and the following disclaimer in the documentation * and/or other materials provided with the distribution. * * Neither the name of the ITU/ISO/IEC nor the names of its contributors may * be used to endorse or promote products derived from this software without * specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF * THE POSSIBILITY OF SUCH DAMAGE. */ /** \file TComRdCostWeightPrediction.cpp \brief RD cost computation class with Weighted-Prediction */ #include #include #include "TComRdCost.h" #include "TComRdCostWeightPrediction.h" Int TComRdCostWeightPrediction::m_w0 = 0; Int TComRdCostWeightPrediction::m_w1 = 0; Int TComRdCostWeightPrediction::m_shift = 0; Int TComRdCostWeightPrediction::m_offset = 0; Int TComRdCostWeightPrediction::m_round = 0; Bool TComRdCostWeightPrediction::m_xSetDone = false; // ==================================================================================================================== // Distortion functions // ==================================================================================================================== TComRdCostWeightPrediction::TComRdCostWeightPrediction() { } TComRdCostWeightPrediction::~TComRdCostWeightPrediction() { } // -------------------------------------------------------------------------------------------------------------------- // SAD // -------------------------------------------------------------------------------------------------------------------- /** get weighted SAD cost * \param pcDtParam * \returns UInt */ UInt TComRdCostWeightPrediction::xGetSADw( DistParam* pcDtParam ) { Pel pred; Pel* piOrg = pcDtParam->pOrg; Pel* piCur = pcDtParam->pCur; Int iRows = pcDtParam->iRows; Int iCols = pcDtParam->iCols; Int iStrideCur = pcDtParam->iStrideCur; Int iStrideOrg = pcDtParam->iStrideOrg; UInt uiComp = pcDtParam->uiComp; assert(uiComp<3); wpScalingParam *wpCur = &(pcDtParam->wpCur[uiComp]); Int w0 = wpCur->w, offset = wpCur->offset, shift = wpCur->shift, round = wpCur->round; UInt uiSum = 0; #if HHI_INTERVIEW_SKIP if( pcDtParam->pUsed ) { Pel* piUsed = pcDtParam->pUsed; Int iStrideUsed = pcDtParam->iStrideUsed; for( ; iRows != 0; iRows-- ) { for (Int n = 0; n < iCols; n++ ) { if( piUsed[n]) { pred = ( (w0*piCur[n] + round) >> shift ) + offset ; uiSum += abs( piOrg[n] - pred ); } } piOrg += iStrideOrg; piCur += iStrideCur; piUsed += iStrideUsed; } #if FIX_LGE_WP_FOR_3D_C0223 } else { #endif #if FIX_LGE_WP_FOR_3D_C0223 //comment of #else //#else #endif #endif for( ; iRows != 0; iRows-- ) { for (Int n = 0; n < iCols; n++ ) { pred = ( (w0*piCur[n] + round) >> shift ) + offset ; uiSum += abs( piOrg[n] - pred ); } piOrg += iStrideOrg; piCur += iStrideCur; } #if FIX_LGE_WP_FOR_3D_C0223 //comment of #endif //#endif #endif #if HHI_INTERVIEW_SKIP } #endif pcDtParam->uiComp = 255; // reset for DEBUG (assert test) return ( uiSum >> g_uiBitIncrement ); } // -------------------------------------------------------------------------------------------------------------------- // SSE // -------------------------------------------------------------------------------------------------------------------- /** get weighted SSD cost * \param pcDtParam * \returns UInt */ UInt TComRdCostWeightPrediction::xGetSSEw( DistParam* pcDtParam ) { Pel* piOrg = pcDtParam->pOrg; Pel* piCur = pcDtParam->pCur; Pel pred; Int iRows = pcDtParam->iRows; Int iCols = pcDtParam->iCols; Int iStrideOrg = pcDtParam->iStrideOrg; Int iStrideCur = pcDtParam->iStrideCur; assert( pcDtParam->iSubShift == 0 ); UInt uiComp = pcDtParam->uiComp; assert(uiComp<3); wpScalingParam *wpCur = &(pcDtParam->wpCur[uiComp]); Int w0 = wpCur->w, offset = wpCur->offset, shift = wpCur->shift, round = wpCur->round; UInt uiSum = 0; UInt uiShift = g_uiBitIncrement<<1; Int iTemp; for( ; iRows != 0; iRows-- ) { for (Int n = 0; n < iCols; n++ ) { pred = ( (w0*piCur[n] + round) >> shift ) + offset ; iTemp = piOrg[n ] - pred; uiSum += ( iTemp * iTemp ) >> uiShift; } piOrg += iStrideOrg; piCur += iStrideCur; } pcDtParam->uiComp = 255; // reset for DEBUG (assert test) return ( uiSum ); } // -------------------------------------------------------------------------------------------------------------------- // HADAMARD with step (used in fractional search) // -------------------------------------------------------------------------------------------------------------------- /** get weighted Hadamard cost for 2x2 block * \param *piOrg * \param *piCur * \param iStrideOrg * \param iStrideCur * \param iStep * \returns UInt */ UInt TComRdCostWeightPrediction::xCalcHADs2x2w( Pel *piOrg, Pel *piCur, Int iStrideOrg, Int iStrideCur, Int iStep ) { Int satd = 0, diff[4], m[4]; assert( m_xSetDone ); Pel pred; pred = ( (m_w0*piCur[0*iStep ] + m_round) >> m_shift ) + m_offset ; diff[0] = piOrg[0 ] - pred; pred = ( (m_w0*piCur[1*iStep ] + m_round) >> m_shift ) + m_offset ; diff[1] = piOrg[1 ] - pred; pred = ( (m_w0*piCur[0*iStep + iStrideCur] + m_round) >> m_shift ) + m_offset ; diff[2] = piOrg[iStrideOrg ] - pred; pred = ( (m_w0*piCur[1*iStep + iStrideCur] + m_round) >> m_shift ) + m_offset ; diff[3] = piOrg[iStrideOrg + 1] - pred; m[0] = diff[0] + diff[2]; m[1] = diff[1] + diff[3]; m[2] = diff[0] - diff[2]; m[3] = diff[1] - diff[3]; satd += abs(m[0] + m[1]); satd += abs(m[0] - m[1]); satd += abs(m[2] + m[3]); satd += abs(m[2] - m[3]); return satd; } /** get weighted Hadamard cost for 4x4 block * \param *piOrg * \param *piCur * \param iStrideOrg * \param iStrideCur * \param iStep * \returns UInt */ UInt TComRdCostWeightPrediction::xCalcHADs4x4w( Pel *piOrg, Pel *piCur, Int iStrideOrg, Int iStrideCur, Int iStep ) { Int k, satd = 0, diff[16], m[16], d[16]; assert( m_xSetDone ); Pel pred; for( k = 0; k < 16; k+=4 ) { pred = ( (m_w0*piCur[0*iStep] + m_round) >> m_shift ) + m_offset ; diff[k+0] = piOrg[0] - pred; pred = ( (m_w0*piCur[1*iStep] + m_round) >> m_shift ) + m_offset ; diff[k+1] = piOrg[1] - pred; pred = ( (m_w0*piCur[2*iStep] + m_round) >> m_shift ) + m_offset ; diff[k+2] = piOrg[2] - pred; pred = ( (m_w0*piCur[3*iStep] + m_round) >> m_shift ) + m_offset ; diff[k+3] = piOrg[3] - pred; piCur += iStrideCur; piOrg += iStrideOrg; } /*===== hadamard transform =====*/ m[ 0] = diff[ 0] + diff[12]; m[ 1] = diff[ 1] + diff[13]; m[ 2] = diff[ 2] + diff[14]; m[ 3] = diff[ 3] + diff[15]; m[ 4] = diff[ 4] + diff[ 8]; m[ 5] = diff[ 5] + diff[ 9]; m[ 6] = diff[ 6] + diff[10]; m[ 7] = diff[ 7] + diff[11]; m[ 8] = diff[ 4] - diff[ 8]; m[ 9] = diff[ 5] - diff[ 9]; m[10] = diff[ 6] - diff[10]; m[11] = diff[ 7] - diff[11]; m[12] = diff[ 0] - diff[12]; m[13] = diff[ 1] - diff[13]; m[14] = diff[ 2] - diff[14]; m[15] = diff[ 3] - diff[15]; d[ 0] = m[ 0] + m[ 4]; d[ 1] = m[ 1] + m[ 5]; d[ 2] = m[ 2] + m[ 6]; d[ 3] = m[ 3] + m[ 7]; d[ 4] = m[ 8] + m[12]; d[ 5] = m[ 9] + m[13]; d[ 6] = m[10] + m[14]; d[ 7] = m[11] + m[15]; d[ 8] = m[ 0] - m[ 4]; d[ 9] = m[ 1] - m[ 5]; d[10] = m[ 2] - m[ 6]; d[11] = m[ 3] - m[ 7]; d[12] = m[12] - m[ 8]; d[13] = m[13] - m[ 9]; d[14] = m[14] - m[10]; d[15] = m[15] - m[11]; m[ 0] = d[ 0] + d[ 3]; m[ 1] = d[ 1] + d[ 2]; m[ 2] = d[ 1] - d[ 2]; m[ 3] = d[ 0] - d[ 3]; m[ 4] = d[ 4] + d[ 7]; m[ 5] = d[ 5] + d[ 6]; m[ 6] = d[ 5] - d[ 6]; m[ 7] = d[ 4] - d[ 7]; m[ 8] = d[ 8] + d[11]; m[ 9] = d[ 9] + d[10]; m[10] = d[ 9] - d[10]; m[11] = d[ 8] - d[11]; m[12] = d[12] + d[15]; m[13] = d[13] + d[14]; m[14] = d[13] - d[14]; m[15] = d[12] - d[15]; d[ 0] = m[ 0] + m[ 1]; d[ 1] = m[ 0] - m[ 1]; d[ 2] = m[ 2] + m[ 3]; d[ 3] = m[ 3] - m[ 2]; d[ 4] = m[ 4] + m[ 5]; d[ 5] = m[ 4] - m[ 5]; d[ 6] = m[ 6] + m[ 7]; d[ 7] = m[ 7] - m[ 6]; d[ 8] = m[ 8] + m[ 9]; d[ 9] = m[ 8] - m[ 9]; d[10] = m[10] + m[11]; d[11] = m[11] - m[10]; d[12] = m[12] + m[13]; d[13] = m[12] - m[13]; d[14] = m[14] + m[15]; d[15] = m[15] - m[14]; for (k=0; k<16; ++k) { satd += abs(d[k]); } satd = ((satd+1)>>1); return satd; } /** get weighted Hadamard cost for 8x8 block * \param *piOrg * \param *piCur * \param iStrideOrg * \param iStrideCur * \param iStep * \returns UInt */ UInt TComRdCostWeightPrediction::xCalcHADs8x8w( Pel *piOrg, Pel *piCur, Int iStrideOrg, Int iStrideCur, Int iStep ) { Int k, i, j, jj, sad=0; Int diff[64], m1[8][8], m2[8][8], m3[8][8]; Int iStep2 = iStep<<1; Int iStep3 = iStep2 + iStep; Int iStep4 = iStep3 + iStep; Int iStep5 = iStep4 + iStep; Int iStep6 = iStep5 + iStep; Int iStep7 = iStep6 + iStep; assert( m_xSetDone ); Pel pred; for( k = 0; k < 64; k+=8 ) { pred = ( (m_w0*piCur[ 0] + m_round) >> m_shift ) + m_offset ; diff[k+0] = piOrg[0] - pred; pred = ( (m_w0*piCur[iStep ] + m_round) >> m_shift ) + m_offset ; diff[k+1] = piOrg[1] - pred; pred = ( (m_w0*piCur[iStep2] + m_round) >> m_shift ) + m_offset ; diff[k+2] = piOrg[2] - pred; pred = ( (m_w0*piCur[iStep3] + m_round) >> m_shift ) + m_offset ; diff[k+3] = piOrg[3] - pred; pred = ( (m_w0*piCur[iStep4] + m_round) >> m_shift ) + m_offset ; diff[k+4] = piOrg[4] - pred; pred = ( (m_w0*piCur[iStep5] + m_round) >> m_shift ) + m_offset ; diff[k+5] = piOrg[5] - pred; pred = ( (m_w0*piCur[iStep6] + m_round) >> m_shift ) + m_offset ; diff[k+6] = piOrg[6] - pred; pred = ( (m_w0*piCur[iStep7] + m_round) >> m_shift ) + m_offset ; diff[k+7] = piOrg[7] - pred; piCur += iStrideCur; piOrg += iStrideOrg; } //horizontal for (j=0; j < 8; j++) { jj = j << 3; m2[j][0] = diff[jj ] + diff[jj+4]; m2[j][1] = diff[jj+1] + diff[jj+5]; m2[j][2] = diff[jj+2] + diff[jj+6]; m2[j][3] = diff[jj+3] + diff[jj+7]; m2[j][4] = diff[jj ] - diff[jj+4]; m2[j][5] = diff[jj+1] - diff[jj+5]; m2[j][6] = diff[jj+2] - diff[jj+6]; m2[j][7] = diff[jj+3] - diff[jj+7]; m1[j][0] = m2[j][0] + m2[j][2]; m1[j][1] = m2[j][1] + m2[j][3]; m1[j][2] = m2[j][0] - m2[j][2]; m1[j][3] = m2[j][1] - m2[j][3]; m1[j][4] = m2[j][4] + m2[j][6]; m1[j][5] = m2[j][5] + m2[j][7]; m1[j][6] = m2[j][4] - m2[j][6]; m1[j][7] = m2[j][5] - m2[j][7]; m2[j][0] = m1[j][0] + m1[j][1]; m2[j][1] = m1[j][0] - m1[j][1]; m2[j][2] = m1[j][2] + m1[j][3]; m2[j][3] = m1[j][2] - m1[j][3]; m2[j][4] = m1[j][4] + m1[j][5]; m2[j][5] = m1[j][4] - m1[j][5]; m2[j][6] = m1[j][6] + m1[j][7]; m2[j][7] = m1[j][6] - m1[j][7]; } //vertical for (i=0; i < 8; i++) { m3[0][i] = m2[0][i] + m2[4][i]; m3[1][i] = m2[1][i] + m2[5][i]; m3[2][i] = m2[2][i] + m2[6][i]; m3[3][i] = m2[3][i] + m2[7][i]; m3[4][i] = m2[0][i] - m2[4][i]; m3[5][i] = m2[1][i] - m2[5][i]; m3[6][i] = m2[2][i] - m2[6][i]; m3[7][i] = m2[3][i] - m2[7][i]; m1[0][i] = m3[0][i] + m3[2][i]; m1[1][i] = m3[1][i] + m3[3][i]; m1[2][i] = m3[0][i] - m3[2][i]; m1[3][i] = m3[1][i] - m3[3][i]; m1[4][i] = m3[4][i] + m3[6][i]; m1[5][i] = m3[5][i] + m3[7][i]; m1[6][i] = m3[4][i] - m3[6][i]; m1[7][i] = m3[5][i] - m3[7][i]; m2[0][i] = m1[0][i] + m1[1][i]; m2[1][i] = m1[0][i] - m1[1][i]; m2[2][i] = m1[2][i] + m1[3][i]; m2[3][i] = m1[2][i] - m1[3][i]; m2[4][i] = m1[4][i] + m1[5][i]; m2[5][i] = m1[4][i] - m1[5][i]; m2[6][i] = m1[6][i] + m1[7][i]; m2[7][i] = m1[6][i] - m1[7][i]; } for (j=0; j < 8; j++) { for (i=0; i < 8; i++) sad += (abs(m2[j][i])); } sad=((sad+2)>>2); return sad; } /** get weighted Hadamard cost * \param *pcDtParam * \returns UInt */ UInt TComRdCostWeightPrediction::xGetHADs4w( DistParam* pcDtParam ) { Pel* piOrg = pcDtParam->pOrg; Pel* piCur = pcDtParam->pCur; Int iRows = pcDtParam->iRows; Int iStrideCur = pcDtParam->iStrideCur; Int iStrideOrg = pcDtParam->iStrideOrg; Int iStep = pcDtParam->iStep; Int y; Int iOffsetOrg = iStrideOrg<<2; Int iOffsetCur = iStrideCur<<2; UInt uiSum = 0; for ( y=0; y> g_uiBitIncrement ); } /** get weighted Hadamard cost * \param *pcDtParam * \returns UInt */ UInt TComRdCostWeightPrediction::xGetHADs8w( DistParam* pcDtParam ) { Pel* piOrg = pcDtParam->pOrg; Pel* piCur = pcDtParam->pCur; Int iRows = pcDtParam->iRows; Int iStrideCur = pcDtParam->iStrideCur; Int iStrideOrg = pcDtParam->iStrideOrg; Int iStep = pcDtParam->iStep; Int y; UInt uiSum = 0; if ( iRows == 4 ) { uiSum += xCalcHADs4x4w( piOrg+0, piCur , iStrideOrg, iStrideCur, iStep ); uiSum += xCalcHADs4x4w( piOrg+4, piCur+4*iStep, iStrideOrg, iStrideCur, iStep ); } else { Int iOffsetOrg = iStrideOrg<<3; Int iOffsetCur = iStrideCur<<3; for ( y=0; y> g_uiBitIncrement ); } /** get weighted Hadamard cost * \param *pcDtParam * \returns UInt */ UInt TComRdCostWeightPrediction::xGetHADsw( DistParam* pcDtParam ) { Pel* piOrg = pcDtParam->pOrg; Pel* piCur = pcDtParam->pCur; Int iRows = pcDtParam->iRows; Int iCols = pcDtParam->iCols; Int iStrideCur = pcDtParam->iStrideCur; Int iStrideOrg = pcDtParam->iStrideOrg; Int iStep = pcDtParam->iStep; Int x, y; UInt uiComp = pcDtParam->uiComp; assert(uiComp<3); wpScalingParam *wpCur = &(pcDtParam->wpCur[uiComp]); Int w0 = wpCur->w, offset = wpCur->offset, shift = wpCur->shift, round = wpCur->round; xSetWPscale(w0, 0, shift, offset, round); UInt uiSum = 0; if( ( iRows % 8 == 0) && (iCols % 8 == 0) ) { Int iOffsetOrg = iStrideOrg<<3; Int iOffsetCur = iStrideCur<<3; for ( y=0; y> g_uiBitIncrement ); }