public override BitMatrix sampleGrid(MonochromeBitmapSource image, int dimension, float p1ToX, float p1ToY, float p2ToX, float p2ToY, float p3ToX, float p3ToY, float p4ToX, float p4ToY, float p1FromX, float p1FromY, float p2FromX, float p2FromY, float p3FromX, float p3FromY, float p4FromX, float p4FromY)
{
PerspectiveTransform transform = PerspectiveTransform.quadrilateralToQuadrilateral(p1ToX, p1ToY, p2ToX, p2ToY, p3ToX, p3ToY, p4ToX, p4ToY, p1FromX, p1FromY, p2FromX, p2FromY, p3FromX, p3FromY, p4FromX, p4FromY);
BitMatrix bits = new BitMatrix(dimension);
float[] points = new float[dimension << 1];
for (int i = 0; i < dimension; i++)
{
int max = points.Length;
float iValue = (float)i + 0.5f;
for (int j = 0; j < max; j += 2)
{
points[j] = (float)(j >> 1) + 0.5f;
points[j + 1] = iValue;
}
transform.transformPoints(points);
// Quick check to see if points transformed to something inside the image;
// sufficent to check the endpoints
checkAndNudgePoints(image, points);
try
{
for (int j = 0; j < max; j += 2)
{
//UPGRADE_WARNING: Narrowing conversions may produce unexpected results in C#. 'ms-help://MS.VSCC.2003/commoner/redir/redirect.htm?keyword="jlca1042"'
if (image.isBlack((int)points[j], (int)points[j + 1]))
{
// Black(-ish) pixel
bits.set(i, j >> 1);
}
}
}
catch (System.IndexOutOfRangeException aioobe)
{
// This feels wrong, but, sometimes if the finder patterns are misidentified, the resulting
// transform gets "twisted" such that it maps a straight line of points to a set of points
// whose endpoints are in bounds, but others are not. There is probably some mathematical
// way to detect this about the transformation that I don't know yet.
// This results in an ugly runtime exception despite our clever checks above -- can't have that.
// We could check each point's coordinates but that feels duplicative. We settle for
// catching and wrapping ArrayIndexOutOfBoundsException.
throw new ReaderException(aioobe.Message);
}
}
return(bits);
}
public override BitMatrix sampleGrid(MonochromeBitmapSource image, int dimension, float p1ToX, float p1ToY, float p2ToX, float p2ToY, float p3ToX, float p3ToY, float p4ToX, float p4ToY, float p1FromX, float p1FromY, float p2FromX, float p2FromY, float p3FromX, float p3FromY, float p4FromX, float p4FromY)
{
PerspectiveTransform transform = PerspectiveTransform.quadrilateralToQuadrilateral(p1ToX, p1ToY, p2ToX, p2ToY, p3ToX, p3ToY, p4ToX, p4ToY, p1FromX, p1FromY, p2FromX, p2FromY, p3FromX, p3FromY, p4FromX, p4FromY);
BitMatrix bits = new BitMatrix(dimension);
float[] points = new float[dimension << 1];
for (int i = 0; i < dimension; i++)
{
int max = points.Length;
float iValue = (float)i + 0.5f;
for (int j = 0; j < max; j += 2)
{
points[j] = (float)(j >> 1) + 0.5f;
points[j + 1] = iValue;
}
transform.transformPoints(points);
// Quick check to see if points transformed to something inside the image;
// sufficent to check the endpoints
checkAndNudgePoints(image, points);
try
{
for (int j = 0; j < max; j += 2)
{
//UPGRADE_WARNING: Narrowing conversions may produce unexpected results in C#. 'ms-help://MS.VSCC.2003/commoner/redir/redirect.htm?keyword="jlca1042"'
if (image.isBlack((int)points[j], (int)points[j + 1]))
{
// Black(-ish) pixel
bits.set(i, j >> 1);
}
}
}
catch (System.IndexOutOfRangeException aioobe)
{
// This feels wrong, but, sometimes if the finder patterns are misidentified, the resulting
// transform gets "twisted" such that it maps a straight line of points to a set of points
// whose endpoints are in bounds, but others are not. There is probably some mathematical
// way to detect this about the transformation that I don't know yet.
// This results in an ugly runtime exception despite our clever checks above -- can't have that.
// We could check each point's coordinates but that feels duplicative. We settle for
// catching and wrapping ArrayIndexOutOfBoundsException.
throw new ReaderException(aioobe.Message);
}
}
return bits;
}
/// <summary> <p>Checks a set of points that have been transformed to sample points on an image against
/// the image's dimensions to see if the point are even within the image.</p>
/// *
/// <p>This method will actually "nudge" the endpoints back onto the image if they are found to be barely
/// (less than 1 pixel) off the image. This accounts for imperfect detection of finder patterns in an image
/// where the QR Code runs all the way to the image border.</p>
/// *
/// <p>For efficiency, the method will check points from either end of the line until one is found
/// to be within the image. Because the set of points are assumed to be linear, this is valid.</p>
/// *
/// </summary>
/// <param name="image">image into which the points should map
/// </param>
/// <param name="points">actual points in x1,y1,...,xn,yn form
/// @throws ReaderException if an endpoint is lies outside the image boundaries
///
/// </param>
protected internal static void checkAndNudgePoints(MonochromeBitmapSource image, float[] points)
{
int width = image.getWidth();
int height = image.getHeight();
// Check and nudge points from start until we see some that are OK:
bool nudged = true;
for (int offset = 0; offset < points.Length && nudged; offset += 2)
{
int x = (int)points[offset];
int y = (int)points[offset + 1];
if (x < -1 || x > width || y < -1 || y > height)
{
throw new ReaderException("");
}
nudged = false;
if (x == -1)
{
points[offset] = 0.0f;
nudged = true;
}
else if (x == width)
{
points[offset] = width - 1;
nudged = true;
}
if (y == -1)
{
points[offset + 1] = 0.0f;
nudged = true;
}
else if (y == height)
{
points[offset + 1] = height - 1;
nudged = true;
}
}
// Check and nudge points from end:
nudged = true;
for (int offset = points.Length - 2; offset >= 0 && nudged; offset -= 2)
{
int x = (int)points[offset];
int y = (int)points[offset + 1];
if (x < -1 || x > width || y < -1 || y > height)
{
throw new ReaderException("");
}
nudged = false;
if (x == -1)
{
points[offset] = 0.0f;
nudged = true;
}
else if (x == width)
{
points[offset] = width - 1;
nudged = true;
}
if (y == -1)
{
points[offset + 1] = 0.0f;
nudged = true;
}
else if (y == height)
{
points[offset + 1] = height - 1;
nudged = true;
}
}
}
/// <summary> <p>Samples an image for a square matrix of bits of the given dimension. This is used to extract the
/// black/white modules of a 2D barcode like a QR Code found in an image. Because this barcode may be
/// rotated or perspective-distorted, the caller supplies four points in the source image that define
/// known points in the barcode, so that the image may be sampled appropriately.</p>
/// *
/// <p>The last eight "from" parameters are four X/Y coordinate pairs of locations of points in
/// the image that define some significant points in the image to be sample. For example,
/// these may be the location of finder pattern in a QR Code.</p>
/// *
/// <p>The first eight "to" parameters are four X/Y coordinate pairs measured in the destination
/// {@link BitMatrix}, from the top left, where the known points in the image given by the "from" parameters
/// map to.</p>
/// *
/// <p>These 16 parameters define the transformation needed to sample the image.</p>
/// *
/// </summary>
/// <param name="image">image to sample
/// </param>
/// <param name="dimension">width/height of {@link BitMatrix} to sample from iamge
/// </param>
/// <returns> {@link BitMatrix} representing a grid of points sampled from the image within a region
/// defined by the "from" parameters
/// @throws ReaderException if image can't be sampled, for example, if the transformation defined by
/// the given points is invalid or results in sampling outside the image boundaries
///
/// </returns>
public abstract BitMatrix sampleGrid(MonochromeBitmapSource image, int dimension, float p1ToX, float p1ToY, float p2ToX, float p2ToY, float p3ToX, float p3ToY, float p4ToX, float p4ToY, float p1FromX, float p1FromY, float p2FromX, float p2FromY, float p3FromX, float p3FromY, float p4FromX, float p4FromY);
/// <summary> <p>Checks a set of points that have been transformed to sample points on an image against
/// the image's dimensions to see if the point are even within the image.</p>
/// *
/// <p>This method will actually "nudge" the endpoints back onto the image if they are found to be barely
/// (less than 1 pixel) off the image. This accounts for imperfect detection of finder patterns in an image
/// where the QR Code runs all the way to the image border.</p>
/// *
/// <p>For efficiency, the method will check points from either end of the line until one is found
/// to be within the image. Because the set of points are assumed to be linear, this is valid.</p>
/// *
/// </summary>
/// <param name="image">image into which the points should map
/// </param>
/// <param name="points">actual points in x1,y1,...,xn,yn form
/// @throws ReaderException if an endpoint is lies outside the image boundaries
///
/// </param>
protected internal static void checkAndNudgePoints(MonochromeBitmapSource image, float[] points)
{
int width = image.getWidth();
int height = image.getHeight();
// Check and nudge points from start until we see some that are OK:
bool nudged = true;
for (int offset = 0; offset < points.Length && nudged; offset += 2)
{
int x = (int)points[offset];
int y = (int)points[offset + 1];
if (x < -1 || x > width || y < -1 || y > height)
{
throw new ReaderException("");
}
nudged = false;
if (x == -1)
{
points[offset] = 0.0f;
nudged = true;
}
else if (x == width)
{
points[offset] = width - 1;
nudged = true;
}
if (y == -1)
{
points[offset + 1] = 0.0f;
nudged = true;
}
else if (y == height)
{
points[offset + 1] = height - 1;
nudged = true;
}
}
// Check and nudge points from end:
nudged = true;
for (int offset = points.Length - 2; offset >= 0 && nudged; offset -= 2)
{
int x = (int)points[offset];
int y = (int)points[offset + 1];
if (x < -1 || x > width || y < -1 || y > height)
{
throw new ReaderException("");
}
nudged = false;
if (x == -1)
{
points[offset] = 0.0f;
nudged = true;
}
else if (x == width)
{
points[offset] = width - 1;
nudged = true;
}
if (y == -1)
{
points[offset + 1] = 0.0f;
nudged = true;
}
else if (y == height)
{
points[offset + 1] = height - 1;
nudged = true;
}
}
}
/// <summary> <p>Samples an image for a square matrix of bits of the given dimension. This is used to extract the
/// black/white modules of a 2D barcode like a QR Code found in an image. Because this barcode may be
/// rotated or perspective-distorted, the caller supplies four points in the source image that define
/// known points in the barcode, so that the image may be sampled appropriately.</p>
/// *
/// <p>The last eight "from" parameters are four X/Y coordinate pairs of locations of points in
/// the image that define some significant points in the image to be sample. For example,
/// these may be the location of finder pattern in a QR Code.</p>
/// *
/// <p>The first eight "to" parameters are four X/Y coordinate pairs measured in the destination
/// {@link BitMatrix}, from the top left, where the known points in the image given by the "from" parameters
/// map to.</p>
/// *
/// <p>These 16 parameters define the transformation needed to sample the image.</p>
/// *
/// </summary>
/// <param name="image">image to sample
/// </param>
/// <param name="dimension">width/height of {@link BitMatrix} to sample from iamge
/// </param>
/// <returns> {@link BitMatrix} representing a grid of points sampled from the image within a region
/// defined by the "from" parameters
/// @throws ReaderException if image can't be sampled, for example, if the transformation defined by
/// the given points is invalid or results in sampling outside the image boundaries
///
/// </returns>
public abstract BitMatrix sampleGrid(MonochromeBitmapSource image, int dimension, float p1ToX, float p1ToY, float p2ToX, float p2ToY, float p3ToX, float p3ToY, float p4ToX, float p4ToY, float p1FromX, float p1FromY, float p2FromX, float p2FromY, float p3FromX, float p3FromY, float p4FromX, float p4FromY);
