Block-matching algorithm: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
m Alter: journal. Add: year, pages, issue, volume, journal, title, doi, pmid, citeseerx, author pars. 1-2. Converted bare reference to cite template. Removed parameters. Formatted dashes. | You can use this bot yourself. Report bugs here. | User-activated.
Line 99:
• First Phase :
• Divide the area of search in four [[quadrant (plane geometry)|quadrant]]s
• Start search with three locations, one at center (A) and others (B and C), A=34.0444094,-117.7977943 B=34.043634,-117.7897651
C=34.04453,-117.7977953
S=4 locations away from A in orthogonal directions 1=34.0460965,-117.7955275; 2=34.0464443,117.7990496; 3=34.0446975,-1177999699;
4=34.0438915,-1177952174
• Find points in search quadrant for second phase using the weight distribution for A, B, C:
• If (MAD(A)>=MAD(B) and MAD(A)>=MAD(C)), select points in second phase quadrant IV
Line 116 ⟶ 118:
 
• Select the ___location with lowest weight as motion vector
34.0444094,-117.7977943
 
SES is computationally very efficient as compared to TSS. However the peak signal-to-noise ratio achieved is poor as compared to TSS as the error surfaces are not strictly unimodal in reality.