Eliminating false positives during corner finding by merging similar segments

Aaron Wolin, Brandon Paulson, Tracy Hammond · 2008

We present a new corner finding algorithm based on merging like stroke segmentations together in order to eliminate false positive corners. We compare our sys-tem to two benchmark corner finders with substantial improvements in both polyline and complex fits. Sketch recognition is an emerging field that utilizes pen-based interaction with computers. Handwriting recognition software in the modern operating systems allows users to write naturally, and applications have been created to recog-nize sketches in domains such as UML diagrams (Hammond & Davis 2002) and family trees (Alvarado & Davis 2004). In an attempt to perform free-sketch recognition, which allows users to draw as they would naturally without train-ing or being trained by the system, certain geometric sketch

Read the paper · More papers on PaperTik