2 * Copyright 2008 Google Inc.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
17 package com.google.zxing.oned;
19 import com.google.zxing.BlackPointEstimationMethod;
20 import com.google.zxing.DecodeHintType;
21 import com.google.zxing.MonochromeBitmapSource;
22 import com.google.zxing.ReaderException;
23 import com.google.zxing.Result;
24 import com.google.zxing.ResultMetadataType;
25 import com.google.zxing.common.BitArray;
27 import java.util.Hashtable;
30 * <p>Encapsulates functionality and implementation that is common to all families
31 * of one-dimensional barcodes.</p>
33 * @author dswitkin@google.com (Daniel Switkin)
34 * @author srowen@google.com (Sean Owen)
36 public abstract class AbstractOneDReader implements OneDReader {
38 public final Result decode(MonochromeBitmapSource image) throws ReaderException {
39 return decode(image, null);
42 public final Result decode(MonochromeBitmapSource image, Hashtable hints) throws ReaderException {
43 boolean tryHarder = hints != null && hints.containsKey(DecodeHintType.TRY_HARDER);
45 return doDecode(image, hints, tryHarder);
46 } catch (ReaderException re) {
47 if (tryHarder && image.isRotateSupported()) {
48 MonochromeBitmapSource rotatedImage = image.rotateCounterClockwise();
49 Result result = doDecode(rotatedImage, hints, tryHarder);
50 // Record that we found it rotated 90 degrees CCW / 270 degrees CW
51 Hashtable metadata = result.getResultMetadata();
52 int orientation = 270;
53 if (metadata != null && metadata.containsKey(ResultMetadataType.ORIENTATION)) {
54 // But if we found it reversed in doDecode(), add in that result here:
55 orientation = (orientation + ((Integer) metadata.get(ResultMetadataType.ORIENTATION)).intValue()) % 360;
57 result.putMetadata(ResultMetadataType.ORIENTATION, new Integer(orientation));
65 private Result doDecode(MonochromeBitmapSource image, Hashtable hints, boolean tryHarder) throws ReaderException {
67 int width = image.getWidth();
68 int height = image.getHeight();
70 BitArray row = new BitArray(width);
72 //int barcodesToSkip = 0;
73 //if (hints != null) {
74 // Integer number = (Integer) hints.get(DecodeHintType.SKIP_N_BARCODES);
75 // if (number != null) {
76 // barcodesToSkip = number.intValue();
80 // We're going to examine rows from the middle outward, searching alternately above and below the middle,
81 // and farther out each time. rowStep is the number of rows between each successive attempt above and below
82 // the middle. So we'd scan row middle, then middle - rowStep, then middle + rowStep,
83 // then middle - 2*rowStep, etc.
84 // rowStep is bigger as the image is taller, but is always at least 1. We've somewhat arbitrarily decided
85 // that moving up and down by about 1/16 of the image is pretty good; we try more of the image if
87 int middle = height >> 1;
88 int rowStep = Math.max(1, height >> (tryHarder ? 7 : 4));
90 //if (tryHarder || barcodesToSkip > 0) {
92 maxLines = height; // Look at the whole image; looking for more than one barcode
97 //Result lastResult = null;
99 for (int x = 0; x < maxLines; x++) {
101 // Scanning from the middle out. Determine which row we're looking at next:
102 int rowStepsAboveOrBelow = (x + 1) >> 1;
103 boolean isAbove = (x & 0x01) == 0; // i.e. is x even?
104 int rowNumber = middle + rowStep * (isAbove ? rowStepsAboveOrBelow : -rowStepsAboveOrBelow);
105 if (rowNumber < 0 || rowNumber >= height) {
106 // Oops, if we run off the top or bottom, stop
110 // Estimate black point for this row and load it:
112 image.estimateBlackPoint(BlackPointEstimationMethod.ROW_SAMPLING, rowNumber);
113 } catch (ReaderException re) {
116 image.getBlackRow(rowNumber, row, 0, width);
118 // We may try twice for each row, if "trying harder":
119 for (int attempt = 0; attempt < 2; attempt++) {
121 if (attempt == 1) { // trying again?
122 if (tryHarder) { // only if "trying harder"
123 row.reverse(); // reverse the row and continue
131 // Look for a barcode
132 Result result = decodeRow(rowNumber, row, hints);
134 //if (lastResult != null && lastResult.getText().equals(result.getText())) {
135 // Just saw the last barcode again, proceed
139 //if (barcodesToSkip > 0) { // See if we should skip and keep looking
141 // lastResult = result; // Remember what we just saw
143 // We found our barcode
145 // But it was upside down, so note that
146 result.putMetadata(ResultMetadataType.ORIENTATION, new Integer(180));
151 } catch (ReaderException re) {
152 // continue -- just couldn't decode this row
158 throw new ReaderException("No barcode found");
161 static void recordPattern(BitArray row, int start, int[] counters) throws ReaderException {
162 int numCounters = counters.length;
163 for (int i = 0; i < numCounters; i++) {
166 int end = row.getSize();
168 throw new ReaderException("Couldn't fully read a pattern");
170 boolean isWhite = !row.get(start);
171 int counterPosition = 0;
174 boolean pixel = row.get(i);
175 if ((!pixel && isWhite) || (pixel && !isWhite)) {
176 counters[counterPosition]++;
179 if (counterPosition == numCounters) {
182 counters[counterPosition] = 1;
188 // If we read fully the last section of pixels and filled up our counters -- or filled
189 // the last counter but ran off the side of the image, OK. Otherwise, a problem.
190 if (!(counterPosition == numCounters || (counterPosition == numCounters - 1 && i == end))) {
191 throw new ReaderException("Couldn't fully read a pattern");
196 * Determines how closely a set of observed counts of runs of black/white values matches a given
197 * target pattern. This is reported as the ratio of the total variance from the expected pattern proportions
198 * across all pattern elements, to the length of the pattern.
200 * @param counters observed counters
201 * @param pattern expected pattern
202 * @return average variance between counters and pattern
204 static float patternMatchVariance(int[] counters, int[] pattern) {
206 int numCounters = counters.length;
207 int patternLength = 0;
208 for (int i = 0; i < numCounters; i++) {
209 total += counters[i];
210 patternLength += pattern[i];
212 float unitBarWidth = (float) total / (float) patternLength;
214 float totalVariance = 0.0f;
215 for (int x = 0; x < numCounters; x++) {
216 float scaledCounter = (float) counters[x] / unitBarWidth;
217 float width = pattern[x];
218 float abs = scaledCounter > width ? scaledCounter - width : width - scaledCounter;
219 totalVariance += abs;
221 return totalVariance / (float) patternLength;