int FilterLed::GetMeanPositionBox ( const int  x, const int  y, const int  boxx, const int  boxy, float &  mx, float &  my, unsigned int &  sum  ) const

private

Definition at line 277 of file FilterLed.cc.

References ClusterFinder::FindClusterAt(), ClusterFinder::GetSumX(), ClusterFinder::GetSumY(), mag, ClusterFinder::SetLimitingSize(), and ClusterFinder::SetRange().

{
    //-------------------------------
    // Improved algorithm:
    // 1. Look for the largest five-pixel-cross signal inside the box
    int x0 = max(x-boxx+1,   0);
    int y0 = max(y-boxy+1,   0);

    int x1 = min(x+boxx+1-1, fW);
    int y1 = min(y+boxy+1-1, fH);

    int maxx=0;
    int maxy=0;

    unsigned int max =0;
    for (int dx=x0; dx<x1; dx++)
    {
        for (int dy=y0; dy<y1; dy++)
        {
            const unsigned int sumloc =
                fImg[(dy+0)*fW + (dx-1)] +
                fImg[(dy+0)*fW + (dx+1)] +
                fImg[(dy+1)*fW + dx] +
                fImg[(dy+0)*fW + dx] +
                fImg[(dy-1)*fW + dx];

            if(sumloc<=max)
                continue;

            maxx=dx;
            maxy=dy;
            max =sumloc;
        }
    }

    // 2. Calculate mean position inside a circle around
    // the highst cross-signal with radius of 6 pixels.
    ClusterFinder find(fImg, fW, fH);
    find.SetLimitingSize(9999);
    find.SetRange(x0, y0, x1, y1);

    const float mag = find.FindClusterAt(maxx, maxy);

    mx = find.GetSumX()/mag;
    my = find.GetSumY()/mag;

    sum = (int)(mag+0.5);

    return (int)my*fW + (int)mx;
}

Here is the call graph for this function: