image-js 1.0.0-alpha.3 → 1.1.0

package/lib/featureMatching/matching/filterEuclideanDistance.js

@@ -0,0 +1,42 @@
+/**
+ * Use this function to only keep the match from source to destination with
+ * the smallest distance (score) for each destination keypoint.
+ * @param matches - Matches from source to destination.
+ * @param sourceKeypoints - Source keypoints.
+ * @param destinationKeypoints - Destination keypoints.
+ * @param options - Filter smallest distance matches options.
+ * @returns Only the matches from source to destination with the smallest distance.
+ */
+export function filterEuclideanDistance(matches, sourceKeypoints, destinationKeypoints, options = {}) {
+    const { origin = { column: 0, row: 0 } } = options;
+    const sorted = matches.slice();
+    sorted.sort((a, b) => a.destinationIndex - b.destinationIndex);
+    const result = [];
+    let sameDestMatches = [];
+    let currentIndex = sorted[0].destinationIndex;
+    for (const match of sorted) {
+        if (match.destinationIndex === currentIndex) {
+            sameDestMatches.push(match);
+        }
+        else {
+            sameDestMatches.sort((a, b) => distanceSquared(a) - distanceSquared(b));
+            result.push(...sameDestMatches.slice(0, 1));
+            currentIndex = match.destinationIndex;
+            sameDestMatches = [match];
+        }
+    }
+    sameDestMatches.sort((a, b) => distanceSquared(a) - distanceSquared(b));
+    result.push(...sameDestMatches.slice(0, 1));
+    return result;
+    function distanceSquared(match) {
+        return ((sourceKeypoints[match.sourceIndex].origin.row -
+            (destinationKeypoints[match.destinationIndex].origin.row -
+                origin.row)) **
+            2 +
+            (sourceKeypoints[match.sourceIndex].origin.column -
+                destinationKeypoints[match.destinationIndex].origin.column -
+                origin.column) **
+                2);
+    }
+}
+//# sourceMappingURL=filterEuclideanDistance.js.map

package/lib/featureMatching/matching/filterEuclideanDistance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filterEuclideanDistance.js","sourceRoot":"","sources":["../../../src/featureMatching/matching/filterEuclideanDistance.ts"],"names":[],"mappings":"AAaA;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CACrC,OAAgB,EAChB,eAA+B,EAC/B,oBAAoC,EACpC,UAAiD,EAAE;IAEnD,MAAM,EAAE,MAAM,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC;IAEnD,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,gBAAgB,CAAC,CAAC;IAE/D,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,IAAI,eAAe,GAAY,EAAE,CAAC;IAClC,IAAI,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC;IAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,gBAAgB,KAAK,YAAY,EAAE,CAAC;YAC5C,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;YACxE,MAAM,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAE5C,YAAY,GAAG,KAAK,CAAC,gBAAgB,CAAC;YACtC,eAAe,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IACD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5C,OAAO,MAAM,CAAC;IAEd,SAAS,eAAe,CAAC,KAAY;QACnC,OAAO,CACL,CAAC,eAAe,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,GAAG;YAC5C,CAAC,oBAAoB,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,MAAM,CAAC,GAAG;gBACtD,MAAM,CAAC,GAAG,CAAC,CAAC;YACd,CAAC;YACH,CAAC,eAAe,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,MAAM;gBAC/C,oBAAoB,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,MAAM,CAAC,MAAM;gBAC1D,MAAM,CAAC,MAAM,CAAC;gBACd,CAAC,CACJ,CAAC;IACJ,CAAC;AACH,CAAC"}

package/lib/featureMatching/matching/filterSmallestDistanceMatches.d.ts

@@ -0,0 +1,9 @@
+import type { Match } from './bruteForceMatch.js';
+/**
+ * Use this function to only keep the match from source to destination with
+ * the smallest distance (score) for each destination keypoint.
+ * @param matches - Matches from source to destination.
+ * @returns Only the matches from source to destination with the smallest distance.
+ */
+export declare function filterSmallestDistanceMatches(matches: Match[]): Match[];
+//# sourceMappingURL=filterSmallestDistanceMatches.d.ts.map

package/lib/featureMatching/matching/filterSmallestDistanceMatches.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filterSmallestDistanceMatches.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/matching/filterSmallestDistanceMatches.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAElD;;;;;GAKG;AACH,wBAAgB,6BAA6B,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAqBvE"}

package/lib/featureMatching/matching/filterSmallestDistanceMatches.js

