float Finder::crossCheckVertical(int startI, int centerJ, int maxCount, int
originalStateCountTotal) {
int maxI = image.rows;
int stateCount[5];
for (int i = 0; i < 5; i++) {
stateCount[i] = 0;
}
int i = startI;
//1. count black up from center
while (i >= 0 && image.at<uchar>(Point(centerJ, i)) < 128) {
stateCount[2]++;
i--;
}
//continue count white
while (i >= 0 && image.at<uchar>(Point(centerJ, i)) > 128) {
stateCount[1]++;
i--;
}
//the toppest black
while (i >= 0 && image.at<uchar>(Point(centerJ, i)) < 128) {
stateCount[0]++;
i--;
}
// if (stateCount[0] + stateCount[1] > maxCount) {
// return 0.0/0.0;
// }
//2. count black down from center
i = startI + 1;
while (i < maxI && image.at<uchar>(Point(centerJ, i)) < 128) {
stateCount[2]++;
i++;
}
while (i < maxI && image.at<uchar>(Point(centerJ, i)) > 128) {
stateCount[3]++;
i++;
}
while (i < maxI && image.at<uchar>(Point(centerJ, i)) < 128) {
stateCount[4]++;
i++;
}
if (stateCount[0] > maxCount && stateCount[1] > maxCount) {
return 0.0/0.0;
}
return checkRatio(stateCount) ? (float)(i - stateCount[4] - stateCount[3]) - stateCount[2] / 2.0f : 0.0/0.0;
}
bool qrReader::find(Mat img) {
int skipRows = 3;
int stateCount[5] = {0};
int currentState = 0;
for (int row = skipRows - 1; row < img.rows; row += skipRows) {
stateCount[0] = 0;
stateCount[1] = 0;
stateCount[2] = 0;
stateCount[3] = 0;
stateCount[4] = 0;
currentState = 0;
uchar *ptr = img.ptr<uchar>(row);
for (int col = 0; col < img.cols; col++) {
if (ptr[col] < 128) {
// We're at a black pixel
if ((currentState & 0x1) == 1) {
// We were counting white pixels
// So change the state now
// W->B transition
currentState++;
}
// Works for boths W->B and B->B
stateCount[currentState]++;
} else {
// We got to a white pixel...
if ((currentState & 0x1) == 1) {
// W->W change
stateCount[currentState]++;
} else {
// ...but, we were counting black pixels
if (currentState == 4) {
// We found the 'white' area AFTER the finder patter
// Do processing for it here
if (checkRatio(stateCount)) {
// This is where we do some more checks
} else {
currentState = 3;
stateCount[0] = stateCount[2];
stateCount[1] = stateCount[3];
stateCount[2] = stateCount[4];
stateCount[3] = 1;
stateCount[4] = 0;
continue;
}
currentState = 0;
stateCount[0] = 0;
stateCount[1] = 0;
stateCount[2] = 0;
stateCount[3] = 0;
stateCount[4] = 0;
} else {
// We still haven't go 'out' of the finder pattern yet
// So increment the state
// B->W transition
currentState++;
stateCount[currentState]++;
}
}
}
}
}
return false;
}
float Finder::crossCheckHorizontal(int startJ, int centerI, int maxCount, int originalStateCountTotal) {
int maxJ = image.cols;
int stateCount[5];
for (int i = 0; i < 5; i++) {
stateCount[i] = 0;
}
int j = startJ;
while (j >= 0 && image.at<uchar>(Point(j, centerI)) < 128) {
stateCount[2]++;
j--;
}
if (j < 0) {
return 0.0/0.0;
}
while (j >= 0 && image.at<uchar>(Point(j, centerI)) > 128 && stateCount[1] <= maxCount) {
stateCount[1]++;
j--;
}
if (j < 0 || stateCount[1] > maxCount) {
return 0.0/0.0;
}
while (j >= 0 && image.at<uchar>(Point(j, centerI)) < 128 && stateCount[0] <= maxCount) {
stateCount[0]++;
j--;
}
if (stateCount[0] > maxCount) {
return 0.0/0.0;
}
j = startJ + 1;
while (j < maxJ && image.at<uchar>(Point(j, centerI)) < 128) {
stateCount[2]++;
j++;
}
if (j == maxJ) {
return 0.0/0.0;
}
while (j < maxJ && image.at<uchar>(Point(j, centerI)) > 128 && stateCount[3] < maxCount) {
stateCount[3]++;
j++;
}
if (j == maxJ || stateCount[3] >= maxCount) {
return 0.0/0.0;
}
while (j < maxJ && image.at<uchar>(Point(j, centerI)) < 128 && stateCount[4] < maxCount) {
stateCount[4]++;
j++;
}
if (stateCount[4] >= maxCount) {
return 0.0/0.0;
}
// If we found a finder-pattern-like section, but its size is significantly different than
// the original, assume it's a false positive
int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
if (5 * abs(stateCountTotal - originalStateCountTotal) >= originalStateCountTotal) {
return 0.0/0.0;
}
return checkRatio(stateCount) ? (float)(j - stateCount[4] - stateCount[3]) - stateCount[2] / 2.0f : 0.0/0.0;
}
FinderResult Finder::find() {
bool done = false;
int skipRows = 3;
int stateCount[5] = {0};
int currentState = 0;
for(int row = skipRows - 1; row < image.rows; row += skipRows)
{
stateCount[0] = 0;
stateCount[1] = 0;
stateCount[2] = 0;
stateCount[3] = 0;
stateCount[4] = 0;
currentState = 0;
// uchar* ptr = image.ptr<uchar>(row);
for(int col=0; col < image.cols; col++)
{
Point p = Point(col, row);
if(image.at<uchar>(p) < 128)
{
// We're at a black pixel
if((currentState & 0x1)==1)
{
// We were counting white pixels
// So change the state now
// W->B transition
currentState++;
}
// Works for boths W->B and B->B
stateCount[currentState]++;
}
else
{
// We got to a white pixel...
if((currentState & 0x1)==1)
{
// W->W change
stateCount[currentState]++;
}
else
{
// ...but, we were counting black pixels
if(currentState==4)
{
// We found the 'white' area AFTER the finder patter
// Do processing for it here
if(checkRatio(stateCount))
{
// This is where we do some more checks
bool confirmed = handlePossibleCenter(stateCount, row, col);
if(confirmed) {
skipRows = 2;
if(hasSkipped) {
done = haveMultiplyConfirmedCenters();
}
else {
int rowsToSkip = getRowSkip();
if(rowsToSkip > stateCount[2]) {
row += rowsToSkip - stateCount[2] - skipRows;
col = image.cols - 1;
}
}
}
else {
stateCount[0] = stateCount[2];
stateCount[1] = stateCount[3];
stateCount[2] = stateCount[4];
stateCount[3] = 1;
stateCount[4] = 0;
currentState = 3;
continue;
}
// Reset all counts and continue looking for more
// finder patterns in the current row
currentState = 0;
stateCount[0] = 0;
stateCount[1] = 0;
stateCount[2] = 0;
stateCount[3] = 0;
stateCount[4] = 0;
}
else
{
currentState = 3;
stateCount[0] = stateCount[2];
stateCount[1] = stateCount[3];
stateCount[2] = stateCount[4];
stateCount[3] = 1;
stateCount[4] = 0;
continue;
}
currentState = 0;
stateCount[0] = 0;
stateCount[1] = 0;
stateCount[2] = 0;
stateCount[3] = 0;
stateCount[4] = 0;
}
else
{
// We still haven't go 'out' of the finder pattern yet
// So increment the state
// B->W transition
currentState++;
stateCount[currentState]++;
}
}
}
}
}
// vector<FinderPoint> best = selectBestPattern();
vector<FinderPoint> best = orderBestPatterns();
FinderResult result = FinderResult(best);
return result;
}
