public static GlobalFeatureVec GetFeatureWithoutPreprocess(Mat <byte> src,
int orientNum = 8, bool normalize = true, int blockSize = 48)
{
List <Mat <double> > orientChannels = Filter.GetOrientChannels(src, orientNum);
GlobalFeatureVec feature = new GlobalFeatureVec();
for (int i = blockSize / 2 - 1; i < src.Rows; i += blockSize / 2)
{
for (int j = blockSize / 2 - 1; j < src.Cols; j += blockSize / 2)
{
for (int k = 0; k < orientNum; k++)
{
double value = 0;
for (int m = i - blockSize; m <= i + blockSize; m++)
{
for (int n = j - blockSize; n <= j + blockSize; n++)
{
if (m < 0 || m >= src.Rows || n < 0 || n >= src.Cols)
{
continue;
}
double weight = 1 - Math.Sqrt((m - i) * (m - i) + (n - j) * (n - j)) / blockSize;
if (weight < 0)
{
weight = 0;
}
value += orientChannels[k][m, n] * weight;
}
}
feature.Append(value);
}
}
}
if (normalize)
{
double sum = 0;
for (int i = 0; i < feature.Count; i++)
{
sum += feature[i] * feature[i];
}
double root = Math.Sqrt(sum);
if (root > 0)
{
for (int i = 0; i < feature.Count; i++)
{
feature[i] /= root;
}
}
}
return(feature);
}
public double GetDistance(GlobalFeatureVec other)
{
if (_vec.Count != other._vec.Count)
{
return(double.NaN);
}
double sum = 0;
for (int i = 0; i < _vec.Count; i++)
{
sum += Math.Abs(_vec[i] - other._vec[i]);
}
return(sum);
}
public double GetDistance(GlobalFeatureVec other)
{
if (_vec.Count != other._vec.Count)
return double.NaN;
double sum = 0;
for (int i = 0; i < _vec.Count; i++)
sum += Math.Abs(_vec[i] - other._vec[i]);
return sum;
}
public static GlobalFeatureVec GetFeatureWithoutPreprocess(Mat<byte> src,
int orientNum = 8, bool normalize = true, int blockSize = 48)
{
List<Mat<double>> orientChannels = Filter.GetOrientChannels(src, orientNum);
GlobalFeatureVec feature = new GlobalFeatureVec();
for (int i = blockSize / 2 - 1; i < src.Rows; i += blockSize / 2)
{
for (int j = blockSize / 2 - 1; j < src.Cols; j += blockSize / 2)
{
for (int k = 0; k < orientNum; k++)
{
double value = 0;
for (int m = i - blockSize; m <= i + blockSize; m++)
{
for (int n = j - blockSize; n <= j + blockSize; n++)
{
if (m < 0 || m >= src.Rows || n < 0 || n >= src.Cols)
continue;
double weight = 1 - Math.Sqrt((m - i) * (m - i) + (n - j) * (n - j)) / blockSize;
if (weight < 0)
weight = 0;
value += orientChannels[k][m, n] * weight;
}
}
feature.Append(value);
}
}
}
if (normalize)
{
double sum = 0;
for (int i = 0; i < feature.Count; i++)
{
sum += feature[i] * feature[i];
}
double root = Math.Sqrt(sum);
if (root > 0)
{
for (int i = 0; i < feature.Count; i++)
{
feature[i] /= root;
}
}
}
return feature;
}
public static GlobalFeatureVec GetFeatureWithoutPreprocess(Mat<byte> src,
int minComponent = 10, int radius = 7, int blockSize = 128)
{
GlobalFeatureVec feature = new GlobalFeatureVec();
List<Mat<byte>> channels = BinaryImgProc.SplitViaOrientation(src, 8);
for (int i = 0; i < channels.Count; i++)
{
int curBlockSize = blockSize;
// Use '||' instead of '&&' is on purpose
while (curBlockSize <= src.Rows || curBlockSize <= src.Cols)
{
int curBlockHalfSize = curBlockSize / 2;
Mat<bool> hasVisited = new Mat<bool>(channels[i].Size);
for (int j = curBlockHalfSize - 1; j < src.Rows - 1; j += curBlockSize)
{
for (int k = curBlockHalfSize - 1; k < src.Cols - 1; k += curBlockSize)
{
int top = j - (curBlockHalfSize - 1),
bottom = j + curBlockHalfSize,
left = k - (curBlockHalfSize - 1),
right = k + curBlockHalfSize;
top = top < 0 ? 0 : top;
bottom = bottom >= src.Rows ? src.Rows - 1 : bottom;
left = left < 0 ? 0 : left;
right = right >= src.Cols ? src.Cols - 1 : right;
int nComponent = 0;
for (int m = top; m <= bottom; m++)
{
for (int n = left; n <= right; n++)
{
if (!hasVisited[m, n] && channels[i][m, n] != byte.MinValue)
{
Queue<Point> queue = new Queue<Point>();
int nPoint = 0;
hasVisited[m, n] = true;
queue.Enqueue(new Point(n, m));
nPoint++;
while (queue.Count != 0)
{
Point cur = queue.Dequeue();
for (int p = -radius; p <= radius; p++)
{
for (int q = -radius; q <= radius; q++)
{
int newR = cur.Y + p, newC = cur.X + q;
if (newR >= top && newR <= bottom &&
newC >= left && newC <= right &&
!hasVisited[newR, newC] &&
channels[i][newR, newC] != byte.MinValue)
{
hasVisited[newR, newC] = true;
queue.Enqueue(new Point(newC, newR));
nPoint++;
}
}
}
}
if (nPoint > minComponent)
nComponent++;
}
}
}
feature.Append(nComponent);
}
}
curBlockSize *= 2;
}
}
return feature;
}
public static GlobalFeatureVec GetFeatureWithoutPreprocess(Mat <byte> src,
int minComponent = 10, int radius = 7, int blockSize = 128)
{
GlobalFeatureVec feature = new GlobalFeatureVec();
List <Mat <byte> > channels = BinaryImgProc.SplitViaOrientation(src, 8);
for (int i = 0; i < channels.Count; i++)
{
int curBlockSize = blockSize;
// Use '||' instead of '&&' is on purpose
while (curBlockSize <= src.Rows || curBlockSize <= src.Cols)
{
int curBlockHalfSize = curBlockSize / 2;
Mat <bool> hasVisited = new Mat <bool>(channels[i].Size);
for (int j = curBlockHalfSize - 1; j < src.Rows - 1; j += curBlockSize)
{
for (int k = curBlockHalfSize - 1; k < src.Cols - 1; k += curBlockSize)
{
int top = j - (curBlockHalfSize - 1),
bottom = j + curBlockHalfSize,
left = k - (curBlockHalfSize - 1),
right = k + curBlockHalfSize;
top = top < 0 ? 0 : top;
bottom = bottom >= src.Rows ? src.Rows - 1 : bottom;
left = left < 0 ? 0 : left;
right = right >= src.Cols ? src.Cols - 1 : right;
int nComponent = 0;
for (int m = top; m <= bottom; m++)
{
for (int n = left; n <= right; n++)
{
if (!hasVisited[m, n] && channels[i][m, n] != byte.MinValue)
{
Queue <Point> queue = new Queue <Point>();
int nPoint = 0;
hasVisited[m, n] = true;
queue.Enqueue(new Point(n, m));
nPoint++;
while (queue.Count != 0)
{
Point cur = queue.Dequeue();
for (int p = -radius; p <= radius; p++)
{
for (int q = -radius; q <= radius; q++)
{
int newR = cur.Y + p, newC = cur.X + q;
if (newR >= top && newR <= bottom &&
newC >= left && newC <= right &&
!hasVisited[newR, newC] &&
channels[i][newR, newC] != byte.MinValue)
{
hasVisited[newR, newC] = true;
queue.Enqueue(new Point(newC, newR));
nPoint++;
}
}
}
}
if (nPoint > minComponent)
{
nComponent++;
}
}
}
}
feature.Append(nComponent);
}
}
curBlockSize *= 2;
}
}
return(feature);
}