@@ -0,0 +1,28 @@
+/**
+ * Use this function to only keep the match from source to destination with
+ * the smallest distance (score) for each destination keypoint.
+ * @param matches - Matches from source to destination.
+ * @returns Only the matches from source to destination with the smallest distance.
+ */
+export function filterSmallestDistanceMatches(matches) {
+    const sorted = matches.slice();
+    sorted.sort((a, b) => a.destinationIndex - b.destinationIndex);
+    const result = [];
+    let sameDestMatches = [];
+    let currentIndex = sorted[0].destinationIndex;
+    for (const match of sorted) {
+        if (match.destinationIndex === currentIndex) {
+            sameDestMatches.push(match);
+        }
+        else {
+            sameDestMatches.sort((a, b) => a.distance - b.distance);
+            result.push(...sameDestMatches.slice(0, 1));
+            currentIndex = match.destinationIndex;
+            sameDestMatches = [match];
+        }
+    }
+    sameDestMatches.sort((a, b) => a.distance - b.distance);
+    result.push(...sameDestMatches.slice(0, 1));
+    return result;
+}
+//# sourceMappingURL=filterSmallestDistanceMatches.js.map

package/lib/featureMatching/matching/filterSmallestDistanceMatches.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filterSmallestDistanceMatches.js","sourceRoot":"","sources":["../../../src/featureMatching/matching/filterSmallestDistanceMatches.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,MAAM,UAAU,6BAA6B,CAAC,OAAgB;IAC5D,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,gBAAgB,CAAC,CAAC;IAE/D,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,IAAI,eAAe,GAAY,EAAE,CAAC;IAClC,IAAI,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC;IAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,gBAAgB,KAAK,YAAY,EAAE,CAAC;YAC5C,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;YACxD,MAAM,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAE5C,YAAY,GAAG,KAAK,CAAC,gBAAgB,CAAC;YACtC,eAAe,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IACD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IACxD,MAAM,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5C,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/lib/featureMatching/matching/getCrosscheckMatches.d.ts

@@ -0,0 +1,19 @@
+import type { BriefDescriptor } from '../descriptors/getBriefDescriptors.js';
+import type { Match } from './bruteForceMatch.js';
+/**
+ * Get the crosscheck matches from the source and destination descriptors.
+ * @param source - Source descriptors.
+ * @param destination - Destination descriptors.
+ * @returns The array of crossckeck matches.
+ */
+export declare function getCrosscheckMatches(source: BriefDescriptor[], destination: BriefDescriptor[]): Match[];
+/**
+ * Return the indices of pairs the keypoints that are mutually the best match.
+ * This means that if B is the best match for A, A should be the best match for B.
+ * The distance of the resulting matches is the maximum distance between the two.
+ * @param srcDstMatches - Best matches computed from source do destination.
+ * @param dstSrcMatches - Best matches computed from destination to source.
+ * @returns The pairs of keypoints that are mutually the best match.
+ */
+export declare function crosscheck(srcDstMatches: Match[], dstSrcMatches: Match[]): Match[];
+//# sourceMappingURL=getCrosscheckMatches.d.ts.map

package/lib/featureMatching/matching/getCrosscheckMatches.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"getCrosscheckMatches.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/matching/getCrosscheckMatches.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uCAAuC,CAAC;AAM7E,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAGlD;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,eAAe,EAAE,EACzB,WAAW,EAAE,eAAe,EAAE,GAC7B,KAAK,EAAE,CAKT;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CACxB,aAAa,EAAE,KAAK,EAAE,EACtB,aAAa,EAAE,KAAK,EAAE,GACrB,KAAK,EAAE,CAgCT"}

package/lib/featureMatching/matching/getCrosscheckMatches.js

