Premium
P.131: A Significant Multi‐Touch Algorithm for the Tracking Problem Based on the Hungarian Algorithm
Author(s) -
Huang ShihLun,
Chen Charlie ChungPing
Publication year - 2013
Publication title -
sid symposium digest of technical papers
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.351
H-Index - 44
eISSN - 2168-0159
pISSN - 0097-966X
DOI - 10.1002/j.2168-0159.2013.tb06534.x
Subject(s) - algorithm , bipartite graph , tracking (education) , computer science , matching (statistics) , state (computer science) , artificial intelligence , mathematics , theoretical computer science , psychology , graph , pedagogy , statistics
The multi‐touch application has been more popular for consumer electronics because it provides a comfortable way to use intuitively. In this paper, we formulate the multi‐touch tracking problem as a minimum weighted bipartite matching problem. Furthermore, we will propose a Pre‐Processing method to prevent the wrong tracking and to have a significant speed‐up compared to the state‐of‐the‐art algorithm.