Eliminating False Positives During Corner Finding by Merging Similar Segments
Abstract
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
Cite
Text
Wolin et al. "Eliminating False Positives During Corner Finding by Merging Similar Segments." AAAI Conference on Artificial Intelligence, 2008.Markdown
[Wolin et al. "Eliminating False Positives During Corner Finding by Merging Similar Segments." AAAI Conference on Artificial Intelligence, 2008.](https://mlanthology.org/aaai/2008/wolin2008aaai-eliminating/)BibTeX
@inproceedings{wolin2008aaai-eliminating,
title = {{Eliminating False Positives During Corner Finding by Merging Similar Segments}},
author = {Wolin, Aaron and Paulson, Brandon and Hammond, Tracy},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2008},
pages = {1836-1837},
url = {https://mlanthology.org/aaai/2008/wolin2008aaai-eliminating/}
}