HomeSort by relevance Sort by last modified time
    Searched full:probs (Results 1 - 25 of 89) sorted by null

1 2 3 4

  /external/lzma/Java/Tukaani/src/org/tukaani/xz/rangecoder/
RangeDecoder.java 22 public int decodeBit(short[] probs, int index) throws IOException {
25 int prob = probs[index];
32 probs[index] = (short)(
38 probs[index] = (short)(prob - (prob >>> MOVE_BITS));
45 public int decodeBitTree(short[] probs) throws IOException {
49 symbol = (symbol << 1) | decodeBit(probs, symbol);
50 } while (symbol < probs.length);
52 return symbol - probs.length;
55 public int decodeReverseBitTree(short[] probs) throws IOException {
61 int bit = decodeBit(probs, symbol)
    [all...]
RangeCoder.java 23 public static final void initProbs(short[] probs) {
24 Arrays.fill(probs, PROB_INIT);
RangeEncoder.java 104 public void encodeBit(short[] probs, int index, int bit) {
105 int prob = probs[index];
111 probs[index] = (short)(
116 probs[index] = (short)(prob - (prob >>> MOVE_BITS));
132 public void encodeBitTree(short[] probs, int symbol) {
134 int mask = probs.length;
139 encodeBit(probs, index, bit);
148 public static int getBitTreePrice(short[] probs, int symbol) {
150 symbol |= probs.length;
155 price += getBitPrice(probs[symbol], bit)
    [all...]
  /external/lzma/Java/SevenZip/Compression/RangeCoder/
Decoder.java 54 public int DecodeBit(short []probs, int index) throws IOException
56 int prob = probs[index];
61 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
73 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
83 public static void InitBitModels(short []probs)
85 for (int i = 0; i < probs.length; i++)
86 probs[i] = (kBitModelTotal >>> 1);
Encoder.java 96 public static void InitBitModels(short []probs)
98 for (int i = 0; i < probs.length; i++)
99 probs[i] = (kBitModelTotal >>> 1);
102 public void Encode(short []probs, int index, int symbol) throws IOException
104 int prob = probs[index];
109 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
115 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
  /external/opencv3/modules/java/src/
ml+EM.java 142 // C++: Vec2d predict2(Mat sample, Mat& probs)
145 //javadoc: EM::predict2(sample, probs)
146 public double[] predict2(Mat sample, Mat probs)
149 double[] retVal = predict2_0(nativeObj, sample.nativeObj, probs.nativeObj);
156 // C++: bool trainEM(Mat samples, Mat& logLikelihoods = Mat(), Mat& labels = Mat(), Mat& probs = Mat())
159 //javadoc: EM::trainEM(samples, logLikelihoods, labels, probs)
160 public boolean trainEM(Mat samples, Mat logLikelihoods, Mat labels, Mat probs)
163 boolean retVal = trainEM_0(nativeObj, samples.nativeObj, logLikelihoods.nativeObj, labels.nativeObj, probs.nativeObj);
179 // C++: bool trainE(Mat samples, Mat means0, Mat covs0 = Mat(), Mat weights0 = Mat(), Mat& logLikelihoods = Mat(), Mat& labels = Mat(), Mat& probs = Mat())
182 //javadoc: EM::trainE(samples, means0, covs0, weights0, logLikelihoods, labels, probs)
    [all...]
  /external/llvm/unittests/Support/
BranchProbabilityTest.cpp 293 SmallVector<BranchProbability, 2> Probs{{0, 1}, {0, 1}};
294 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
295 EXPECT_EQ(BranchProbability::getDenominator() / 2, Probs[0].getNumerator());
296 EXPECT_EQ(BranchProbability::getDenominator() / 2, Probs[1].getNumerator());
299 SmallVector<BranchProbability, 2> Probs{{0, 1}, {1, 1}};
300 BranchProbability::normalizeProbabilities(Probs.begin(), Probs.end());
301 EXPECT_EQ(0u, Probs[0].getNumerator());
302 EXPECT_EQ(BranchProbability::getDenominator(), Probs[1].getNumerator())
    [all...]
  /external/libvpx/libvpx/vp9/encoder/
vp9_cost.h 34 static INLINE int treed_cost(vpx_tree tree, const vpx_prob *probs,
41 cost += vp9_cost_bit(probs[i >> 1], bit);
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);
vp9_treewriter.h 32 const vpx_prob *probs, int bits, int len,
36 vpx_write(w, bit, probs[i >> 1]);
42 const vpx_prob *probs,
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
vp9_cost.c 38 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs,
40 const vpx_prob prob = probs[i / 2];
50 cost(costs, tree, probs, ii, cc);
54 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) {
55 cost(costs, tree, probs, 0, 0);
58 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) {
61 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
62 cost(costs, tree, probs, 2, 0);
vp9_segmentation.c 69 static int cost_segmap(int *segcounts, vpx_prob *probs) {
78 int cost = c0123 * vp9_cost_zero(probs[0]) +
79 c4567 * vp9_cost_one(probs[0]);
83 cost += c01 * vp9_cost_zero(probs[1]) +
84 c23 * vp9_cost_one(probs[1]);
87 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
88 segcounts[1] * vp9_cost_one(probs[3]);
90 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
91 segcounts[3] * vp9_cost_one(probs[4]);
95 cost += c45 * vp9_cost_zero(probs[2])
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/
vp9_cost.h 34 static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs,
41 cost += vp9_cost_bit(probs[i >> 1], bit);
48 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree);
49 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree);
vp9_treewriter.h 32 const vp9_prob *probs, int bits, int len,
36 vp9_write(w, bit, probs[i >> 1]);
42 const vp9_prob *probs,
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
vp9_cost.c 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs,
39 const vp9_prob prob = probs[i / 2];
49 cost(costs, tree, probs, ii, cc);
53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) {
54 cost(costs, tree, probs, 0, 0);
57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) {
60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
61 cost(costs, tree, probs, 2, 0);
vp9_segmentation.c 83 static int cost_segmap(int *segcounts, vp9_prob *probs) {
92 int cost = c0123 * vp9_cost_zero(probs[0]) +
93 c4567 * vp9_cost_one(probs[0]);
97 cost += c01 * vp9_cost_zero(probs[1]) +
98 c23 * vp9_cost_one(probs[1]);
101 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
102 segcounts[1] * vp9_cost_one(probs[3]);
104 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
105 segcounts[3] * vp9_cost_one(probs[4]);
109 cost += c45 * vp9_cost_zero(probs[2])
    [all...]
  /external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/rangecoder/
Decoder.java 64 public int DecodeBit (short[] probs, int index) throws IOException {
65 int prob = probs[index];
69 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
78 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
87 public static void InitBitModels (short[] probs) {
88 for (int i = 0; i < probs.length; i++)
89 probs[i] = (kBitModelTotal >>> 1);
Encoder.java 95 public static void InitBitModels (short[] probs) {
96 for (int i = 0; i < probs.length; i++)
97 probs[i] = (kBitModelTotal >>> 1);
100 public void Encode (short[] probs, int index, int symbol) throws IOException {
101 int prob = probs[index];
105 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
109 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
  /external/deqp/modules/gles2/stress/
es2sLongRunningTests.cpp 54 typedef gls::LongStressCase::FeatureProbabilities Probs;
79 const Probs probs; member in struct:deqp::gles2::Stress::Case
80 Case (const char* const name_, const char* const desc_, int bufFact, const Probs& probs_ = Probs()) : name(name_), desc(desc_), redundantBufferFactor(bufFact), probs(probs_) {}
86 Probs().pReuploadBuffer(1.0f)),
91 Probs().pReuploadBuffer(1.0f).pReuploadWithBufferData(1.0f)),
96 Probs().pDeleteBuffer(1.0f)),
101 Probs().pWastefulBufferMemoryUsage(1.0f))
151 const Probs probs; member in struct:deqp::gles2::Stress::Case
208 const Probs probs; member in struct:deqp::gles2::Stress::Case
257 const Probs probs; member in struct:deqp::gles2::Stress::Case
    [all...]
  /external/deqp/modules/gles3/stress/
es3sLongRunningTests.cpp 54 typedef gls::LongStressCase::FeatureProbabilities Probs;
79 const Probs probs; member in struct:deqp::gles3::Stress::Case
80 Case (const char* const name_, const char* const desc_, int bufFact, const Probs& probs_ = Probs()) : name(name_), desc(desc_), redundantBufferFactor(bufFact), probs(probs_) {}
86 Probs().pReuploadBuffer(1.0f)),
91 Probs().pReuploadBuffer(1.0f).pReuploadWithBufferData(1.0f)),
96 Probs().pDeleteBuffer(1.0f)),
101 Probs().pWastefulBufferMemoryUsage(1.0f))
151 const Probs probs; member in struct:deqp::gles3::Stress::Case
208 const Probs probs; member in struct:deqp::gles3::Stress::Case
257 const Probs probs; member in struct:deqp::gles3::Stress::Case
    [all...]
  /external/libvpx/libvpx/vpx_dsp/
prob.c 36 vpx_prob *probs) {
40 : tree_merge_probs_impl(l, tree, pre_probs, counts, probs);
44 : tree_merge_probs_impl(r, tree, pre_probs, counts, probs);
46 probs[i >> 1] = mode_mv_merge_probs(pre_probs[i >> 1], ct);
51 const unsigned int *counts, vpx_prob *probs) {
52 tree_merge_probs_impl(0, tree, pre_probs, counts, probs);
  /external/lzma/C/
LzmaDec.c 29 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
30 #define TREE_DECODE(probs, limit, i) \
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)
38 #define TREE_6_DECODE(probs, i) \
40 TREE_GET_BIT(probs, i); \
41 TREE_GET_BIT(probs, i); \
42 TREE_GET_BIT(probs, i); \
142 CLzmaProb *probs = p->probs; local
525 CLzmaProb *probs = p->probs; local
744 CLzmaProb *probs = p->probs; local
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/
vp9_prob.c 39 vp9_prob *probs) {
44 count_sat, max_update, probs);
49 count_sat, max_update, probs);
51 probs[i >> 1] = merge_probs(pre_probs[i >> 1], ct,
58 unsigned int max_update_factor, vp9_prob *probs) {
60 max_update_factor, probs);
  /external/opencv3/modules/ml/src/
em.cpp 121 OutputArray probs)
125 return doTrain(START_AUTO_STEP, logLikelihoods, labels, probs);
134 OutputArray probs)
144 return doTrain(START_E_STEP, logLikelihoods, labels, probs);
151 OutputArray probs)
157 return doTrain(START_M_STEP, logLikelihoods, labels, probs);
163 Mat samples = _inputs.getMat(), probs, probsrow; local
180 probsrow = probs.row(i);
203 Mat probs; local
209 probs = _probs.getMat()
    [all...]
  /external/libvpx/libvpx/vp8/common/
treecoder.c 113 vp8_prob probs [ /* n-1 */ ],
137 probs[t] = p < 256 ? (p ? p : 1) : 255; /* agree w/old version for now */
140 probs[t] = vp8_prob_half;
treecoder.h 74 vp8_prob probs [ /* n-1 */ ],
81 /* Variant of above using coder spec rather than hardwired 8-bit probs. */
87 vp8_prob probs [ /* n-1 */ ],

Completed in 615 milliseconds

1 2 3 4