@srsergio/taptapp-ar 1.0.86 → 1.0.87

package/dist/core/matching/matching.js

@@ -3,8 +3,6 @@ import { compute as hammingCompute } from "./hamming-distance.js";
 import { computeHoughMatches } from "./hough.js";
 import { computeHomography } from "./ransacHomography.js";
 import { multiplyPointHomographyInhomogenous, matrixInverse33 } from "../utils/geometry.js";
-import { FourierEncoder } from "../utils/fourier-encoder.js";
-const encoder = new FourierEncoder(4);
 const INLIER_THRESHOLD = 5.0; // Tightened from 10 to 5 for better precision
 const MIN_NUM_INLIERS = 8; // Restored to 8
 const CLUSTER_MAX_POP = 20;
@@ -96,7 +94,7 @@ const match = ({ keyframe, querypoints, querywidth, queryheight, debugMode }) =>
         return { debugExtra };
     // Second pass with homography guided matching
     const HInv = matrixInverse33(H, 0.00001);
-    const dThreshold2 = 400; // 20 * 20 - Expanded search window thanks to Fourier filtering
+    const dThreshold2 = 100; // 10 * 10
     const matches2 = [];
     const hi00 = HInv[0], hi01 = HInv[1], hi02 = HInv[2];
     const hi10 = HInv[3], hi11 = HInv[4], hi12 = HInv[5];
@@ -115,29 +113,14 @@ const match = ({ keyframe, querypoints, querywidth, queryheight, debugMode }) =>
         const col = querypoint.maxima ? kmax : kmin;
         if (!col)
             continue;
-        const cx = col.x, cy = col.y, cd = col.d, cf = col.f;
+        const cx = col.x, cy = col.y, cd = col.d;
         const qDesc = querypoint.descriptors;
-        // Fourier encoding of the mapped point (where it SHOULD be in the keyframe)
-        const qFourier = encoder.encode(mapX / keyframe.w, mapY / keyframe.h);
         for (let k = 0, clen = cx.length; k < clen; k++) {
             const dx = cx[k] - mapX;
             const dy = cy[k] - mapY;
             const d2 = dx * dx + dy * dy;
             if (d2 > dThreshold2)
                 continue;
-            // 🚀 MOONSHOT: Fourier Spatial Harmony Check
-            // We check if the stored point's Fourier signature matches its predicted position
-            let fourierSim = 0;
-            if (cf) {
-                for (let fidx = 0; fidx < 16; fidx++) {
-                    fourierSim += (cf[k * 16 + fidx] / 127) * qFourier[fidx];
-                }
-            }
-            else {
-                fourierSim = 16; // Backward compatibility
-            }
-            if (fourierSim < 8)
-                continue; // Reject if spatially dissonant (low harmonic match)
             const d = hammingCompute({ v1: cd, v1Offset: k * descSize, v2: qDesc });
             if (d < bestD1) {
                 bestD2 = bestD1;

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@srsergio/taptapp-ar",
-    "version": "1.0.86",
+    "version": "1.0.87",
     "description": "Ultra-fast Augmented Reality (AR) SDK for Node.js and Browser. Image tracking with 100% pure JavaScript, zero-dependencies, and high-performance compilation.",
     "keywords": [
         "augmented reality",

package/src/core/matching/matching.js

@@ -3,9 +3,6 @@ import { compute as hammingCompute } from "./hamming-distance.js";
 import { computeHoughMatches } from "./hough.js";
 import { computeHomography } from "./ransacHomography.js";
 import { multiplyPointHomographyInhomogenous, matrixInverse33 } from "../utils/geometry.js";
-import { FourierEncoder } from "../utils/fourier-encoder.js";
-
-const encoder = new FourierEncoder(4);
 
 const INLIER_THRESHOLD = 5.0; // Tightened from 10 to 5 for better precision
 const MIN_NUM_INLIERS = 8;  // Restored to 8
@@ -111,7 +108,7 @@ const match = ({ keyframe, querypoints, querywidth, queryheight, debugMode }) =>
 
   // Second pass with homography guided matching
   const HInv = matrixInverse33(H, 0.00001);
-  const dThreshold2 = 400; // 20 * 20 - Expanded search window thanks to Fourier filtering
+  const dThreshold2 = 100; // 10 * 10
   const matches2 = [];
 
   const hi00 = HInv[0], hi01 = HInv[1], hi02 = HInv[2];
@@ -135,12 +132,9 @@ const match = ({ keyframe, querypoints, querywidth, queryheight, debugMode }) =>
     const col = querypoint.maxima ? kmax : kmin;
     if (!col) continue;
 
-    const cx = col.x, cy = col.y, cd = col.d, cf = col.f;
+    const cx = col.x, cy = col.y, cd = col.d;
     const qDesc = querypoint.descriptors;
 
-    // Fourier encoding of the mapped point (where it SHOULD be in the keyframe)
-    const qFourier = encoder.encode(mapX / keyframe.w, mapY / keyframe.h);
-
     for (let k = 0, clen = cx.length; k < clen; k++) {
       const dx = cx[k] - mapX;
       const dy = cy[k] - mapY;
@@ -148,19 +142,6 @@ const match = ({ keyframe, querypoints, querywidth, queryheight, debugMode }) =>
 
       if (d2 > dThreshold2) continue;
 
-      // 🚀 MOONSHOT: Fourier Spatial Harmony Check
-      // We check if the stored point's Fourier signature matches its predicted position
-      let fourierSim = 0;
-      if (cf) {
-        for (let fidx = 0; fidx < 16; fidx++) {
-          fourierSim += (cf[k * 16 + fidx] / 127) * qFourier[fidx];
-        }
-      } else {
-        fourierSim = 16; // Backward compatibility
-      }
-
-      if (fourierSim < 8) continue; // Reject if spatially dissonant (low harmonic match)
-
       const d = hammingCompute({ v1: cd, v1Offset: k * descSize, v2: qDesc });
 
       if (d < bestD1) {