@@ -0,0 +1,55 @@
+import { sortByDestSource, sortBySourceDest, } from '../utils/sortBySourceDest.js';
+import { bruteForceOneMatch } from './bruteForceMatch.js';
+/**
+ * Get the crosscheck matches from the source and destination descriptors.
+ * @param source - Source descriptors.
+ * @param destination - Destination descriptors.
+ * @returns The array of crossckeck matches.
+ */
+export function getCrosscheckMatches(source, destination) {
+    const srcMatches = bruteForceOneMatch(source, destination);
+    const dstMatches = bruteForceOneMatch(destination, source);
+    return crosscheck(srcMatches, dstMatches);
+}
+/**
+ * Return the indices of pairs the keypoints that are mutually the best match.
+ * This means that if B is the best match for A, A should be the best match for B.
+ * The distance of the resulting matches is the maximum distance between the two.
+ * @param srcDstMatches - Best matches computed from source do destination.
+ * @param dstSrcMatches - Best matches computed from destination to source.
+ * @returns The pairs of keypoints that are mutually the best match.
+ */
+export function crosscheck(srcDstMatches, dstSrcMatches) {
+    const result = [];
+    const sortedSrcDst = sortBySourceDest(srcDstMatches);
+    const sortedDstSrc = sortByDestSource(dstSrcMatches);
+    let pointer1 = 0;
+    let pointer2 = 0;
+    while (pointer1 < sortedSrcDst.length && pointer2 < sortedDstSrc.length) {
+        const match1 = sortedSrcDst[pointer1];
+        const match2 = sortedDstSrc[pointer2];
+        if (match1.sourceIndex > match2.destinationIndex) {
+            pointer2++;
+        }
+        else if (match1.sourceIndex < match2.destinationIndex) {
+            pointer1++;
+        }
+        else if (match1.destinationIndex > match2.sourceIndex) {
+            pointer2++;
+        }
+        else if (match1.destinationIndex < match2.sourceIndex) {
+            pointer1++;
+        }
+        else {
+            result.push({
+                distance: Math.max(match1.distance, match2.distance),
+                sourceIndex: match1.sourceIndex,
+                destinationIndex: match1.destinationIndex,
+            });
+            pointer1++;
+            pointer2++;
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=getCrosscheckMatches.js.map

package/lib/featureMatching/matching/getCrosscheckMatches.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getCrosscheckMatches.js","sourceRoot":"","sources":["../../../src/featureMatching/matching/getCrosscheckMatches.ts"],"names":[],"mappings":"AACA,OAAO,EACL,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,8BAA8B,CAAC;AAGtC,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAyB,EACzB,WAA8B;IAE9B,MAAM,UAAU,GAAG,kBAAkB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC3D,MAAM,UAAU,GAAG,kBAAkB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAE3D,OAAO,UAAU,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;AAC5C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CACxB,aAAsB,EACtB,aAAsB;IAEtB,MAAM,MAAM,GAAY,EAAE,CAAC;IAE3B,MAAM,YAAY,GAAG,gBAAgB,CAAC,aAAa,CAAC,CAAC;IACrD,MAAM,YAAY,GAAG,gBAAgB,CAAC,aAAa,CAAC,CAAC;IAErD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,OAAO,QAAQ,GAAG,YAAY,CAAC,MAAM,IAAI,QAAQ,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACxE,MAAM,MAAM,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QAEtC,IAAI,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;YACjD,QAAQ,EAAE,CAAC;QACb,CAAC;aAAM,IAAI,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;YACxD,QAAQ,EAAE,CAAC;QACb,CAAC;aAAM,IAAI,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACxD,QAAQ,EAAE,CAAC;QACb,CAAC;aAAM,IAAI,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACxD,QAAQ,EAAE,CAAC;QACb,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC;gBACV,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC;gBACpD,WAAW,EAAE,MAAM,CAAC,WAAW;gBAC/B,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;aAC1C,CAAC,CAAC;YACH,QAAQ,EAAE,CAAC;YACX,QAAQ,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/lib/featureMatching/matching/getHammingDistance.d.ts

@@ -0,0 +1,10 @@
+import type { BriefDescriptor } from '../descriptors/getBriefDescriptors.js';
+/**
+ * Compute the Hamming distance between two bit strings.
+ * @see {@link https://en.wikipedia.org/wiki/Hamming_distance}
+ * @param descriptor1 - First bit string.
+ * @param descriptor2 - Second bit string.
+ * @returns The Hamming distance.
+ */
+export declare function getHammingDistance(descriptor1: BriefDescriptor, descriptor2: BriefDescriptor): number;
+//# sourceMappingURL=getHammingDistance.d.ts.map

package/lib/featureMatching/matching/getHammingDistance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"getHammingDistance.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/matching/getHammingDistance.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uCAAuC,CAAC;AAE7E;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,WAAW,EAAE,eAAe,EAC5B,WAAW,EAAE,eAAe,GAC3B,MAAM,CAOR"}

package/lib/featureMatching/matching/getHammingDistance.js

@@ -0,0 +1,15 @@
+/**
+ * Compute the Hamming distance between two bit strings.
+ * @see {@link https://en.wikipedia.org/wiki/Hamming_distance}
+ * @param descriptor1 - First bit string.
+ * @param descriptor2 - Second bit string.
+ * @returns The Hamming distance.
+ */
+export function getHammingDistance(descriptor1, descriptor2) {
+    let sum = 0;
+    for (let i = 0; i < descriptor1.length; i++) {
+        sum += descriptor1[i] ^ descriptor2[i];
+    }
+    return sum;
+}
+//# sourceMappingURL=getHammingDistance.js.map

package/lib/featureMatching/matching/getHammingDistance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getHammingDistance.js","sourceRoot":"","sources":["../../../src/featureMatching/matching/getHammingDistance.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,WAA4B,EAC5B,WAA4B;IAE5B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

package/lib/featureMatching/utils/checkBorderDistance.d.ts

@@ -0,0 +1,11 @@
+import type { Image } from '../../Image.js';
+import type { Point } from '../../geometry/index.js';
+/**
+ * Check that a point is not too close to the border of the image.
+ * @param image - Image to process.
+ * @param point - The interest point.
+ * @param distance - The minimum distance to the border required.
+ * @returns Whether the point is far enough from the border.
+ */
+export declare function checkBorderDistance(image: Image, point: Point, distance: number): boolean;
+//# sourceMappingURL=checkBorderDistance.d.ts.map

package/lib/featureMatching/utils/checkBorderDistance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"checkBorderDistance.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/utils/checkBorderDistance.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAC;AAErD;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,KAAK,EACZ,KAAK,EAAE,KAAK,EACZ,QAAQ,EAAE,MAAM,GACf,OAAO,CAOT"}

package/lib/featureMatching/utils/checkBorderDistance.js

@@ -0,0 +1,14 @@
+/**
+ * Check that a point is not too close to the border of the image.
+ * @param image - Image to process.
+ * @param point - The interest point.
+ * @param distance - The minimum distance to the border required.
+ * @returns Whether the point is far enough from the border.
+ */
+export function checkBorderDistance(image, point, distance) {
+    return (point.column >= distance &&
+        point.row >= distance &&
+        image.width - point.column > distance &&
+        image.height - point.row > distance);
+}
+//# sourceMappingURL=checkBorderDistance.js.map

package/lib/featureMatching/utils/checkBorderDistance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"checkBorderDistance.js","sourceRoot":"","sources":["../../../src/featureMatching/utils/checkBorderDistance.ts"],"names":[],"mappings":"AAGA;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAY,EACZ,KAAY,EACZ,QAAgB;IAEhB,OAAO,CACL,KAAK,CAAC,MAAM,IAAI,QAAQ;QACxB,KAAK,CAAC,GAAG,IAAI,QAAQ;QACrB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,QAAQ;QACrC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,GAAG,QAAQ,CACpC,CAAC;AACJ,CAAC"}

