M-estimators over separable sets of representative points for template matching
Abstract
References
Recommendations
Template localization using invariant moments
CompSysTech '10: Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and TechnologiesA variant for solving the task for template localization in a greater image, using invariant moments is presented in the paper. Template and image are represented by specially extracted sets of points. Mutual spatial location of both subsets gives ...
Fixed time template matching
SMC'09: Proceedings of the 2009 IEEE international conference on Systems, Man and CyberneticsThe problem of finding a match for an image ('template') within a larger image is known as template matching. It is key to a variety of Computer Vision applications. Currently known template matching algorithms run in fixed time, or are guaranteed to ...
A Dual-Bound Algorithm for Very Fast and Exact Template Matching
Recently proposed fast template matching techniques employ rejection schemes derived from lower bounds on the match measure. This paper generalizes that idea and shows that in addition to lower bounds, upper bounds on the match measure can be used to ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 80Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in