2013
DOI: 10.1002/j.2168-0159.2013.tb06534.x
|View full text |Cite
|
Sign up to set email alerts
|

P.131: A Significant Multi‐Touch Algorithm for the Tracking Problem Based on the Hungarian Algorithm

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…After getting a noiseless data map, accurate touch points could be calculated, presented in [19]- [23]. After getting the coordinates of the touch points, the tracking algorithm is used to identify and track the corresponding touch points in two sequential frames, presented in [24]- [29]. The third and fourth steps are pure software-related topics.…”
Section: Introductionmentioning
confidence: 99%
“…After getting a noiseless data map, accurate touch points could be calculated, presented in [19]- [23]. After getting the coordinates of the touch points, the tracking algorithm is used to identify and track the corresponding touch points in two sequential frames, presented in [24]- [29]. The third and fourth steps are pure software-related topics.…”
Section: Introductionmentioning
confidence: 99%