package/lib/featureMatching/utils/compareIntensity.d.ts

@@ -0,0 +1,19 @@
+import type { Image } from '../../Image.js';
+import type { Point } from '../../geometry/index.js';
+export interface CompareIntensityOptions {
+    /**
+     * Origin of the points coordinates relative to the top-left corner.
+     * @default `image.getCoordinates('center')`
+     */
+    origin?: Point;
+}
+/**
+ * Compare the intensity of two pixels of a GREY image.
+ * @param image - Source image of the pixels.
+ * @param p1 - First point.
+ * @param p2 - Second point.
+ * @param options - Options.
+ * @returns Wether p1 is darker that p2.
+ */
+export declare function compareIntensity(image: Image, p1: Point, p2: Point, options?: CompareIntensityOptions): boolean;
+//# sourceMappingURL=compareIntensity.d.ts.map

package/lib/featureMatching/utils/compareIntensity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compareIntensity.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/utils/compareIntensity.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAC;AAGrD,MAAM,WAAW,uBAAuB;IACtC;;;OAGG;IACH,MAAM,CAAC,EAAE,KAAK,CAAC;CAChB;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,KAAK,EACZ,EAAE,EAAE,KAAK,EACT,EAAE,EAAE,KAAK,EACT,OAAO,GAAE,uBAA4B,GACpC,OAAO,CAST"}

package/lib/featureMatching/utils/compareIntensity.js

@@ -0,0 +1,18 @@
+import { sum } from '../../utils/geometry/points.js';
+/**
+ * Compare the intensity of two pixels of a GREY image.
+ * @param image - Source image of the pixels.
+ * @param p1 - First point.
+ * @param p2 - Second point.
+ * @param options - Options.
+ * @returns Wether p1 is darker that p2.
+ */
+export function compareIntensity(image, p1, p2, options = {}) {
+    const { origin = image.getCoordinates('center') } = options;
+    const absoluteP1 = sum(p1, origin);
+    const absoluteP2 = sum(p2, origin);
+    const intensity1 = image.getValueByPoint(absoluteP1, 0);
+    const intensity2 = image.getValueByPoint(absoluteP2, 0);
+    return intensity1 < intensity2;
+}
+//# sourceMappingURL=compareIntensity.js.map

