public void createMatrix() { int N = 159; similarityMatrix = new double[N, N]; Quantize q = new Quantize(); for (int index1 = 0; index1 < N; index1++) { for (int index2 = 0; index2 < N; index2++) { LUVClass luv1 = q.getLUVfromIndex(index1); LUVClass luv2 = q.getLUVfromIndex(index2); double distance = getEuclideanDistance(luv1, luv2); if (distance > tColor) { similarityMatrix[index1, index2] = 0; } else { similarityMatrix[index1, index2] = 1 - distance / tColor; } } } //return similarityMatrix; }
private void initializeMaxDistance() { int N = 159; Quantize q = new Quantize(); double max = 0; for (int index1 = 0; index1 < N; index1++) { for (int index2 = 0; index2 < N; index2++) { LUVClass luv1 = q.getLUVfromIndex(index1); LUVClass luv2 = q.getLUVfromIndex(index2); double distance = getEuclideanDistance(luv1, luv2); if (distance > max) { max = distance; } } } dMax = max; tColor = p * dMax; }