boofcv.alg.fiducial.qrcode.QrCodeAlignmentPatternLocator Maven / Gradle / Ivy

Go to download
/*
 * Copyright (c) 2021, Peter Abeles. All Rights Reserved.
 *
 * This file is part of BoofCV (http://boofcv.org).
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package boofcv.alg.fiducial.qrcode;

import boofcv.alg.distort.LensDistortionNarrowFOV;
import boofcv.struct.image.ImageGray;
import org.ddogleg.struct.FastArray;
import org.jetbrains.annotations.Nullable;

/**
 * Searches the image for alignment patterns. First it computes a transform that removes perspective distortion
 * using previously detected position patterns. Then it searches inside the image for the position patterns. If
 * available, adjacent position patterns are used to adjust the search so that locations distant from position
 * patterns can be compensated for.
 *
 * NOTE: The current algorithm is a bit brittle and is a good target for further improvement. It has issues converging
 * when its initial guess is off.
 *
 * @author Peter Abeles
 */
@SuppressWarnings({"NullAway.Init"})
public class QrCodeAlignmentPatternLocator> {

	// grid for quick look up of alignment patterns to adjust search
	private final FastArray lookup = new FastArray<>(QrCode.Alignment.class);

	QrCodeBinaryGridReader reader;

	// pixel value storage used when localizing
	float[] arrayX = new float[12];
	float[] arrayY = new float[12];

	QrCode qr;

	float threshold;

	public QrCodeAlignmentPatternLocator( Class imageType ) {
		reader = new QrCodeBinaryGridReader<>(imageType);
	}

	/**
	 * Uses the previously detected position patterns to seed the search for the alignment patterns
	 */
	public boolean process( T image, QrCode qr ) {
		this.qr = qr;
		// this must be cleared before calling setMarker or else the distortion will be messed up
		qr.alignment.reset();

		reader.setImage(image);
		reader.setMarker(qr);

		threshold = (float)qr.threshCorner;

		initializePatterns(qr);

		// version 1 has no alignment patterns
		if (qr.version <= 1)
			return true;
		return localizePositionPatterns(QrCode.VERSION_INFO[qr.version].alignment);
	}

	public void setLensDistortion( int width, int height,
								   @Nullable LensDistortionNarrowFOV model ) {
		reader.setLensDistortion(width, height, model);
	}

	/**
	 * Creates a list of alignment patterns to look for and their grid coordinates
	 */
	void initializePatterns( QrCode qr ) {
		int[] where = QrCode.VERSION_INFO[qr.version].alignment;
		qr.alignment.reset();
		lookup.reset();
		for (int row = 0; row < where.length; row++) {
			for (int col = 0; col < where.length; col++) {
				boolean skip = false;
				if (row == 0 && col == 0)
					skip = true;
				else if (row == 0 && col == where.length - 1)
					skip = true;
				else if (row == where.length - 1 && col == 0)
					skip = true;

				if (skip) {
					lookup.add(null);
				} else {
					QrCode.Alignment a = qr.alignment.grow();
					a.moduleX = where[col];
					a.moduleY = where[row];
					lookup.add(a);
				}
			}
		}
	}

	boolean localizePositionPatterns( int[] alignmentLocations ) {
		int size = alignmentLocations.length;

		for (int row = 0; row < size; row++) {
			for (int col = 0; col < size; col++) {
				QrCode.Alignment a = lookup.get(row*size + col);
				if (a == null)
					continue;

				// adjustment from previously found alignment patterns
				double adjY = 0, adjX = 0;

				if (row > 0) {
					QrCode.Alignment p = lookup.get((row - 1)*size + col);
					if (p != null)
						adjY = p.moduleY + 0.5 - p.moduleFound.y;
				}
				if (col > 0) {
					QrCode.Alignment p = lookup.get(row*size + col - 1);
					if (p != null)
						adjX = p.moduleX + 0.5 - p.moduleFound.x;
				}

				if (!centerOnSquare(a, (float)(a.moduleY + 0.5 + adjY), (float)(a.moduleX + 0.5 + adjX))) {
					return false;
				}

//				if( !localize(a, (float)a.moduleFound.y, (float)a.moduleFound.x) ) {
//					return false;
//				}
				if (!meanshift(a, (float)a.moduleFound.y, (float)a.moduleFound.x)) {
					return false;
				}
			}
		}
		return true;
	}

	float[] samples = new float[9];