package/lib/featureMatching/utils/compareIntensity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compareIntensity.js","sourceRoot":"","sources":["../../../src/featureMatching/utils/compareIntensity.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,GAAG,EAAE,MAAM,gCAAgC,CAAC;AAUrD;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAY,EACZ,EAAS,EACT,EAAS,EACT,UAAmC,EAAE;IAErC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,GAAG,OAAO,CAAC;IAE5D,MAAM,UAAU,GAAG,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACnC,MAAM,UAAU,GAAG,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACnC,MAAM,UAAU,GAAG,KAAK,CAAC,eAAe,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IACxD,MAAM,UAAU,GAAG,KAAK,CAAC,eAAe,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAExD,OAAO,UAAU,GAAG,UAAU,CAAC;AACjC,CAAC"}

package/lib/featureMatching/utils/extractSquareImage.d.ts

@@ -0,0 +1,11 @@
+import type { Image } from '../../Image.js';
+import type { Point } from '../../geometry/index.js';
+/**
+ * Crop the source image to given dimensions around the origin.
+ * @param image - Source image.
+ * @param origin - Center point for the crop.
+ * @param patchSize - Size of the returned image.
+ * @returns The square image around the origin extracted from the source image.
+ */
+export declare function extractSquareImage(image: Image, origin: Point, patchSize: number): Image;
+//# sourceMappingURL=extractSquareImage.d.ts.map

package/lib/featureMatching/utils/extractSquareImage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"extractSquareImage.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/utils/extractSquareImage.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAC;AAErD;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,KAAK,EACb,SAAS,EAAE,MAAM,GAChB,KAAK,CAYP"}

package/lib/featureMatching/utils/extractSquareImage.js

@@ -0,0 +1,20 @@
+/**
+ * Crop the source image to given dimensions around the origin.
+ * @param image - Source image.
+ * @param origin - Center point for the crop.
+ * @param patchSize - Size of the returned image.
+ * @returns The square image around the origin extracted from the source image.
+ */
+export function extractSquareImage(image, origin, patchSize) {
+    const cropOffset = (patchSize - 1) / 2;
+    const cropOrigin = {
+        column: origin.column - cropOffset,
+        row: origin.row - cropOffset,
+    };
+    return image.crop({
+        origin: cropOrigin,
+        width: patchSize,
+        height: patchSize,
+    });
+}
+//# sourceMappingURL=extractSquareImage.js.map

package/lib/featureMatching/utils/extractSquareImage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"extractSquareImage.js","sourceRoot":"","sources":["../../../src/featureMatching/utils/extractSquareImage.ts"],"names":[],"mappings":"AAGA;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAY,EACZ,MAAa,EACb,SAAiB;IAEjB,MAAM,UAAU,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACvC,MAAM,UAAU,GAAG;QACjB,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,UAAU;QAClC,GAAG,EAAE,MAAM,CAAC,GAAG,GAAG,UAAU;KAC7B,CAAC;IAEF,OAAO,KAAK,CAAC,IAAI,CAAC;QAChB,MAAM,EAAE,UAAU;QAClB,KAAK,EAAE,SAAS;QAChB,MAAM,EAAE,SAAS;KAClB,CAAC,CAAC;AACL,CAAC"}

package/lib/featureMatching/utils/getColors.d.ts

@@ -0,0 +1,11 @@
+import type { Image } from '../../Image.js';
+import type { GetColorsOptions } from '../featureMatching.types.js';
+/**
+ * Generate an array of colors to draw the keypoints depending on their score or the matches depending on the distance.
+ * @param image - The source image.
+ * @param baseColor - The desired shade for the colors.
+ * @param options - Get score colors options.
+ * @returns Array of colors.
+ */
+export declare function getColors(image: Image, baseColor: number[], options?: GetColorsOptions): number[][];
+//# sourceMappingURL=getColors.d.ts.map

package/lib/featureMatching/utils/getColors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"getColors.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/utils/getColors.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAE5C,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAEpE;;;;;;GAMG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,KAAK,EACZ,SAAS,EAAE,MAAM,EAAE,EACnB,OAAO,GAAE,gBAAqB,GAC7B,MAAM,EAAE,EAAE,CAkBZ"}

package/lib/featureMatching/utils/getColors.js

