Fuzzy search for subimage within image. Tolerates color drift and bad pixels.
npm install imagesearch
var pngparse = require('pngparse');
var imagesearch = require('imagesearch');
pngparse.parseFile('image.png', function (error, image) {
pngparse.parseFile('template.png', function (error, template) {
imagesearch(image, template, function (error, results) {
console.log(results);
});
});
})
imagesearch(image, template, [options], callback);
Image object should have the following example structure:
{
width: 10,
height: 10,
channels: 3,
data: <Buffer ff ff ff ...>
}
where
width
Number - image widthheight
Number - image heightchannels
Number - optional, number of color channels in an image, possible values: 1-4data
Buffer - image pixel data
Property channels
is optional and is only used for data
length validation.
Property data
should be of type buffer with pixel data arranged from top-leftmost to bottom-rightmost pixel. Possible channel orders are listed bellow:
- K (grayscale)
- KA (grayscale + alpha)
- RGB
- RGBA
For example, let's say we have a 2x2 pixel image with red background and blue pixel on the bottom left corner. So the data buffer would look like this:
<Buffer ff 00 00 ff 00 00 00 00 ff ff 00 00>
For added convenience the image object is compatible with the object returned by pngparse module as shown in the usage example above. The structure of this image object is similar to HTML5 Canvas ImageData object.
Two options are supported:
colorTolerance
Number - the maximum range in color difference between two matched pixels to constitute a match.pixelTolerance
Number - the number of not matching (bad) pixels to ignore and treat subimage as still matching.
Options colorTolerance
and pixelTolerance
can be used together.
Option colorTolerance
is combined for all color channels. For example, if colorTolerance == 10
, then the difference for R channel can be 6, G - 4, and B should match exactly, for the pixel color to be treated as matching.
The callback function receives an array of result objects. If there were no matches of the subimage within the template, the result array will be empty. The result object has 3 properties: x
, y
, and accuracy
. The later doesn't bear any strict meaning and is only used for ordinal comparison. The smaller the accuracy
value, the more accurate the match between the template and the subimage is.
Example:
{ x: 2, y: 2, accuracy: 0 }
Image pixel comparison requires a lot of steps of algebraic computation which spawns large loops of few small number operations for each step. JavaScript doesn't have native SIMD support, although there are signs of promising initiatives and the situation can change eventually. As of today, there's no other way to speed things up as to use native bindings to some algebra library that supports vectorization. Since the image data can be expressed as a matrix, Eigen C++ template library is used in this project.
- Various contributions and pull requests are welcome.
- Addon code review and improvement from experienced C++ developers and mathematicians is especially welcome.
ISC