	/**
	 * If the initial guess is within the inner white circle or black dot this will ensure that it is centered
	 * on the black dot
	 */
	boolean centerOnSquare( QrCode.Alignment pattern, float guessY, float guessX ) {
		float step = 1;
		float bestMag = Float.MAX_VALUE;
		float bestX = guessX;
		float bestY = guessY;

		for (int i = 0; i < 10; i++) {
			for (int row = 0; row < 3; row++) {
				float gridy = guessY - 1f + row;
				for (int col = 0; col < 3; col++) {
					float gridx = guessX - 1f + col;

					samples[row*3 + col] = reader.read(gridy, gridx);
				}
			}

			float dx = (samples[2] + samples[5] + samples[8]) - (samples[0] + samples[3] + samples[6]);
			float dy = (samples[6] + samples[7] + samples[8]) - (samples[0] + samples[1] + samples[2]);

			float r = (float)Math.sqrt(dx*dx + dy*dy);

			if (bestMag > r) {
//				System.out.println("good step at "+i);
				bestMag = r;
				bestX = guessX;
				bestY = guessY;
			} else {
//				System.out.println("bad step at "+i);
				step *= 0.75f;
			}

			if (r > 0) {
				guessX = bestX + step*dx/r;
				guessY = bestY + step*dy/r;
			} else {
				break;
			}
		}

		pattern.moduleFound.x = bestX;
		pattern.moduleFound.y = bestY;

		reader.gridToImage((float)pattern.moduleFound.y, (float)pattern.moduleFound.x, pattern.pixel);

		return true;
	}

	/**
	 * Localizizes the alignment pattern crudely by searching for the black box in the center by looking
	 * for its edges in the gray scale image
	 *
	 * @return true if success or false if it doesn't resemble an alignment pattern
	 */
	boolean localize( QrCode.Alignment pattern, float guessY, float guessX ) {
		// sample along the middle. Try to not sample the outside edges which could confuse it
		for (int i = 0; i < arrayY.length; i++) {
			float x = guessX - 1.5f + i*3f/12.0f;
			float y = guessY - 1.5f + i*3f/12.0f;

			arrayX[i] = reader.read(guessY, x);
			arrayY[i] = reader.read(y, guessX);
		}

		// TODO turn this into an exhaustive search of the array for best up and down point?
		int downX = greatestDown(arrayX);
		if (downX == -1) return false;
		int upX = greatestUp(arrayX, downX);
		if (upX == -1) return false;

		int downY = greatestDown(arrayY);
		if (downY == -1) return false;
		int upY = greatestUp(arrayY, downY);
		if (upY == -1) return false;

		pattern.moduleFound.x = guessX - 1.5f + (downX + upX)*3f/24.0f;
		pattern.moduleFound.y = guessY - 1.5f + (downY + upY)*3f/24.0f;

		reader.gridToImage((float)pattern.moduleFound.y, (float)pattern.moduleFound.x, pattern.pixel);

		return true;
	}

	boolean meanshift( QrCode.Alignment pattern, float guessY, float guessX ) {

//		System.out.println("before "+guessX+" "+guessY);
		float step = 1;
		float decay = 0.7f;
		for (int i = 0; i < 10; i++) {
			float sumX = 0;
			float sumY = 0;
			float total = 0;

			for (int y = 0; y < 8; y++) {
				float dy = -1.5f + 3f*y/7f;
				float gridY = guessY + dy;
				for (int x = 0; x < 8; x++) {
					float dx = -1.5f + 3f*x/7f;
					float gridX = guessX + dx;
					float v = reader.read(gridY, gridX);
					float r = (float)Math.sqrt(dx*dx + dy*dy);

					float w = Math.max(-10, (r > 0.5 ? v - threshold : threshold - v));
					total += Math.abs(w);
					sumX += w*dx;
					sumY += w*dy;
				}
			}

			guessX += step*sumX/total;
			guessY += step*sumY/total;
			step *= decay;
		}

//		System.out.println("after "+guessX+" "+guessY+"\n");

		pattern.moduleFound.x = guessX;
		pattern.moduleFound.y = guessY;

		reader.gridToImage((float)pattern.moduleFound.y, (float)pattern.moduleFound.x, pattern.pixel);

		return true;
	}

	/**
	 * Searches for the greatest down slope in the list
	 */
	static int greatestDown( float[] array ) {
		int best = -1;
		float bestScore = 0;

		for (int i = 5; i < array.length; i++) {
			float diff = (4.0f/2.0f)*(array[i - 5] + array[i]);
			diff -= array[i - 4] + array[i - 3] + array[i - 2] + array[i - 1];

			if (diff > bestScore) {
				bestScore = diff;
				best = i - 4;
			}
		}
		return best;
	}

	static int greatestUp( float[] array, int start ) {
		int best = -1;
		float bestScore = 0;

		for (int i = start; i < array.length; i++) {
			float diff = array[i] - array[i - 1];
			if (diff > bestScore) {
				bestScore = diff;
				best = i - 1;
			}
		}
		return best;
	}
}