Fast-Match: Fast Affine Template Matching

Fast-Match is a fast algorithm for approximate template matching under 2D affine transformations that minimizes the Sum-of-Absolute-Differences (SAD) error measure. There is a huge number of transformations to consider but we prove that they can be sampled using a density that depends on the smoothn...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of computer vision Ročník 121; číslo 1; s. 111 - 125
Hlavní autori:	Korman, Simon, Reichman, Daniel, Tsur, Gilad, Avidan, Shai
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2017 Springer Springer Nature B.V
Predmet:	Affine transformations Algorithms Analysis Approximation Artificial Intelligence Computer Imaging Computer Science Computer vision Errors Experiments Image Processing and Computer Vision Image processing systems Mathematical analysis Pattern Recognition Pattern Recognition and Graphics Studies Template matching Transformations Vision Image matching Template matching Sublinear algorithms Pattern matching
ISSN:	0920-5691, 1573-1405
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!