@@ -0,0 +1,25 @@
+import { getClampFromTo } from '../../utils/clamp.js';
+/**
+ * Generate an array of colors to draw the keypoints depending on their score or the matches depending on the distance.
+ * @param image - The source image.
+ * @param baseColor - The desired shade for the colors.
+ * @param options - Get score colors options.
+ * @returns Array of colors.
+ */
+export function getColors(image, baseColor, options = {}) {
+    const { nbShades = 6, minValueFactor = 0.2 } = options;
+    const maxValue = Math.max(...baseColor);
+    const minValue = maxValue * minValueFactor;
+    const interval = Math.floor((maxValue - minValue) / (nbShades - 1));
+    const clamp = getClampFromTo(0, image.maxValue);
+    const colors = [];
+    for (let i = 0; i < nbShades; i++) {
+        const color = [];
+        for (const channel of baseColor) {
+            color.push(clamp(channel - i * interval));
+        }
+        colors.push(color);
+    }
+    return colors;
+}
+//# sourceMappingURL=getColors.js.map

package/lib/featureMatching/utils/getColors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getColors.js","sourceRoot":"","sources":["../../../src/featureMatching/utils/getColors.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAGtD;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CACvB,KAAY,EACZ,SAAmB,EACnB,UAA4B,EAAE;IAE9B,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAE,cAAc,GAAG,GAAG,EAAE,GAAG,OAAO,CAAC;IACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IACxC,MAAM,QAAQ,GAAG,QAAQ,GAAG,cAAc,CAAC;IAE3C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IAEhD,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,KAAK,MAAM,OAAO,IAAI,SAAS,EAAE,CAAC;YAChC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/lib/featureMatching/utils/getGaussianPoints.d.ts

@@ -0,0 +1,23 @@
+import type { Point } from '../../geometry/index.js';
+import type { GetGaussianPointsOptions } from '../../utils/utils.types.js';
+/**
+ * Get the coordinates of random points inside of the given dimensions, spread with a
+ * gaussian distribution around the center of the dimensions.
+ * The reference point with coordinates (0,0) is the center of the patch.
+ * @param width - Width in which the points should be.
+ * @param height - Height in which the points should be.
+ * @param options - Get gaussian points options.
+ * @returns An array of random points with a gaussian distribution.
+ */
+export declare function getGaussianPoints(width: number, height: number, options?: GetGaussianPointsOptions): Point[];
+/**
+ * Generate an array of values
+ * that follow a gaussian distribution with a mean value of zero.
+ * @param size - Specifies the width of the gaussian distribution.
+ * @param seed - Seed for the random generator.
+ * @param nbValues - Number of values wanted.
+ * @param sigma - The standard deviation. The default value is the optimal SD for BRIEF.
+ * @returns Array of values with gaussian distribution.
+ */
+export declare function getGaussianValues(size: number, seed: number, nbValues: number, sigma?: number): Float64Array;
+//# sourceMappingURL=getGaussianPoints.d.ts.map

package/lib/featureMatching/utils/getGaussianPoints.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"getGaussianPoints.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/utils/getGaussianPoints.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAC;AAErD,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAE3E;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,wBAA6B,GACrC,KAAK,EAAE,CAYT;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,MAAM,EAChB,KAAK,SAAW,GACf,YAAY,CAgBd"}

package/lib/featureMatching/utils/getGaussianPoints.js

@@ -0,0 +1,46 @@
+import { createRandomArray } from 'ml-spectra-processing';
+import { getClampFromTo } from '../../utils/clamp.js';
+/**
+ * Get the coordinates of random points inside of the given dimensions, spread with a
+ * gaussian distribution around the center of the dimensions.
+ * The reference point with coordinates (0,0) is the center of the patch.
+ * @param width - Width in which the points should be.
+ * @param height - Height in which the points should be.
+ * @param options - Get gaussian points options.
+ * @returns An array of random points with a gaussian distribution.
+ */
+export function getGaussianPoints(width, height, options = {}) {
+    const { nbPoints = 1024, xSeed = 0, ySeed = 1, sigma } = options;
+    const xCoordinates = getGaussianValues(width, xSeed, nbPoints, sigma);
+    const yCoordinates = getGaussianValues(height, ySeed, nbPoints, sigma);
+    const points = [];
+    for (let i = 0; i < nbPoints; i++) {
+        points.push({ column: xCoordinates[i], row: yCoordinates[i] });
+    }
+    return points;
+}
+/**
+ * Generate an array of values
+ * that follow a gaussian distribution with a mean value of zero.
+ * @param size - Specifies the width of the gaussian distribution.
+ * @param seed - Seed for the random generator.
+ * @param nbValues - Number of values wanted.
+ * @param sigma - The standard deviation. The default value is the optimal SD for BRIEF.
+ * @returns Array of values with gaussian distribution.
+ */
+export function getGaussianValues(size, seed, nbValues, sigma = size / 5) {
+    const width = (size - 1) / 2;
+    const array = createRandomArray({
+        distribution: 'normal',
+        seed,
+        length: nbValues,
+        standardDeviation: sigma,
+        mean: 0,
+    });
+    const clamp = getClampFromTo(-width, width);
+    return array.map((value) => {
+        const rounded = Math.round(value);
+        return clamp(rounded);
+    });
+}
+//# sourceMappingURL=getGaussianPoints.js.map

