Exploiting transitivity of correlation for fast template matching

A Mahmood, S Khan - IEEE Transactions on Image Processing, 2010 - ieeexplore.ieee.org
Elimination Algorithms are often used in template matching to provide a significant speed-up
by skipping portions of the computation while guaranteeing the same best-match location as …
被引用次数：52 相关文章
[PDF] lums.edu.pk

[PDF][PDF] Exploiting Transitivity of Correlation for Fast Template Matching

A Mahmood, S Khan - cvlab.lums.edu.pk
Elimination Algorithms are often used in template matching to provide a significant speed-up
by skipping portions of the computation while guaranteeing the same best-match location as …

Exploiting transitivity of correlation for fast template matching

A Mahmood, S Khan - … : a publication of the IEEE Signal …, 2010 - pubmed.ncbi.nlm.nih.gov
Elimination Algorithms are often used in template matching to provide a significant speed-up
by skipping portions of the computation while guaranteeing the same best-match location as …

[引用][C] Exploiting Transitivity of Correlation for Fast Template Matching

A Mahmood, S Khan - IEEE Transactions on Image …, 2010 - ui.adsabs.harvard.edu
Exploiting Transitivity of Correlation for Fast Template Matching - NASA/ADS Now on home
page ads icon ads Enable full ADS view NASA/ADS Exploiting Transitivity of Correlation for …
[PDF] researchgate.net

[PDF][PDF] Exploiting Transitivity of Correlation for Fast Template Matching

A Mahmood, S Khan - researchgate.net
Elimination Algorithms are often used in template matching to provide a significant speed-up
by skipping portions of the computation while guaranteeing the same best-match location as …

Exploiting Transitivity of Correlation for Fast Template Matching

A Mahmood, S Khan - IEEE Transactions on Image Processing, 2010 - infona.pl
Elimination Algorithms are often used in template matching to provide a significant speed-up
by skipping portions of the computation while guaranteeing the same best-match location as …

Exploiting transitivity of correlation for fast template matching.

A Mahmood, S Khan - IEEE Transactions on Image Processing: a …, 2010 - europepmc.org
Elimination Algorithms are often used in template matching to provide a significant speed-up
by skipping portions of the computation while guaranteeing the same best-match location as …
[PDF] psu.edu

[PDF][PDF] Exploiting Transitivity of Correlation for Fast Template Matching

A Mahmood, S Khan - Citeseer
Elimination Algorithms are often used in template matching to provide a significant speed-up
by skipping portions of the computation while guaranteeing the same best-match location as …

Exploiting transitivity of correlation for fast template matching

A Mahmood, S Khan - IEEE Transactions on Image Processing, 2010 - dl.acm.org
Elimination Algorithms are often used in template matching to provide a significant speed-up
by skipping portions of the computation while guaranteeing the same best-match location as …

[引用][C] Exploiting transitivity of correlation for fast template matching

A Mahmood, S Khan - IEEE Transactions on Image …, 2010 - research-repository.uwa.edu.au
Exploiting transitivity of correlation for fast template matching — the UWA Profiles and Research
Repository Skip to main navigation Skip to search Skip to main content the UWA Profiles and …