How to make a Quick$: Using Hierarchical Clustering toImprove the Efficiency of the Dollar Recognizer

dc.contributor.author	Reaver, J.	en_US
dc.contributor.author	Stahovich, T. F.	en_US
dc.contributor.author	Herold, J.	en_US
dc.contributor.editor	Tracy Hammond and Andy Nealen	en_US
dc.date.accessioned	2013-10-31T10:24:23Z
dc.date.available	2013-10-31T10:24:23Z
dc.date.issued	2011	en_US
dc.identifier.isbn	978-1-4503-0906-6	en_US
dc.identifier.issn	1812-3503	en_US
dc.identifier.uri	http://dx.doi.org/10.2312/SBM/SBM11/103-108	en_US
dc.description.abstract	We present Quick$ (QuickBuck), an extension to the Dollar Recognizer designed to improve recognition efficiency. While the Dollar Recognizer must search all training templates to recognize an unknown symbol, Quick$ employs hierarchical clustering along with branch and bound search to do this more efficiently. Experiments have demonstrated that Quick$ is almost always faster than the Dollar Recognizer and always selects the same best-match templates.	en_US
dc.publisher	The Eurographics Association	en_US
dc.subject	Categories and Subject Descriptors (according to ACM CCS): I.7.5 [Computer Graphics]: Document Capture Graphics recognition and interpretation	en_US
dc.title	How to make a Quick$: Using Hierarchical Clustering toImprove the Efficiency of the Dollar Recognizer	en_US
dc.description.seriesinformation	Eurographics Workshop on Sketch-Based Interfaces and Modeling	en_US