import com.google.zxing.MonochromeBitmapSource;
import com.google.zxing.ReaderException;
import com.google.zxing.ResultPoint;
-import com.google.zxing.BlackPointEstimationMethod;
import com.google.zxing.common.BitMatrix;
import com.google.zxing.common.Collections;
import com.google.zxing.common.Comparator;
import com.google.zxing.common.DetectorResult;
import com.google.zxing.common.GenericResultPoint;
import com.google.zxing.common.GridSampler;
+import com.google.zxing.common.detector.MonochromeRectangleDetector;
import java.util.Enumeration;
import java.util.Hashtable;
* <p>Encapsulates logic that can detect a Data Matrix Code in an image, even if the Data Matrix Code
* is rotated or skewed, or partially obscured.</p>
*
- * @author srowen@google.com (Sean Owen)
+ * @author Sean Owen
*/
public final class Detector {
{ new Integer(0), new Integer(1), new Integer(2), new Integer(3), new Integer(4) };
private final MonochromeBitmapSource image;
+ private final MonochromeRectangleDetector rectangleDetector;
public Detector(MonochromeBitmapSource image) {
this.image = image;
+ rectangleDetector = new MonochromeRectangleDetector(image);
}
/**
*/
public DetectorResult detect() throws ReaderException {
- if (!BlackPointEstimationMethod.TWO_D_SAMPLING.equals(image.getLastEstimationMethod())) {
- image.estimateBlackPoint(BlackPointEstimationMethod.TWO_D_SAMPLING, 0);
- }
-
- int height = image.getHeight();
- int width = image.getWidth();
- int halfHeight = height >> 1;
- int halfWidth = width >> 1;
- int iSkip = Math.max(1, height / (MAX_MODULES << 3));
- int jSkip = Math.max(1, width / (MAX_MODULES << 3));
-
- int minI = 0;
- int maxI = height;
- int minJ = 0;
- int maxJ = width;
- ResultPoint pointA = findCornerFromCenter(halfHeight, -iSkip, minI, maxI, halfWidth, 0, minJ, maxJ, halfWidth >> 1);
- minI = (int) pointA.getY() - 1;
- ResultPoint pointB = findCornerFromCenter(halfHeight, 0, minI, maxI, halfWidth, -jSkip, minJ, maxJ, halfHeight >> 1);
- minJ = (int) pointB.getX() - 1;
- ResultPoint pointC = findCornerFromCenter(halfHeight, 0, minI, maxI, halfWidth, jSkip, minJ, maxJ, halfHeight >> 1);
- maxJ = (int) pointC.getX() + 1;
- ResultPoint pointD = findCornerFromCenter(halfHeight, iSkip, minI, maxI, halfWidth, 0, minJ, maxJ, halfWidth >> 1);
- maxI = (int) pointD.getY() + 1;
- // Go try to find point A again with better information -- might have been off at first.
- pointA = findCornerFromCenter(halfHeight, -iSkip, minI, maxI, halfWidth, 0, minJ, maxJ, halfWidth >> 2);
+ ResultPoint[] cornerPoints = rectangleDetector.detect();
+ ResultPoint pointA = cornerPoints[0];
+ ResultPoint pointB = cornerPoints[1];
+ ResultPoint pointC = cornerPoints[2];
+ ResultPoint pointD = cornerPoints[3];
// Point A and D are across the diagonal from one another,
// as are B and C. Figure out which are the solid black lines
}
}
+ if (maybeTopLeft == null || bottomLeft == null || maybeBottomRight == null) {
+ throw ReaderException.getInstance();
+ }
+
// Bottom left is correct but top left and bottom right might be switched
- ResultPoint[] corners = new ResultPoint[] { maybeTopLeft, bottomLeft, maybeBottomRight };
+ ResultPoint[] corners = { maybeTopLeft, bottomLeft, maybeBottomRight };
// Use the dot product trick to sort them out
GenericResultPoint.orderBestPatterns(corners);
return new DetectorResult(bits, new ResultPoint[] {pointA, pointB, pointC, pointD});
}
- /**
- * Attempts to locate a corner of the barcode by scanning up, down, left or right from a center
- * point which should be within the barcode.
- *
- * @param centerI center's i componennt (vertical)
- * @param di change in i per step. If scanning up this is negative; down, positive; left or right, 0
- * @param minI minimum value of i to search through (meaningless when di == 0)
- * @param maxI maximum value of i
- * @param centerJ center's j component (horizontal)
- * @param dj same as di but change in j per step instead
- * @param minJ see minI
- * @param maxJ see minJ
- * @param maxWhiteRun maximum run of white pixels that can still be considered to be within
- * the barcode
- * @return a {@link ResultPoint} encapsulating the corner that was found
- * @throws ReaderException if such a point cannot be found
- */
- private ResultPoint findCornerFromCenter(int centerI, int di, int minI, int maxI,
- int centerJ, int dj, int minJ, int maxJ,
- int maxWhiteRun) throws ReaderException {
- int[] lastRange = null;
- for (int i = centerI, j = centerJ;
- i < maxI && i >= minI && j < maxJ && j >= minJ;
- i += di, j += dj) {
- int[] range;
- if (dj == 0) {
- // horizontal slices, up and down
- range = blackWhiteRange(i, maxWhiteRun, minJ, maxJ, true);
- } else {
- // vertical slices, left and right
- range = blackWhiteRange(j, maxWhiteRun, minI, maxI, false);
- }
- if (range == null) {
- if (lastRange == null) {
- throw new ReaderException("Center of image not within barcode");
- }
- // lastRange was found
- if (dj == 0) {
- int lastI = i - di;
- if (lastRange[0] < centerJ) {
- if (lastRange[1] > centerJ) {
- // straddle, choose one or the other based on direction
- return new GenericResultPoint(di > 0 ? lastRange[0] : lastRange[1], lastI);
- }
- return new GenericResultPoint(lastRange[0], lastI);
- } else {
- return new GenericResultPoint(lastRange[1], lastI);
- }
- } else {
- int lastJ = j - dj;
- if (lastRange[0] < centerI) {
- if (lastRange[1] > centerI) {
- return new GenericResultPoint(lastJ, dj < 0 ? lastRange[0] : lastRange[1]);
- }
- return new GenericResultPoint(lastJ, lastRange[0]);
- } else {
- return new GenericResultPoint(lastJ, lastRange[1]);
- }
- }
- }
- lastRange = range;
- }
- throw new ReaderException("Couldn't find an end to barcode");
- }
-
/**
* Increments the Integer associated with a key by one.
*/
table.put(key, value == null ? INTEGERS[1] : INTEGERS[value.intValue() + 1]);
}
- /**
- * Computes the start and end of a region of pixels, either horizontally or vertically, that could be
- * part of a Data Matrix barcode.
- *
- * @param fixedDimension if scanning horizontally, this is the row (the fixed vertical location) where
- * we are scanning. If scanning vertically it's the colummn, the fixed horizontal location
- * @param maxWhiteRun largest run of white pixels that can still be considered part of the barcode region
- * @param minDim minimum pixel location, horizontally or vertically, to consider
- * @param maxDim maximum pixel location, horizontally or vertically, to consider
- * @param horizontal if true, we're scanning left-right, instead of up-down
- * @return int[] with start and end of found range, or null if no such range is found (e.g. only white was found)
- */
- private int[] blackWhiteRange(int fixedDimension, int maxWhiteRun, int minDim, int maxDim, boolean horizontal) {
-
- int center = (minDim + maxDim) / 2;
-
- // Scan left/up first
- int start = center;
- while (start >= minDim) {
- if (horizontal ? image.isBlack(start, fixedDimension) : image.isBlack(fixedDimension, start)) {
- start--;
- } else {
- int whiteRunStart = start;
- do {
- start--;
- } while (start >= minDim &&
- !(horizontal ? image.isBlack(start, fixedDimension) : image.isBlack(fixedDimension, start)));
- int whiteRunSize = whiteRunStart - start;
- if (start < minDim || whiteRunSize > maxWhiteRun) {
- start = whiteRunStart + 1; // back up
- break;
- }
- }
- }
-
- // Then try right/down
- int end = center;
- while (end < maxDim) {
- if (horizontal ? image.isBlack(end, fixedDimension) : image.isBlack(fixedDimension, end)) {
- end++;
- } else {
- int whiteRunStart = end;
- do {
- end++;
- } while (end < maxDim &&
- !(horizontal ? image.isBlack(end, fixedDimension) : image.isBlack(fixedDimension, end)));
- int whiteRunSize = end - whiteRunStart;
- if (end >= maxDim || whiteRunSize > maxWhiteRun) {
- end = whiteRunStart - 1;
- break;
- }
- }
- }
-
- if (end > start) {
- return new int[] { start, end };
- } else {
- return null;
- }
- }
-
private static BitMatrix sampleGrid(MonochromeBitmapSource image,
ResultPoint topLeft,
ResultPoint bottomLeft,
boolean inBlack = image.isBlack(steep ? fromY : fromX, steep ? fromX : fromY);
for (int x = fromX, y = fromY; x != toX; x += xstep) {
boolean isBlack = image.isBlack(steep ? y : x, steep ? x : y);
- if (isBlack == !inBlack) {
+ if (isBlack != inBlack) {
transitions++;
inBlack = isBlack;
}
projects / zxing.git / blobdiff