Java 如何实现bwlabel
2016-02-29 12:26
495 查看
public static Map<String,Object> bwlabel(Mat mat,int n)
{
Map<String,Object> hash = new HashMap<String,Object>();
int rows = (int) mat.size().height;
int cols = (int) mat.size().width;
Mat labelMap = Mat.zeros(mat.size(),CvType.CV_32SC1);
int labelIndex = 0;
Mat queue = Mat.zeros(rows*cols,2, CvType.CV_32SC1);
int be = 0;
int en = 0;
for(int i = 0; i < rows; i++)
{
for(int j = 0; j < cols; j++)
{
if(MatUtils.getIntData(labelMap,i,j) != 0 || MatUtils.getIntData(mat,i,j) == 0)
{
continue;
}
labelIndex =labelIndex + 1;
labelMap.put(i,j,labelIndex);
//上
if( i > 1 && MatUtils.getIntData(labelMap,i-1,j)== 0 && MatUtils.getIntData(mat,i-1,j) == 1)
{
labelMap.put(i-1,j,labelIndex);
queue.put(en, 0, i-1);
queue.put(en, 1, j);
en = en + 1;
}
//下
if(i < rows && MatUtils.getIntData(labelMap, i+1, j) == 0 && MatUtils.getIntData(mat, i+1, j) == 1)
{
labelMap.put(i+1,j,labelIndex);
queue.put(en, 0, i+1);
queue.put(en, 1, j);
en = en + 1;
}
//左
if(j > 1&& MatUtils.getIntData(labelMap,i,j-1)== 0 && MatUtils.getIntData(mat,i,j-1) == 1)
{
labelMap.put(i,j-1,labelIndex);
queue.put(en,0,i);
queue.put(en,1,j-1);
en = en + 1;
}
//右
if(j < cols && MatUtils.getIntData(labelMap,i,j+1)== 0 && MatUtils.getIntData(mat,i,j+1) == 1)
{
labelMap.put(i,j+1, labelIndex);
queue.put(en,0,i);
queue.put(en,1,j+1);
en = en + 1;
}
if(n == 8)
{
//左上
if(i > 1 && j > 1 && MatUtils.getIntData(labelMap, i-1,j-1) == 0 && MatUtils.getIntData(mat,i-1,j-1) == 1)
{
labelMap.put(i-1,j-1, labelIndex);
queue.put(en,0,i-1);
queue.put(en,1,j-1);
en = en + 1;
}
//右上
if(i > 1 && j < cols && MatUtils.getIntData(labelMap,i-1,j+1) == 0 && MatUtils.getIntData(mat,i-1,j+1) == 1)
{
labelMap.put(i-1,j+1,labelIndex);
queue.put(en,0,i-1);
queue.put(en,1,j+1);
en = en + 1;
}
//左下
if(i < rows && j > 1 && MatUtils.getIntData(labelMap,i+1,j-1) == 0 && MatUtils.getIntData(mat,i+1,j-1) == 1)
{
labelMap.put(i+1,j-1,labelIndex);
queue.put(en,0,i+1);
queue.put(en,1,j-1);
en = en + 1;
}
//右下
if(i < rows && j < cols && MatUtils.getIntData(labelMap,i+1,j+1) == 0 && MatUtils.getIntData(mat,i+1,j+1) == 1)
{
labelMap.put(i+1,j+1,labelIndex);
queue.put(en,0,i+1);
queue.put(en,1,j+1);
en = en + 1;
}
}
int qi = 0;
int qj = 0;
while(be < en)
{
qi = MatUtils.getIntData(queue, be, 0);
qj = MatUtils.getIntData(queue, be, 1);
be = be + 1;
//上
if(qi > 1 && MatUtils.getIntData(labelMap,qi-1,qj)== 0 && MatUtils.getIntData(mat,qi-1,qj) == 1)
{
labelMap.put(qi-1,qj,labelIndex);
queue.put(en,0, qi-1);
queue.put(en,1, qj);
en = en + 1;
}
//下
if(qi < rows && MatUtils.getIntData(labelMap,qi+1,qj)== 0 && MatUtils.getIntData(mat,qi+1,qj) == 1)
{
labelMap.put(qi+1,qj,labelIndex);
queue.put(en,0,qi+1);
queue.put(en,1,qj);
en = en + 1;
}
//左
if(qj >1 &&MatUtils.getIntData(labelMap,qi,qj-1)== 0 && MatUtils.getIntData(mat,qi,qj-1) == 1)
{
labelMap.put(qi,qj-1,labelIndex);
queue.put(en,0,qi);
queue.put(en,1,qj-1);
en = en + 1;
}
//右
if(qj < cols && MatUtils.getIntData(labelMap,qi,qj+1)== 0 && MatUtils.getIntData(mat,qi,qj+1) == 1)
{
labelMap.put(qi,qj+1,labelIndex);
queue.put(en,0,qi);
queue.put(en,1,qj+1);
en = en + 1;
}
if(n == 8)
{
//左上
if(qi >1 && qj > 1 && MatUtils.getIntData(labelMap,qi-1,qj-1) == 0 && MatUtils.getIntData(mat,qi-1,qj-1) == 1)
{
labelMap.put(qi-1,qj-1,labelIndex);
queue.put(en,0,qi-1);
queue.put(en,1,qj-1);
en = en + 1;
}
//右上
if(qi > 1 && qj < cols && MatUtils.getIntData(labelMap,qi-1,qj+1) == 0 && MatUtils.getIntData(mat,qi-1,qj+1) == 1)
{
labelMap.put(qi-1,qj+1,labelIndex);
queue.put(en,0,qi-1);
queue.put(en,1,qj+1);
en = en + 1;
}
//左下
if(qi < rows && qj > 1 && MatUtils.getIntData(labelMap,qi+1,qj-1) == 0 && MatUtils.getIntData(mat,qi+1,qj-1) == 1)
{
labelMap.put(qi+1,qj-1,labelIndex);
queue.put(en,0,qi+1);
queue.put(en,1,qj-1);
en = en + 1;
}
//右下
if(qi < rows && qj < cols && MatUtils.getIntData(labelMap,qi+1,qj+1) == 0 && MatUtils.getIntData(mat,qi+1,qj+1) == 1)
{
labelMap.put(qi+1,qj+1,labelIndex);
queue.put(en,0,qi+1);
queue.put(en,1,qj+1);
en = en + 1;
}
}
}
}
}
hash.put("Mat",labelMap);
hash.put("Num", labelIndex);
return hash;
}
{
Map<String,Object> hash = new HashMap<String,Object>();
int rows = (int) mat.size().height;
int cols = (int) mat.size().width;
Mat labelMap = Mat.zeros(mat.size(),CvType.CV_32SC1);
int labelIndex = 0;
Mat queue = Mat.zeros(rows*cols,2, CvType.CV_32SC1);
int be = 0;
int en = 0;
for(int i = 0; i < rows; i++)
{
for(int j = 0; j < cols; j++)
{
if(MatUtils.getIntData(labelMap,i,j) != 0 || MatUtils.getIntData(mat,i,j) == 0)
{
continue;
}
labelIndex =labelIndex + 1;
labelMap.put(i,j,labelIndex);
//上
if( i > 1 && MatUtils.getIntData(labelMap,i-1,j)== 0 && MatUtils.getIntData(mat,i-1,j) == 1)
{
labelMap.put(i-1,j,labelIndex);
queue.put(en, 0, i-1);
queue.put(en, 1, j);
en = en + 1;
}
//下
if(i < rows && MatUtils.getIntData(labelMap, i+1, j) == 0 && MatUtils.getIntData(mat, i+1, j) == 1)
{
labelMap.put(i+1,j,labelIndex);
queue.put(en, 0, i+1);
queue.put(en, 1, j);
en = en + 1;
}
//左
if(j > 1&& MatUtils.getIntData(labelMap,i,j-1)== 0 && MatUtils.getIntData(mat,i,j-1) == 1)
{
labelMap.put(i,j-1,labelIndex);
queue.put(en,0,i);
queue.put(en,1,j-1);
en = en + 1;
}
//右
if(j < cols && MatUtils.getIntData(labelMap,i,j+1)== 0 && MatUtils.getIntData(mat,i,j+1) == 1)
{
labelMap.put(i,j+1, labelIndex);
queue.put(en,0,i);
queue.put(en,1,j+1);
en = en + 1;
}
if(n == 8)
{
//左上
if(i > 1 && j > 1 && MatUtils.getIntData(labelMap, i-1,j-1) == 0 && MatUtils.getIntData(mat,i-1,j-1) == 1)
{
labelMap.put(i-1,j-1, labelIndex);
queue.put(en,0,i-1);
queue.put(en,1,j-1);
en = en + 1;
}
//右上
if(i > 1 && j < cols && MatUtils.getIntData(labelMap,i-1,j+1) == 0 && MatUtils.getIntData(mat,i-1,j+1) == 1)
{
labelMap.put(i-1,j+1,labelIndex);
queue.put(en,0,i-1);
queue.put(en,1,j+1);
en = en + 1;
}
//左下
if(i < rows && j > 1 && MatUtils.getIntData(labelMap,i+1,j-1) == 0 && MatUtils.getIntData(mat,i+1,j-1) == 1)
{
labelMap.put(i+1,j-1,labelIndex);
queue.put(en,0,i+1);
queue.put(en,1,j-1);
en = en + 1;
}
//右下
if(i < rows && j < cols && MatUtils.getIntData(labelMap,i+1,j+1) == 0 && MatUtils.getIntData(mat,i+1,j+1) == 1)
{
labelMap.put(i+1,j+1,labelIndex);
queue.put(en,0,i+1);
queue.put(en,1,j+1);
en = en + 1;
}
}
int qi = 0;
int qj = 0;
while(be < en)
{
qi = MatUtils.getIntData(queue, be, 0);
qj = MatUtils.getIntData(queue, be, 1);
be = be + 1;
//上
if(qi > 1 && MatUtils.getIntData(labelMap,qi-1,qj)== 0 && MatUtils.getIntData(mat,qi-1,qj) == 1)
{
labelMap.put(qi-1,qj,labelIndex);
queue.put(en,0, qi-1);
queue.put(en,1, qj);
en = en + 1;
}
//下
if(qi < rows && MatUtils.getIntData(labelMap,qi+1,qj)== 0 && MatUtils.getIntData(mat,qi+1,qj) == 1)
{
labelMap.put(qi+1,qj,labelIndex);
queue.put(en,0,qi+1);
queue.put(en,1,qj);
en = en + 1;
}
//左
if(qj >1 &&MatUtils.getIntData(labelMap,qi,qj-1)== 0 && MatUtils.getIntData(mat,qi,qj-1) == 1)
{
labelMap.put(qi,qj-1,labelIndex);
queue.put(en,0,qi);
queue.put(en,1,qj-1);
en = en + 1;
}
//右
if(qj < cols && MatUtils.getIntData(labelMap,qi,qj+1)== 0 && MatUtils.getIntData(mat,qi,qj+1) == 1)
{
labelMap.put(qi,qj+1,labelIndex);
queue.put(en,0,qi);
queue.put(en,1,qj+1);
en = en + 1;
}
if(n == 8)
{
//左上
if(qi >1 && qj > 1 && MatUtils.getIntData(labelMap,qi-1,qj-1) == 0 && MatUtils.getIntData(mat,qi-1,qj-1) == 1)
{
labelMap.put(qi-1,qj-1,labelIndex);
queue.put(en,0,qi-1);
queue.put(en,1,qj-1);
en = en + 1;
}
//右上
if(qi > 1 && qj < cols && MatUtils.getIntData(labelMap,qi-1,qj+1) == 0 && MatUtils.getIntData(mat,qi-1,qj+1) == 1)
{
labelMap.put(qi-1,qj+1,labelIndex);
queue.put(en,0,qi-1);
queue.put(en,1,qj+1);
en = en + 1;
}
//左下
if(qi < rows && qj > 1 && MatUtils.getIntData(labelMap,qi+1,qj-1) == 0 && MatUtils.getIntData(mat,qi+1,qj-1) == 1)
{
labelMap.put(qi+1,qj-1,labelIndex);
queue.put(en,0,qi+1);
queue.put(en,1,qj-1);
en = en + 1;
}
//右下
if(qi < rows && qj < cols && MatUtils.getIntData(labelMap,qi+1,qj+1) == 0 && MatUtils.getIntData(mat,qi+1,qj+1) == 1)
{
labelMap.put(qi+1,qj+1,labelIndex);
queue.put(en,0,qi+1);
queue.put(en,1,qj+1);
en = en + 1;
}
}
}
}
}
hash.put("Mat",labelMap);
hash.put("Num", labelIndex);
return hash;
}
相关文章推荐
- java对世界各个时区(TimeZone)的通用转换处理方法(转载)
- java-注解annotation
- java-模拟tomcat服务器
- java-用HttpURLConnection发送Http请求.
- java-WEB中的监听器Lisener
- Android IPC进程间通讯机制
- Android Native 绘图方法
- Android java 与 javascript互访(相互调用)的方法例子
- 介绍一款信息管理系统的开源框架---jeecg
- 聚类算法之kmeans算法java版本
- java实现 PageRank算法
- PropertyChangeListener简单理解
- c++11 + SDL2 + ffmpeg +OpenAL + java = Android播放器
- 插入排序
- 冒泡排序
- 堆排序
- 快速排序
- 二叉查找树