Feature Matching OpenCV Python: Read the Indices Before Trusting the Lines

Select the code and use your copy shortcut. Changes in this preview are temporary.

<!doctype html>
<html lang="en-US"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width,initial-scale=1"><title>Feature Matching OpenCV Python: Read the Indices Before Trusting the Lines</title><style>:root{--bg:#eaf3f7;--paper:#fff;--ink:#16354a;--accent:#12526f;--tint:#dcedf5;--line:#b5ccd7;--muted:#436171;--button:#fff}*{box-sizing:border-box}body{margin:0;background:var(--bg);color:var(--ink);font:17px/1.55 system-ui,sans-serif}main{max-width:1000px;margin:auto;padding:22px clamp(18px,4vw,42px) 38px}header{border-bottom:2px solid var(--accent);padding-bottom:14px;margin-bottom:18px}h1{font-size:clamp(26px,4vw,36px);line-height:1.15;margin:4px 0 10px}h2{font-size:22px;line-height:1.3;margin:0 0 14px}h3{font-size:19px}p{margin:0 0 14px}.eyebrow{font-size:16px;font-weight:750;color:var(--accent)}.lede{max-width:800px}.panel{background:var(--paper);border:1px solid var(--line);border-radius:9px;padding:20px;margin:18px 0}.workbench{border-top:4px solid var(--accent)}.grid{display:grid;grid-template-columns:repeat(2,minmax(0,1fr));gap:16px}.grid>*{min-width:0}label{display:block;font-size:16px;font-weight:650;margin:12px 0 6px}input,textarea,select{font:inherit;color:var(--ink);background:var(--paper);border:1px solid #7b8893;border-radius:5px;padding:10px;width:100%;min-width:0}textarea{resize:vertical;line-height:1.45}input[type=checkbox],input[type=radio]{width:21px;height:21px;vertical-align:middle;margin-right:9px}button{font:650 16px/1.4 system-ui,sans-serif;padding:11px 15px;min-height:46px;background:var(--accent);border:2px solid var(--accent);color:var(--button);border-radius:5px;cursor:pointer}button:disabled{opacity:.55;cursor:default}.buttons{display:flex;gap:9px;flex-wrap:wrap;margin:14px 0}.buttons>*{flex:1 1 auto}button:focus-visible,input:focus-visible,textarea:focus-visible,select:focus-visible,summary:focus-visible{outline:3px solid #c05b00;outline-offset:3px}.result{font:600 17px/1.6 ui-monospace,monospace;white-space:pre-wrap;overflow-wrap:anywhere;background:var(--tint);padding:16px;border-left:4px solid var(--accent);min-height:65px;margin:16px 0}.sample{padding:14px 16px;border-left:3px solid var(--accent);background:var(--tint);margin:12px 0}.muted{color:var(--muted)}pre,code{font:16px/1.6 ui-monospace,monospace;white-space:pre-wrap;overflow-wrap:anywhere}pre{margin:12px 0}table{border-collapse:collapse;width:100%;table-layout:fixed;font-size:16px}th,td{text-align:left;vertical-align:top;padding:10px 8px;border-bottom:1px solid var(--line);overflow-wrap:anywhere}th{background:var(--tint)}svg{max-width:100%;height:auto;display:block}details{margin:20px 0}summary{font-weight:700;cursor:pointer}footer{margin-top:28px;border-top:1px solid var(--line);padding-top:18px;font-size:16px}a{color:var(--accent)}.reading{font-family:Georgia,serif}.codeview{border-radius:0;box-shadow:7px 7px 0 var(--tint)}.token{display:inline-block;padding:8px 12px;margin:4px;border:1px solid var(--line);border-radius:4px;background:var(--paper)}.swatch{min-height:30px}.split{display:grid;grid-template-columns:1.1fr 1fr;gap:22px}ol{padding-left:25px}li{margin:9px 0}@media(max-width:600px){main{padding:16px}.grid,.split{grid-template-columns:1fr}.panel{padding:16px;margin:14px 0}h1{font-size:27px}header{padding-bottom:10px}.buttons{gap:8px}.result{padding:13px}th,td{padding:8px 5px}}</style></head><body><main><header><div class="eyebrow">Original practice fixture · local workbench</div><h1>Nearest is not always mutual</h1><p class="lede">Compare query bytes [0,3,255,1] with train bytes [0,7,254]. The distance-matrix rows are [0,3,7], [2,1,7], [8,5,1], and [1,2,8]. Mutual pairs are Q0/T0 at distance 0, Q1/T1 at distance 1, and Q2/T2 at distance 1. Q3/T0 is rejected because T0 prefers Q0.</p></header><pre id="result" class="result" role="status" aria-live="polite" aria-atomic="true">Default: four nearest pairs; three mutual pairs. Q3/T0 is not mutual.</pre><label for="query">Query bytes</label><input id="query" value="0,3,255,1" ><label for="train">Train bytes</label><input id="train" value="0,7,254" ><div class="buttons"><button type="button" id="calculate">Calculate matrix</button></div><section class="panel"><h2>Full matrix</h2><pre id="matrix"></pre></section><footer><p>The calculator executes synthetic Hamming arithmetic, not OpenCV, ORB extraction, or geometric image validation.</p><p>Use a prepared HTML explanation in <a href="https://nos-workspace.com/">NOS</a> when reviewing this Hamming-distance and mutual-best calculator. Eligible static instructions can be revised in visual editing mode; dynamic outputs follow their controls.</p></footer></main><script>
(()=>{'use strict';const $=s=>document.querySelector(s);const out=s=>{$('#result').textContent=s;};const val=id=>$('#'+id).value;const num=id=>{const s=val(id).trim();return s===''?NaN:Number(s);};const on=(id,fn)=>$('#'+id).addEventListener('click',fn);const watch=ids=>{for(const id of ids)for(const event of ['input','change'])$('#'+id).addEventListener(event,()=>out('Inputs changed. Run the action to update this result.'));};const fmt=(n,d=4)=>Math.abs(n)<1e-10?(0).toFixed(d):n.toFixed(d);
watch(['query','train']);for(const id of ['query','train'])for(const event of ['input','change'])$('#'+id).addEventListener(event,()=>{$('#matrix').textContent='';});function calc(){const arrays=['query','train'].map(id=>val(id).split(',').map(s=>s.trim()));if(arrays.some(a=>a.length>16||a.some(s=>s===''||!Number.isInteger(Number(s))||Number(s)<0||Number(s)>255))){$('#matrix').textContent='';out('Invalid descriptors: 1–16 integer bytes in 0–255 required.');return;}const [q,tr]=arrays.map(a=>a.map(Number)),pop=n=>{let c=0;for(;n;n>>>=1)c+=n&1;return c;},d=q.map(x=>tr.map(y=>pop(x^y)));$('#matrix').textContent=d.map((row,i)=>'Q'+i+': '+row.map((n,j)=>'T'+j+'='+n).join(' ')).join(String.fromCharCode(10));const best=row=>{const v=Math.min(...row),ids=row.map((n,i)=>n===v?i:-1).filter(i=>i>=0);return ids.length===1?ids[0]:null;},fw=d.map(best),rv=tr.map((_,j)=>best(d.map(row=>row[j])));if(fw.includes(null)||rv.includes(null)){out('Tie unresolved: define a native tie policy.');return;}const yes=[],no=[];fw.forEach((j,i)=>(rv[j]===i?yes:no).push('Q'+i+'/T'+j+' d'+d[i][j]));out('Nearest: '+fw.map((j,i)=>'Q'+i+'/T'+j+' d'+d[i][j]).join(', ')+' | Mutual: '+yes.join(', ')+' | Rejected: '+no.join(', '));}on('calculate',calc);calc();
})();
</script></body></html>