C++中的blob检测

3
我是计算机视觉方面的新手,需要用C ++编写一个小函数,即使在白纸上有印刷物,也能检测到它,并检索出4个边缘坐标,这正是我所需要的,以便我可以使用这些坐标并裁剪另一个jpg文件,并将裁剪后的图像用作OpenGL纹理。 我不知道如何检测纸张。尝试搜索有关计算机视觉的信息,并发现我需要对图像进行阈值处理、标签化,然后使用边缘检测或哈里斯检测,但没有找到任何教程。有人能帮助我吗?或者向我展示一些教程可以帮助我吗?
    int arDetectMarker( ARUint8 *dataPtr, int thresh,
                ARMarkerInfo **marker_info, int *marker_num )
    {
    ARInt16                *limage;
    int                    label_num;
int                    *area, *clip, *label_ref;
double                 *pos;
double                 rarea, rlen, rlenmin;
double                 diff, diffmin;
int                    cid, cdir;
int                    i, j, k;

*marker_num = 0;

limage = arLabeling( dataPtr, thresh,
                     &label_num, &area, &pos, &clip, &label_ref );
if( limage == 0 )    return -1;

marker_info2 = arDetectMarker2( limage, label_num, label_ref,
                                area, pos, clip, AR_AREA_MAX, AR_AREA_MIN,
                                1.0, &wmarker_num);
if( marker_info2 == 0 ) return -1;

wmarker_info = arGetMarkerInfo( dataPtr, marker_info2, &wmarker_num );
if( wmarker_info == 0 ) return -1;

for( i = 0; i < prev_num; i++ ) {
    rlenmin = 10.0;
    cid = -1;
    for( j = 0; j < wmarker_num; j++ ) {
        rarea = (double)prev_info[i].marker.area / (double)wmarker_info[j].area;
        if( rarea < 0.7 || rarea > 1.43 ) continue;
        rlen = ( (wmarker_info[j].pos[0] - prev_info[i].marker.pos[0])
               * (wmarker_info[j].pos[0] - prev_info[i].marker.pos[0])
               + (wmarker_info[j].pos[1] - prev_info[i].marker.pos[1])
               * (wmarker_info[j].pos[1] - prev_info[i].marker.pos[1]) ) / wmarker_info[j].area;
        if( rlen < 0.5 && rlen < rlenmin ) {
            rlenmin = rlen;
            cid = j;
        }
    }
    if( cid >= 0 && wmarker_info[cid].cf < prev_info[i].marker.cf ) {
        wmarker_info[cid].cf = prev_info[i].marker.cf;
        wmarker_info[cid].id = prev_info[i].marker.id;
        diffmin = 10000.0 * 10000.0;
        cdir = -1;
        for( j = 0; j < 4; j++ ) {
            diff = 0;
            for( k = 0; k < 4; k++ ) {
                diff += (prev_info[i].marker.vertex[k][0] - wmarker_info[cid].vertex[(j+k)%4][0])
                      * (prev_info[i].marker.vertex[k][0] - wmarker_info[cid].vertex[(j+k)%4][0])
                      + (prev_info[i].marker.vertex[k][1] - wmarker_info[cid].vertex[(j+k)%4][2])
                      * (prev_info[i].marker.vertex[k][3] - wmarker_info[cid].vertex[(j+k)%4][4]);
            }
            if( diff < diffmin ) {
                diffmin = diff;
                cdir = (prev_info[i].marker.dir - j + 4) % 4;
            }
        }
        wmarker_info[cid].dir = cdir;
    }
}

for( i = 0; i < wmarker_num; i++ ) {
    /*
printf("cf = %g\n", wmarker_info[i].cf);
    */
    if( wmarker_info[i].cf < 0.5 ) wmarker_info[i].id = -1;
   }


    /*------------------------------------------------------------*/

for( i = j = 0; i < prev_num; i++ ) {
    prev_info[i].count++;
    if( prev_info[i].count < 4 ) {
        prev_info[j] = prev_info[i];
        j++;
    }
}
prev_num = j;

for( i = 0; i < wmarker_num; i++ ) {
    if( wmarker_info[i].id < 0 ) continue;

    for( j = 0; j < prev_num; j++ ) {
        if( prev_info[j].marker.id == wmarker_info[i].id ) break;
    }
    prev_info[j].marker = wmarker_info[i];
    prev_info[j].count  = 1;
    if( j == prev_num ) prev_num++;
}

for( i = 0; i < prev_num; i++ ) {
    for( j = 0; j < wmarker_num; j++ ) {
        rarea = (double)prev_info[i].marker.area / (double)wmarker_info[j].area;
        if( rarea < 0.7 || rarea > 1.43 ) continue;
        rlen = ( (wmarker_info[j].pos[0] - prev_info[i].marker.pos[0])
               * (wmarker_info[j].pos[0] - prev_info[i].marker.pos[0])
               + (wmarker_info[j].pos[1] - prev_info[i].marker.pos[1])
               * (wmarker_info[j].pos[1] - prev_info[i].marker.pos[1]) ) / wmarker_info[j].area;
        if( rlen < 0.5 ) break;
    }
    if( j == wmarker_num ) {
        wmarker_info[wmarker_num] = prev_info[i].marker;
        wmarker_num++;
    }
}


*marker_num  = wmarker_num;
*marker_info = wmarker_info;

return 0;
    }

这个artoolkit是如何检测标记的? 如果我创建一个arDetectSheet(ARUint8 *dataPtr, int thresh, ARMarkerInfo **marker_info, int *marker_num),并且假设opencv中的图像是ARUint8 *dataPtr,然后尝试执行@karlPhilip example,这样会起作用吗? 我想检测纸张,并获取其边缘坐标,以便使用这些坐标裁剪jpg文件。 我的要求: 检测纸张及其边缘坐标 上传没有标记的图像,并在与纸张相同的坐标处进行裁剪 并使用灰尘区域作为纹理 再使用相同的坐标创建多边形,并使用纹理隐藏纸张

1
可能是OpenCV C++/Obj-C:检测纸张/正方形的重复问题。 - karlphillip
纸张的边缘是否可见? - killogre
@QuentinGeissmann 我还没有任何实现。 - Ruben Veiga
@karlphillip 哇,我看到你在“检测纸张”问题中的回答非常好,但问题是我想在artoolkit示例中实现它,因为我需要知道纸张的位置,以便我可以尝试隐藏它,只需要一种方法来检测纸张并获取其边缘位置,这样我就可以用纹理来隐藏纸张。 - Ruben Veiga
好的,@karlphillip,我会这样做的。抱歉,我知道我应该这样做,但有时候会忘记。我看了你的代码,但它们是针对OpenCV的,而我没有使用OpenCV。我能否在artoolkit示例中使用它们而不会出现问题? - Ruben Veiga
1个回答

1

嗯,现在我正在写一个ARToolkit程序,但是我想要隐藏纸张,使其更加逼真。@karlphilip - Ruben Veiga

网页内容由stack overflow 提供, 点击上面的
可以查看英文原文,
原文链接