Lines Matching full:cost
115 computes the cost (cost[(x-minX)*(maxD - minD) + (d - minD)]), depending on the difference between
123 int minD, int maxD, CostType* cost,
178 memset( cost, 0, width1*D*sizeof(cost[0]) );
181 cost -= minX1*D + minD; // simplify the cost indices inside the loop
230 c0 = _mm_load_si128((__m128i*)(cost + x*D + d));
231 c1 = _mm_load_si128((__m128i*)(cost + x*D + d + 8));
233 _mm_store_si128((__m128i*)(cost + x*D + d), _mm_adds_epi16(c0, _mm_srl_epi16(_mm_unpacklo_epi8(diff,z), ds)));
234 _mm_store_si128((__m128i*)(cost + x*D + d + 8), _mm_adds_epi16(c1, _mm_srl_epi16(_mm_unpackhi_epi8(diff,z), ds)));
248 cost[x*D + d] = (CostType)(cost[x*D+d] + (std::min(c0, c1) >> diff_scale));
268 __m128i c0 = _mm_load_si128((__m128i*)(cost + x*D + d));
269 __m128i c1 = _mm_load_si128((__m128i*)(cost + x*D + d + 8));
271 _mm_store_si128((__m128i*)(cost + x*D + d), _mm_adds_epi16(c0, _mm_unpacklo_epi8(diff,z)));
272 _mm_store_si128((__m128i*)(cost + x*D + d + 8), _mm_adds_epi16(c1, _mm_unpackhi_epi8(diff,z)));
281 cost[x*D + d] = (CostType)(cost[x*D + d] + (CostType)std::abs(u - v));
308 It contains the minimum current cost, used to find the best disparity, corresponding to the minimal cost.
374 // we keep pixel difference cost (C) and the summary cost over NR directions (S).
383 width*16*img1.channels()*sizeof(PixType) + // temp buffer for computing per-pixel cost
390 // summary cost over different (nDirs) directions
1126 Mat disp = _disp.getMat(), cost = _cost.getMat();
1135 int costType = cost.type();
1141 disp.size() == cost.size() );
1155 const short* cptr = cost.ptr<short>(y);
1171 const int* cptr = cost.ptr<int>(y);
