From 0dab894a5be9f7d10d85e89dea91d02c71bae84d Mon Sep 17 00:00:00 2001
From: Edmond Yoo <hj3yoo@uwaterloo.ca>
Date: Sun, 16 Sep 2018 03:24:45 +0000
Subject: [PATCH] Moving files from MTGCardDetector repo
---
src/tree.c | 54 +++++++++++++++++++++++++++---------------------------
1 files changed, 27 insertions(+), 27 deletions(-)
diff --git a/src/tree.c b/src/tree.c
index 35ac3de..d66da9f 100644
--- a/src/tree.c
+++ b/src/tree.c
@@ -52,34 +52,34 @@
int hierarchy_top_prediction(float *predictions, tree *hier, float thresh, int stride)
{
- float p = 1;
- int group = 0;
- int i;
- while (1) {
- float max = 0;
- int max_i = 0;
+ float p = 1;
+ int group = 0;
+ int i;
+ while (1) {
+ float max = 0;
+ int max_i = 0;
- for (i = 0; i < hier->group_size[group]; ++i) {
- int index = i + hier->group_offset[group];
- float val = predictions[(i + hier->group_offset[group])*stride];
- if (val > max) {
- max_i = index;
- max = val;
- }
- }
- if (p*max > thresh) {
- p = p*max;
- group = hier->child[max_i];
- if (hier->child[max_i] < 0) return max_i;
- }
- else if (group == 0) {
- return max_i;
- }
- else {
- return hier->parent[hier->group_offset[group]];
- }
- }
- return 0;
+ for (i = 0; i < hier->group_size[group]; ++i) {
+ int index = i + hier->group_offset[group];
+ float val = predictions[(i + hier->group_offset[group])*stride];
+ if (val > max) {
+ max_i = index;
+ max = val;
+ }
+ }
+ if (p*max > thresh) {
+ p = p*max;
+ group = hier->child[max_i];
+ if (hier->child[max_i] < 0) return max_i;
+ }
+ else if (group == 0) {
+ return max_i;
+ }
+ else {
+ return hier->parent[hier->group_offset[group]];
+ }
+ }
+ return 0;
}
tree *read_tree(char *filename)
--
Gitblit v1.10.0