Home
last modified time | relevance | path

Searched refs:probs (Results 1 – 25 of 51) sorted by relevance

123

/external/lzma/Java/Tukaani/src/org/tukaani/xz/rangecoder/
DRangeEncoder.java104 public void encodeBit(short[] probs, int index, int bit) { in encodeBit() argument
105 int prob = probs[index]; in encodeBit()
111 probs[index] = (short)( in encodeBit()
116 probs[index] = (short)(prob - (prob >>> MOVE_BITS)); in encodeBit()
132 public void encodeBitTree(short[] probs, int symbol) { in encodeBitTree() argument
134 int mask = probs.length; in encodeBitTree()
139 encodeBit(probs, index, bit); in encodeBitTree()
148 public static int getBitTreePrice(short[] probs, int symbol) { in getBitTreePrice() argument
150 symbol |= probs.length; in getBitTreePrice()
155 price += getBitPrice(probs[symbol], bit); in getBitTreePrice()
[all …]
DRangeDecoder.java22 public int decodeBit(short[] probs, int index) throws IOException { in decodeBit() argument
25 int prob = probs[index]; in decodeBit()
32 probs[index] = (short)( in decodeBit()
38 probs[index] = (short)(prob - (prob >>> MOVE_BITS)); in decodeBit()
45 public int decodeBitTree(short[] probs) throws IOException { in decodeBitTree() argument
49 symbol = (symbol << 1) | decodeBit(probs, symbol); in decodeBitTree()
50 } while (symbol < probs.length); in decodeBitTree()
52 return symbol - probs.length; in decodeBitTree()
55 public int decodeReverseBitTree(short[] probs) throws IOException { in decodeReverseBitTree() argument
61 int bit = decodeBit(probs, symbol); in decodeReverseBitTree()
[all …]
DRangeCoder.java23 public static final void initProbs(short[] probs) { in initProbs() argument
24 Arrays.fill(probs, PROB_INIT); in initProbs()
/external/libvpx/libvpx/vp9/encoder/
Dvp9_cost.c38 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, in cost() argument
40 const vpx_prob prob = probs[i / 2]; in cost()
50 cost(costs, tree, probs, ii, cc); in cost()
54 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
55 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
58 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
61 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
62 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
Dvp9_segmentation.c69 static int cost_segmap(int *segcounts, vpx_prob *probs) { in cost_segmap() argument
78 int cost = c0123 * vp9_cost_zero(probs[0]) + in cost_segmap()
79 c4567 * vp9_cost_one(probs[0]); in cost_segmap()
83 cost += c01 * vp9_cost_zero(probs[1]) + in cost_segmap()
84 c23 * vp9_cost_one(probs[1]); in cost_segmap()
87 cost += segcounts[0] * vp9_cost_zero(probs[3]) + in cost_segmap()
88 segcounts[1] * vp9_cost_one(probs[3]); in cost_segmap()
90 cost += segcounts[2] * vp9_cost_zero(probs[4]) + in cost_segmap()
91 segcounts[3] * vp9_cost_one(probs[4]); in cost_segmap()
95 cost += c45 * vp9_cost_zero(probs[2]) + in cost_segmap()
[all …]
Dvp9_treewriter.h32 const vpx_prob *probs, int bits, int len, in vp9_write_tree() argument
36 vpx_write(w, bit, probs[i >> 1]); in vp9_write_tree()
42 const vpx_prob *probs, in vp9_write_token() argument
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0); in vp9_write_token()
Dvp9_cost.h34 static INLINE int treed_cost(vpx_tree tree, const vpx_prob *probs, in treed_cost() argument
41 cost += vp9_cost_bit(probs[i >> 1], bit); in treed_cost()
48 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree);
49 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree);
/external/lzma/C/
DLzmaDec.c29 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); } argument
30 #define TREE_DECODE(probs, limit, i) \ argument
31 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
36 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i) argument
38 #define TREE_6_DECODE(probs, i) \ argument
40 TREE_GET_BIT(probs, i); \
41 TREE_GET_BIT(probs, i); \
42 TREE_GET_BIT(probs, i); \
43 TREE_GET_BIT(probs, i); \
44 TREE_GET_BIT(probs, i); \
[all …]
DLzmaEnc.c585 static void LitEnc_Encode(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol) in LitEnc_Encode() argument
590 RangeEnc_EncodeBit(p, probs + (symbol >> 8), (symbol >> 7) & 1); in LitEnc_Encode()
596 static void LitEnc_EncodeMatched(CRangeEnc *p, CLzmaProb *probs, UInt32 symbol, UInt32 matchByte) in LitEnc_EncodeMatched() argument
603 RangeEnc_EncodeBit(p, probs + (offs + (matchByte & offs) + (symbol >> 8)), (symbol >> 7) & 1); in LitEnc_EncodeMatched()
646 static UInt32 LitEnc_GetPrice(const CLzmaProb *probs, UInt32 symbol, UInt32 *ProbPrices) in LitEnc_GetPrice() argument
652 price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1); in LitEnc_GetPrice()
659 static UInt32 LitEnc_GetPriceMatched(const CLzmaProb *probs, UInt32 symbol, UInt32 matchByte, UInt3… in LitEnc_GetPriceMatched() argument
667 price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1); in LitEnc_GetPriceMatched()
676 static void RcTree_Encode(CRangeEnc *rc, CLzmaProb *probs, int numBitLevels, UInt32 symbol) in RcTree_Encode() argument
685 RangeEnc_EncodeBit(rc, probs + m, bit); in RcTree_Encode()
[all …]
/external/libvpx/libvpx/vpx_dsp/
Dprob.c36 vpx_prob *probs) { in tree_merge_probs_impl() argument
40 : tree_merge_probs_impl(l, tree, pre_probs, counts, probs); in tree_merge_probs_impl()
44 : tree_merge_probs_impl(r, tree, pre_probs, counts, probs); in tree_merge_probs_impl()
46 probs[i >> 1] = mode_mv_merge_probs(pre_probs[i >> 1], ct); in tree_merge_probs_impl()
51 const unsigned int *counts, vpx_prob *probs) { in vpx_tree_merge_probs() argument
52 tree_merge_probs_impl(0, tree, pre_probs, counts, probs); in vpx_tree_merge_probs()
/external/lzma/Java/SevenZip/Compression/RangeCoder/
DDecoder.java54 public int DecodeBit(short []probs, int index) throws IOException in DecodeBit() argument
56 int prob = probs[index]; in DecodeBit()
61 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits)); in DecodeBit()
73 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits)); in DecodeBit()
83 public static void InitBitModels(short []probs) in InitBitModels() argument
85 for (int i = 0; i < probs.length; i++) in InitBitModels()
86 probs[i] = (kBitModelTotal >>> 1); in InitBitModels()
DEncoder.java96 public static void InitBitModels(short []probs) in InitBitModels() argument
98 for (int i = 0; i < probs.length; i++) in InitBitModels()
99 probs[i] = (kBitModelTotal >>> 1); in InitBitModels()
102 public void Encode(short []probs, int index, int symbol) throws IOException in Encode() argument
104 int prob = probs[index]; in Encode()
109 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits)); in Encode()
115 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits)); in Encode()
/external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/rangecoder/
DDecoder.java64 public int DecodeBit (short[] probs, int index) throws IOException { in DecodeBit() argument
65 int prob = probs[index]; in DecodeBit()
69 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits)); in DecodeBit()
78 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits)); in DecodeBit()
87 public static void InitBitModels (short[] probs) { in InitBitModels() argument
88 for (int i = 0; i < probs.length; i++) in InitBitModels()
89 probs[i] = (kBitModelTotal >>> 1); in InitBitModels()
DEncoder.java95 public static void InitBitModels (short[] probs) { in InitBitModels() argument
96 for (int i = 0; i < probs.length; i++) in InitBitModels()
97 probs[i] = (kBitModelTotal >>> 1); in InitBitModels()
100 public void Encode (short[] probs, int index, int symbol) throws IOException { in Encode() argument
101 int prob = probs[index]; in Encode()
105 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits)); in Encode()
109 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits)); in Encode()
/external/opencv3/modules/ml/src/
Dem.cpp121 OutputArray probs) in trainEM() argument
125 return doTrain(START_AUTO_STEP, logLikelihoods, labels, probs); in trainEM()
134 OutputArray probs) in trainE() argument
144 return doTrain(START_E_STEP, logLikelihoods, labels, probs); in trainE()
151 OutputArray probs) in trainM() argument
157 return doTrain(START_M_STEP, logLikelihoods, labels, probs); in trainM()
163 Mat samples = _inputs.getMat(), probs, probsrow; in predict() local
180 probsrow = probs.row(i); in predict()
203 Mat probs; in predict2() local
209 probs = _probs.getMat(); in predict2()
[all …]
/external/deqp/modules/gles2/stress/
Des2sLongRunningTests.cpp79 const Probs probs; in init() member
80 …obs& probs_ = Probs()) : name(name_), desc(desc_), redundantBufferFactor(bufFact), probs(probs_) {} in init()
123 contexts, cases[caseNdx].probs, in init()
151 const Probs probs; in init() member
152 …st Probs& probs_ = Probs()) : name(name_), desc(desc_), numTextures(numTextures_), probs(probs_) {} in init()
191 contexts, cases[caseNdx].probs, in init()
208 const Probs probs; in init() member
210 …: name(name_), desc(desc_), drawCallsPerIteration(calls), numTrisPerDrawCall(tris), probs(probs_) … in init()
241 contexts, cases[caseNdx].probs, in init()
257 const Probs probs; in init() member
[all …]
/external/deqp/modules/gles3/stress/
Des3sLongRunningTests.cpp79 const Probs probs; in init() member
80 …obs& probs_ = Probs()) : name(name_), desc(desc_), redundantBufferFactor(bufFact), probs(probs_) {} in init()
123 contexts, cases[caseNdx].probs, in init()
151 const Probs probs; in init() member
152 …st Probs& probs_ = Probs()) : name(name_), desc(desc_), numTextures(numTextures_), probs(probs_) {} in init()
191 contexts, cases[caseNdx].probs, in init()
208 const Probs probs; in init() member
210 …: name(name_), desc(desc_), drawCallsPerIteration(calls), numTrisPerDrawCall(tris), probs(probs_) … in init()
241 contexts, cases[caseNdx].probs, in init()
257 const Probs probs; in init() member
[all …]
/external/opencv3/modules/java/src/
Dml+EM.java146 public double[] predict2(Mat sample, Mat probs) in predict2() argument
149 double[] retVal = predict2_0(nativeObj, sample.nativeObj, probs.nativeObj); in predict2()
160 public boolean trainEM(Mat samples, Mat logLikelihoods, Mat labels, Mat probs) in trainEM() argument
163 …ainEM_0(nativeObj, samples.nativeObj, logLikelihoods.nativeObj, labels.nativeObj, probs.nativeObj); in trainEM()
183 …trainE(Mat samples, Mat means0, Mat covs0, Mat weights0, Mat logLikelihoods, Mat labels, Mat probs) in trainE() argument
186 … covs0.nativeObj, weights0.nativeObj, logLikelihoods.nativeObj, labels.nativeObj, probs.nativeObj); in trainE()
206 public boolean trainM(Mat samples, Mat probs0, Mat logLikelihoods, Mat labels, Mat probs) in trainM() argument
209 … samples.nativeObj, probs0.nativeObj, logLikelihoods.nativeObj, labels.nativeObj, probs.nativeObj); in trainM()
/external/lzma/xz-embedded/
Dxz_dec_lzma2.c520 uint16_t *probs, uint32_t limit) in rc_bittree() argument
525 if (rc_bit(rc, &probs[symbol])) in rc_bittree()
536 uint16_t *probs, in rc_bittree_reverse() argument
543 if (rc_bit(rc, &probs[symbol])) { in rc_bittree_reverse()
583 uint16_t *probs; in lzma_literal() local
590 probs = lzma_literal_probs(s); in lzma_literal()
593 symbol = rc_bittree(&s->rc, probs, 0x100); in lzma_literal()
604 if (rc_bit(&s->rc, &probs[i])) { in lzma_literal()
622 uint16_t *probs; in lzma_len() local
626 probs = l->low[pos_state]; in lzma_len()
[all …]
/external/opencv/ml/src/
Dmlem.cpp74 means = weights = probs = inv_eigen_values = log_weight_div_det = 0; in CvEM()
81 means = weights = probs = inv_eigen_values = log_weight_div_det = 0; in CvEM()
100 cvReleaseMat( &probs ); in clear()
138 if( !params.probs ) in set_params()
154 if( params.probs ) in set_params()
342 CV_CALL( probs = cvCreateMat( nsamples, nclusters, CV_64FC1 )); in train()
376 prob.data.ptr = probs->data.ptr + probs->step*i; in train()
415 cvGetRow( params.probs, &prob, i ); in init_em()
509 cvSetIdentity( probs ); in init_auto()
805 CV_CALL( cvSet( probs, cvScalar(1.)) ); in run_em()
[all …]
Dml_inner_functions.cpp185 CV_IMPL void cvRandSeries( float probs[], int len, int sample[], int amount ) in cvRandSeries() argument
195 knots[0] = probs[0]; in cvRandSeries()
197 knots[i] = knots[i - 1] + probs[i]; in cvRandSeries()
1415 const CvMat* probs, CvMat* dst_probs, in cvWritebackLabels() argument
1492 if( dst_probs && (!probs || probs->data.ptr != dst_probs->data.ptr) ) in cvWritebackLabels()
1494 if( !probs ) in cvWritebackLabels()
1497 if( probs->cols != dst_probs->cols ) in cvWritebackLabels()
1505 CV_ASSERT( probs->rows == samples_selected ); in cvWritebackLabels()
1507 CV_CALL( icvConvertDataToSparse( probs->data.ptr, probs->step, probs->type, in cvWritebackLabels()
1509 cvSize( probs->cols, samples_selected ), in cvWritebackLabels()
[all …]
/external/opencv3/apps/traincascade/
Dold_ml_inner_functions.cpp185 static void cvRandSeries( float probs[], int len, int sample[], int amount ) in cvRandSeries() argument
195 knots[0] = probs[0]; in cvRandSeries()
197 knots[i] = knots[i - 1] + probs[i]; in cvRandSeries()
1341 const CvMat* probs, CvMat* dst_probs, in cvWritebackLabels() argument
1418 if( dst_probs && (!probs || probs->data.ptr != dst_probs->data.ptr) ) in cvWritebackLabels()
1420 if( !probs ) in cvWritebackLabels()
1423 if( probs->cols != dst_probs->cols ) in cvWritebackLabels()
1431 CV_ASSERT( probs->rows == samples_selected ); in cvWritebackLabels()
1433 CV_CALL( icvConvertDataToSparse( probs->data.ptr, probs->step, probs->type, in cvWritebackLabels()
1435 cvSize( probs->cols, samples_selected ), in cvWritebackLabels()
[all …]
/external/libvpx/libvpx/vp9/common/
Dvp9_entropy.c745 static void extend_to_full_distribution(vpx_prob *probs, vpx_prob p) { in extend_to_full_distribution() argument
746 memcpy(probs, vp9_pareto8_full[p = 0 ? 0 : p - 1], in extend_to_full_distribution()
774 vp9_coeff_probs_model *const probs = cm->fc->coef_probs[tx_size]; in adapt_coef_probs() local
795 probs[i][j][k][l][m] = merge_probs(pre_probs[i][j][k][l][m], in adapt_coef_probs()
/external/libvpx/libvpx/vp8/common/
Dtreecoder.c113 vp8_prob probs [ /* n-1 */ ], in vp8_tree_probs_from_distribution()
137 probs[t] = p < 256 ? (p ? p : 1) : 255; /* agree w/old version for now */ in vp8_tree_probs_from_distribution()
140 probs[t] = vp8_prob_half; in vp8_tree_probs_from_distribution()
Dtreecoder.h74 vp8_prob probs [ /* n-1 */ ],
87 vp8_prob probs [ /* n-1 */ ],

123