text stringlengths 1 93.6k |
|---|
uiqm = p1 * uicm + p2 * uism + p3 * uiconm
|
return uiqm,uciqe
|
def eme(ch,blocksize=8):
|
num_x = math.ceil(ch.shape[0] / blocksize)
|
num_y = math.ceil(ch.shape[1] / blocksize)
|
eme = 0
|
w = 2. / (num_x * num_y)
|
for i in range(num_x):
|
xlb = i * blocksize
|
if i < num_x - 1:
|
xrb = (i+1) * blocksize
|
else:
|
xrb = ch.shape[0]
|
for j in range(num_y):
|
ylb = j * blocksize
|
if j < num_y - 1:
|
yrb = (j+1) * blocksize
|
else:
|
yrb = ch.shape[1]
|
block = ch[xlb:xrb,ylb:yrb]
|
blockmin = np.float(np.min(block))
|
blockmax = np.float(np.max(block))
|
# # old version
|
# if blockmin == 0.0: eme += 0
|
# elif blockmax == 0.0: eme += 0
|
# else: eme += w * math.log(blockmax / blockmin)
|
# new version
|
if blockmin == 0: blockmin+=1
|
if blockmax == 0: blockmax+=1
|
eme += w * math.log(blockmax / blockmin)
|
return eme
|
def plipsum(i,j,gamma=1026):
|
return i + j - i * j / gamma
|
def plipsub(i,j,k=1026):
|
return k * (i - j) / (k - j)
|
def plipmult(c,j,gamma=1026):
|
return gamma - gamma * (1 - j / gamma)**c
|
def logamee(ch,blocksize=8):
|
num_x = math.ceil(ch.shape[0] / blocksize)
|
num_y = math.ceil(ch.shape[1] / blocksize)
|
s = 0
|
w = 1. / (num_x * num_y)
|
for i in range(num_x):
|
xlb = i * blocksize
|
if i < num_x - 1:
|
xrb = (i+1) * blocksize
|
else:
|
xrb = ch.shape[0]
|
for j in range(num_y):
|
ylb = j * blocksize
|
if j < num_y - 1:
|
yrb = (j+1) * blocksize
|
else:
|
yrb = ch.shape[1]
|
block = ch[xlb:xrb,ylb:yrb]
|
blockmin = np.float(np.min(block))
|
blockmax = np.float(np.max(block))
|
top = plipsub(blockmax,blockmin)
|
bottom = plipsum(blockmax,blockmin)
|
m = top/bottom
|
if m ==0.:
|
s+=0
|
else:
|
s += (m) * np.log(m)
|
return plipmult(w,s)
|
def main():
|
result_path = sys.argv[1]
|
reference_path = sys.argv[2]
|
result_dirs = os.listdir(result_path)
|
# reference_dirs = os.listdir(reference_path)
|
sumpsnr, sumssim, sumuiqm, sumuciqe = 0.,0.,0.,0.
|
N=0
|
for imgdir in result_dirs:
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.