| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i,
41 const vpx_prob prob = probs[i / 2];
52 cost(costs, tree, probs, ii, cc);
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) {
57 cost(costs, tree, probs, 0, 0);
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) {
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0);
64 cost(costs, tree, probs, 2, 0);
|
| vp9_cost.h | 37 static INLINE int treed_cost(vpx_tree tree, const vpx_prob *probs, int bits,
44 cost += vp9_cost_bit(probs[i >> 1], bit);
51 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree);
52 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_segmentation.c | 67 static int cost_segmap(int *segcounts, vpx_prob *probs) {
76 int cost = c0123 * vp9_cost_zero(probs[0]) + c4567 * vp9_cost_one(probs[0]);
80 cost += c01 * vp9_cost_zero(probs[1]) + c23 * vp9_cost_one(probs[1]);
83 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
84 segcounts[1] * vp9_cost_one(probs[3]);
86 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
87 segcounts[3] * vp9_cost_one(probs[4]);
91 cost += c45 * vp9_cost_zero(probs[2]) + c67 * vp9_cost_one(probs[2])
[all...] |
| /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/libvpx/libvpx/vpx_dsp/ |
| prob.c | 30 vpx_prob *probs) {
34 : tree_merge_probs_impl(l, tree, pre_probs, counts, probs);
38 : tree_merge_probs_impl(r, tree, pre_probs, counts, probs);
40 probs[i >> 1] = mode_mv_merge_probs(pre_probs[i >> 1], ct);
45 const unsigned int *counts, vpx_prob *probs) {
46 tree_merge_probs_impl(0, tree, pre_probs, counts, probs);
|
| /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/tensorflow/tensorflow/contrib/distributions/python/kernel_tests/ |
| negative_binomial_test.py | 38 probs = [.1] * 5
41 total_count=total_count, probs=probs)
50 probs = [[.1, .2, .3]] * 5
53 total_count=total_count, probs=probs)
66 self.assertEqual([1, 3], negbinom.probs.get_shape())
75 5., probs=invalid_ps, validate_args=True)
76 negbinom.probs.eval()
80 with self.assertRaisesOpError("probs has components greater than 1.")
[all...] |
| relaxed_bernoulli_test.py | 36 dist = relaxed_bernoulli.RelaxedBernoulli(temperature, probs=p)
38 self.assertAllClose(p, dist.probs.eval())
48 self.assertAllClose(scipy.special.expit(logits), dist.probs.eval())
51 dist = relaxed_bernoulli.RelaxedBernoulli(temperature, probs=p)
60 with self.assertRaisesOpError("probs has components greater than 1"):
62 probs=p,
64 dist.probs.eval()
71 probs=p,
73 dist.probs.eval()
79 probs=p
[all...] |
| geometric_test.py | 38 probs = constant_op.constant([.1] * 5)
39 geom = geometric.Geometric(probs=probs)
50 geom = geometric.Geometric(probs=invalid_ps, validate_args=True)
51 geom.probs.eval()
56 geom = geometric.Geometric(probs=invalid_ps, validate_args=True)
57 geom.probs.eval()
62 probs = constant_op.constant([.2] * batch_size)
65 geom = geometric.Geometric(probs=probs)
[all...] |
| binomial_test.py | 33 binom = binomial.Binomial(total_count=1., probs=p)
43 binom = binomial.Binomial(total_count=n, probs=p)
54 binom = binomial.Binomial(total_count=n, probs=p)
61 binom = binomial.Binomial(total_count=3., probs=p)
62 self.assertEqual((1, 3), binom.probs.get_shape())
64 self.assertAllClose(p, binom.probs.eval())
70 self.assertEqual((1, 3), binom.probs.get_shape())
78 binom = binomial.Binomial(total_count=n, probs=p, validate_args=True)
97 binom = binomial.Binomial(total_count=n, probs=p, validate_args=True)
111 binom = binomial.Binomial(total_count=n, probs=p, validate_args=False
[all...] |
| /external/tensorflow/tensorflow/contrib/distributions/python/ops/ |
| geometric.py | 60 probs=None,
70 and must be in the range `(-inf, inf]`. Only one of `logits` or `probs`
72 probs: Positive floating-point `Tensor` with shape `[B1, ..., Bb]`
76 or `probs` should be specified.
89 with ops.name_scope(name, values=[logits, probs]):
91 logits, probs, validate_args=validate_args, name=name)
95 self._probs = array_ops.identity(self._probs, name="probs")
112 def probs(self): member in class:Geometric
120 return self.probs.get_shape()
144 math_ops.log(sampled) / math_ops.log1p(-self.probs))
[all...] |
| binomial.py | 39 can be broadcast with `self.probs` and `self.total_count`. `value` is only legal
70 This distribution is parameterized by `probs`, a (batch of) probabilities for
78 `probs`.
89 * `probs = p`,
98 dist = Binomial(total_count=5., probs=.5)
113 dist = Binomial(total_count=4., probs=p)
136 probs=None,
144 to `[N1,..., Nm]` with `m >= 0` and the same dtype as `probs` or
151 of `logits` or `probs` should be passed in.
152 probs: Positive floating point tensor with shape broadcastable t
198 def probs(self): member in class:Binomial
[all...] |
| relaxed_bernoulli.py | 39 becomes discrete with a distribution described by the `logits` or `probs`
78 dist = RelaxedBernoulli(temperature, probs=p)
137 probs=None,
150 event is sigmoid(logits). Only one of `logits` or `probs` should be
152 probs: An N-D `Tensor` representing the probability of a positive event.
154 distribution. Only one of `logits` or `probs` should be passed in.
166 ValueError: If both `probs` and `logits` are passed, or if neither.
169 with ops.name_scope(name, values=[logits, probs, temperature]):
174 logits=logits, probs=probs, validate_args=validate_args
202 def probs(self): member in class:RelaxedBernoulli
[all...] |
| /external/tensorflow/tensorflow/python/kernel_tests/distributions/ |
| bernoulli_test.py | 49 return bernoulli.Bernoulli(probs=p, dtype=dtype)
61 dist = bernoulli.Bernoulli(probs=p)
63 self.assertAllClose(p, dist.probs.eval())
75 self.assertAllClose(special.expit(logits), dist.probs.eval())
78 dist = bernoulli.Bernoulli(probs=p)
86 with self.assertRaisesOpError("probs has components greater than 1"):
87 dist = bernoulli.Bernoulli(probs=p, validate_args=True)
88 dist.probs.eval()
94 dist = bernoulli.Bernoulli(probs=p, validate_args=True)
95 dist.probs.eval(
[all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/C/LzmaCompress/Sdk/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
583 const CLzmaProb *probs = p->probs; local
795 CLzmaProb *probs = p->probs; local
[all...] |
| /device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Library/LzmaCustomDecompressLib/Sdk/C/ |
| LzmaDec.c | 31 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
32 #define TREE_DECODE(probs, limit, i) \
33 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
38 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
40 #define TREE_6_DECODE(probs, i) \
42 TREE_GET_BIT(probs, i); \
43 TREE_GET_BIT(probs, i); \
44 TREE_GET_BIT(probs, i); \
144 CLzmaProb *probs = p->probs; local
585 const CLzmaProb *probs = p->probs; local
797 CLzmaProb *probs = p->probs; local
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Library/LzmaCustomDecompressLib/Sdk/C/ |
| LzmaDec.c | 31 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }
32 #define TREE_DECODE(probs, limit, i) \
33 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
38 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)
40 #define TREE_6_DECODE(probs, i) \
42 TREE_GET_BIT(probs, i); \
43 TREE_GET_BIT(probs, i); \
44 TREE_GET_BIT(probs, i); \
144 CLzmaProb *probs = p->probs; local
585 const CLzmaProb *probs = p->probs; local
797 CLzmaProb *probs = p->probs; local
[all...] |
| /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
583 const CLzmaProb *probs = p->probs; local
795 CLzmaProb *probs = p->probs; local
[all...] |
| /external/libvpx/libvpx/vp8/common/ |
| treecoder.h | 64 vp8_prob probs[/* n-1 */],
69 /* Variant of above using coder spec rather than hardwired 8-bit probs. */
73 vp8_prob probs[/* n-1 */],
|
| /external/tensorflow/tensorflow/contrib/kfac/python/kernel_tests/ |
| loss_functions_test.py | 76 probs = np.exp(logits) / np.sum(np.exp(logits), axis=1, keepdims=True)
78 probs[0, targets[0]], #
79 probs[1, targets[1]]
127 probs = np.exp(logits - np.logaddexp.reduce(logits))
128 fisher = np.diag(probs) - np.outer(probs, probs)
143 probs = np.exp(logits - np.logaddexp.reduce(logits, axis=-1,
145 fishers = probs[..., na] * np.eye(3) - probs[..., na] * probs[..., na, :
[all...] |
| /external/tensorflow/tensorflow/contrib/training/python/training/ |
| sampling_ops_test.py | 45 probs = [.2] * 5
54 probs,
62 probs,
71 probs, batch_size, init_probs)
76 array_ops.zeros([1, 3]), label, probs, batch_size, init_probs)
83 probs,
93 probs,
167 probs = np.array([0, 1, 0, 0, 0])
169 val_input_batch, lbl_input_batch, probs, batch_size, init_probs=probs)
[all...] |
