/usr/share/pyshared/gamera/confidence.py is in python-gamera 3.3.2-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 | # -*- mode: python; indent-tabs-mode: nil; tab-width: 3 -*-
# vim: set tabstop=3 shiftwidth=3 expandtab:
#
# Copyright (C) 2003 Karl MacMillan
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License
# as published by the Free Software Foundation; either version 2
# of the License, or (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
#
from gamera.core import *
from gamera import knn, gamera_xml, cluster, stats
import math
init_gamera()
def max_distance(glyphs, k):
ud = k.unique_distances(glyphs, 0)
ud.sort()
return ud[-1]
def local_max_distance(glyphs, x, k):
d = k.distance_from_images(glyphs, x)
d.sort()
return d[-1][0]
def get_graph_stats(glyphs, k):
s = { }
gc = knn.glyphs_by_category(glyphs)
for x in gc.itervalues():
if len(x) == 1:
s[x[0].get_main_id()] = 1.0
continue
graph = cluster.make_spanning_tree(x, k)
edges = []
for edge in graph.get_edges():
edges.append(edge.cost)
id = x[0].get_main_id()
s[id] = stats.mean(edges)
#cluster.make_subtrees_stddev(graph, 1, 2, 0)
#print graph.nedges, len(x)
return s
def strip_small_categories(glyphs):
gc = knn.glyphs_by_category(glyphs)
new_glyphs = []
for v in gc.itervalues():
if len(v) > 3:
new_glyphs.extend(v)
return new_glyphs
def test():
glyphs = gamera_xml.glyphs_from_xml(r"C:\Documents and Settings\Karl MacMillan\Desktop\test\prod.xml")
glyphs = strip_small_categories(glyphs)
from gamera.plugins import features
k = knn.kNN()
print k.features
features.generate_features_list(glyphs, k.feature_functions)
print "Getting gstats"
graph_stats = get_graph_stats(glyphs, k)
gstats = knn.get_glyphs_stats(glyphs)
max_dist = max_distance(glyphs, k)
print max_dist
file = open("results.txt", "w")
global_max = [[],[]]
local_max = [[],[]]
all = [[],[]]
graph = [[],[]]
gr_ccorrect = 0
gr_icorrect = 0
for x in glyphs:
local_max_dist = local_max_distance(glyphs, x, k)
ans = k.classify_with_images(glyphs, x, 1)
file.write(ans[0][1] + ",")# + str(ans[0][0]) + ",")
correct = 0
if x.get_main_id() == ans[0][1]:
file.write("1,")
correct = 1
else:
file.write("0,")
g = 1.0 - (ans[0][0] / max_dist)
global_max[correct].append(g)
file.write(str(g) + ",")
l = 1.0 - (ans[0][0] / local_max_dist)
local_max[correct].append(l)
file.write(str(l) + ",")
a = stats.samplestdev([ans[0][0],gstats[ans[0][1]][1]])
all[correct].append(a)
file.write(str(a) + ",")
gr = stats.samplestdev([ans[0][0],graph_stats[ans[0][1]]])
if (gr <= 1 and correct):
gr_ccorrect += 1
if (gr > 1 and not correct):
gr_icorrect += 1
graph[correct].append(gr)
file.write(str(gr))
file.write("\n")
print "num correct: %d num incorrect: %d" % (len(global_max[1]), len(global_max[0]))
print "confidence %f %f %f" % (((gr_ccorrect + gr_icorrect) / float(len(glyphs))),
gr_ccorrect / float(len(glyphs) - len(global_max[0])),
gr_icorrect / float(len(glyphs) - len(global_max[1])))
cgm = -1
igm = -1
cgs = -1
igs = -1
if (len(global_max[0])):
igm = stats.mean(global_max[0])
igs = stats.samplestdev(global_max[0])
if (len(global_max[1])):
cgm = stats.mean(global_max[1])
cgs = stats.samplestdev(global_max[1])
clm = -1
ilm = -1
cls = -1
ils = -1
if (len(local_max[0])):
ilm = stats.mean(local_max[0])
ils = stats.samplestdev(local_max[0])
if (len(local_max[1])):
clm = stats.mean(local_max[1])
cls = stats.samplestdev(local_max[1])
cam = -1
iam = -1
cas = -1
ias = -1
if (len(all[0])):
iam = stats.mean(all[0])
ias = stats.samplestdev(all[0])
if (len(all[1])):
cam = stats.mean(all[1])
cas = stats.samplestdev(all[1])
cgraphm = -1
igraphm = -1
cgraphs = -1
igraphs = -1
if (len(graph[0])):
igraphm = stats.mean(graph[0])
igraphs = stats.samplestdev(graph[0])
if (len(graph[1])):
cgraphm = stats.mean(graph[1])
cgraphs = stats.samplestdev(graph[1])
print "global correct avg: %f stdev: %f incorrect avg: %f stddev: %f" % (cgm, cgs, igm, igs)
print "local correct avg: %f stdev: %f incorrect avg: %f stddev: %f" % (clm, cls, ilm, ils)
print "all correct avg: %f stdev: %f incorrect avg: %f stddev: %f" % (cam, cas, iam, ias)
print "graph correct avg: %f stdev: %f incorrect avg: %f stddev: %f" % (cgraphm, cgraphs, igraphm, igraphs)
def otsu_threshold(p):
l = len(p)
mu_T = 0.0
for i in range(l):
mu_T += i * p[i]
sigma_T = 0.0
for i in range(l):
sigma_T += (i-mu_T)*(i-mu_T)*p[i]
k_low = 0
while (p[k_low] == 0) and (k_low < (l - 1)):
k_low += 1
k_high = l - 1
while (p[k_high] == 0) and (k_high > 0):
k_low += 1
k_high -= 1
criterion = 0.0
thresh = 127
omega_k = 0.0
mu_k = 0.0
k = k_low
while k <= k_high:
omega_k += p[k]
mu_k += k*p[k]
expr_1 = (mu_T*omega_k - mu_k)
sigma_b_k = expr_1 * expr_1 / (omega_k*(1-omega_k))
if (criterion < sigma_b_k/sigma_T):
criterion = sigma_b_k/sigma_T
thresh = k;
k += 1
return thresh
graph_l = graph[0][:]
graph_l.extend(graph[1])
graph_l.sort()
threshold = stats.mean(graph_l)
print "threshold: " + str(threshold)
num_wrong = 0
for x in graph[0]:
if x < threshold:
num_wrong += 1
print num_wrong, num_wrong / float(len(graph[0])) * 100
num_wrong = 0
for x in graph[1]:
if x >= threshold:
num_wrong += 1
print num_wrong, num_wrong / float(len(graph[1])) * 100
graph_l = all[0][:]
graph_l.extend(all[1])
graph_l.sort()
threshold = stats.mean(graph_l)
print "threshold: " + str(threshold)
num_wrong = 0
for x in graph[0]:
if x < threshold:
num_wrong += 1
print num_wrong, num_wrong / float(len(graph[0])) * 100
num_wrong = 0
for x in graph[1]:
if x >= threshold:
num_wrong += 1
print num_wrong, num_wrong / float(len(graph[1])) * 100
graph_l = local_max[0][:]
graph_l.extend(local_max[1])
graph_l.sort()
threshold = stats.mean(graph_l)
print "threshold: " + str(threshold)
num_wrong = 0
for x in graph[0]:
if x < threshold:
num_wrong += 1
print num_wrong, num_wrong / float(len(graph[0])) * 100
num_wrong = 0
for x in graph[1]:
if x >= threshold:
num_wrong += 1
print num_wrong, num_wrong / float(len(graph[1])) * 100
test()
|