北邮 信通院 数据结构 实验二-7 二值图像连通域标记算法
在仅有黑色像素和白色像素的图像中,将相邻的黑色像素构成的点集称为一个连通域。连通域标记算法把连通区域所有像素设定同一个标记,常见的标记算法有四邻域标记算法和八邻域标记算法。
仅供学习交流使用
#include "iostream"
using namespace std;
void island(int * a, int ** b, int * p, int r, int c)
{
int k = 1;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
if (!a[i*c + j])continue;
if ((i == 0 || i > 0 && !b[(i - 1)*c + j]) && j > 0 && b[i*c + j - 1])
b[i*c + j] = b[i*c + j - 1];
else if ((j == 0 || j > 0 && !b[(i)*c + j - 1]) && b[(i - 1)*c + j])
b[i*c + j] = b[(i - 1)*c + j];
else if (i == 0 || k == 1 || j == 0 && !b[(i - 1)*c + j] || !b[(i)*c + j - 1] && !b[(i - 1)*c + j])
{
b[i*c + j] = p;
*p++ = k++;
}
else if (b[(i - 1)*c + j] && b[(i - 1)*c + j] == b[i*c + j - 1])
b[i*c + j] = b[(i - 1)*c + j];
else if (b[(i - 1)*c + j] && b[i*c + j - 1]) //加入映射表
{
int * p1 = p;
int x = *b[(i - 1)*c + j];
while (p1 + k - 1 >= p)
{
if (*p1 == x)
*p1 = *b[i*c + j - 1];
p1--;
}
b[i*c + j] = b[i*c + j - 1];
}
}
}
}
#define M 7
#define N 7
int main(int arge, char* argv[])
{
int a[M][N] = {
1,0,1,0,1,1,1,
1,0,1,0,1,1,1,
1,0,1,1,0,0,1,
1,0,0,1,1,1,1,
1,1,1,0,0,0,1,
0,0,1,0,0,0,1,
1,1,1,1,1,1,1,
};
int*b[M][N] = { 0 };
int p[M*N] = { 0 };
island(a[0], b[0], p, M, N);
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++)
{
cout << a[i][j] << "(" << (b[i][i] ? (*b[i][j]) : 0) << " - " << b[i][j] << ")";
}
cout << endl;
}
return 0;
}