package/lib/featureMatching/utils/getGaussianPoints.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getGaussianPoints.js","sourceRoot":"","sources":["../../../src/featureMatching/utils/getGaussianPoints.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAG1D,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAGtD;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAa,EACb,MAAc,EACd,UAAoC,EAAE;IAEtC,MAAM,EAAE,QAAQ,GAAG,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;IAEjE,MAAM,YAAY,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;IACtE,MAAM,YAAY,GAAG,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;IAEvE,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACjE,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,IAAY,EACZ,IAAY,EACZ,QAAgB,EAChB,KAAK,GAAG,IAAI,GAAG,CAAC;IAEhB,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAE7B,MAAM,KAAK,GAAG,iBAAiB,CAAC;QAC9B,YAAY,EAAE,QAAQ;QACtB,IAAI;QACJ,MAAM,EAAE,QAAQ;QAChB,iBAAiB,EAAE,KAAK;QACxB,IAAI,EAAE,CAAC;KACR,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAE5C,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC"}

package/lib/featureMatching/utils/getKeypointColor.d.ts

@@ -0,0 +1,11 @@
+import type { FastKeypoint } from '../keypoints/getFastKeypoints.js';
+/**
+ * Get the shade the keypoint with given index should have (the color is an indicator
+ * of the score). The keypoints should be sorted with highest score first.
+ * @param keypoints - The sorted keypoints.
+ * @param index - Index of the keypoint.
+ * @param colors - The colors from which to pick (sorted from brightest to darkest).
+ * @returns The color the keypoint should have.
+ */
+export declare function getKeypointColor(keypoints: FastKeypoint[], index: number, colors: number[][]): number[];
+//# sourceMappingURL=getKeypointColor.d.ts.map

package/lib/featureMatching/utils/getKeypointColor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"getKeypointColor.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/utils/getKeypointColor.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kCAAkC,CAAC;AAErE;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,SAAS,EAAE,YAAY,EAAE,EACzB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EAAE,EAAE,GACjB,MAAM,EAAE,CAcV"}

package/lib/featureMatching/utils/getKeypointColor.js

@@ -0,0 +1,21 @@
+/**
+ * Get the shade the keypoint with given index should have (the color is an indicator
+ * of the score). The keypoints should be sorted with highest score first.
+ * @param keypoints - The sorted keypoints.
+ * @param index - Index of the keypoint.
+ * @param colors - The colors from which to pick (sorted from brightest to darkest).
+ * @returns The color the keypoint should have.
+ */
+export function getKeypointColor(keypoints, index, colors) {
+    const maxScore = keypoints[0].score;
+    const minScore = keypoints.at(-1).score;
+    if (minScore === maxScore) {
+        return colors[0];
+    }
+    const score = keypoints[index].score;
+    const colorIndex = colors.length -
+        1 -
+        Math.floor(((colors.length - 1) * (score - minScore)) / (maxScore - minScore));
+    return colors[colorIndex];
+}
+//# sourceMappingURL=getKeypointColor.js.map

package/lib/featureMatching/utils/getKeypointColor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getKeypointColor.js","sourceRoot":"","sources":["../../../src/featureMatching/utils/getKeypointColor.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC9B,SAAyB,EACzB,KAAa,EACb,MAAkB;IAElB,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACpC,MAAM,QAAQ,GAAI,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAkB,CAAC,KAAK,CAAC;IAC1D,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAC1B,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC;IACrC,MAAM,UAAU,GACd,MAAM,CAAC,MAAM;QACb,CAAC;QACD,IAAI,CAAC,KAAK,CACR,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,CACnE,CAAC;IACJ,OAAO,MAAM,CAAC,UAAU,CAAC,CAAC;AAC5B,CAAC"}

package/lib/featureMatching/utils/getMatchColor.d.ts

@@ -0,0 +1,11 @@
+import type { Match } from '../matching/bruteForceMatch.js';
+/**
+ * Get the shade of the match with given index (the color is an indicator
+ * of the distance). The matches should be sorted with smallest distance first.
+ * @param matches - The sorted keypoints.
+ * @param index - Index of the keypoint.
+ * @param colors - The colors from which to pick (sorted from brightest to darkest).
+ * @returns The color the keypoint should have.
+ */
+export declare function getMatchColor(matches: Match[], index: number, colors: number[][]): number[];
+//# sourceMappingURL=getMatchColor.d.ts.map

package/lib/featureMatching/utils/getMatchColor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"getMatchColor.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/utils/getMatchColor.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gCAAgC,CAAC;AAE5D;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,KAAK,EAAE,EAChB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EAAE,EAAE,GACjB,MAAM,EAAE,CAYV"}

package/lib/featureMatching/utils/getMatchColor.js

@@ -0,0 +1,20 @@
+/**
+ * Get the shade of the match with given index (the color is an indicator
+ * of the distance). The matches should be sorted with smallest distance first.
+ * @param matches - The sorted keypoints.
+ * @param index - Index of the keypoint.
+ * @param colors - The colors from which to pick (sorted from brightest to darkest).
+ * @returns The color the keypoint should have.
+ */
+export function getMatchColor(matches, index, colors) {
+    const maxDistance = matches.at(-1).distance;
+    const minDistance = matches[0].distance;
+    if (minDistance === maxDistance) {
+        return colors[0];
+    }
+    const distance = matches[index].distance;
+    const colorIndex = Math.floor(((colors.length - 1) * (distance - minDistance)) /
+        (maxDistance - minDistance));
+    return colors[colorIndex];
+}
+//# sourceMappingURL=getMatchColor.js.map

package/lib/featureMatching/utils/getMatchColor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getMatchColor.js","sourceRoot":"","sources":["../../../src/featureMatching/utils/getMatchColor.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,OAAgB,EAChB,KAAa,EACb,MAAkB;IAElB,MAAM,WAAW,GAAI,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAW,CAAC,QAAQ,CAAC;IACvD,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IACxC,IAAI,WAAW,KAAK,WAAW,EAAE,CAAC;QAChC,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC;IACzC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAC3B,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,WAAW,CAAC,CAAC;QAC9C,CAAC,WAAW,GAAG,WAAW,CAAC,CAC9B,CAAC;IACF,OAAO,MAAM,CAAC,UAAU,CAAC,CAAC;AAC5B,CAAC"}

package/lib/featureMatching/utils/sortByDistance.d.ts

@@ -0,0 +1,8 @@
+import type { Match } from '../matching/bruteForceMatch.js';
+/**
+ * Source array of matches by ascending distance.
+ * @param matches - Array of matches to sort.
+ * @returns Sorted copy of the array of matches.
+ */
+export declare function sortByDistance(matches: Match[]): Match[];
+//# sourceMappingURL=sortByDistance.d.ts.map

package/lib/featureMatching/utils/sortByDistance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sortByDistance.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/utils/sortByDistance.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gCAAgC,CAAC;AAE5D;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAMxD"}

package/lib/featureMatching/utils/sortByDistance.js

@@ -0,0 +1,13 @@
+/**
+ * Source array of matches by ascending distance.
+ * @param matches - Array of matches to sort.
+ * @returns Sorted copy of the array of matches.
+ */
+export function sortByDistance(matches) {
+    const sorted = matches.slice();
+    sorted.sort((match1, match2) => {
+        return match1.distance - match2.distance;
+    });
+    return sorted;
+}
+//# sourceMappingURL=sortByDistance.js.map

package/lib/featureMatching/utils/sortByDistance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sortByDistance.js","sourceRoot":"","sources":["../../../src/featureMatching/utils/sortByDistance.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,OAAgB;IAC7C,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE;QAC7B,OAAO,MAAM,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;IAC3C,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/lib/featureMatching/utils/sortBySourceDest.d.ts

@@ -0,0 +1,14 @@
+import type { Match } from '../matching/bruteForceMatch.js';
+/**
+ * Sort array of matches by source index and then destination index.
+ * @param matches - Array of matches to sort.
+ * @returns Sorted copy of the array of matches.
+ */
+export declare function sortBySourceDest(matches: Match[]): Match[];
+/**
+ * Sort array of matches by destination index and then source index.
+ * @param matches - Array of matches to sort.
+ * @returns Sorted copy of the array of matches.
+ */
+export declare function sortByDestSource(matches: Match[]): Match[];
+//# sourceMappingURL=sortBySourceDest.d.ts.map

package/lib/featureMatching/utils/sortBySourceDest.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sortBySourceDest.d.ts","sourceRoot":"","sources":["../../../src/featureMatching/utils/sortBySourceDest.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gCAAgC,CAAC;AAE5D;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAQ1D;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAQ1D"}